<p>ROS är ett produktnära system som stödjer planering och återrapportering i stålverket. Sandvik vill undersöka möjligheterna att modernisera användargränssnittet på detta system som idag är terminalbaserat till ett modernt grafiskt interface. Två metoder analyseras, den ena innebär att använda en kommersiell produkt för screen scraping och den andra metoden är Web Services Integration Toolkit som är freeware. Resultatet från analysen visar att Web Services Integration Toolkit klarar av att uppfylla de mål som är satta. En testkörning av Web Services Integration Toolkit görs också på ROS och resultat visar att metoden fungerar även fungerar i praktiken.</p>

<p>För att dagens system och deras allt mer komplexa applikationer ska kunna integreras med</p><p>varandra krävs det att de kommunicerar via tjänster. Denna tjänsteorienterade integration</p><p>uppnås genom att man använder sig av Service Oriented Architecture (SOA) som bygger på</p><p>löst kopplade tjänster som kommunicerar med varandra på ett standardiserat sätt. En viktig</p><p>del i en integrationslösning är Enterprise Service Bus (ESB). I denna rapport kommer vi</p><p>förklara grunderna i tjänsteorienterad integration och sedan fördjupa oss i ESB. Då ESB är ett</p><p>luddigt begrepp ska vi på ett enkelt och lättbegripligt sätt ge vår syn på begreppet, samt dess</p><p>fördelar och nackdelar. Vi kommer även att ge marknadens syn på ESB genom en</p><p>enkätundersökning som innefattar både leverantörer, konsulter och kunder.</p> / <p>If today’s software systems and their complex applications shall be able to integrate with each</p><p>other, they have to communicate through services. This service oriented integration can be</p><p>accomplished by using Service Oriented Architecture (SOA) where all components are</p><p>loosely coupled and communicate in a standardized way. An important part when building an</p><p>integrated solution is the Enterprise Service Bus (ESB). In this report we will explain the</p><p>basics of SOA and take a more detailed look at the world of ESB. The concept of ESB is not</p><p>well defined and hence means different things to different people. We are going to present an</p><p>interpretation of the ESB and its benefits and disadvantages. To find out what the market</p><p>thinks about ESB we have been talking to producers, consultants and customers.</p>

<p>During the past decade, Grid computing has gained popularity as a means to build powerful computing infrastructures by aggregating distributed computing capacity. Grid technology allows computing resources that belong to different organizations to be integrated into a single unified system image – a Grid. As such, Grid technology constitutes a key enabler of large-scale, crossorganizational sharing of computing resources. An important objective for the Virtual Organizations (VOs) that result from such sharing is to tame the distributed capacity of the Grid in order to manage it and make fair and efficient use of the pooled computing resources.</p><p>Most Grids to date have, however, been completely unregulated, essentially serving as a “source of free CPU cycles” for authorized Grid users. Whenever unrestricted access is admitted to a shared resource there is a risk of overexploitation and degradation of the common resource, a phenomenon often referred to as “the tragedy of the commons”. This thesis addresses this problem by presenting two complementary Grid capacity allocation systems that allow the aggregate computing capacity of a Grid to be divided between users in order to protect the Grid from overuse while delivering fair service that satisfies the individual computational needs of different user groups.</p><p>These two Grid capacity allocation mechanisms constitute the core contribution of this thesis. The first mechanism, the SweGrid Accounting System (SGAS), addresses the need for coordinated soft, real-time quota enforcement across Grid sites. The SGAS project was an early adopter of the serviceoriented principles that are now common practice in the Grid community, and the system has been tested in the Swegrid production environment. Furthermore, SGAS has been included in the Globus Toolkit, the de-facto standard Grid middleware toolkit. SGAS employs a credit-based allocation model where research projects are granted quota allowances that can be spent across the Grid resources, which charge users for their resource consumption. This enforcement of usage limits thus produces real-time overuse protection.</p><p>The second approach, employed by the Fair Share Grid (FSGrid) system, uses a share-based allocation model where project entitlements are expressed in terms of hierarchical share policies that logically divide the Grid capacity between user groups. By coordinating local job scheduling to maintain these global capacity shares, the Grid resources collectively strive to schedule users for a “share of the Grid”. We refer to this cooperative scheduling model as decentralized Grid-wide fairshare scheduling.</p>

