Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Institution
Articles 1 - 11 of 11
Full-Text Articles in OS and Networks
Topic-Guided Conversational Recommender In Multiple Domains, Lizi Liao, Ryuichi Takanobu, Yunshan Ma, Xun Yang, Minlie Huang, Tat-Seng Chua
Topic-Guided Conversational Recommender In Multiple Domains, Lizi Liao, Ryuichi Takanobu, Yunshan Ma, Xun Yang, Minlie Huang, Tat-Seng Chua
Research Collection School Of Computing and Information Systems
Conversational systems have recently attracted significant attention. Both the research community and industry believe that it will exert huge impact on human-computer interaction, and specifically, the IR/RecSys community has begun to explore Conversational Recommendation. In real-life scenarios, such systems are often urgently needed in helping users accomplishing different tasks under various situations. However, existing works still face several shortcomings: (1) Most efforts are largely confined in single task setting. They fall short of hands in handling tasks across domains. (2) Aside from soliciting user preference from dialogue history, a conversational recommender naturally has access to the back-end data structure which …
Defeating Sql Injection, Lwin Khin Shar, Hee Beng Kuan Tan
Defeating Sql Injection, Lwin Khin Shar, Hee Beng Kuan Tan
Research Collection School Of Computing and Information Systems
The best strategy for combating SQL injection, which has emerged as the most widespread website security risk, calls for integrating defensive coding practices with both vulnerability detection and runtime attack prevention methods.
Local Properties Of Query Languages, Guozhu Dong, Leonid Libkin, Limsoon Wong
Local Properties Of Query Languages, Guozhu Dong, Leonid Libkin, Limsoon Wong
Kno.e.sis Publications
In this paper we study the expressiveness of local queries. By locality we mean — informally — that in order to check if a tuple belongs to the result of a query, one only has to look at a certain predetermined portion of the input. Examples include all relational calculus queries. We start by proving a general result describing outputs of local queries. This result leads to many easy inexpressibility proofs for local queries. We then consider a closely related property, namely, the bounded degree property. It describes the outputs of local queries on structures that locally look “simple.” Every …
Scis Networking - Summer-Fall 1998, Nova Southeastern University
Scis Networking - Summer-Fall 1998, Nova Southeastern University
CCIS Networking / SCIS Networking magazines
No abstract provided.
Scis Networking - January 1997, Nova Southeastern University
Scis Networking - January 1997, Nova Southeastern University
CCIS Networking / SCIS Networking magazines
No abstract provided.
Scis Networking - July 1995, Nova Southeastern University
Scis Networking - July 1995, Nova Southeastern University
CCIS Networking / SCIS Networking magazines
No abstract provided.
Scis Networking - January 1995, Nova Southeastern University - Shepard Broad College Of Law
Scis Networking - January 1995, Nova Southeastern University - Shepard Broad College Of Law
CCIS Networking / SCIS Networking magazines
No abstract provided.
Ccis Networking - July 1993, Nova University
Ccis Networking - July 1993, Nova University
CCIS Networking / SCIS Networking magazines
No abstract provided.
Ccis Networking - January 1993, Nova University
Ccis Networking - January 1993, Nova University
CCIS Networking / SCIS Networking magazines
No abstract provided.
Ccis Networking - July 1992, Nova University
Ccis Networking - July 1992, Nova University
CCIS Networking / SCIS Networking magazines
No abstract provided.
Ccis Networking - December 1991, Nova University
Ccis Networking - December 1991, Nova University
CCIS Networking / SCIS Networking magazines
No abstract provided.