Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Databases and Information Systems (3441)
- Software Engineering (2143)
- Artificial Intelligence and Robotics (1664)
- Information Security (1056)
- Numerical Analysis and Scientific Computing (1024)
-
- Graphics and Human Computer Interfaces (921)
- Engineering (857)
- Social and Behavioral Sciences (661)
- Business (625)
- Theory and Algorithms (493)
- Computer Engineering (431)
- Operations Research, Systems Engineering and Industrial Engineering (399)
- Programming Languages and Compilers (379)
- OS and Networks (322)
- Communication (297)
- Social Media (240)
- Public Affairs, Public Policy and Public Administration (207)
- Transportation (185)
- Medicine and Health Sciences (178)
- Education (164)
- Management Information Systems (164)
- Data Storage Systems (160)
- E-Commerce (146)
- Health Information Technology (107)
- International and Area Studies (107)
- Asian Studies (106)
- Technology and Innovation (100)
- Digital Communications and Networking (96)
- Keyword
-
- Deep learning (122)
- Machine learning (121)
- Social media (74)
- Artificial intelligence (70)
- Reinforcement learning (69)
-
- Data mining (64)
- Privacy (61)
- Cloud computing (58)
- Deep Learning (56)
- Empirical study (54)
- Optimization (53)
- Security (53)
- Visualization (51)
- Software engineering (49)
- Training (49)
- Neural networks (48)
- Online learning (48)
- Task analysis (48)
- Anomaly detection (47)
- Singapore (47)
- Twitter (46)
- Feature extraction (45)
- Blockchain (44)
- Collaboration (44)
- Large Language Models (43)
- Semantics (43)
- Access control (41)
- Algorithms (40)
- Android (39)
- Machine Learning (38)
- Publication Year
- File Type
Articles 6061 - 6090 of 8479
Full-Text Articles in Computer Sciences
Writing For Publication In Biomedical Informatics Journals, Christoph Lehmann, Reinhold Haux, Jan Talmon, Dominik Aronsky, Nicolette De Keizer, Tze-Yun Leong, Charles Safran
Writing For Publication In Biomedical Informatics Journals, Christoph Lehmann, Reinhold Haux, Jan Talmon, Dominik Aronsky, Nicolette De Keizer, Tze-Yun Leong, Charles Safran
Research Collection School Of Computing and Information Systems
No abstract provided.
Audit Games, Jeremiah Blocki, Nicolas Christin, Anupam Datta, Ariel D. Procaccia, Arunesh Sinha
Audit Games, Jeremiah Blocki, Nicolas Christin, Anupam Datta, Ariel D. Procaccia, Arunesh Sinha
Research Collection School Of Computing and Information Systems
Effective enforcement of laws and policies requires expending resources to prevent and detect offenders, as well as appropriate punishment schemes to deter violators. In particular, enforcement of privacy laws and policies in modern organizations that hold large volumes of personal information (e.g., hospitals, banks) relies heavily on internal audit mechanisms. We study economic considerations in the design of these mechanisms, focusing in particular on effective resource allocation and appropriate punishment schemes. We present an audit game model that is a natural generalization of a standard security game model for resource allocation with an additional punishment parameter. Computing the Stackelberg equilibrium …
An Empirical Study On Uncertainty Identification In Social Media Context, Zhongyu Wei, Junwen Chen, Wei Gao, Binyang Li, Lanjun Zhou, Yulan He, Kam-Fai Wong
An Empirical Study On Uncertainty Identification In Social Media Context, Zhongyu Wei, Junwen Chen, Wei Gao, Binyang Li, Lanjun Zhou, Yulan He, Kam-Fai Wong
Research Collection School Of Computing and Information Systems
Uncertainty text detection is important to many social-media-based applications since more and more users utilize social media platforms (e.g., Twitter, Facebook, etc.) as information source to produce or derive interpretations based on them. However, existing uncertainty cues are ineffective in social media context because of its specific characteristics. In this paper, we propose a variant of annotation scheme for uncertainty identification and construct the first uncertainty corpus based on tweets. We then conduct experiments on the generated tweets corpus to study the effectiveness of different types of features for uncertainty text identification.
Multi-View Discriminant Transfer Learning, Pei Yang Yang, Wei Gao
Multi-View Discriminant Transfer Learning, Pei Yang Yang, Wei Gao
Research Collection School Of Computing and Information Systems
We study to incorporate multiple views of data in a perceptive transfer learning framework and propose a Multi-view Discriminant Transfer (MDT) learning approach for domain adaptation. The main idea is to find the optimal discriminant weight vectors for each view such that the correlation between the two-view projected data is maximized, while both the domain discrepancy and the view disagreement are minimized simultaneously. Furthermore, we analyze MDT theoretically from discriminant analysis perspective to explain the condition and reason, under which the proposed method is not applicable. The analytical results allow us to investigate whether there exist within-view and/or betweenview conflicts, …
The User’S Communication Patterns On A Mobile Social Network Site, Youngsoo Kim
The User’S Communication Patterns On A Mobile Social Network Site, Youngsoo Kim
Research Collection School Of Computing and Information Systems
No abstract provided.
Click-Boosting Random Walk For Image Search Reranking, Xiaopeng Yang, Yongdong Zhang, Ting Yao, Zheng-Jun Zha, Chong-Wah Ngo
Click-Boosting Random Walk For Image Search Reranking, Xiaopeng Yang, Yongdong Zhang, Ting Yao, Zheng-Jun Zha, Chong-Wah Ngo
Research Collection School Of Computing and Information Systems
Image reranking is an effective way for improving the retrieval performance of keyword-based image search engines. A fundamental issue underlying the success of existing image reranking approaches is the ability in identifying potentially useful recurrent patterns or relevant training examples from the initial search results. Ideally, these patterns and examples can be leveraged to upgrade the ranks of visually similar images, which are also likely to be relevant. The challenge, nevertheless, originates from the fact that keyword-based queries are used to be ambiguous, resulting in difficulty in predicting the search intention. Mining useful patterns and examples without understanding query is …
Self-Organizing Cognitive Models For Virtual Agents, Yilin Kang, Ah-Hwee Tan
Self-Organizing Cognitive Models For Virtual Agents, Yilin Kang, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
Three key requirements of realistic characters or agents in virtual world can be identified as autonomy, interactivity, and personification. Working towards these challenges, this paper proposes a brain inspired agent architecture that integrates goal-directed autonomy, natural language interaction and human-like personification. Based on self-organizing neural models, the agent architecture maintains explicit mental representation of desires, intention, personalities, self-awareness, situation awareness and user awareness. Autonomous behaviors are generated via evaluating the current situation with active goals and learning the most appropriate social or goal-directed rule from the available knowledge, in accordance with the personality of each individual agent. We have built …
An Agent-Based Network Analytic Perspective On The Evolution Of Complex Adaptive Supply Chain Networks, Loganathan Ponnanbalam, A. Tan, Xiuju Fu, Xiaofeng Yin, Zhaoxia Wang, Rick S. M. Goh
An Agent-Based Network Analytic Perspective On The Evolution Of Complex Adaptive Supply Chain Networks, Loganathan Ponnanbalam, A. Tan, Xiuju Fu, Xiaofeng Yin, Zhaoxia Wang, Rick S. M. Goh
Research Collection School Of Computing and Information Systems
Supply chain networks of modern era are complex adaptive systems that are dynamic and highly interdependent in nature. Business continuity of these complex systems depend vastly on understanding as to how the supply chain network evolves over time (based on the policies it adapts), and identifying the susceptibility of the evolved networks to external disruptions. The objective of this article is to illustrate as to how an agent-based network analytic perspective can aid this understanding on the network-evolution dynamics, and identification of disruption effects on the evolved networks. To this end, we developed a 4-tier agent based supply chain model …
Vigilance Adaptation In Adaptive Resonance Theory, Lei Meng, Ah-Hwee Tan, Donald C. Winsch
Vigilance Adaptation In Adaptive Resonance Theory, Lei Meng, Ah-Hwee Tan, Donald C. Winsch
Research Collection School Of Computing and Information Systems
Despite the advantages of fast and stable learning, Adaptive Resonance Theory (ART) still relies on an empirically fixed vigilance parameter value to determine the vigilance regions of all of the clusters in the category field (F 2 ), causing its performance to depend on the vigilance value. It would be desirable to use different values of vigilance for different category field nodes, in order to fit the data with a smaller number of categories. We therefore introduce two methods, the Activation Maximization Rule (AMR) and the Confliction Minimization Rule (CMR). Despite their differences, both ART with AMR (AM-ART) and with …
An Agent-Based Network Analytic Perspective On The Evolution Of Complex Adaptive Supply Chain Networks, L. Ponnambalam, A. Tan, X. Fu, X. F. Yin, Zhaoxia Wang, R. S. Goh
An Agent-Based Network Analytic Perspective On The Evolution Of Complex Adaptive Supply Chain Networks, L. Ponnambalam, A. Tan, X. Fu, X. F. Yin, Zhaoxia Wang, R. S. Goh
Research Collection School Of Computing and Information Systems
Supply chain networks of modern era are complex adaptive systems that are dynamic and highly interdependent in nature. Business continuity of these complex systems depend vastly on understanding as to how the supply chain network evolves over time (based on the policies it adapts), and identifying the susceptibility of the evolved networks to external disruptions. The objective of this article is to illustrate as to how an agent-based network analytic perspective can aid this understanding on the network-evolution dynamics, and identification of disruption effects on the evolved networks. To this end, we developed a 4-tier agent based supply chain model …
Near-Duplicate Video Retrieval: Current Research And Future Trends, Jiajun Liu, Zi Huang, Hongyun Cai, Heng Tao Shen, Chong-Wah Ngo, Wei Wang
Near-Duplicate Video Retrieval: Current Research And Future Trends, Jiajun Liu, Zi Huang, Hongyun Cai, Heng Tao Shen, Chong-Wah Ngo, Wei Wang
Research Collection School Of Computing and Information Systems
The exponential growth of online videos, along with increasing user involvement in video-related activities, has been observed as a constant phenomenon during the last decade. User's time spent on video capturing, editing, uploading, searching, and viewing has boosted to an unprecedented level. The massive publishing and sharing of videos has given rise to the existence of an already large amount of near-duplicate content. This imposes urgent demands on near-duplicate video retrieval as a key role in novel tasks such as video search, video copyright protection, video recommendation, and many more. Driven by its significance, near-duplicate video retrieval has recently attracted …
Incremental And Accuracy-Aware Personalized Pagerank Through Scheduled Approximation, Fanwei Zhu, Yuan Fang, Kevin Chen-Chuan Chang, Jing Ying
Incremental And Accuracy-Aware Personalized Pagerank Through Scheduled Approximation, Fanwei Zhu, Yuan Fang, Kevin Chen-Chuan Chang, Jing Ying
Research Collection School Of Computing and Information Systems
As Personalized PageRank has been widely leveraged for ranking on a graph, the efficient computation of Personalized PageRank Vector (PPV) becomes a prominent issue. In this paper, we propose FastPPV, an approximate PPV computation algorithm that is incremental and accuracy-aware. Our approach hinges on a novel paradigm of scheduled approximation: the computation is partitioned and scheduled for processing in an "organized" way, such that we can gradually improve our PPV estimation in an incremental manner, and quantify the accuracy of our approximation at query time. Guided by this principle, we develop an efficient hub based realization, where we adopt the …
Using Contracts To Guide The Search-Based Verification Of Concurrent Programs, Christopher M. Poskitt, Simon Poulding
Using Contracts To Guide The Search-Based Verification Of Concurrent Programs, Christopher M. Poskitt, Simon Poulding
Research Collection School Of Computing and Information Systems
Search-based techniques can be used to identify whether a concurrent program exhibits faults such as race conditions, deadlocks, and starvation: a fitness function is used to guide the search to a region of the program’s state space in which these concurrency faults are more likely occur. In this short paper, we propose that contracts specified by the developer as part of the program’s implementation could be used to provide additional guidance to the search. We sketch an example of how contracts might be used in this way, and outline our plans for investigating this verification approach.
Applying Search In An Automatic Contract-Based Testing Tool, Alexey Kolesnichenko, Christopher M. Poskitt, Bertrand Meyer
Applying Search In An Automatic Contract-Based Testing Tool, Alexey Kolesnichenko, Christopher M. Poskitt, Bertrand Meyer
Research Collection School Of Computing and Information Systems
Automated random testing has been shown to be effective at finding faults in a variety of contexts and is deployed in several testing frameworks. AutoTest is one such framework, targeting programs written in Eiffel, an object-oriented language natively supporting executable pre- and postconditions; these respectively serving as test filters and test oracles. In this paper, we propose the integration of search-based techniques—along the lines of Tracey—to try and guide the tool towards input data that leads to violations of the postconditions present in the code; input data that random testing alone might miss, or take longer to find. Furthermore, we …
Usmmc: A Self-Contained Model Checker For Uml State Machines, Shuang Liu, Yang Liu, Jun Sun, Manchun Zheng, Bimlesh Wadhwa, Jin Song Dong
Usmmc: A Self-Contained Model Checker For Uml State Machines, Shuang Liu, Yang Liu, Jun Sun, Manchun Zheng, Bimlesh Wadhwa, Jin Song Dong
Research Collection School Of Computing and Information Systems
UML diagrams are gaining increasing usage in Object-Oriented system designs. UML state machines are specifically used in modeling dynamic behaviors of classes. It has been widely agreed that verification of system designs at an early stage will dramatically reduce the development cost. Tool support for verification UML designs can also encourage consistent usage of UML diagrams throughout the software development procedure. In this work, we present a tool, named USMMC, which turns model checking of UML state machines into practice. USMMC is a self-contained toolkit, which provides editing, interactive simulation as well as powerful model checking support for UML state …
Riskvis: Supply Chain Visualization With Risk Management And Real-Time Monitoring, Rick S. M. Goh, Zhaoxia Wang, Xiaofeng Yin, Xiuju Fu, Loganathan Ponnanbalam, Sifei Lu, Xiaorong Li
Riskvis: Supply Chain Visualization With Risk Management And Real-Time Monitoring, Rick S. M. Goh, Zhaoxia Wang, Xiaofeng Yin, Xiuju Fu, Loganathan Ponnanbalam, Sifei Lu, Xiaorong Li
Research Collection School Of Computing and Information Systems
With increased complexity, supply chain networks (SCNs) of modern era face higher risks and lower efficiency due to limited visibility. Hence, there is an immediate need to provide end-to-end supply chain visibility for efficient management of complex supply chains. This paper proposes a visualization scheme based on multi-hierarchical modular design and develops a supply chain visualization platform with risk management and real-time monitoring, named RiskVis, for realizing better Supply Chain Risk Management (SCRM). A Supply Chain Visualizer (SCV) with a graphical visualization platform is mounted as a part of a SCRM management decision-making dashboard and it provides senior management a …
How Many Researchers Does It Take To Make Impact? Mining Software Engineering Publication Data For Collaboration Insights, Subhajit Datta, Santonu Sarkar, Sajeev A. S. M., Nishant Kumar
How Many Researchers Does It Take To Make Impact? Mining Software Engineering Publication Data For Collaboration Insights, Subhajit Datta, Santonu Sarkar, Sajeev A. S. M., Nishant Kumar
Research Collection School Of Computing and Information Systems
In the three and half decades since the inception of organized research publication in software engineering, the discipline has gained a significant maturity. This journey to maturity has been guided by the synergy of ideas, individuals and interactions. In this journey software engineering has evolved into an increasingly empirical discipline. Empirical sciences involve significant collaboration, leading to large teams working on research problems. In this paper we analyze a corpus of 19,000+ papers, written by 21,000+ authors from 16 publication venues between 1975 to 2010, to understand what is the ideal team size that has produced maximum impact in software …
Scalable Randomized Patrolling For Securing Rapid Transit Networks, Pradeep Varakantham, Hoong Chuin Lau, Zhi Yuan
Scalable Randomized Patrolling For Securing Rapid Transit Networks, Pradeep Varakantham, Hoong Chuin Lau, Zhi Yuan
Research Collection School Of Computing and Information Systems
Mass Rapid Transit using rail is a popular mode of transport employed by millions of people in many urban cities across the world. Typically, these networks are massive, used by many and thus, can be a soft target for criminals. In this paper, we consider the problem of scheduling randomised patrols for improving security of such rail networks. Similar to existing work in randomised patrols for protecting critical infrastructure, we also employ Stackelberg Games to represent the problem. In solving the Stackelberg games for massive rail networks, we make two key contributions. Firstly, we provide an approach called RaPtoR for …
A Multi-Objective Memetic Algorithm For Vehicle Resource Allocation In Sustainable Transportation Planning, Hoong Chuin Lau, Lucas Agussurja, Shih-Fen Cheng, Pang Jin Tan
A Multi-Objective Memetic Algorithm For Vehicle Resource Allocation In Sustainable Transportation Planning, Hoong Chuin Lau, Lucas Agussurja, Shih-Fen Cheng, Pang Jin Tan
Research Collection School Of Computing and Information Systems
Sustainable supply chain management has been an increasingly important topic of research in recent years. At the strategic level, there are computational models which study supply and distribution networks with environmental considerations. At the operational level, there are, for example, routing and scheduling models which are constrained by carbon emissions. Our paper explores work in tactical planning with regards to vehicle resource allocation from distribution centers to customer locations in a multi-echelon logistics network. We formulate the bi-objective optimization problem exactly and design a memetic algorithm to efficiently derive an approximate Pareto front. We illustrate the applicability of our approach …
Best Upgrade Plans For Large Road Networks, Yimin Lin, Kyriakos Mouratidis
Best Upgrade Plans For Large Road Networks, Yimin Lin, Kyriakos Mouratidis
Research Collection School Of Computing and Information Systems
In this paper, we consider a new problem in the context of road network databases, named Resource Constrained Best Upgrade Plan computation (BUP, for short). Consider a transportation network (weighted graph) G where a subset of the edges are upgradable, i.e., for each such edge there is a cost, which if spent, the weight of the edge can be reduced to a specific new value. Given a source and a destination in G, and a budget (resource constraint) B, the BUP problem is to identify which upgradable edges should be upgraded so that the shortest path distance between source and …
Flotra: Flower-Shape Trajectory Mining For Instance-Specific Parameter Tuning, Lindawati Lindawati, Feida Zhu, Hoong Chuin Lau
Flotra: Flower-Shape Trajectory Mining For Instance-Specific Parameter Tuning, Lindawati Lindawati, Feida Zhu, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
The performance of a heuristic algorithm is highly dependent on its parameter configuration, yet finding a good parameter configuration is often a time-consuming task. In this paper we propose FloTra, a Flower graph mining for graph search Trajectory pattern extraction for generic instance-specific automated parameter tuning. This algorithm provides efficient extraction of compact and discriminative features of the search trajectory, upon which problem instances are clustered and the corresponding optimal parameter configurations are computed. Experimental evaluations of our approach on the Quadratic Assignment Problem (QAP) show that our approach offers promising improvement over existing parameter tuning algorithms. In this work, …
Interacting Knapsack Problem In Designing Resource Bundles, Truong Huy D. Nguyen, Pradeep Reddy Varakantham, Hoong Chuin Lau, Shih-Fen Cheng
Interacting Knapsack Problem In Designing Resource Bundles, Truong Huy D. Nguyen, Pradeep Reddy Varakantham, Hoong Chuin Lau, Shih-Fen Cheng
Research Collection School Of Computing and Information Systems
In many real-life businesses, the service provider/seller keeps a log of the visitors’ behavior as a way to assess the efficiency of the current business/operation model and find room for improvement. For example, by tracking when visitors entering attractions in a theme park, theme park owners can detect when and where congestion may occur, thus having contingency plans to reroute the visitors accordingly. Similarly, a Cable TV service provider can track channel switching events at each household to identify uninteresting channels. Subsequently, the repertoire of channels up for subscription can evolve over time to better serve the entertainment demand of …
Multi-Agent Orienteering Problem With Time-Dependent Capacity Constraints, Cen Chen, Shih-Fen Cheng, Hoong Chuin Lau
Multi-Agent Orienteering Problem With Time-Dependent Capacity Constraints, Cen Chen, Shih-Fen Cheng, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
The Orienteering Problem (OP), as originally defined by Tsiligirides, is the problem of cross-countr sport in which participants get rewards from visiting a predefined set of checkpoints. As Orienteering Problem can be used to describe a wide variety of real-world problems like route planning for facility inspection, patrolling of strategic location, and reward-weighted traveling salesman problem, it has attracted continuous interests from researchers and a large number of variants and corresponding algorithms for solving them have been introduced.
Politics, Sharing And Emotion In Microblogs, Tuan-Anh Hoang, William Cohen, Ee Peng Lim, Doug Pierce, David Redlawsk
Politics, Sharing And Emotion In Microblogs, Tuan-Anh Hoang, William Cohen, Ee Peng Lim, Doug Pierce, David Redlawsk
Research Collection School Of Computing and Information Systems
In political contexts, it is known that people act as "motivated reasoners", i.e., information is evaluated first for emotional affect, and this emotional reaction influences later deliberative reasoning steps. As social media becomes a more and more prevalent way of receiving political information, it becomes important to understand more completely the interaction between information, emotion, social community, and information-sharing behavior. In this paper, we describe a high-precision classifier for politically-oriented tweets, and an accurate classifier of a Twitter user's political affiliation. Coupled with existing sentiment-analysis tools for microblogs, these methods enable us to systematically study the interaction of emotion and …
“Network-Theoretic” Queuing Delay Estimation In Theme Park Attractions, Ajay Aravamudhan, Archan Misra, Hoong Chuin Lau
“Network-Theoretic” Queuing Delay Estimation In Theme Park Attractions, Ajay Aravamudhan, Archan Misra, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Queuing is a common phenomenon in theme parks which negatively affects visitor experience and revenue yields. There is thus a need for park operators to infer the real queuing delays without expensive investment in human effort or complex tracking infrastructure. In this paper, we depart from the classical queuing theory approach and provide a data-driven and online approach for estimating the time-varying queuing delays experienced at different attractions in a theme park. This work is novel in that it relies purely on empirical observations of the entry time of individual visitors at different attractions, and also accommodates the reality that …
Improving Patient Length-Of-Stay In Emergency Department Through Dynamic Resource Allocation Policies, Kar Way Tan, Wei Hao Tan, Hoong Chuin Lau
Improving Patient Length-Of-Stay In Emergency Department Through Dynamic Resource Allocation Policies, Kar Way Tan, Wei Hao Tan, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
In this work, we consider the problem of allocating doctors in the ambulatory area of a hospital's emergency department (ED) based on a set of policies. Traditional staffing methods are static, hence do not react well to surges in patient demands. We study strategies that intelligently adjust the number of doctors based on current and historical information about the patient arrival. Our main contribution is our proposed data-driven online approach that performs adaptive allocation by utilizing historical as well as current arrivals by running symbiotic simulation in real-time. We build a simulation prototype that models ED process that is close …
Attribute-Based Encryption With Verifiable Outsourced Decryption, Junzuo Lai, Robert H. Deng, Chaowen Guan, Jian Weng
Attribute-Based Encryption With Verifiable Outsourced Decryption, Junzuo Lai, Robert H. Deng, Chaowen Guan, Jian Weng
Research Collection School Of Computing and Information Systems
Attribute-based encryption (ABE) is a public-keybased one-to-many encryption that allows users to encrypt and decrypt data based on user attributes. A promising application of ABE is flexible access control of encrypted data stored in the cloud, using access polices and ascribed attributes associated with private keys and ciphertexts.One of themain efficiency drawbacks of the existing ABE schemes is that decryption involves expensive pairing operations and the number of such operations grows with the complexity of the access policy. Recently, Green et al. proposed an ABE system with outsourced decryption that largely eliminates the decryption overhead for users. In such a …
The User’S Communication Patterns On A Mobile Social Network Site, Youngsoo Kim
The User’S Communication Patterns On A Mobile Social Network Site, Youngsoo Kim
Research Collection School Of Computing and Information Systems
Given that users are simultaneously connected in multiple communication channels in a social networking service site (e.g., chat, message, and group message), we explore user's collective networking behavior. We collected the data from a mobile social networking site with 4.8 million registered users. The empirical estimation shows interesting results: (1) there are cross-effects across the communication channels: substitute effects for "chat and message" and complementary effects for "message and group message" and "chat and group message" (2) there is significant local network effect but global network effect is not observed, (3) users utilize communication channels for different purposes according to …
Integration Of Social Media Technologies With Erp:A Prototype Implementation, Venky Shankararaman, Eng Kit Lum
Integration Of Social Media Technologies With Erp:A Prototype Implementation, Venky Shankararaman, Eng Kit Lum
Research Collection School Of Computing and Information Systems
Many organizations use social media to enhance collaboration both internally among employees and externally with customers and partners. However, it is not sufficient to just create a presence in some key social environments such as Facebook or YouTube. In order to fully leverage the value of social media, organizations must integrate social media with their business processes, which means new solutions have to be developed that extend existing enterprise systems. In this paper, we present a prototype solution that demonstrates the integration of social media with the order processing process. The implemented solution brings together the embedded best practice processes …
Automated Generation Of Interaction Graphs For Value-Factored Decentralized Pomdps, William Yeoh, Akshat Kumar, Shlomo Zilberstein
Automated Generation Of Interaction Graphs For Value-Factored Decentralized Pomdps, William Yeoh, Akshat Kumar, Shlomo Zilberstein
Research Collection School Of Computing and Information Systems
The Decentralized Partially Observable Markov Decision Process (Dec-POMDP) is a powerful model for multi-agent planning under uncertainty, but its applicability is hindered by its high complexity – solving Dec-POMDPs optimally is NEXP-hard. Recently, Kumar et al. introduced the Value Factorization (VF) framework, which exploits decomposable value functions that can be factored into subfunctions. This framework has been shown to be a generalization of several specialized models such as TI-Dec-MDPs, ND-POMDPs and TD-POMDPs, which leverage different forms of sparse agent interactions to improve the scalability of planning. Existing algorithms for these models assume that the interaction graph of the problem is …