<p>The emergence of Grid computing infrastructures enables researchers to share resources and collaborate in more efficient ways than before, despite belonging to different organizations and being distanced geographically. While the Grid computing paradigm offers new opportunities, it also gives rise to new difficulties. One such problem is the selection of resources for user applications. Given the large and disparate set of Grid resources, manual resource selection becomes impractical, even for experienced users. This thesis investigates methods, algorithms and software for a Grid resource broker, i.e., a scheduling agent that automates the resource selection process for the user. The development of such a component is a non-trivial task as Grid resources are heterogeneous in hardware, software, availability, ownership and usage policies. A wide range of algorithmically difficult issues must also be solved, including characterization of jobs, prediction of resource performance, data placement considerations, and, how to provide Quality of Service guarantees. One contribution of this thesis is the development of resource brokering algorithms that enable resource selection based on Grid job performance predictions and use advance reservations to provide Quality of Service guarantees. The thesis also includes an algorithm for coallocation of sets of jobs. This algorithm guarantees a simultaneous start of each subjob, as required e.g., when running larger-than-supercomputer simulations that involve multiple resources.</p><p>We today have the somewhat paradoxal situation where Grids, originally aimed to overcome interoperability problems between different computing platforms, themselves struggle with interoperability problems caused by the wide range of interfaces, protocols and data formats that are used in different environments. The reasons for this situation are obvious, expected and almost impossible to avoid, as the task of defining appropriate standards, models and best-practices must be preceded by basic research, proof-of-concept implementations and real-world testing. We address the interoperability problem with a generic Grid resource brokering architecture and job submission service.</p><p>By using (proposed) standard formats and protocols, the service acts as an interoperability-bridge that translates job requests between clients and resources running different Grid middlewares. This concept is demonstrated by the integration of the service with three different Grid middlewares. The service also enables users to both fine-tune the existing resource selection algorithms and plug in custom brokering algorithms tailored to their requirements.</p>

Model integration that allows multiple models to work together for solving a sophisticated problem has been an important research issue in the management of decision models. The recent development of the service-oriented architecture (SOA) has provided an opportunity to apply this new technology to support model integration. This is particularly critical when more and more models are delivered as web services. A web-services-based approach to model management is useful in providing effective decision support. In the past, existing literature has adopted the approach that treated a model as a service. Model integration can be thought of as a composition of web services. In the composition process, proper components and their relationships must be properly identified. This requires accurate model definition and reasoning. In the research, we propose a semantic-based approach for developing such as system. The approach uses DAML-S to describe the capability of a service. Then the system can discover proper services for a particular requirement by using semantic matching on these DAML-S documents. When suitable web services are found, the system uses BPEL4WS to composite them together. The resulting composite web service can be applied to decision support. A prototype that demonstrates the feasibility of the proposed approach is implemented in Java.

This thesis investigates designs that enable individual components of a distributed system to work together and coordinate their actions towards a common goal. While the basic motivation for our research is to develop engineering principles for large-scale autonomous systems, we address the problem in the context of resource management in server clusters that provide web services. To this end, we have developed, implemented and evaluated a decentralized design for resource management that follows four principles. First, in order to facilitate scalability, each node has only partial knowledge of the system. Second, each node can adapt and change its role at runtime. Third, each node runs a number of local control mechanisms independently and asynchronously from its peers. Fourth, each node dynamically adapts its local configuration in order to optimize a global utility function. The design includes three fundamental building blocks: overlay construction, request routing and application placement. Overlay construction organizes the cluster nodes into a single dynamic overlay. Request routing directs service requests towards nodes with available resources. Application placement partitions the cluster resources between applications, and dynamically adjusts the allocation in response to changes in external load, node failures, etc. We have evaluated the design using complexity analysis, simulation and prototype implementation. Using complexity analysis and simulation, we have shown that the system is scalable, operates efficiently in steady state, quickly adapts to external events and allows for effective service differentiation by a system administrator. A prototype has been built using accepted technologies (Java, Tomcat) and evaluated using standard benchmarks (TPC-W and RUBiS). The evaluation results show that the behavior of the prototype matches closely that of the simulated design for key metrics related to adaptability and robustness, therefore validating our design and proving its feasibility. / QC 20100629

