Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Computer Sciences (17)
- Physical Sciences and Mathematics (17)
- Computer Engineering (9)
- Operations Research, Systems Engineering and Industrial Engineering (9)
- Data Storage Systems (7)
-
- Artificial Intelligence and Robotics (6)
- Graphics and Human Computer Interfaces (5)
- Business (3)
- Theory and Algorithms (2)
- Databases and Information Systems (1)
- Digital Communications and Networking (1)
- Numerical Analysis and Scientific Computing (1)
- OS and Networks (1)
- Operations and Supply Chain Management (1)
- Keyword
-
- Activity durations (1)
- Algorithms (1)
- Applications (1)
- BP neural network (1)
- Bag-of-visual-words (1)
-
- Blog (1)
- Concept-based video search (1)
- Detector selection and fusion (1)
- Dynamic programming (1)
- Error (1)
- Expansion (1)
- Experimentation (1)
- Feasible solutions (1)
- Hidden layer unit (1)
- Infinite in-process wait buffer (1)
- Job Shop Scheduling (1)
- Local searches (1)
- Makespan (1)
- Market-based approach (1)
- Minimal and maximal time lags (1)
- Monte-Carlo Simulation (1)
- Multimedia topic detection and tracking (1)
- Multiple Machine (1)
- Near-duplicate visual constraint (1)
- News (1)
- News story clustering (1)
- Partial order schedules (1)
- Performance (1)
- Popular queries (1)
- Queues (1)
Articles 1 - 18 of 18
Full-Text Articles in Engineering
Distributing Complementary Resources Across Multiple Periods With Stochastic Demand, Shih-Fen Cheng, John Tajan, Hoong Chuin Lau
Distributing Complementary Resources Across Multiple Periods With Stochastic Demand, Shih-Fen Cheng, John Tajan, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
In this paper, we evaluate whether the robustness of a market mechanism that allocates complementary resources could be improved through the aggregation of time periods in which resources are consumed. In particular, we study a multi-round combinatorial auction that is built on a general equilibrium framework. We adopt the general equilibrium framework and the particular combinatorial auction design from the literature, and we investigate the benefits and the limitation of time-period aggregation when demand-side uncertainties are introduced. By using simulation experiments, we show that under stochastic conditions the performance variation of the process decreases as the time frame length (time …
Spreadsheet Data Resampling For Monte-Carlo Simulation, Thin Yin Leong, Wee Leong Lee
Spreadsheet Data Resampling For Monte-Carlo Simulation, Thin Yin Leong, Wee Leong Lee
Research Collection School Of Computing and Information Systems
The pervasiveness of spreadsheets software resulted in its increased application as a simulation tool for business analysis. Random values generation supporting such evaluations using spreadsheets are simple and yet powerful. However, the typical approach to Monte-Carlo simulations, which is what simulations with stochasticity are called, requires significant amount of time to be spent on data collection, data collation, and distribution function fitting. In fact, the latter can be overwhelming for undergraduate students to learn and do properly in a short time. Resampling eliminates both the need to fit distributions to the sample data, and to perform the ensuing tests of …
Fusing Semantics, Observability, Reliability And Diversity Of Concept Detectors For Video Search, Xiao-Yong Wei, Chong-Wah Ngo
Fusing Semantics, Observability, Reliability And Diversity Of Concept Detectors For Video Search, Xiao-Yong Wei, Chong-Wah Ngo
Research Collection School Of Computing and Information Systems
Effective utilization of semantic concept detectors for large-scale video search has recently become a topic of intensive studies. One of main challenges is the selection and fusion of appropriate detectors, which considers not only semantics but also the reliability of detectors, observability and diversity of detectors in target video domains. In this paper, we present a novel fusion technique which considers different aspects of detectors for query answering. In addition to utilizing detectors for bridging the semantic gap of user queries and multimedia data, we also address the issue of "observability gap" among detectors which could not be directly inferred …
Ontology-Based Visual Word Matching For Near-Duplicate Retrieval, Yu-Gang Jiang, Chong-Wah Ngo
Ontology-Based Visual Word Matching For Near-Duplicate Retrieval, Yu-Gang Jiang, Chong-Wah Ngo
Research Collection School Of Computing and Information Systems
This paper proposes a novel approach to exploit the ontological relationship of visual words by linguistic reasoning. A visual word ontology is constructed to facilitate the rigorous evaluation of linguistic similarity across visual words. The linguistic similarity measurement enables cross-bin matching of visual words, compromising the effectiveness and speed of conventional keypoint matching and bag-of-word approaches. A constraint EMD is proposed and experimented to efficiently match visual words. Empirical findings indicate that the proposed approach offers satisfactory performance to near-duplicate retrieval, while still enjoying the merit of speed efficiency compared with other techniques.
Modeling Video Hyperlinks With Hypergraph For Web Video Reranking, Hung-Khoon Tan, Chong-Wah Ngo, Xiao Wu
Modeling Video Hyperlinks With Hypergraph For Web Video Reranking, Hung-Khoon Tan, Chong-Wah Ngo, Xiao Wu
Research Collection School Of Computing and Information Systems
In this paper, we investigate a novel approach of exploiting visual-duplicates for web video reranking using hypergraph. Current graph-based reranking approaches consider mainly the pair-wise linking of keyframes and ignore reliability issues that are inherent in such representation. We exploit higher order relation to overcome the issues of missing links in visual-duplicate keyframes and in addition identify the latent relationships among keyframes. Based on hypergraph, we consider two groups of video threads: visual near-duplicate threads and story threads, to hyperlink web videos and describe the higher order information existing in video content. To facilitate reranking using random walk algorithm, the …
Determining The Number Of Bp Neural Network Hidden Layer Units, Huayu Shen, Zhaoxia Wang, Chengyao Gao, Juan Qin, Fubin Yao, Wei Xu
Determining The Number Of Bp Neural Network Hidden Layer Units, Huayu Shen, Zhaoxia Wang, Chengyao Gao, Juan Qin, Fubin Yao, Wei Xu
Research Collection School Of Computing and Information Systems
This paper proposed an improved method to contrapose the problem which is difficult to determine the number of BP neural network hidden layer units. it is proved that the method is efficeient in reducing the frequency of the test through experients, and improves the efficiency of determining the best number of hidden units, which is more valuable in the applications.
A Heuristic Method For Job-Shop Scheduling With An Infinite Wait Buffer: From One-Machine To Multi-Machine Problems, Z. J. Zhao, J. Kim, M. Luo, Hoong Chuin Lau, S. S. Ge
A Heuristic Method For Job-Shop Scheduling With An Infinite Wait Buffer: From One-Machine To Multi-Machine Problems, Z. J. Zhao, J. Kim, M. Luo, Hoong Chuin Lau, S. S. Ge
Research Collection School Of Computing and Information Systems
Through empirical comparison of classical job shop problems (JSP) with multi-machine consideration, we find that the objective to minimize the sum of weighted tardiness has a better wait property compared with the objective to minimize the makespan. Further, we test the proposed Iterative Minimization Micro-model (IMM) heuristic method with the mixed integer programming (MIP) solution by CPLEX. For multi-machine problems, the IMM heuristic method is faster and achieves a better solution. Finally, for a large problem instance with 409 jobs and 30 types of machines, IMM-heuristic method is compared with ProModel and we find that the heuristic method is slightly …
Generating Robust Schedules Subject To Resource And Duration Uncertainties, Na Fu, Hoong Chuin Lau, Fei Xiao
Generating Robust Schedules Subject To Resource And Duration Uncertainties, Na Fu, Hoong Chuin Lau, Fei Xiao
Research Collection School Of Computing and Information Systems
We consider the Resource-Constrained Project Scheduling Problem with minimal and maximal time lags under resource and duration uncertainties. To manage resource uncertainties, we build upon the work of Lambrechts et al 2007 and develop a method to analyze the effect of resource breakdowns on activity durations. We then extend the robust local search framework of Lau et al 2007 with additional considerations on the impact of unexpected resource breakdowns to the project makespan, so that partial order schedules (POS) can absorb both resource and duration uncertainties. Experiments show that our proposed model is capable of addressing the uncertainty of resources, …
Dynamic Allocation Of Airline Check-In Counters: A Queueing Optimisation Approach, Mahmut Parlar, Sharafali Moosa
Dynamic Allocation Of Airline Check-In Counters: A Queueing Optimisation Approach, Mahmut Parlar, Sharafali Moosa
Research Collection Lee Kong Chian School Of Business
This paper was motivated by an observation in an international airport with regard to allocation of resources for check-in counters. In an exclusive check-in counter system, each flight has a dedicated number of counters that will be open until at least a half-hour before the scheduled departure of that flight. Currently, in many of the airports around the world, the decision to open or close check-in counters is done on an ad hoc basis by human schedulers. In doing so, the schedulers are almost always forced to perform a balancing act in meeting the quality of service stipulated by the …
Linear Relaxation Techniques For Task Management In Uncertain Settings, Pradeep Varakantham, Stephen F. Smith
Linear Relaxation Techniques For Task Management In Uncertain Settings, Pradeep Varakantham, Stephen F. Smith
Research Collection School Of Computing and Information Systems
In this paper, we consider the problem of assisting a busy user in managing her workload of pending tasks. We assume that our user is typically oversubscribed, and is invariably juggling multiple concurrent streams of tasks (or work flows) of varying importance and urgency. There is uncertainty with respect to the duration of a pending task as well as the amount of follow-on work that may be generated as a result of executing the task. The user’s goal is to be as productive as possible; i.e., to execute tasks that realize the maximum cumulative payoff. This is achieved by enabling …
Bag-Of-Visual-Words Expansion Using Visual Relatedness For Video Indexing, Yu-Gang Jiang, Chong-Wah Ngo
Bag-Of-Visual-Words Expansion Using Visual Relatedness For Video Indexing, Yu-Gang Jiang, Chong-Wah Ngo
Research Collection School Of Computing and Information Systems
Bag-of-visual-words (BoW) has been popular for visual classification in recent years. In this paper, we propose a novel BoW expansion method to alleviate the effect of visual word correlation problem. We achieve this by diffusing the weights of visual words in BoW based on visual word relatedness, which is rigorously defined within a visual ontology. The proposed method is tested in video indexing experiment on TRECVID-2006 video retrieval benchmark, and an improvement of 7% over the traditional BoW is reported.
Searching Blogs And News: A Study On Popular Queries, Aixin Sun, Meishan Hu, Ee Peng Lim
Searching Blogs And News: A Study On Popular Queries, Aixin Sun, Meishan Hu, Ee Peng Lim
Research Collection School Of Computing and Information Systems
Blog/news search engines are very important channels to reach information about the real-time happenings. In this paper, we study the popular queries collected over one year period and compare their search results returned by a blog search engine (i.e., Technorati) and a news search engine (i.e., Google News). We observed that the numbers of hits returned by the two search engines for the same set of queries were highly correlated, suggesting that blogs often provide commentary to current events reported in news. As many popular queries are related to some events, we further observed a high cohesiveness among the returned …
Electric Elves: What Went Wrong And Why, Milind Tambe, Emma Bowring, Jonathan Pearce, Pradeep Reddy Varakantham, Paul Scerri, David V. Pynadath
Electric Elves: What Went Wrong And Why, Milind Tambe, Emma Bowring, Jonathan Pearce, Pradeep Reddy Varakantham, Paul Scerri, David V. Pynadath
Research Collection School Of Computing and Information Systems
Software personal assistants continue to be a topic of significant research interest. This article outlines some of the important lessons learned from a successfully-deployed team of personal assistant agents (Electric Elves) in an office environment. In the Electric Elves project, a team of almost a dozen personal assistant agents were continually active for seven months. Each elf (agent) represented one person and assisted in daily activities in an actual office environment. This project led to several important observations about privacy, adjustable autonomy, and social norms in office environments. In addition to outlining some of the key lessons learned we outline …
Integrating Temporal Difference Methods And Self‐Organizing Neural Networks For Reinforcement Learning With Delayed Evaluative Feedback, Ah-Hwee Tan, Ning Lu, Dan Xiao
Integrating Temporal Difference Methods And Self‐Organizing Neural Networks For Reinforcement Learning With Delayed Evaluative Feedback, Ah-Hwee Tan, Ning Lu, Dan Xiao
Research Collection School Of Computing and Information Systems
This paper presents a neural architecture for learning category nodes encoding mappings across multimodal patterns involving sensory inputs, actions, and rewards. By integrating adaptive resonance theory (ART) and temporal difference (TD) methods, the proposed neural model, called TD fusion architecture for learning, cognition, and navigation (TD-FALCON), enables an autonomous agent to adapt and function in a dynamic environment with immediate as well as delayed evaluative feedback (reinforcement) signals. TD-FALCON learns the value functions of the state-action space estimated through on-policy and off-policy TD learning methods, specifically state-action-reward-state-action (SARSA) and Q-learning. The learned value functions are then used to determine the …
Multimodal News Story Clustering With Pairwise Visual Near-Duplicate Constraint, Xiao Wu, Chong-Wah Ngo, Alexander G. Hauptmann
Multimodal News Story Clustering With Pairwise Visual Near-Duplicate Constraint, Xiao Wu, Chong-Wah Ngo, Alexander G. Hauptmann
Research Collection School Of Computing and Information Systems
Story clustering is a critical step for news retrieval, topic mining, and summarization. Nonetheless, the task remains highly challenging owing to the fact that news topics exhibit clusters of varying densities, shapes, and sizes. Traditional algorithms are found to be ineffective in mining these types of clusters. This paper offers a new perspective by exploring the pairwise visual cues deriving from near-duplicate keyframes (NDK) for constraint-based clustering. We propose a constraint-driven co-clustering algorithm (CCC), which utilizes the near-duplicate constraints built on top of text, to mine topic-related stories and the outliers. With CCC, the duality between stories and their underlying …
Concept Detection: Convergence To Local Features And Opportunities Beyond, Shih-Fu Chang, Junfeng He, Yu-Gang Jiang, Elie El Khoury, Chong-Wah Ngo, Akira Yanagawa, Eric Zavesky
Concept Detection: Convergence To Local Features And Opportunities Beyond, Shih-Fu Chang, Junfeng He, Yu-Gang Jiang, Elie El Khoury, Chong-Wah Ngo, Akira Yanagawa, Eric Zavesky
Research Collection School Of Computing and Information Systems
No abstract provided.
Columbia University/Vireo-Cityu/Irit Trecvid2008 High-Level Feature Extraction And Interactive Video Search, Shih-Fu Chang, Junfeng He, Yu-Gang Jiang, Elie El Khoury, Chong-Wah Ngo, Akira Yanagawa, Eric Zavesky
Columbia University/Vireo-Cityu/Irit Trecvid2008 High-Level Feature Extraction And Interactive Video Search, Shih-Fu Chang, Junfeng He, Yu-Gang Jiang, Elie El Khoury, Chong-Wah Ngo, Akira Yanagawa, Eric Zavesky
Research Collection School Of Computing and Information Systems
In this report, we present overview and comparative analysis of our HLF detection system, which achieves the top performance among all type-A submissions in 2008. We also describe preliminary evaluation of our video search system, CuZero, in the interactive search task.
The Oil Drilling Model And Iterative Deepening Genetic Annealing Algorithm For The Traveling Salesman Problem, Hoong Chuin Lau, Fei Xiao
The Oil Drilling Model And Iterative Deepening Genetic Annealing Algorithm For The Traveling Salesman Problem, Hoong Chuin Lau, Fei Xiao
Research Collection School Of Computing and Information Systems
In this work, we liken the solving of combinatorial optimization problems under a prescribed computational budget as hunting for oil in an unexplored ground. Using this generic model, we instantiate an iterative deepening genetic annealing (IDGA) algorithm, which is a variant of memetic algorithms. Computational results on the traveling salesman problem show that IDGA is more effective than standard genetic algorithms or simulated annealing algorithms or a straightforward hybrid of them. Our model is readily applicable to solve other combinatorial optimization problems.