Showing papers on "Web modeling published in 2021"
Book•
12 Jun 2021
TL;DR: The author argues for a disciplined, engineering approach to the creation of business critical Web based systems, populated by a set of framework activities that occur for all business-critical WebApp projects, regardless of the size or complexity.
Abstract: The author argues for a disciplined, engineering approach to the creation of business critical Web based systems. Web engineering is an adaptable, incremental (evolutionary) process populated by a set of framework activities that occur for all business-critical WebApp projects, regardless of the size or complexity. The following framework activities might be considered for Web engineering work: formulation, planning, analysis, modeling, page generation and testing, and customer evaluation. These activities are applied iteratively as a Web based system evolves. Project management for Web engineering is governed by the unique characteristics of WebApp projects. These characteristics precipitate questions whose answers can make or break a project.
102 citations
Posted Content•
TL;DR: This proposed matchmaker algorithm performs semantic matching of Web Services on the basis of input and output descriptions of semantic Web Services matching, and uses the algorithm that has the least running time among all others that can be used for bipartite matching.
Abstract: Since using environments that are made according to the service oriented architecture, we have more effective and dynamic applications. Semantic matchmaking process is finding valuable service candidates for substitution. It is a very important aspect of using semantic Web Services. Our proposed matchmaker algorithm performs semantic matching of Web Services on the basis of input and output descriptions of semantic Web Services matching. This technique takes advantages from a graph structure and flow networks. Our novel approach is assigning matchmaking scores to semantics of the inputs and outputs parameters and their types. It makes a flow network in which the weights of the edges are these scores, using FordFulkerson algorithm, we find matching rate of two web services. So, all services should be described in the same Ontology Web Language. Among these candidates, best one is chosen for substitution in the case of an execution failure. Our approach uses the algorithm that has the least running time among all others that can be used for bipartite matching. The importance of problem is that in real systems, many fundamental problems will occur
7 citations