Researchers in software engineering proposed design method for distributed applications to construct a set of communicating system components from a global behavior. The joint behaviors of these components must precisely satisfy the specified global behavior. The next concern is to transform the constructed models of these components into executable business processes by ensuring the exchange of asynchronous messages among the generated business processes. The introduction of Service-Oriented Architecture (SOA) has helped to achieve this goal. SOA provides high flexibility in composing loosely-integrated services that can be used among business domains to carry out business transactions; this composition is known as service orchestration. Moreover, SOA supports Model Driven Architecture (MDA) such that services modeled as UML Activity Diagrams (AD) can be transformed into a set of Business Execution Language (BPEL) processes. Many researchers discussed the transformation of UML AD and the Business Process Modeling Notation (BPMN) into BPEL. However, they did not discuss the practical limitations that some of these transformations impose. This thesis addresses the imitations of the transformation from UML AD to BPEL processes using the IBM Rational Software Architect (RSA). We showed here that the tool is unable to create the correct BPEL artifacts from UML AD components in certain cases, for instance when the behavior includes the alternative for receiving single or concurrent messages, a weak loop, or certain choice activities. Furthermore, we provided novel solutions to the transformations in these cases in order to facilitate the transformation from UML AD to BPEL.

A neutrosophic set is a part of neutrosophy that studies the origin, nature, and scope of neutralities, as well as their interactions with different ideational spectra. The neutrosophic set is a powerful general formal framework that has been recently proposed. However, the neutrosophic set needs to be specified from a technical point of view. Here, we define the set-theoretic operators on an instance of a neutrosophic set, and call it an Interval Neutrosophic Set (INS). We prove various properties of INS, which are connected to operations and relations over INS. We also introduce a new logic system based on interval neutrosophic sets. We study the interval neutrosophic propositional calculus and interval neutrosophic predicate calculus. We also create a neutrosophic logic inference system based on interval neutrosophic logic. Under the framework of the interval neutrosophic set, we propose a data model based on the special case of the interval neutrosophic sets called Neutrosophic Data Model. This data model is the extension of fuzzy data model and paraconsistent data model. We generalize the set-theoretic operators and relation-theoretic operators of fuzzy relations and paraconsistent relations to neutrosophic relations. We propose the generalized SQL query constructs and tuple-relational calculus for Neutrosophic Data Model. We also design an architecture of Semantic Web Services agent based on the interval neutrosophic logic and do the simulation study.

In this dissertation work, we have investigated the main research thrust of decentralized coordination of workflows over web services. To address distributed workflow coordination, first we have developed “Web Coordination Bonds” as a capable set of dependency modeling primitives that enable each web service to manage its own dependencies. Web bond primitives are as powerful as extended Petri nets and have sufficient modeling and expressive capabilities to model workflow dependencies. We have designed and prototyped our “Web Service Coordination Management Middleware” (WSCMM) system that enhances current web services infrastructure to accommodate web bond enabled web services. Finally, based on core concepts of web coordination bonds and WSCMM, we have developed the “BondFlow” system that allows easy configuration distributed coordination of workflows. The footprint of the BonFlow runtime is 24KB and the additional third party software packages, SOAP client and XML parser, account for 115KB.

Researchers in software engineering proposed design method for distributed applications to construct a set of communicating system components from a global behavior. The joint behaviors of these components must precisely satisfy the specified global behavior. The next concern is to transform the constructed models of these components into executable business processes by ensuring the exchange of asynchronous messages among the generated business processes. The introduction of Service-Oriented Architecture (SOA) has helped to achieve this goal. SOA provides high flexibility in composing loosely-integrated services that can be used among business domains to carry out business transactions; this composition is known as service orchestration. Moreover, SOA supports Model Driven Architecture (MDA) such that services modeled as UML Activity Diagrams (AD) can be transformed into a set of Business Execution Language (BPEL) processes. Many researchers discussed the transformation of UML AD and the Business Process Modeling Notation (BPMN) into BPEL. However, they did not discuss the practical limitations that some of these transformations impose. This thesis addresses the imitations of the transformation from UML AD to BPEL processes using the IBM Rational Software Architect (RSA). We showed here that the tool is unable to create the correct BPEL artifacts from UML AD components in certain cases, for instance when the behavior includes the alternative for receiving single or concurrent messages, a weak loop, or certain choice activities. Furthermore, we provided novel solutions to the transformations in these cases in order to facilitate the transformation from UML AD to BPEL.