Discovery and composition of web services using artificial intelligence planning and web service modeling ontology

In today’s Web environment, Web services are the preferred standards-based way to realize Service Oriented Architecture (SOA) computing. A problem that has become one of the recent critical issues is automated discovery and composition of Semantic Web services. A number of approaches have been presented to solve the problem. However, most of these approaches only consider discovery or composition of Web services but not both. In this study, an effective approach called AIMO, based on Artificial Intelligence (AI) planning, Web Service Modeling Ontology (WSMO), and Semantic Web has been proposed to tackle the problem. The main purpose of this study is to investigate and develop a novel approach for automated Web service discovery and composition. In this case, a comparative evaluation of state-of-the-art approaches for Web service composition approaches has been done and the strengths and weaknesses of those approaches have been discussed. Moreover a translator for interaction between WSMO and AI-planning based on Description Logics has been proposed. In addition, some parts of AIMO architecture have been tested on a practical case study, and the results based on the experimental validation demonstrate that AIMO provides an effective and applicable solution. AIMO continues to support loose coupling paradigm of SOA by separating the discovery from the composition of Web services

A group sum inequality and its application to power graphs

Let $G$ be a finite group of order $n$, and let $C_n$ be the cyclic group of order $n$. We show that $\sum_{g \in C_n} \phi(\mathrm{o}(g))\geq \sum_{g \in G} \phi(\mathrm{o}(g))$, with equality if and only if $G$ is isomorphic to $C_n$. As an application, we show that among all finite groups of a given order, the cyclic group of that order has the maximum number of undirected edges in its directed power graph

Large stars with few colors

A recent question in generalized Ramsey theory is that for fixed positive integers $s\leq t$, at least how many vertices can be covered by the vertices of no more than $s$ monochromatic members of the family $\cal F$ in every edge coloring of $K_n$ with $t$ colors. This is related to an old problem of Chung and Liu: for graph $G$ and integers $1\leq s<t$ what is the smallest positive integer $n=R_{s,t}(G)$ such that every coloring of the edges of $K_n$ with $t$ colors contains a copy of $G$ with at most $s$ colors. We answer this question when $G$ is a star and $s$ is either $t-1$ or $t-2$ generalizing the well-known result of Burr and Roberts

Online Master Program in System Technology

The University of Louisiana at Lafayette proposed the creation of a Master of Science in Systems Technology (STEC) in 2013 to the State of Louisiana Board of Regents which was approved in 2014. The delivery of the new MS degree was 100% online to facilitate access to a wide student base within the state of Louisiana and beyond. The objective of Systems Technology education intends to equip students with the knowledge base, skill set and cutting-edge tools to develop solutions to complex systems problems in a diversity of industries. It is designed for industrial and engineering technologists, and other professionals engaged in developing systems to meet required specifications.Cockrell School of Engineerin