Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (9364)
- Computer Sciences (9056)
- Databases and Information Systems (3567)
- Software Engineering (2215)
- Artificial Intelligence and Robotics (1920)
-
- Social and Behavioral Sciences (1630)
- Business (1306)
- Information Security (1112)
- Numerical Analysis and Scientific Computing (1060)
- Graphics and Human Computer Interfaces (952)
- Engineering (935)
- Theory and Algorithms (513)
- Computer Engineering (469)
- Economics (426)
- Operations Research, Systems Engineering and Industrial Engineering (425)
- Programming Languages and Compilers (413)
- Communication (348)
- OS and Networks (346)
- International and Area Studies (336)
- Asian Studies (327)
- Public Affairs, Public Policy and Public Administration (310)
- Education (294)
- Social Media (271)
- Finance and Financial Management (248)
- Environmental Sciences (240)
- Medicine and Health Sciences (228)
- Transportation (220)
- Econometrics (214)
- Technology and Innovation (201)
- Management Information Systems (187)
- Keyword
-
- Machine learning (148)
- Deep learning (130)
- Artificial intelligence (127)
- Singapore (125)
- Social media (82)
-
- Reinforcement learning (74)
- Data mining (70)
- Privacy (67)
- Security (62)
- Sustainability (61)
- Cloud computing (60)
- Deep Learning (58)
- Optimization (56)
- Empirical study (55)
- Software engineering (55)
- Blockchain (52)
- Online learning (52)
- Visualization (52)
- Natural language processing (51)
- Neural networks (50)
- Training (50)
- Anomaly detection (49)
- Large Language Models (49)
- Twitter (49)
- Task analysis (48)
- Collaboration (47)
- Machine Learning (47)
- Feature extraction (45)
- Algorithms (44)
- Semantics (44)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (8567)
- Research Collection Lee Kong Chian School Of Business (428)
- Research Collection School Of Economics (340)
- Dissertations and Theses Collection (Open Access) (272)
- Research Collection School of Social Sciences (193)
-
- Research Collection College of Integrative Studies (138)
- Research Collection Yong Pung How School Of Law (110)
- Research Collection School Of Accountancy (65)
- Asian Management Insights (63)
- Perspectives@SMU (49)
- Dissertations and Theses Collection (20)
- Research Collection Library (19)
- SMU Press Releases and News (18)
- Knowledge@SMU (17)
- FORCE 2026 (14)
- Sim Kee Boon Institute for Financial Economics (14)
- Research@SMU: Connecting the Dots (13)
- Social Space (12)
- MITB Thought Leadership Series (11)
- Research Collection School of Computing and Information Systems (11)
- Oral History Collection (9)
- Report to Stakeholders (9)
- PhD Student’s Publications Collection (8)
- LARC Research Publications (7)
- Research Collection School of Economics (7)
- Student Publications (7)
- Centre for Computational Law (2022-2025) (6)
- CCX Research (5)
- SMU Research Data (4)
- 2024 AI for Research Week (3)
- Publication Type
- File Type
Articles 1651 - 1680 of 10474
Full-Text Articles in Entire DC Network
Greening Large Language Models Of Code, Jieke Shi, Zhou Yang, Hong Jin Kang, Bowen Xu, Junda He, David Lo
Greening Large Language Models Of Code, Jieke Shi, Zhou Yang, Hong Jin Kang, Bowen Xu, Junda He, David Lo
Research Collection School Of Computing and Information Systems
Large language models of code have shown remarkable effectiveness across various software engineering tasks. Despite the availability of many cloud services built upon these powerful models, there remain several scenarios where developers cannot take full advantage of them, stemming from factors such as restricted or unreliable internet access, institutional privacy policies that prohibit external transmission of code to third-party vendors, and more. Therefore, developing a compact, efficient, and yet energy-saving model for deployment on developers' devices becomes essential.To this aim, we propose Avatar, a novel approach that crafts a deployable model from a large language model of code by optimizing …
Exploiting Library Vulnerability Via Migration-Based Automated Test Generation, Zirui Chen, Xing Hu, Xin Xia, Yi Gao, Tongtong Xu, David Lo, Xiaohu Yang
Exploiting Library Vulnerability Via Migration-Based Automated Test Generation, Zirui Chen, Xing Hu, Xin Xia, Yi Gao, Tongtong Xu, David Lo, Xiaohu Yang
Research Collection School Of Computing and Information Systems
In software development, developers extensively utilize third-party libraries to avoid implementing existing functionalities. When a new third-party library vulnerability is disclosed, project maintainers need to determine whether their projects are affected by the vulnerability, which requires developers to invest substantial effort in assessment. However, existing tools face a series of issues: static analysis tools produce false alarms, dynamic analysis tools require existing tests and test generation tools have low success rates when facing complex vulnerabilities.Vulnerability exploits, as code snippets provided for reproducing vulnerabilities after disclosure, contain a wealth of vulnerability-related information. This study proposes a new method based on vulnerability …
Mut: Human-In-The-Loop Unit Test Migration, Yi Gao, Xing Hu, Tongtong Xu, Xin Xia, David Lo, Xiaohu Yang
Mut: Human-In-The-Loop Unit Test Migration, Yi Gao, Xing Hu, Tongtong Xu, Xin Xia, David Lo, Xiaohu Yang
Research Collection School Of Computing and Information Systems
Test migration, which enables the reuse of test cases crafted with knowledge and creativity by testers across various platforms and programming languages, has exhibited effectiveness in mobile app testing. However, unit test migration at the source code level has not garnered adequate attention and exploration. In this paper, we propose a novel cross-language and cross-platform test migration methodology, named MUT, which consists of four modules: code mapping, test case filtering, test case translation, and test case adaptation. MUT initially calculates code mappings to establish associations between source and target projects, and identifies suitable unit tests for migration from the source …
Streamlining Java Programming: Uncovering Well-Formed Idioms With Idiomine, Yanming Yang, Xing Hu, Xin Xia, David Lo, Xiaohu Yang
Streamlining Java Programming: Uncovering Well-Formed Idioms With Idiomine, Yanming Yang, Xing Hu, Xin Xia, David Lo, Xiaohu Yang
Research Collection School Of Computing and Information Systems
Code idioms are commonly used patterns, techniques, or practices that aid in solving particular problems or specific tasks across multiple software projects. They can improve code quality, performance, and maintainability, and also promote program standardization and reuse across projects. However, identifying code idioms is significantly challenging, as existing studies have still suffered from three main limitations. First, it is difficult to recognize idioms that span non-contiguous code lines. Second, identifying idioms with intricate data flow and code structures can be challenging. Moreover, they only extract dataset-specific idioms, so common idioms or well-established code/design patterns that are rarely found in datasets …
Curiosity-Driven Testing For Sequential Decision-Making Process, Junda He, Zhou Yang, Jieke Shi, Chengran Yang, Kisub Kim, Bowen Xu, Xin Zhou, David Lo
Curiosity-Driven Testing For Sequential Decision-Making Process, Junda He, Zhou Yang, Jieke Shi, Chengran Yang, Kisub Kim, Bowen Xu, Xin Zhou, David Lo
Research Collection School Of Computing and Information Systems
Sequential decision-making processes (SDPs) are fundamental for complex real-world challenges, such as autonomous driving, robotic control, and traffic management. While recent advances in Deep Learning (DL) have led to mature solutions for solving these complex problems, SDMs remain vulnerable to learning unsafe behaviors, posing significant risks in safety-critical applications. However, developing a testing framework for SDMs that can identify a diverse set of crash-triggering scenarios remains an open challenge. To address this, we propose CureFuzz, a novel curiosity-driven black-box fuzz testing approach for SDMs. CureFuzz proposes a curiosity mechanism that allows a fuzzer to effectively explore novel and diverse scenarios, …
Deep Reinforcement Learning For Dynamic Algorithm Selection: A Proof-Of-Principle Study On Differential Evolution, Hongshu Guo, Yining Ma, Zeyuan Ma, Jiacheng Chen, Xinglin Zhang, Zhiguang Cao, Jun Zhang, Yue-Jiao Gong
Deep Reinforcement Learning For Dynamic Algorithm Selection: A Proof-Of-Principle Study On Differential Evolution, Hongshu Guo, Yining Ma, Zeyuan Ma, Jiacheng Chen, Xinglin Zhang, Zhiguang Cao, Jun Zhang, Yue-Jiao Gong
Research Collection School Of Computing and Information Systems
Evolutionary algorithms, such as differential evolution, excel in solving real-parameter optimization challenges. However, the effectiveness of a single algorithm varies across different problem instances, necessitating considerable efforts in algorithm selection or configuration. This article aims to address the limitation by leveraging the complementary strengths of a group of algorithms and dynamically scheduling them throughout the optimization progress for specific problems. We propose a deep reinforcement learning-based dynamic algorithm selection framework to accomplish this task. Our approach models the dynamic algorithm selection a Markov decision process, training an agent in a policy gradient manner to select the most suitable algorithm according …
Hop‑Based Heterogeneous Graph Transformer, Zixuan Yang, Xiao Wang, Yanhua Yu, Yuling Wang, Kangkang Lu, Zirui Guo, Xiting Qin, Yunshan Ma, Tat‑Seng Chua
Hop‑Based Heterogeneous Graph Transformer, Zixuan Yang, Xiao Wang, Yanhua Yu, Yuling Wang, Kangkang Lu, Zirui Guo, Xiting Qin, Yunshan Ma, Tat‑Seng Chua
Research Collection School Of Computing and Information Systems
The Graph Transformer (GT) has shown significant ability in processing graph-structured data, addressing limitations in graph neural networks, such as over-smoothing and over-squashing. However, the implementation of GT in real-world heterogeneous graphs (HGs) with complex topology continues to present numerous challenges. Firstly, a challenge arises in designing a tokenizer that is compatible with heterogeneity. Secondly, the complexity of the transformer hampers the acquisition of high-order neighbor information in HGs. In this paper, we propose a novel Hop-basedHeterogeneous Graph Transformer (H2Gormer) framework, paving a promising path for HGs to benefit from the capabilities of Transformers. We propose a Heterogeneous Hop-based Token …
Discovering Significant Topics From Legal Decisions With Selective Inference, Jerrold Tsin Howe Soh
Discovering Significant Topics From Legal Decisions With Selective Inference, Jerrold Tsin Howe Soh
Research Collection Yong Pung How School Of Law
We propose and evaluate an automated pipeline for discovering significant topics from legal decision texts by passing features synthesized with topic models through penalized regressions and post-selection significance tests. The method identifies case topics significantly correlated with outcomes, topic-word distributions which can be manually interpreted to gain insights about significant topics, and case-topic weights which can be used to identify representative cases for each topic. We demonstrate the method on a new dataset of domain name disputes and a canonical dataset of European Court of Human Rights violation cases. Topic models based on latent semantic analysis as well as language …
Legal Hypergraphs, Corinna Coupette, Dirk Hartung, Daniel Martin Katz
Legal Hypergraphs, Corinna Coupette, Dirk Hartung, Daniel Martin Katz
Research Collection Yong Pung How School Of Law
Complexity science provides a powerful framework for understanding physical, biological and social systems, and network analysis is one of its principal tools. Since many complex systems exhibit multilateral interactions that change over time, in recent years, network scientists have become increasingly interested in modelling and measuring dynamic networks featuring higher-order relations. At the same time, while network analysis has been more widely adopted to investigate the structure and evolution of law as a complex system, the utility of dynamic higher-order networks in the legal domain has remained largely unexplored. Setting out to change this, we introduce temporal hypergraphs as a …
Traceability Technology Adoption In Supply Chain Networks, Philippe Blaettchen, Andre P. Calmon, Georgina Hall
Traceability Technology Adoption In Supply Chain Networks, Philippe Blaettchen, Andre P. Calmon, Georgina Hall
Research Collection Lee Kong Chian School Of Business
Modern traceability technologies promise to improve supply chain management by simplifying recalls, increasing visibility, and verifying sustainable supplier practices. Initiatives leading the implementation of traceability technologies must choose the least-costly set of firms—or seed set—to target for early adoption. Choosing this seed set is challenging because firms are part of supply chains interlinked in complex networks, yielding an inherent supply chain effect: benefits obtained from traceability are conditional on technology adoption by a subset of firms in a product’s supply chain. We prove that the problem of selecting the least-costly seed set in a supply chain network is hard to …
Interim Regret Minimization, Wei He, Jiangtao Li, Kexin Wang
Interim Regret Minimization, Wei He, Jiangtao Li, Kexin Wang
Research Collection School Of Economics
We consider a robust version of monopoly pricing when the seller only knows the bound on valuations and the mean of the distribution of the buyer’s value. The seller seeks to minimize interim regret, the forgone expected revenue due to not knowing the distribution of the buyer’s value. The optimal pricing policy randomizes over a range of prices; the support of the pricing policy is bounded away from zero.
Math Word Problem Generation Via Disentangled Memory Retrieval, Wei Qin, Xiaowei Wang, Zhenzhen Hu, Lei Wang, Yunshi Lan, Richang Hong
Math Word Problem Generation Via Disentangled Memory Retrieval, Wei Qin, Xiaowei Wang, Zhenzhen Hu, Lei Wang, Yunshi Lan, Richang Hong
Research Collection Lee Kong Chian School Of Business
The task of math word problem (MWP) generation, which generates an MWP given an equation and relevant topic words, has increasingly attracted researchers’ attention. In this work, we introduce a simple memory retrieval module to search related training MWPs, which are used to augment the generation. To retrieve more relevant training data, we also propose a disentangled memory retrieval module based on the simple memory retrieval module. To this end, we first disentangle the training MWPs into logical description and scenario description and then record them in respective memory modules. Later, we use the given equation and topic words as …
Measurement Of Regional Electric Vehicle Adoption Using Multiagent Deep Reinforcement Learning, Seung Jun Choi, Junfeng Jiao
Measurement Of Regional Electric Vehicle Adoption Using Multiagent Deep Reinforcement Learning, Seung Jun Choi, Junfeng Jiao
Research Collection College of Integrative Studies
This study explores the socioeconomic disparities observed in the early adoption of Electric Vehicles (EVs) in the United States. A multiagent deep reinforcement learning-based policy simulator was developed to address the disparities. The model, tested using data from Austin, Texas, indicates that neighborhoods with higher incomes and a predominantly White demographic are leading in EV adoption. To help low-income communities keep pace, we introduced tiered subsidies and incrementally increased their amounts. In our environment, with the reward and policy design implemented, the adoption gap began to narrow when the incentive was equivalent to an increase in promotion from 20% to …
Active Discovering New Slots For Task-Oriented Conversation, Yuxia Wu, Tianhao Dai, Zhedong Zheng, Lizi Liao
Active Discovering New Slots For Task-Oriented Conversation, Yuxia Wu, Tianhao Dai, Zhedong Zheng, Lizi Liao
Research Collection School Of Computing and Information Systems
Existing task-oriented conversational systems heavily rely on domain ontologies with pre-defined slots and candidate values. In practical settings, these prerequisites are hard to meet, due to the emerging new user requirements and ever-changing scenarios. To mitigate these issues for better interaction performance, there are efforts working towards detecting out-of-vocabulary values or discovering new slots under unsupervised or semi-supervised learning paradigms. However, overemphasizing on the conversation data patterns alone induces these methods to yield noisy and arbitrary slot results. To facilitate the pragmatic utility, real-world systems tend to provide a stringent amount of human labeling quota, which offers an authoritative way …
T-Pickseer: Visual Analysis Of Taxi Pick-Up Point Selection Behavior, Shuxian Gu, Yemo Dai, Zezheng Feng, Yong Wang, Haipeng Zeng
T-Pickseer: Visual Analysis Of Taxi Pick-Up Point Selection Behavior, Shuxian Gu, Yemo Dai, Zezheng Feng, Yong Wang, Haipeng Zeng
Research Collection School Of Computing and Information Systems
Taxi drivers often take much time to navigate the streets to look for passengers, which leads to high vacancy rates and wasted resources. Empty taxi cruising remains a big concern for taxi companies. Analyzing the pick-up point selection behavior can solve this problem effectively, providing suggestions for taxi management and dispatch. Many studies have been devoted to analyzing and recommending hotspot regions of pick-up points, which can make it easier for drivers to pick-up passengers. However, the selection of pick-up points is complex and affected by multiple factors, such as convenience and traffic management. Most existing approaches cannot produce satisfactory …
Harnessing The Advances Of Meda To Optimize Multi-Puf For Enhancing Ip Security Of Biochips, Chen Dong, Xiaodong Guo, Sihuang Lian, Yinan Yao, Zhenyi Chen, Yang Yang, Zhanghui Liu
Harnessing The Advances Of Meda To Optimize Multi-Puf For Enhancing Ip Security Of Biochips, Chen Dong, Xiaodong Guo, Sihuang Lian, Yinan Yao, Zhenyi Chen, Yang Yang, Zhanghui Liu
Research Collection School Of Computing and Information Systems
Digital microfluidic biochips (DMFBs) have a significant stride in the applications of medicine and the biochemistry in recent years. DMFBs based on micro-electrode-dot-array (MEDA) architecture, as the next-generation DMFBs, aim to overcome drawbacks of conventional DMFBs, such as droplet size restriction, low accuracy, and poor sensing ability. Since the potential market value of MEDA biochips is vast, it is of paramount importance to explore approaches to protect the intellectual property (IP) of MEDA biochips during the development process. In this paper, an IP authentication strategy based on the multi-PUF applied to MEDA biochips is presented, called bioMPUF, consisting of Delay …
Knowledge Generation For Zero-Shot Knowledge-Based Vqa, Rui Cao, Jing Jiang
Knowledge Generation For Zero-Shot Knowledge-Based Vqa, Rui Cao, Jing Jiang
Research Collection School Of Computing and Information Systems
Previous solutions to knowledge-based visual question answering (K-VQA) retrieve knowledge from external knowledge bases and use supervised learning to train the K-VQA model. Recently pre-trained LLMs have been used as both a knowledge source and a zero-shot QA model for K-VQA and demonstrated promising results. However, these recent methods do not explicitly show the knowledge needed to answer the questions and thus lack interpretability. Inspired by recent work on knowledge generation from LLMs for text-based QA, in this work we propose and test a similar knowledge-generation-based K-VQA method, which first generates knowledge from an LLM and then incorporates the generated …
Conditional Neural Heuristic For Multiobjective Vehicle Routing Problems, Mingfeng Fan, Yaoxin Wu, Zhiguang Cao, Wen Song, Guillaume Sartoretti, Huan Liu, Guohua Wu
Conditional Neural Heuristic For Multiobjective Vehicle Routing Problems, Mingfeng Fan, Yaoxin Wu, Zhiguang Cao, Wen Song, Guillaume Sartoretti, Huan Liu, Guohua Wu
Research Collection School Of Computing and Information Systems
Existing neural heuristics for multiobjective vehicle routing problems (MOVRPs) are primarily conditioned on instance context, which failed to appropriately exploit preference and problem size, thus holding back the performance. To thoroughly unleash the potential, we propose a novel conditional neural heuristic (CNH) that fully leverages the instance context, preference, and size with an encoder–decoder structured policy network. Particularly, in our CNH, we design a dual-attention-based encoder to relate preferences and instance contexts, so as to better capture their joint effect on approximating the exact Pareto front (PF). We also design a size-aware decoder based on the sinusoidal encoding to explicitly …
Temporal Implicit Multimodal Networks For Investment And Risk Management, Meng Kiat Gary Ang, Ee-Peng Lim
Temporal Implicit Multimodal Networks For Investment And Risk Management, Meng Kiat Gary Ang, Ee-Peng Lim
Research Collection School Of Computing and Information Systems
Many deep learning works on financial time-series forecasting focus on predicting future prices/returns of individual assets with numerical price-related information for trading, and hence propose models designed for univariate, single-task, and/or unimodal settings. Forecasting for investment and risk management involves multiple tasks in multivariate settings: forecasts of expected returns and risks of assets in portfolios, and correlations between these assets. As different sources/types of time-series influence future returns, risks, and correlations of assets in different ways, it is also important to capture time-series from different modalities. Hence, this article addresses financial time-series forecasting for investment and risk management in a …
T-Sciq: Teaching Multimodal Chain-Of-Thought Reasoning Via Large Language Model Signals For Science Question Answering, Lei Wang, Yi Hu, Jiabang He, Xing Xu, Ning Liu, Hui Liu, Heng Tao Shen
T-Sciq: Teaching Multimodal Chain-Of-Thought Reasoning Via Large Language Model Signals For Science Question Answering, Lei Wang, Yi Hu, Jiabang He, Xing Xu, Ning Liu, Hui Liu, Heng Tao Shen
Research Collection School Of Computing and Information Systems
Large Language Models (LLMs) have recently demonstrated exceptional performance in various Natural Language Processing (NLP) tasks. They have also shown the ability to perform chain-of-thought (CoT) reasoning to solve complex problems. Recent studies have explored CoT reasoning in complex multimodal scenarios, such as the science question answering task, by fine-tuning multimodal models with high-quality human-annotated CoT rationales. However, collecting high-quality COT rationales is usually time-consuming and costly. Besides, the annotated rationales are hardly accurate due to the external essential information missed. To address these issues, we propose a novel method termed T-SciQ that aims at teaching science question answering with …
Navigating Sustainable Futures, Franziska Zimmermann
Navigating Sustainable Futures, Franziska Zimmermann
Asian Management Insights
A leadership imperative.
Deontic Meta-Rules, Francesco Olivieri, Guido Governatori, Matteo Cristani, Antonino Rotolo, Abdul Sattar
Deontic Meta-Rules, Francesco Olivieri, Guido Governatori, Matteo Cristani, Antonino Rotolo, Abdul Sattar
Centre for Computational Law (2022-2025)
The use of meta-rules in logic, i.e., rules whose content includes other rules, has recently gained attention in the setting of non-monotonic reasoning: a first logical formalisation and efficient algorithms to compute the (meta)-extensions of such theories were proposed in Olivieri et al. (2021, Computing defeasible meta-logic. In JELIA 2021, LNCS, vol. 12678, pp. 69-84. Springer.). This work extends such a logical framework by considering the deontic aspect. The resulting logic will not just be able to model policies but also tackle well-known aspects that occur in numerous legal systems. The use of Defeasible Logic to model meta-rules in the …
Forging The Future: Strategic Approaches To Quantum Ai Integration For Industry Transformation, Meng Leong How, Sin Mei Cheah
Forging The Future: Strategic Approaches To Quantum Ai Integration For Industry Transformation, Meng Leong How, Sin Mei Cheah
CCX Research
The fusion of quantum computing and artificial intelligence (AI) heralds a transformative era for Industry 4.0, offering unprecedented capabilities and challenges. This paper delves into the intricacies of quantum AI, its potential impact on Industry 4.0, and the necessary change management and innovation strategies for seamless integration. Drawing from theoretical insights and real-world case studies, we explore the current landscape of quantum AI, its foreseeable influence, and the implications for organizational strategy. We further expound on traditional change management tactics, emphasizing the importance of continuous learning, ecosystem collaborations, and proactive approaches. By examining successful and failed quantum AI implementations, lessons …
Simulated Annealing With Reinforcement Learning For The Set Team Orienteering Problem With Time Windows, Vincent F. Yu, Nabila Y. Salsabila, Shih-W Lin, Aldy Gunawan
Simulated Annealing With Reinforcement Learning For The Set Team Orienteering Problem With Time Windows, Vincent F. Yu, Nabila Y. Salsabila, Shih-W Lin, Aldy Gunawan
Research Collection School Of Computing and Information Systems
This research investigates the Set Team Orienteering Problem with Time Windows (STOPTW), a new variant of the well-known Team Orienteering Problem with Time Windows and Set Orienteering Problem. In the STOPTW, customers are grouped into clusters. Each cluster is associated with a profit attainable when a customer in the cluster is visited within the customer's time window. A Mixed Integer Linear Programming model is formulated for STOPTW to maximizing total profit while adhering to time window constraints. Since STOPTW is an NP-hard problem, a Simulated Annealing with Reinforcement Learning (SARL) algorithm is developed. The proposed SARL incorporates the core concepts …
Community Similarity Based On User Profile Joins, Konstantinos Theocharidis, Hady Wirawan Lauw
Community Similarity Based On User Profile Joins, Konstantinos Theocharidis, Hady Wirawan Lauw
Research Collection School Of Computing and Information Systems
Similarity joins on multidimensional data are crucial operators for recommendation purposes. The classic ��-join problem finds all pairs of points within �� distance to each other among two ��-dimensional datasets. In this paper, we consider a novel and alternative version of ��-join named community similarity based on user profile joins (CSJ). The aim of CSJ problem is, given two communities having a set of ��-dimensional users, to find how similar are the communities by matching every single pair of users (a user can be matched with at most one other user) having an absolute difference of at most �� per …
Improvement Of Flow Coefficient Estimation With Limited Well Test Data For Real-Time Condition Analytics Of Choke Valve, T. Visawameteekul, Tin Seong Kam, P. Thamvechvitee
Improvement Of Flow Coefficient Estimation With Limited Well Test Data For Real-Time Condition Analytics Of Choke Valve, T. Visawameteekul, Tin Seong Kam, P. Thamvechvitee
Research Collection School Of Computing and Information Systems
The study discusses a method for monitoring the internal condition of choke valves to predict sand erosion using flow coefficient (Cv). The method calculates the Cv of the choke valve by utilizing eight parameters and compares it to the newly manufactured value to generate warnings. However, the availability of spot-check well test data can significantly impact the model's efficiency if tests are performed infrequently. To address this issue, the Extended Cv monitoring method is proposed in this paper. The main purpose of this study is to develop a model for estimating Cv value in the absence of well test data. …
Stopguess: A Framework For Public-Key Authenticated Encryption With Keyword Search, Tao Xiang, Zhongming Wang, Biwen Chen, Xiaoguo Li, Peng Wang, Fei Chen
Stopguess: A Framework For Public-Key Authenticated Encryption With Keyword Search, Tao Xiang, Zhongming Wang, Biwen Chen, Xiaoguo Li, Peng Wang, Fei Chen
Research Collection School Of Computing and Information Systems
Public key encryption with keyword search (PEKS) allows users to search on encrypted data without leaking the keyword information from the ciphertexts. But it does not preserve keyword privacy within the trapdoors, because an adversary (e.g., untrusted server) might launch inside keyword-guessing attacks (IKGA) to guess keywords from the trapdoors. In recent years, public key authenticated encryption with keyword search (PAEKS) has become a promising primitive to counter the IKGA. However, existing PAEKS schemes focus on the concrete construction of PAEKS, making them unable to support modular construction, intuitive proof, or flexible extension. In this paper, our proposal called “StopGuess” …
On The Effects Of Information Asymmetry In Digital Currency Trading, Kwansoo Kim, Robert John Kauffman
On The Effects Of Information Asymmetry In Digital Currency Trading, Kwansoo Kim, Robert John Kauffman
Research Collection School Of Computing and Information Systems
We report on two studies that examine how social sentiment influences information asymmetry in digital currency markets. We also assess whether cryptocurrency can be an investment vehicle, as opposed to only an instrument for asset speculation. Using a dataset on transactions from an exchange in South Korea and sentiment from Korean social media in 2018, we conducted a study of different trading behavior under two cryptocurrency trading market microstructures: a bid-ask spread dealer's market and a continuous trading buy-sell, immediate trade execution market. Our results highlight the impacts of positive and negative trader social sentiment valences on the effects of …
Eyris: From The Lab To The Market, Steven Miller, David Gomulya, Mahima Rao-Kachroo
Eyris: From The Lab To The Market, Steven Miller, David Gomulya, Mahima Rao-Kachroo
Asian Management Insights
Singapore’s trailblazer AI algorithm for detecting diabetes-related eye diseases. Can you imagine getting the results of your eye disease screening within minutes rather than days? This capability is what EyRIS, a Singapore-based start-up that uses the AI (Artificial Intelligence)-driven Singapore Eye LEsion Analyzer (SELENA+) algorithm to screen for diabetes-related eye diseases, set out to productise and commercialise.
Superminds At Work: The Promise Of Human-Ai Collaboration, Thomas W. Malone
Superminds At Work: The Promise Of Human-Ai Collaboration, Thomas W. Malone
Asian Management Insights
Massachusetts Institute of Technology (MIT) Center for Collective Intelligence Director Professor Thomas W. Malone’s scholarship offers deep insights into the promise afforded by the synergies between human intelligence and technology. According to Professor Malone, the boundaries between human intellect and technological prowess are becoming increasingly blurred, but this may not be a bad thing for humankind. In Asian Management Insights’ inaugural Pulse Point interview, we get to learn more about the concept of ‘collective intelligence’, which explores how a partnership between humans and Artificial Intelligence (AI) can be catalysed to make ground-breaking advancements in addressing the wicked problems of our …