Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Singapore Management University (2961)
- Wright State University (632)
- Walden University (447)
- Selected Works (287)
- New Jersey Institute of Technology (137)
-
- University of Nebraska at Omaha (119)
- California State University, San Bernardino (96)
- Old Dominion University (95)
- San Jose State University (85)
- University of Dayton (82)
- The University of Maine (67)
- City University of New York (CUNY) (65)
- University of Nebraska - Lincoln (54)
- Air Force Institute of Technology (53)
- SelectedWorks (53)
- Technological University Dublin (51)
- University of South Florida (50)
- Kennesaw State University (46)
- Nova Southeastern University (43)
- Claremont Colleges (42)
- University of Wisconsin Milwaukee (42)
- University of Arkansas, Fayetteville (41)
- Western Kentucky University (41)
- Dakota State University (39)
- Institute of Business Administration (38)
- California Polytechnic State University, San Luis Obispo (36)
- Western University (35)
- Ateneo de Manila University (34)
- Governors State University (34)
- Purdue University (34)
- Keyword
-
- Machine learning (101)
- Information technology (93)
- Data mining (89)
- Social media (78)
- Twitter (64)
-
- Machine Learning (57)
- Cybersecurity (54)
- Semantic Web (54)
- Deep learning (52)
- Artificial intelligence (49)
- Online learning (49)
- Information Technology (47)
- Classification (46)
- Cloud computing (45)
- Information retrieval (45)
- Privacy (45)
- Big data (44)
- Database (43)
- Ontology (43)
- Computer science (42)
- Information security (41)
- Algorithms (40)
- Security (40)
- Databases (39)
- Information systems (39)
- Management (37)
- Clustering (36)
- Data Mining (36)
- Northern Ohio Data and Information Service (NODIS) (36)
- Technology (35)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (2867)
- Kno.e.sis Publications (541)
- Walden Dissertations and Doctoral Studies (447)
- Theses and Dissertations (116)
- Dissertations (107)
-
- Computer Science Faculty Publications (91)
- Computer Science and Engineering Faculty Publications (91)
- Theses Digitization Project (84)
- Master's Projects (68)
- Information Systems and Quantitative Analysis Faculty Proceedings & Presentations (64)
- Electronic Theses and Dissertations (55)
- Dissertations and Theses Collection (Open Access) (50)
- Theses (46)
- USF Tampa Graduate Theses and Dissertations (46)
- CCE Theses and Dissertations (42)
- Information Systems and Quantitative Analysis Faculty Publications (41)
- Kyriakos MOURATIDIS (40)
- CGU Faculty Publications and Research (37)
- International Conference on Information and Communication Technologies (36)
- Open Educational Resources (34)
- Department of Information Systems & Computer Science Faculty Publications (33)
- All Capstone Projects (32)
- Graduate Theses and Dissertations (32)
- Masters Theses & Doctoral Dissertations (32)
- Articles (29)
- Conference papers (28)
- David LO (28)
- Journal of Spatial Information Science (28)
- All Maxine Goodman Levin School of Urban Affairs Publications (27)
- Saverio Perugini (25)
- Publication Type
Articles 5491 - 5520 of 6720
Full-Text Articles in Physical Sciences and Mathematics
The Librarian As Hacker, Getting More From Google, R Philip Reynolds
The Librarian As Hacker, Getting More From Google, R Philip Reynolds
Librarian and Staff Publications
This paper will cover four areas. First it will discuss the research habits of search engine users and some of the problems with these habits. Then it will discuss librarians' use of search engines. Here we encounter the real question: Do we do much better? Can we use a search engines to their full potential? When needed, can we hack an engine to make it perform beyond its intended function? Can we use a clever workaround to solve a problem? Or are we on a level playing field with our patrons once we get outside traditional database searching? Google currently …
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 …
Can Semantic Web Techniques Empower Comprehension And Projection In Cyber Situational Awareness?, Amit P. Sheth
Can Semantic Web Techniques Empower Comprehension And Projection In Cyber Situational Awareness?, Amit P. Sheth
Kno.e.sis Publications
No abstract provided.
Supporting Complex Thematic, Spatial And Temporal Queries Over Semantic Web Data, Matthew Perry, Amit P. Sheth, Farshad Hakimpour, Prateek Jain
Supporting Complex Thematic, Spatial And Temporal Queries Over Semantic Web Data, Matthew Perry, Amit P. Sheth, Farshad Hakimpour, Prateek Jain
Kno.e.sis Publications
Spatial and temporal data are critical components in many applications. This is especially true in analytical domains such as national security and criminal investigation. Often, the analytical process requires uncovering and analyzing complex thematic relationships between disparate people, places and events. Fundamentally new query operators based on the graph structure of Semantic Web data models, such as semantic associations, are proving useful for this purpose. However, these analysis mechanisms are primarily intended for thematic relationships. In this paper, we describe a framework built around the RDF metadata model for analysis of thematic, spatial and temporal relationships between named entities. We …
Semantic Convergence Of Wikipedia Articles, Christopher J. Thomas, Amit P. Sheth
Semantic Convergence Of Wikipedia Articles, Christopher J. Thomas, Amit P. Sheth
Kno.e.sis Publications
Social networking, distributed problem solving and human computation have gained high visibility. Wikipedia is a well established service that incorporates aspects of these three fields of research. For this reason it is a good object of study for determining quality of solutions in a social setting that is open, completely distributed, bottom up and not peer reviewed by certified experts. In particular, this paper aims at identifying semantic convergence of Wikipedia articles; the notion that the content of an article stays stable regardless of continuing edits. This could lead to an automatic recommendation of good article tags but also add …
Conjunctive Queries For A Tractable Fragment Of Owl 1.1, Markus Krotzsch, Sebastian Rudolph, Pascal Hitzler
Conjunctive Queries For A Tractable Fragment Of Owl 1.1, Markus Krotzsch, Sebastian Rudolph, Pascal Hitzler
Computer Science and Engineering Faculty Publications
Despite the success of the Web Ontology Language OWL, the development of expressive means for querying OWL knowledge bases is still an open issue. In this paper, we investigate how a very natural and desirable form of queries-namely conjunctive ones-can be used in conjunction with OWL such that one of the major design criteria of the latter-namely decidability-can be retained. More precisely, we show that querying the tractable fragment EL++ of OWL 1.1 is decidable. We also provide a complexity analysis and show that querying unrestricted EL++ is undecidable.
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 …
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.
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 …
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.
Reduce Response Time: Get "Hooked" On A Wiki, Rebecca Klein, Matthew Smith, David Sierkowski
Reduce Response Time: Get "Hooked" On A Wiki, Rebecca Klein, Matthew Smith, David Sierkowski
Information Technology Faculty and Staff Publications
Managing the flow of information both within the IT department and to our customers is one of our greatest challenges in the Office of Technology Information at Valparaiso University. To be successful, IT staff first need to acquire the right information from colleagues to provide excellent service. Then, the staff must determine the most effective way to communicate that information to internal and external customers to encourage the flow of information. To advance the IT department’s goals, how best can we utilize “information” and “communication” vehicles to exchange information, improve workflow, and ultimately communicate essential information to our internal and …
A Proposed Statistical Protocol For The Analysis Of Metabolic Toxicological Data Derived From Nmr Spectroscopy, Benjamin J. Kelly, Paul E. Anderson, Nicholas V. Reo, Nicholas J. Delraso, Travis E. Doom, Michael L. Raymer
A Proposed Statistical Protocol For The Analysis Of Metabolic Toxicological Data Derived From Nmr Spectroscopy, Benjamin J. Kelly, Paul E. Anderson, Nicholas V. Reo, Nicholas J. Delraso, Travis E. Doom, Michael L. Raymer
Kno.e.sis Publications
Nuclear magnetic resonance (NMR) spectroscopy is a non-invasive method of acquiring a metabolic profile from biofluids. This metabolic information may provide keys to the early detection of exposure to a toxin. A typical NMR toxicology data set has low sample size and high dimensionality. Thus, traditional pattern recognition techniques are not always feasible. In this paper, we evaluate several common alternatives for isolating these biomarkers. The fold test, unpaired t-test, and paired t-test were performed on an NMR-derived toxicological data set and results were compared. The paired t-test method was preferred, due to its ability to attribute statistical significance, to …
A Multi-Objective Genetic Algorithm That Employs A Hybrid Approach For Isolating Codon Usage Bias Indicative Of Translational Efficiency, Douglas W. Raiford, Dan E. Krane, Travis E. Doom, Michael L. Raymer
A Multi-Objective Genetic Algorithm That Employs A Hybrid Approach For Isolating Codon Usage Bias Indicative Of Translational Efficiency, Douglas W. Raiford, Dan E. Krane, Travis E. Doom, Michael L. Raymer
Kno.e.sis Publications
Isolation of translational efficiency bias can have important applications in gene expression prediction and heterologous protein production. In some genomes the presence of a high GC(AT)-content bias can confound the isolation of translational efficiency bias. In other organisms translational efficiency bias is weak making it difficult to isolate. Described here is a multi-objective genetic algorithm that improves the isolation of translational efficiency bias in Streptomyces coelicolor A3(2) and Pseudomonas aeruginosa PAO1, two organisms shown to have high GC-content and weak translational efficiency bias.
Swashup: Situational Web Applications Mashups, E. Michael Maximilien, Ajith Harshana Ranabahu, Stefan Tai
Swashup: Situational Web Applications Mashups, E. Michael Maximilien, Ajith Harshana Ranabahu, Stefan Tai
Kno.e.sis Publications
Distributed programming has shifted from private networks to the Internet using heterogeneous Web APIs. This enables the creation of situational applications of composed services exposing user interfaces, i.e., mashups. However, this programmable Web lacks unified models that can facilitate mashup creation, reuse, and deployments. This poster demonstrates a platform to facilitate Web 2.0 mashups.
Does Mutual Knowledge Affect Virtual Team Performance? Theoretical Analysis And Anecdotal Evidence, Alanah Davis, Deepak Khazanchi
Does Mutual Knowledge Affect Virtual Team Performance? Theoretical Analysis And Anecdotal Evidence, Alanah Davis, Deepak Khazanchi
Information Systems and Quantitative Analysis Faculty Publications
This paper describes the concept of mutual knowledge and its potential impact on virtual team performance. Based on an analysis of extant literature, we argue that there is a gap in our understanding of what is known about mutual knowledge as it impacts team dynamics and virtual team performance. Supporting literature, anecdotes, and case studies are used to discuss the importance of mutual knowledge for virtual team performance and the research issues that need to be addressed in the future.
Product Complexity: A Definition And Impacts On Operations, Mark A. Jacobs
Product Complexity: A Definition And Impacts On Operations, Mark A. Jacobs
MIS/OM/DS Faculty Publications
The difficulty for organizations arises because neither complexity nor its impacts on performance are well understood (Fisher & Ittner, 1999b). The mechanisms through which it affects cost, quality, delivery, and flexibility need to be explained (Ramdas, 2003). However, this cannot happen until complexity can be explained theoretically. But, to build theory there must first be a common understanding about the construct of interest (Wacker, 2004). Only then can researchers operationalize it and search for meaningful relationships. In light of this, I develop a definition of complexity below. A sampling of the operations management literature is then presented within the context …
Gapprox: Mining Frequent Approximate Patterns From A Massive Network, Chen Chen, Xifeng Yan, Feida Zhu, Jiawei Han
Gapprox: Mining Frequent Approximate Patterns From A Massive Network, Chen Chen, Xifeng Yan, Feida Zhu, Jiawei Han
Research Collection School Of Computing and Information Systems
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, demanding powerful data mining methods. Due to inherent noise or data diversity, it is crucial to address the issue of approximation, if one wants to mine patterns that are potentially interesting with tolerable variations. In this paper, we investigate the problem of mining frequent approximate patterns from a massive network and propose a method called gApprox. gApprox not only finds approximate network patterns, which is the key for many knowledge discovery applications on …
Efficient Discovery Of Frequent Approximate Sequential Patterns, Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu
Efficient Discovery Of Frequent Approximate Sequential Patterns, Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu
Research Collection School Of Computing and Information Systems
We propose an efficient algorithm for mining frequent approximate sequential patterns under the Hamming distance model. Our algorithm gains its efficiency by adopting a "break-down-and-build-up" methodology. The "breakdown" is based on the observation that all occurrences of a frequent pattern can be classified into groups, which we call strands. We developed efficient algorithms to quickly mine out all strands by iterative growth. In the "build-up" stage, these strands are grouped up to form the support sets from which all approximate patterns would be identified. A salient feature of our algorithm is its ability to grow the frequent patterns by iteratively …
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 …
Neighborhood Defined Adaboost Based Mixture Of Color Components For Efficient Skin Segmentation, Ramya Reddy Maaram
Neighborhood Defined Adaboost Based Mixture Of Color Components For Efficient Skin Segmentation, Ramya Reddy Maaram
Electrical & Computer Engineering Theses & Dissertations
A skin segmentation algorithm robust to illumination changes and skin-like backgrounds is developed in this thesis. So far skin pixel classification has been limited to only individual color spaces and there has not been a comprehensive evaluation of which color components or combination of color components would provide the best classification accuracy, Color components in a given color space form the feature set for the classification of skin pixels. The combination of the color components or the features present within a single color space may not be the best when it comes to skin pixel classification as the discriminatory power …
A Modular Kernel Linear Discriminant Analysis Of Gabor Features For Improved Face Recognition, Neeharika Gudur
A Modular Kernel Linear Discriminant Analysis Of Gabor Features For Improved Face Recognition, Neeharika Gudur
Electrical & Computer Engineering Theses & Dissertations
Automatic face recognition is one of the major challenges in computer vision and pattern analysis. This thesis presents an efficient face recognition system that is robust with regards to changes in illumination, facial expressions and partial occlusions. Modular Kernel Linear Discriminant Analysis performed on Gabor Features obtained from the face images is employed for improving face recognition accuracy. A face image is pre-processed using the 2D Gabor wavelet transform to achieve invariance to illumination in images. Modular approaches that divide the pre-processed images into smaller sub-images provide improved accuracy, as the facial variations in an image are confined to local …
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.
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.
I Tube, You Tube, Everybody Tubes: Analyzing The World’S Largest User Generated Content Video System, Meeyoung Cha, Haewoon Kwak, Pablo Rodriguez, Yong-Yeol Ahn, Sue. Moon
I Tube, You Tube, Everybody Tubes: Analyzing The World’S Largest User Generated Content Video System, Meeyoung Cha, Haewoon Kwak, Pablo Rodriguez, Yong-Yeol Ahn, Sue. Moon
Research Collection School Of Computing and Information Systems
User Generated Content (UGC) is re-shaping the way people watch video and TV, with millions of video producers and consumers. In particular, UGC sites are creating new viewing patterns and social interactions, empowering users to be more creative, and developing new business opportunities. To better understand the impact of UGC systems, we have analyzed YouTube, the world's largest UGC VoD system. Based on a large amount of data collected, we provide an in-depth study of YouTube and other similar UGC systems. In particular, we study the popularity life-cycle of videos, the intrinsic statistical properties of requests and their relationship with …
Realizing The Relationship Web: Morphing Information Access On The Web From Today's Document- And Entity-Centric Paradigm To A Relationship-Centric Paradigm, Amit P. Sheth
Kno.e.sis Publications
No abstract provided.
Description Logic Programs: Normal Forms, Pascal Hitzler, Andreas Eberhart
Description Logic Programs: Normal Forms, Pascal Hitzler, Andreas Eberhart
Computer Science and Engineering Faculty Publications
The relationship and possible interplay between different knowledge representation and reasoning paradigms is a fundamental topic in artificial intelligence. For expressive knowledge representation for the Semantic Web, two different paradigms - namely Description Logics (DLs) and Logic Programming - are the two most successful approaches. A study of their exact relationships is thus paramount. An intersection of OWL with (function-free non-disjunctive) Datalog, called DLP (for Description Logic Programs), has been described in [1,2]. We provide normal forms for DLP in Description Logic syntax and in Datalog syntax, thus providing a bridge for the researcher and user who is familiar with …
Comparing Disjunctive Well-Founded Semantics, Matthias Knorr, Pascal Hitzler
Comparing Disjunctive Well-Founded Semantics, Matthias Knorr, Pascal Hitzler
Computer Science and Engineering Faculty Publications
While the stable model semantics, in the form of Answer Set Programming, has become a successful semantics for disjunctive logic programs, a corresponding satisfactory extension of the well-founded semantics to disjunctive programs remains to be found. The many current proposals for such an extension are so diverse, that even a systematic comparison between them is a challenging task. In order to aid the quest for suitable disjunctive well-founded semantics, we present a systematic approach to a comparison based on level mappings, a recently introduced framework for characterizing logic programming semantics, which was quite successfully used for comparing the major semantics …
Any-World Access To Owl From Prolog, Tobias Matzner, Pascal Hitzler
Any-World Access To Owl From Prolog, Tobias Matzner, Pascal Hitzler
Computer Science and Engineering Faculty Publications
The W3C standard OWL provides a decidable language for representing ontologies. While its use is rapidly spreading, efforts are being made by researchers worldwide to augment OWL with additional expressive features or by interlacing it with other forms of knowledge representation, in order to make it applicable for even further purposes. In this paper, we integrate OWL with one of the most successful and most widely used forms of knowledge representation, namely Prolog, and present a hybrid approach which layers Prolog on top of OWL in such a way that the open-world semantics of OWL becomes directly accessible within the …
Sa-Rest And (S)Mashups: Adding Semantics To Restful Services, Jonathan Lathem, Karthik Gomadam, Amit P. Sheth
Sa-Rest And (S)Mashups: Adding Semantics To Restful Services, Jonathan Lathem, Karthik Gomadam, Amit P. Sheth
Kno.e.sis Publications
The evolution of the Web 2.0 phenomenon has led to the increased adoption of the RESTful services paradigm. RESTful services often take the form of RSS/Atom feeds and AJAX based light weight services. The XML based messaging paradigm of RESTful services has made it possible to compose various services together. Such compositions of RESTful services is widely referred to as Mashups. In this paper, we outline the limitations in current approaches to creating mashups. We address these limitations by proposing a framework called as SA-REST. SA-REST adds semantics to RESTful services. Our proposed framework builds upon the original ideas in …
The Programmable Web: Agile, Social, And Grassroots Computing, E. Michael Maximilien, Ajith Harshana Ranabahu
The Programmable Web: Agile, Social, And Grassroots Computing, E. Michael Maximilien, Ajith Harshana Ranabahu
Kno.e.sis Publications
Web services, the semantic Web, and Web 2.0 are three somewhat separate movements trying to make the Web a programmable substrate. While each has achieved some level of success on their own right, it is becoming apparent that the grassroots approach of the Web 2.0 is gaining greater success than the other two. In this paper we analyze each movement, briefly describing its main traits, and outlining its primary assumptions. We then frame the common problem of achieving a programmable Web within the context of distributed computing and software engineering and then attempt to show why Web 2.0 is closest …