Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Databases and Information Systems (3555)
- Software Engineering (2197)
- Artificial Intelligence and Robotics (1881)
- Information Security (1102)
- Numerical Analysis and Scientific Computing (1060)
-
- Graphics and Human Computer Interfaces (942)
- Engineering (884)
- Social and Behavioral Sciences (807)
- Business (748)
- Theory and Algorithms (514)
- Computer Engineering (449)
- Programming Languages and Compilers (413)
- Operations Research, Systems Engineering and Industrial Engineering (407)
- OS and Networks (345)
- Communication (326)
- Social Media (264)
- Public Affairs, Public Policy and Public Administration (230)
- Medicine and Health Sciences (196)
- Education (194)
- Transportation (194)
- Management Information Systems (176)
- Data Storage Systems (167)
- E-Commerce (154)
- International and Area Studies (147)
- Technology and Innovation (146)
- Asian Studies (145)
- Health Information Technology (118)
- Higher Education (105)
- Keyword
-
- Machine learning (145)
- Deep learning (129)
- Artificial intelligence (123)
- Social media (82)
- Singapore (73)
-
- Reinforcement learning (72)
- Data mining (70)
- Privacy (67)
- Security (62)
- Cloud computing (60)
- Deep Learning (57)
- Empirical study (55)
- Software engineering (55)
- Optimization (53)
- Online learning (51)
- Visualization (51)
- Neural networks (50)
- Anomaly detection (49)
- Training (49)
- Twitter (49)
- Task analysis (48)
- Blockchain (47)
- Natural language processing (47)
- Collaboration (46)
- Large Language Models (46)
- Feature extraction (45)
- Algorithms (44)
- Access control (43)
- Machine Learning (43)
- Semantics (43)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (8458)
- Dissertations and Theses Collection (Open Access) (189)
- Research Collection Lee Kong Chian School Of Business (59)
- Research Collection Yong Pung How School Of Law (49)
- Research Collection School of Social Sciences (27)
-
- Asian Management Insights (26)
- Research Collection College of Integrative Studies (23)
- Perspectives@SMU (21)
- Research Collection School Of Accountancy (18)
- Dissertations and Theses Collection (15)
- FORCE 2026 (14)
- SMU Press Releases and News (12)
- MITB Thought Leadership Series (11)
- Research Collection Library (10)
- Research Collection School of Computing and Information Systems (10)
- Research@SMU: Connecting the Dots (10)
- PhD Student’s Publications Collection (8)
- LARC Research Publications (7)
- Research Collection School Of Economics (6)
- CCX Research (4)
- SMU Research Data (4)
- Student Publications (4)
- 2024 AI for Research Week (3)
- SCIS Student Publications (3)
- Centre for AI & Data Governance (2019-2025) (2)
- Research Collection Office of Research (2)
- CASTLe: Collection of Articles on Scholarship for Teaching and Learning (1)
- Centre for Computational Law (2022-2025) (1)
- Library Events (1)
- ROSA Journal Articles and Publications (1)
- Publication Type
- File Type
Articles 7951 - 7980 of 9003
Full-Text Articles in Computer Sciences
Location Update Versus Paging Trade-Off In Cellular Networks: An Approach Based On Vector Quantization, Abhishek Roy, Archan Misra, Sajal K. Das
Location Update Versus Paging Trade-Off In Cellular Networks: An Approach Based On Vector Quantization, Abhishek Roy, Archan Misra, Sajal K. Das
Research Collection School Of Computing and Information Systems
In this paper we propose two information-theoretic techniques for efficiently trading off the location update and paging costs associated with mobility management in wireless cellular networks. Previous approaches attempt to always accurately convey a mobile's movement sequence and hence, cannot reduce the signaling cost below the entropy bound. Our proposed techniques, however, exploit rate-distortion theory to arbitrarily reduce the update cost, at the expense of an increase in the corresponding paging overhead. To this end, we describe two location tracking algorithms, based on spatial quantization and temporal quantization, which first quantize the movement sequence into a smaller set of codewords, …
I’M A Virus Harming The Earth, M. Thulasidas
I’M A Virus Harming The Earth, M. Thulasidas
Research Collection School Of Computing and Information Systems
We humans plunder the raw material from our host planet with such an abandon that is only seen in viruses.
An Empirical Analysis Of Mobile Voice Service And Sms: A Structural Model, Youngsoo Kim, William B. Vogt, Ramayya Krishnan, Rahul Telang
An Empirical Analysis Of Mobile Voice Service And Sms: A Structural Model, Youngsoo Kim, William B. Vogt, Ramayya Krishnan, Rahul Telang
Research Collection School Of Computing and Information Systems
In addition to the wireless telephony boom, a similar exponential increasing trend in wireless data service - short message service (SMS) - is visible as technology advances. We develop a structural model to understand how mobile users behave, especially how they consume voice, and services. Specifically, we measure the own- and the cross-price elasticities of these services. The cross-price elasticity is of significant importance because marketing activities are critically influenced by whether the goods are substitutes or complements. The research context poses significant econometric challenges due to three-part tariff, sequential discrete plan choice and continuous quantity choices. Using detailed individual …
Machine-Assisted Proof Support For Validation Beyond Simulink, Chunqing Chen, Jin Song Dong, Jun Sun
Machine-Assisted Proof Support For Validation Beyond Simulink, Chunqing Chen, Jin Song Dong, Jun Sun
Research Collection School Of Computing and Information Systems
Simulink is popular in industry for modeling and simulating embedded systems. It is deficient to handle requirements of high-level assurance and timing analysis. Previously, we showed the idea of applying Timed Interval Calculus (TIC) to complement Simulink. In this paper, we develop machine-assisted proof support for Simulink models represented in TIC. The work is based on a generic theorem prover, Prototype Verification System (PVS). The TIC specifications of both Simulink models and requirements are transformed to PVS specifications automatically. Verification can be carried out at interval level with a high level of automation. Analysis of continuous and discrete behaviors is …
Important Characteristics Of Software Development Team Members: An Empirical Investigation Using Repertory Grid, Keng Siau, Xin Tan, Hong Sheng
Important Characteristics Of Software Development Team Members: An Empirical Investigation Using Repertory Grid, Keng Siau, Xin Tan, Hong Sheng
Research Collection School Of Computing and Information Systems
An information system is typically developed by a team of information systems (IS) professionals. Research shows that teams staffed with the right people are more likely to be effective and efficient. There is a paucity of study that examines the important traits of IS professionals in team contexts. The objective of this research is to identify and understand the important characteristics of good team members in software development projects. We applied an established psychological technique (Repertory Grid) to guide our interviews with 21 experienced IS professionals, who have had extensive experience in software development teams. The comprehensive list of important …
On Improving Wikipedia Search Using Article Quality, Meiqun Hu, Ee Peng Lim, Aixin Sun, Hady Wirawan Lauw, Ba-Quy Vuong
On Improving Wikipedia Search Using Article Quality, Meiqun Hu, Ee Peng Lim, Aixin Sun, Hady Wirawan Lauw, Ba-Quy Vuong
Research Collection School Of Computing and Information Systems
Wikipedia is presently the largest free-and-open online encyclopedia collaboratively edited and maintained by volunteers. While Wikipedia offers full-text search to its users, the accuracy of its relevance-based search can be compromised by poor quality articles edited by non-experts and inexperienced contributors. In this paper, we propose a framework that re-ranks Wikipedia search results considering article quality. We develop two quality measurement models, namely Basic and PeerReview, to derive article quality based on co-authoring data gathered from articles' edit history. Compared with Wikipedia's full-text search engine, Google and Wikiseek, our experimental results showed that (i) quality-only ranking produced by PeerReview gives …
Comment-Oriented Blog Summarization By Sentence Extraction, Meishan Hu, Ee Peng Lim, Aixin Sun
Comment-Oriented Blog Summarization By Sentence Extraction, Meishan Hu, Ee Peng Lim, Aixin Sun
Research Collection School Of Computing and Information Systems
Much existing research on blogs focused on posts only, ignoring their comments. Our user study conducted on summarizing blog posts, however, showed that reading comments does change one's understanding about blog posts. In this research, we aim to extract representative sentences from a blog post that best represent the topics discussed among its comments. The proposed solution first derives representative words from comments and then selects sentences containing representative words. The representativeness of words is measured using ReQuT (i.e., Reader, Quotation, and Topic). Evaluated on human labeled sentences, ReQuT together with summation-based sentence selection showed promising results.
Light-Weight Encryption Schemes For Multimedia Data, Feng Bao, Robert H. Deng
Light-Weight Encryption Schemes For Multimedia Data, Feng Bao, Robert H. Deng
Research Collection School Of Computing and Information Systems
Due to the pervasiveness of high-speed networks and multimedia communications and storage, the demand for highspeed cryptosystems is ever increasing. It is widely believed that there is a tradeoff between speed and security in cryptosystem design. No existing encryption algorithms are both fast enough for high-speed operation and sufficiently secure to withstand powerful cryptanalysis. In this paper, we propose and analyze a generic construction of high-speed encryption schemes. Our solution is based on the fact that there exist secure but relatively slow block ciphers, e. g. AES, and super-fast but relatively weaker stream ciphers. We then combine a secure block …
Designing The Market Game For A Commodity Trading Simulation, Shih-Fen Cheng
Designing The Market Game For A Commodity Trading Simulation, Shih-Fen Cheng
Research Collection School Of Computing and Information Systems
In this paper, we propose to design a market game that (a) can be used in modeling and studying commodity trading scenarios, and (b) can be used in capturing human traders' behaviors. Specifically, we demonstrate the usefulness of this commodity trading game in a single-commodity futures trading scenario. A pilot experiment was run with a mixture of human traders and an autonomous agent that emulates the aggregatedmarket condition, with the assumption that this autonomous agent would hint each of its action through a public announcement. We show that the information collected from this simulation can be used to extract the …
Measuring Article Quality In Wikipedia: Models And Evaluation, Meiqun Hu, Ee Peng Lim, Aixin Sun, Hady W. Lauw, Ba-Quy Vuong
Measuring Article Quality In Wikipedia: Models And Evaluation, Meiqun Hu, Ee Peng Lim, Aixin Sun, Hady W. Lauw, Ba-Quy Vuong
Research Collection School Of Computing and Information Systems
Wikipedia has grown to be the world largest and busiest free encyclopedia, in which articles are collaboratively written and maintained by volunteers online. Despite its success as a means of knowledge sharing and collaboration, the public has never stopped criticizing the quality of Wikipedia articles edited by non-experts and inexperienced contributors. In this paper, we investigate the problem of assessing the quality of articles in collaborative authoring of Wikipedia. We propose three article quality measurement models that make use of the interaction data between articles and their contributors derived from the article edit history. Our Basic model is designed based …
An Information-Sharing Based Anti-Phishing System, Yueqing Cheng, Zhen Yuan, Lei Ma, Robert H. Deng
An Information-Sharing Based Anti-Phishing System, Yueqing Cheng, Zhen Yuan, Lei Ma, Robert H. Deng
Research Collection School Of Computing and Information Systems
This paper presents the design of an informationsharing based or server-assisted anti-phishing system. The system follows a client-server architecture and makes decision based on not only client side heuristics but also collective information from multiple clients. When visiting a web site, a client side proxy, installed as a plug-in to a browser, decides on the legitimacy of the web site based on a combination of white list, black list and heuristics. In case the client side proxy does not have sufficient information to make a clear judgment, it reports the suspicious site to a central server which has access to …
Multi-Period Combinatorial Auction Mechanism For Distributed Resource Allocation And Scheduling, Hoong Chuin Lau, Shih-Fen Cheng, Thin Yin Leong, Jong Han Park, Zhengyi Zhao
Multi-Period Combinatorial Auction Mechanism For Distributed Resource Allocation And Scheduling, Hoong Chuin Lau, Shih-Fen Cheng, Thin Yin Leong, Jong Han Park, Zhengyi Zhao
Research Collection School Of Computing and Information Systems
We consider the problem of resource allocation and scheduling where information and decisions are decentralized, and our goal is to propose a market mechanism that allows resources from a central resource pool to be allocated to distributed decision makers (agents) that seek to optimize their respective scheduling goals. We propose a generic combinatorial auction mechanism that allows agents to competitively bid for the resources needed in a multi-period setting, regardless of the respective scheduling problem faced by the agent, and show how agents can design optimal bidding strategies to respond to price adjustment strategies from the auctioneer. We apply our …
The Price Of Stability In Selfish Scheduling Games, Lucas Agussurja, Hoong Chuin Lau
The Price Of Stability In Selfish Scheduling Games, Lucas Agussurja, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Game theory has gained popularity as an approach to analysing and understanding distributed systems with selfinterested agents. Central to game theory is the concept of Nash equilibrium as a stable state (solution) of the system, which comes with a price - the loss in efficiency. The quantification of the efficiency loss is one of the main research concerns. In this paper, we study the quality and computational characteristic of the best Nash equilibrium in two selfish scheduling models: the congestion model and the sequencing model. In particular, we present the following results: (1) In the congestion model: first, the best …
S-Made: Interactive Storytelling Architecture Through Goal Execution And Decomposition, Yundong Cai, Zhiqi Shen, Chunyan Miao, Ah-Hwee Tan
S-Made: Interactive Storytelling Architecture Through Goal Execution And Decomposition, Yundong Cai, Zhiqi Shen, Chunyan Miao, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
Interactive storytelling, emerging with virtual reality technology, has attracted a lot of research interests in recent years. In order to bridge the gap between story generation and story presentation, some hybrid narrative models are raised. In this paper, we propose a new hybrid interactive storytelling architecture S-MADE. It combines the story plot generation and character performance through goal execution and decomposition mechanism. Fuzzy Cognitive Goal Net (FCGN) is a goal modeling tool for modeling the story scenario and character behaviors. The goal decomposition algorithm enables for director agent to dispatch acts to characters easily. With this system, dynamic storylines as …
Experimenting Vireo-374: Bag-Of-Visual-Words And Visual-Based Ontology For Semantic Video Indexing And Search, Chong-Wah Ngo, Yu-Gang Jiang, Xiaoyong Wei, Feng Wang, Wanlei Zhao, Hung-Khoon Tan, Xiao Wu
Experimenting Vireo-374: Bag-Of-Visual-Words And Visual-Based Ontology For Semantic Video Indexing And Search, Chong-Wah Ngo, Yu-Gang Jiang, Xiaoyong Wei, Feng Wang, Wanlei Zhao, Hung-Khoon Tan, Xiao Wu
Research Collection School Of Computing and Information Systems
In this paper, we present our approaches and results of high-level feature extraction and automatic video search in TRECVID-2007.
Important Characteristics Of Software Development Team Members: An Empirical Investigation Using Repertory Grid, Keng Siau, Xin Tan, Hong Sheng
Important Characteristics Of Software Development Team Members: An Empirical Investigation Using Repertory Grid, Keng Siau, Xin Tan, Hong Sheng
Research Collection School Of Computing and Information Systems
An information system is typically developed by a team of information systems (IS) professionals. Research shows that teams staffed with the right people are more likely to be effective and efficient. There is a paucity of study that examines the important traits of IS professionals in team contexts. The objective of this research is to identify and understand the important characteristics of good team members in software development projects. We applied an established psychological technique (Repertory Grid) to guide our interviews with 21 experienced IS professionals, who have had extensive experience in software development teams. The comprehensive list of important …
Advances And Challenges With Data Broadcasting In Wireless Mesh Networks, Chun Tung Chou, Junaid Qadir, Joo Ghee Lim, Archan Misra
Advances And Challenges With Data Broadcasting In Wireless Mesh Networks, Chun Tung Chou, Junaid Qadir, Joo Ghee Lim, Archan Misra
Research Collection School Of Computing and Information Systems
Wireless mesh networks have become a promising means to provide low-cost broadband access. Many WMN applications require broadcasting data (IPTV etc.) over the WMN. This article studies how efficient data broadcast, measured in terms of broadcast latency, can be realized by exploiting two features of WMNs: the use of multiple transmission rates at the link layer and the use of multiple radio interfaces on each node. We demonstrate that by exploiting these features, broadcast latency can be reduced severalfold compared to the current default practice in wireless LANs of using the lowest transmission rate for broadcast traffic. We also discuss …
Context-Aware Statistical Debugging: From Bug Predictors To Faulty Control Flow Paths, Lingxiao Jiang, Zhendong Su
Context-Aware Statistical Debugging: From Bug Predictors To Faulty Control Flow Paths, Lingxiao Jiang, Zhendong Su
Research Collection School Of Computing and Information Systems
Effective bug localization is important for realizing automated debugging. One attractive approach is to apply statistical techniques on a collection of evaluation profiles of program properties to help localize bugs. Previous research has proposed various specialized techniques to isolate certain program predicates as bug predictors. However, because many bugs may not be directly associated with these predicates, these techniques are often ineffective in localizing bugs. Relevant control flow paths that may contain bug locations are more informative than stand-alone predicates for discovering and understanding bugs. In this paper, we propose an approach to automatically generate such faulty control flow paths …
Mining Modal Scenarios-Based Specifications From Execution Trace Of Reactive Systems, David Lo, Shahar Maoz, Siau-Cheng Khoo
Mining Modal Scenarios-Based Specifications From Execution Trace Of Reactive Systems, David Lo, Shahar Maoz, Siau-Cheng Khoo
Research Collection School Of Computing and Information Systems
Specification mining is a dynamic analysis process aimed at automatically inferring suggested specifications of a program from its execution traces. We describe a novel method, framework, and tool, for mining inter-object scenario-based specifications in the form of a UML2-compliant variant of Damm and Harels Live Sequence Charts (LSC). LSC extends the classical partial order semantics of sequence diagrams with temporal liveness and symbolic class level lifelines, in order to generate compact and expressive specifications. The output of our algorithm is a sound and complete set of statistically significant LSCs (i.e., satisfying given thresholds of support and confidence), mined from an …
Modeling Semantics In Composite Web Service Requests By Utility Elicitation, Qianhui Althea Liang, Jen Yao Chung, Steven M. Miller
Modeling Semantics In Composite Web Service Requests By Utility Elicitation, Qianhui Althea Liang, Jen Yao Chung, Steven M. Miller
Research Collection School Of Computing and Information Systems
When meeting the challenges in automatic and semi-automatic Web service composition, capturing the user’s service demand and preferences is as important as knowing what the services can do. This paper discusses the idea of semantic service requests for composite services, and presents a multi-attribute utility theory (MAUT) based model of composite service requests. Service requests are modeled as user preferences and constraints. Two preference structures, additive independence and generalized additive independence, are utilized in calculating the expected utilities of service composition outcomes. The model is also based on an iterative and incremental scheme meant to better capture requirements in accordance …
Sloque: Slot-Based Query Expansion For Complex Questions, Maggy Anastasia Suryanto, Ee Peng Lim, Aixin Sun, Roger Hsiang-Li Chiang
Sloque: Slot-Based Query Expansion For Complex Questions, Maggy Anastasia Suryanto, Ee Peng Lim, Aixin Sun, Roger Hsiang-Li Chiang
Research Collection School Of Computing and Information Systems
Searching answers to complex questions is a challenging IR task. In this paper, we examine the use of query templates with semantic slots to formulate slot-based queries. These queries have query terms assigned to entity and relationship slots. We develop several query expansion methods for slot-based queries so as to improve their retrieval effectiveness on a document collection. Each method consists of a combination of term scoring scheme, term scoring formula, and term assignment scheme. Our preliminary experiments evaluate these different slot-based query expansion methods on a collection of news documents,and conclude that:(1) slot-based queries yield better retrieval accuracy compared …
Model Checking In The Absence Of Code, Model And Properties, David Lo, Siau-Cheng Khoo
Model Checking In The Absence Of Code, Model And Properties, David Lo, Siau-Cheng Khoo
Research Collection School Of Computing and Information Systems
Model checking is a major approach in ensuring software correctness. It verifies a model converted from code against some formal properties. However, difficulties and programmers ’ reluctance to formalize formal properties have been some hurdles to its widespread industrial adoption. Also, with the advent of commercial off-the-shelf (COTS) components provided by third party vendors, model checking is further challenged as often only a binary version of the code is provided by vendors. Interestingly, latest instrumentation tools like PIN and Valgrind have enable execution traces to be collected dynamically from a running program. In this preliminary study, we investigate what can …
A Two-Phase Approach To Interactivity Enhancement For Large-Scale Distributed Virtual Environments, Nguyen Binh Duong Ta, Suiping Zhou
A Two-Phase Approach To Interactivity Enhancement For Large-Scale Distributed Virtual Environments, Nguyen Binh Duong Ta, Suiping Zhou
Research Collection School Of Computing and Information Systems
Distributed virtual environments (DVEs) are distributed systems that allow multiple geographically distributed clients (users) to interact simultaneously in a computer-generated, shared virtual world. Applications of DVEs can be seen in many areas nowadays, such as online games, military simulations, collaborative designs, etc. To support large-scale DVEs with real-time interactions among thousands or even more distributed clients, a geographically distributed server architecture (GDSA) is generally needed, and the virtual world can be partitioned into many distinct zones to distribute the load among the servers. Due to the geographic distributions of clients and servers in such architectures, it is essential to efficiently …
Performance Of Network-Coding In Multi-Rate Wireless Environments For Multicast Applications, Luiz F. M. Viera, Archan Misra, Mario Gerla
Performance Of Network-Coding In Multi-Rate Wireless Environments For Multicast Applications, Luiz F. M. Viera, Archan Misra, Mario Gerla
Research Collection School Of Computing and Information Systems
This paper investigates the interaction between net-work coding and link-layer transmission rate diversity in multi-hop wireless networks. By appropriately mixing data packets at intermediate nodes, network coding allows a single multicast flow to achieve higher throughput to a set of receivers. Broadcast applications can also exploit link-layer rate diversity, whereby individual nodes can transmit at faster rates at the expense of corresponding smaller coverage area. We first demonstrate how combining rate-diversity with network coding can provide a larger capacity for data dissemination of a single multicast flow, and how consideration of rate diversity is critical for maximizing system throughput. We …
A Multitude Of Opinions: Mining Online Rating Data, Hady Wirawan Lauw, Ee Peng Lim
A Multitude Of Opinions: Mining Online Rating Data, Hady Wirawan Lauw, Ee Peng Lim
Research Collection School Of Computing and Information Systems
Online rating system is a popular feature of Web 2.0 applications. It typically involves a set of reviewers assigning rating scores (based on various evaluation criteria) to a set of objects. We identify two objectives for research on online rating data, namely achieving effective evaluation of objects and learning behaviors of reviewers/objects. These two objectives have conventionally been pursued separately. We argue that the future research direction should focus on the integration of these two objectives, as well as the integration between rating data and other types of data.
Mining Modal Scenarios From Execution Traces, David Lo, Shahar Maoz, Siau-Cheng Khoo
Mining Modal Scenarios From Execution Traces, David Lo, Shahar Maoz, Siau-Cheng Khoo
Research Collection School Of Computing and Information Systems
Specification mining is a dynamic analysis process aimed at automatically inferring suggested specifications of a program from its execution traces. We describe a method, a framework, and a tool, for mining inter-object scenario-based specifications in the form of a UML2-compliant variant of Damm and Harel's Live Sequence Charts (LSC), which extends the classical partial order semantics of sequence diagrams with temporal liveness and symbolic class level lifelines, in order to generate compact and expressive specifications. Moreover, we use previous research work and tools developed for LSC to visualize, analyze, manipulate, test, and thus evaluate the scenario-based specifications we mine. Our …
Preserving Privacy In Supply Chain Management: A Challenge For Next Generation Data Mining, Madhu Ahluwalia, Zhiyuan Chen, Arrya Gangopadhyay, Zhiling Guo
Preserving Privacy In Supply Chain Management: A Challenge For Next Generation Data Mining, Madhu Ahluwalia, Zhiyuan Chen, Arrya Gangopadhyay, Zhiling Guo
Research Collection School Of Computing and Information Systems
In this paper we identify a major area of research as a topic for next generation data mining. The research effort in the last decade on privacy preserving data mining has resulted in the development of numerous algorithms. However, most of the existing research has not been applied in any particular application context. Hence it is unclear whether the current algorithms are directly applicable in any particular problem context. In this paper we identify a significant application context that not only requires protection of privacy but also sophisticated data analysis. The area in question is supply chain management, arguably one …
Analyzing Service Usage Patterns: Methodology And Simulation, Qianhui (Althea) Liang, Jen-Yao Chung
Analyzing Service Usage Patterns: Methodology And Simulation, Qianhui (Althea) Liang, Jen-Yao Chung
Research Collection School Of Computing and Information Systems
This paper proposes that service mining technology will power the construction of new business services via both intra- and inter-enterprise service assembly within the Service Oriented Architecture (SOA) framework. We investigate the methodologies of service mining at the component level of service usage. We also demonstrate how mining of service usage patterns is intended to be used to improve different aspects of service composition. Simulation experiments conducted for mining at the component level are analyzed. The processing details within a general service mining deployment are demonstrated.
Sketchwizard: Wizard Of Oz Prototyping Of Pen-Based User Interfaces, Richard C. Davis, T. Scott Saponas, Michael Shilman, James A. Landay
Sketchwizard: Wizard Of Oz Prototyping Of Pen-Based User Interfaces, Richard C. Davis, T. Scott Saponas, Michael Shilman, James A. Landay
Research Collection School Of Computing and Information Systems
SketchWizard allows designers to create Wizard of Oz prototypes of pen-based user interfaces in the early stages of design. In the past, designers have been inhibited from participating in the design of pen-based interfaces because of the inadequacy of paper prototypes and the difficulty of developing functional prototypes. In SketchWizard, designers and end users share a drawing canvas between two computers, allowing the designer to simulate the behavior of recognition or other technologies. Special editing features are provided to help designers respond quickly to end-user input. This paper describes the SketchWizard system and presents two evaluations of our approach. The …
Om-Based Video Shot Retrieval By One-To-One Matching, Yuxin Peng, Chong-Wah Ngo, Jianguo Xiao
Om-Based Video Shot Retrieval By One-To-One Matching, Yuxin Peng, Chong-Wah Ngo, Jianguo Xiao
Research Collection School Of Computing and Information Systems
This paper proposes a new approach for shot-based retrieval by optimal matching (OM), which provides an effective mechanism for the similarity measure and ranking of shots by one-to-one matching. In the proposed approach, a weighted bipartite graph is constructed to model the color similarity between two shots. Then OM based on Kuhn-Munkres algorithm is employed to compute the maximum weight of a constructed bipartite graph as the shot similarity value by one-to-one matching among frames. To improve the speed efficiency of OM, two improved algorithms are also proposed: bipartite graph construction based on subshots and bipartite graph construction based on …