Web Services Choreography

All tools dedicated to system administration of local area network follow the same scheme. For each host they install an initial operating system and then update it using a package manager. The package managers run independently on the hosts, this makes dicult (even impossible) to create and maintain a stable environment in which multiple hosts coexist and cooperate. Furthermore, over time, the update process, that upgrades, adds or suppress software, results in instability of host systems. Finally, a package corre-sponds most often to a single software with a basic conguration which does not match to the network requirements. This article presents the YaKa framework which propose an orthogonal approach to this scheme in which the update feature almost disappears and is replaced by a very fast installation of a new clean system. All systems required in the network are generated all together by a compiler which has a complete view of the network. This general view allows to describe ...

The concept of thin-shell wormhole (TSW) was introduced by Visser in 1989 [1, 2] in the hope of keeping the idea of wormholes alive by con ning the exotic matter to a thin shell, called the throat of the TSW. Exotic matter, which inevitably emerges in the theories of wormholes, is an unwanted type of matter that violates the known energy conditions such as the weak energy condition (WEC) [3]. Pre-Visser's theories had the exotic matter distributed on the certain parts of the spacetime, if not all over it. However, Visser's so called cut-and-paste procedure allows us to con ne such a notorious matter on a very limited part of the space, the TSW itself. Moreover, the cut-and-paste procedure has the advantage that can be applied to a vast variety of spacetimes [4{15], while before Visser only some certain spacetimes had the structure of a wormhole [16]. It is also worth mentioning that while TSWs are categorized as traversable wormholes not all the wormholes are considered to b...

In this work, 95 roof tiles from the Passavant-Iselin (PIC) and the Aktienziegelei (AZA) tileworks in Allschwil and the tilework in Laufen were chemically and mineralogical-petrographically examined. The history of these factories is presented in summary. The sample material consists of random finds on the surface, which can clearly be assigned to a specific factory based on the company name. Seven different company names for PIC, three for AZA and five for Laufen could be found on the tiles, most of which were used in the first decades of the 20th century as shown by the fired-in years. Both Allschwil tileworks mixed Oligocene marine marls with Quaternary decarbonated Loess sediments. In Laufen, however, there was no Loess. Here Ologocene layers with different lime contents were mixed. The macroscopic and microscopic studies show variable degrees of mixing. The Laufen tiles can be chemically differentiated from those from Allschwil, for example due to their high chromium content. This is difficult to achieve for both Allschwil products, which is not surprising since their raw materials come from open pits in close proximity. The 95 roof tiles differ chemically from the 277 Swiss roof tiles examined so far.

A business process (BP) can be understood as a set of related, structured, interacting services acting as peers, according to an intended choreography that is capable of giving complex functionality to customers. Several authors have made progress in solving the ”choreography realization” problem. The research work carried out in this paper amounts to analyzing and automatically checking the realizability of the defined choreography for services that communicate through messages in a general, distributed, and highly parallel system.

Module is said to be small if it is not a union of strictly increasing innite countable chain of submodules. We show that the class of all small modules over self-injective purely innite ring is closed under direct products whenever there exists no strongly inaccessible cardinal. 2000 Mathematics Subject Classication. 16D10 (16S50). Key words and phrases. small module, self-injectivity, von Neumann regular ring.

A business process (BP) can be understood as a set of related, structured, interacting services acting as peers, according to an intended choreography that is capable of giving complex functionality to customers. Several authors have made progress in solving the "choreography realization" problem. The research work carried out in this paper amounts to analyzing and automatically checking the realizability of the defined choreography for services that communicate through messages in a general, distributed, and highly parallel system.

Les moteurs traditionnels offrent a l'utilisateur des resultats de plus en plus pertinents, mais, dans la plupart des cas, les resultats similaires ont tendance a se regrouper. L'utilisateur peut etre interesse pour retrouver des documents qui soient certes tous pertinents par rapport a sa requete, mais aussi qui soient differents les uns des autres. Dans cette these, nous considerons le probleme de la diversite pour la recherche d'images. Nous avons focalise notre attention sur la diversite par l'exploitation du clustering, plus specialement par une approche hierarchique (AHC), car sa hierarchie de clusters peut bien correspondre a la nature hierarchique de la diversite. De plus, nous proposons une nouvelle approche pour exploiter des ressources plus riches, telle qu'une « arborescence de concepts », pour augmenter la diversite. Differentes approches sont comparees sur trois benchmarks : un qui a ete annote manuellement et qui possede une haute pertinence; et de...

Nowadays web services composition that presents capabilities in response to customers' complex requirements has a special importance in real businesses. However, service choreography as a form of service composition, still faces many challenges. One of the most important challenges of the choreography domain is how to validate the model based on the corresponding requirements. To this end, in this paper processes choreographies are modeled using the interaction view of BPMN 2.0 standard. Then, goal modeling is suggested to extract the requirements. For each requirement all possible valid scenarios are considered and finally using Savara tool, the requirements' scenarios are modeled and the choreography models are validated according to the corresponding requirements.

Nowadays compositing web services to present capabilities in response to customers’ complex requirements has a special importance in service-oriented development. However, service choreography as a form of service composition, still faces many problems. The large gap between business domain and service-oriented domain, especially in service choreography and the lack of systematic method for code generation from the business level models are two significant challenges of this domain. The goal of this paper is to present a stepwise systematic method for mapping an inter-organization business process model to an implementation level code. To this end, choreography business processes are modeled using the interaction view of BPMN 2.0 standard and then, the proposed algorithm maps the BPMN 2.0 model to the WS-CDL code in 16 steps. The resulted code covers all of the required elements of WSCDL, describes the choreography of services and can be used in the implementation level.

Grids and clouds are utilized for the execution of applications composed of dependent tasks, usually modeled as workflows. To efficiently run the application, a scheduler must distribute the components of the workflow in the available resources using information about duration of tasks and communication between tasks in the workflow. However, such information may be subject to imprecisions, thus not reflecting what is observed during the execution. In this paper we propose a simple way of representing the costs of the components in a workflow in order to reduce the impact of uncertainties introduced by wrong estimations, and also to ease the application specification for the user. Evaluation shows that the use of relative costs in tasks and dependencies can improve in many cases the resulting schedule when compared to cases where the input data carries an uncertainty of 20% and 50%.

Surface treatments of Y2O3:Eu phosphors for improving the hydrophobic property were carried out using plasmas generated from a O-(Si(CH3)3)2 (HMDSO) in a low-pressure environment. The super-hydrophobic properties of the treated Y2O3:Eu phosphors were investigated. The samples treated by using the HMDSO/toluene glow plasma were analyzed by FTIR and OES and analyzed in terms of their contact angles (CAs). The eects of the HMDSO/toluene plasma treatments on the Y2O3:Eu phosphors were investigated in terms of the total surface free energy by using probe liquids to measure their contact angles (CAs). The total surface free energy of the Y2O3:Eu phosphors before and after a surface treatment with the HMDSO/toluene plasma, as estimated via the Owens-Wendt equation, was found to decrease from 82.2 mJ/m 2 to 0.021 mJ/m 2. This represents a signicant improvement of the hydrophobicity of the Y2O3:Eu phosphors after the plasma treatment.

This study demonstrates the super-hydrophobic coating of multi-walled carbon nanotube (MWCNT) powders by using a O-(Si(CH3)3)2 (HMDSO) glow discharge plasma under low pressure and investigates the hydrophobic behavior of the treated MWCNT powders. To investigate the change in the surface free energy of the MWCNT powders, we used water, PEG and glycerol as probe liquids. Their surface free energies were determined by making use of the measured contact angles (CAs) and the Owens-Wendt equation. A cushion made of the plasma-treated MWCNT powders showed super-hydrophobicity. The total surface free energies of the MWCNT powders before and after the HMDSO plasma treatment were estimated to be 82.6 and 0.1 mJ/m 2 , respectively.

The paper analyzes the effect of transaction costs on social learning in an asset market with asymmetric information, sequential trading and a competitive price mechanism. Both fixed and proportional transaction costs reduce the information content of trading orders and lead to informational cascades. If transaction costs are very high, an informational cascade may occur not only when beliefs converge on a specific asset value, but also when there is absolute uncertainty about the asset's fundamental value. Finally, if the value in the bad state is sufficiently low, proportional transaction costs lead to an informational cascade only when prices are very high. * I am grateful to Jean-Paul Decamps for his early input on this work. I would like to thank Abhijit Banerjee, Marcello D'Amato, Amil Dasgupta, Salvatore Piccolo and seminar participants at the CSEF, University of Salerno, for comments. The paper was improved by helpful discussions and advice by Alberto Bennardo and Ma...

Thirteen elements from ve suits of plate armour made in Milan during the late 14th and early 15th centuries and kept in Churburg Castle have been examined. Out of the late 14th/early 15th century examples, one has been successfully hardened by quenching and three more have had some increase in hardness brought about by attempts at heat-treatment. All of the mid-15th century examples have been hardened by quenching, four out of ve to around 300-400 VPH.

Dissertação (mestrado)–Universidade de Brasília, Faculdade UnB de Planaltina, Programa de Pós-Graduação em Ciência de Materiais, 2017.Nesta dissertação se analisa a ocorrência do fenômeno da ressonância estocástica pela inserção de sinal-ruído, seus efeitos e requisitos para ocorrência do fenômeno. Entre os principais requisitos para ocorrência do fenômeno, encontramos a necessidade de existência de uma correlação entre uma fonte de sinal com o sinal-ruído estocástico inserido. Quando ocorre tal correlação entre os sinais em determinado instante de tempo, ocorre o fenômeno de ressonância estocástica que provoca a amplificação do sinal em picos. A partir da análise do fenômeno supracitado, é proposto uma inovação tecnológica de um sistema gerador de sinal-ruído estocástico correlacionado, capaz de induzir e facilitar a ocorrência do fenômeno de ressonância estocástica por meio de um modelo matemático, inspirado em uma tese de doutorado, que atende o requisito principal de gerar sinai...

Trabalho de Conclusão de Curso (especialização)—Universidade de Brasília, Instituto de Geociências, 2018.Este trabalho apresenta um caso de uso de aplicação de técnicas de alta performance em banco de dados espaciais de grande volume para extração de pontos de interesse aplicado na Empresa Brasileira de Correios e Telégrafos - ECT. São abordadas técnicas de alta performance em consultas espaciais envolvendo operadores espaciais e estruturais em banco de dados, análise comparativa entre indexadores espaciais, aplicação de consultas espaciais utilizando índices com bounding boxes (caixas delimitadoras) como exemplo de melhores práticas, análise das funções de clusteriza ção do PosGis e aplicação de consultas performáticas, também conhecidas como tuning , aplicadas com os conceitos de clusters espaciais para obtenção de pontos de interesses em bases de dados de enorme volume de dados além de funções geoestatísticas do Postgis. O método utilizado envolveu escolha da origem de dados, apl...

e estlish deidility oundry of the model heking prolem for in¢niteE stte systems de¢ned y roess ewrite ystems @A or wekly extended roess ewrite ystems @wAD nd properties desried y si frgments of tionE sed viner emporl vogi @vvAF st is known tht the prolem for generl vv properties is deidle for etri nets nd for pushdown proessesD while it is undeE idle for e proessesF es our min resultD we show tht the prolem is deidle for w if we onsider properties de¢ned y formule with only modlities strit eventully nd strit lwysF woreoverD we show tht the prolem remins undeidE le for e proesses even with respet to the vv frgment with the only modlity until or the frgment with modlities next nd in¢nitely oftenF * his is full version of the pper fu HT epted for pg PHHTF I 1 fy stndrd modlities we men the ones de¢ned in this pper nd lso other ommonly used modlE ities like strict untilD releaseD weak untilD etF roweverD it is well possile tht one n de¢ne new modlity suh tht there is si frgment not equivlent to ny of the frgments in the hierrhyF U

Die Beweisentwicklungsumgebung Omega-Mkrp soll Mathematiker bei einer ihrer Haupttätigkeiten, nämlich dem Beweisen mathematischer Theoreme unterstützen. Diese Unterstützung muß so komfortabel sein, daß die Beweise mit vertretbarem Aufwand formal durchgeführt werden können und daß die Korrektheit der so erzeugten Beweise durch das System sichergestellt wird. Ein solches System wird sich nur dann wirklich durchsetzen, wenn die rechnergestützte Suche nach formalen Beweisen weniger aufwendig und leichter ist, als ohne das System. Um dies zu erreichen, ergeben sich verschiedene Anforderungen an eine solche Entwicklungsumgebung, die wir im einzelnen beschreiben. Diese betreffen insbesondere die Ausdruckskraft der verwendeten Objektsprache, die Möglichkeit, abstrakt über Beweispläne zu reden, die am Menschen orientierte Präsentation der gefundenen Beweise, aber auch die effiziente Unterstützung beim Füllen von Beweislücken. Das im folgenden vorgestellte Omega-Mkrp-System ist eine Synthese ...

The present work proposes the use of the statistical method of frequency ratio (RF) and the hierarchical analytical process (AHP) to obtain zoning maps of the landslide processes, determining the susceptible areas in the territory of the Cayambe canton located in the province of Pichincha in Ecuador. Statistical methods use sample data based on the relationship between landslides and causal factors, evaluating the combination of these data objectively. As results, it was identified that the analysis of the landslide indices according to the FR method and the AHP method, shows that the inclination of the slope and the exposure are the important factors in the analysis of the susceptibility of the territory. However, a separate analysis shows that, for the FR method, the stratigraphic genetic complex factor is the most relevant, while for the AHP method, the most important factor is the steepness of the slope. On the other hand, the analysis of the distribution of landslides by parish...

Abstract. Spearman distance is a permutation distance which might prove useful for coding, e.g. for codes on permutations. It turns out, however, that the Spearman geometry of strings is rather unruly from the point of view of error correction and error detection, and special care has to be taken to discriminate between the two notions of codeword distance and codeword distinguishability. All of this stresses the importance of rejuvenating the latter notion, extending it from Shannon's zero-error information theory to the more general setting of metric string distances. 1 Foreword Recent literature [1] has highlighted the importance of codes on permutations, where the Hamming distance is replaced by the Kendall distance, a permutation distance which counts the minimum number of twiddles, i.e. of transposition be-tween two adjacent letters, which is required to transform two permuted strings into each other. Codes constructed on the basis of alternative string distances are foun...

Abstract—Cloud computing has recently emerged as a conver-gence of concepts such as cluster computing, grid computing, utility computing, and virtualization. In hybrid clouds, the user has its private cloud available for use, but she can also request new resources to public clouds in a pay-per-use basis when there is an increase in demand. In this scenario it is important to decide when and how to request these new resources to satisfy deadlines and/or to get a reasonable execution time, while minimizing the monetary costs involved. In this paper we propose a strategy to schedule service workflows in a hybrid cloud. The strategy aims at determining which services should use paid resources and what kind of resource should be requested to the cloud in order to minimize costs and meet deadlines. Experiments suggest that the strategy can decrease the execution costs while maintaining reasonable execution times. I.

In their paper “Trace Semantics are Fully Abstract ” Nain and Vardi propose that denotational semantics of behavioural modelling formalisms should adhere to the“Principle of Com-prehensive Modelling”which requires models are exhaustive of all possible circumstances. However their exploration of this principle is made only in the context of machines that use sets of single symbols to define their state and alpha-bet. We extend the application of the principle to the de-notational semantics of machines that use data structures, rather than single symbols, for the definition of state and alphabet. We show that, in the context of modelling the interaction between data and behaviour, this extension en-ables a unification of what are normally considered distinct styles of behavioural composition.

Abstract-As the IT trade progress towards game-changing expertise, a cloud Eco-system is gradually increasing in the country with expertise corporation ramping up employing and guiding for cloud computing. An accomplishment of green IT is probable to assist an organization in several ways like operating cost, stakeholder value, sustainability, employee morale and so on. In this paper, we propose an optimal resource allocation method for cloud computing environments. This paper progress a resource allocation representation of green cloud computing environments, considering both bandwidth and processing capability, allocated concurrently to every service request and returned it on an hourly basis. The owed resources are committed to every service request. It is established that, by simulation evaluation, the proposed ORAT method can diminish the request loss possibility and therefore, decrease the total resource obligatory, compared with the predictable allocation method. Various perf...

We consider here a UML 2 collaboration describing the structure of a service as a set of roles and the sub-collaborations that take place between them. Such sub-collaborations are represented as UML collaboration uses, and can themselves be composite collaborations or elementary collaborations, which are no further decomposed. We assume the behavior of an elementary collaboration is described with the help of a UML 2 sequence diagram. The behavior of a composite collaboration is described as a choreography of its sub-collaborations. Such choreography is specified using an UML 2 activity diagram, where each nodes is a CallBehaviorAction that invokes the behavior associated with a collaboration type and made available via a collaboration use (in the diagram describing the structure of the composite collaboration). Given a choreography, we are interested in finding a set of communicating role behaviors whose joint behavior is precisely the specified by the choreography. Whenever it is ...

Abstract: We explore logical reasoning for the global calculus, a coordination model based on the notion of choreography, with the aim to provide a methodology for specification and verification of structured communications. Starting with an extension of Hennessy-Milner logic, we present the global logic (GL), a modal logic describing possible interactions among participants in a choreography. We illustrate its use by giving examples of properties on service specifications. Finally, we show that, despite GL is undecidable, there is a ...

Cloud services are offered to consumers based on Service Level Agreements (SLAs) signed between Cloud Service Provider (CSP) and consumer. Due to on-demand provisioning of resources there is exponential growth of cloud consumers. Job scheduling is one of the areas that has attracted researchers to improve performance of cloud management system. Along with the on premise infrastructure, Small and Medium Enterprises (SMEs) also depend on public cloud infrastructure (leading to hybrid cloud) for seamless continuity of their businesses. In this context, ensuring SLAs and effective management of hybrid cloud resources are major challenging issues to be considered. Hence, there is a need for an effective scheduling algorithm which considers multiple objective functions like SLA (deadline), cost and energy while making scheduling decisions. Most of the state of the art schedulers in hybrid cloud environment considered single objective function. However, in real world, it is inadequate for scheduling effectiveness. To overcome this problem, we proposed an integrated framework which ensures SLAs (deadline), cost effectiveness and energy efficiency with an underlying scheduling algorithm known as SCE-TS. This algorithm is evaluated with different workloads and SLAs using a cloud platform. The empirical study revealed that the proposed framework improves scheduling efficiency in terms of meeting SLAs, cost and energy efficiency. It is evaluated and compared with the state of the art and found to be effective in making scheduling decisions in cloud environment.

Cloud computing relies on sharing of resources to achieve coherence and economies of scale similar to a utility over a network. The cloud also focuses on maximizing the effectiveness of the sharing the resources. Cloud computing resources are not only shared by multiple users but as well as dynamically re-allocated as per the user demand. Cloud computing provides on-demand self-service it allows users to configure, obtain and deploying the cloud services themselves using cloud service catalogues, without requiring the assistance of information technology. In this cloud computing offers a promising new platform to execute large programs in the cloud. In this large programs can be divided into multiple sequence of task.

This thesis develops and explores a technique called Protocol Modelling, a mathematics for the description of orderings. Protocol Modelling can be viewed as a hybrid of object orientation, as it supports ideas of data encapsulation and object instantiation; and process algebra, as it supports a formally defined idea of process and process composition. The first half of the thesis focuses on describing and defining the Protocol Modelling technique. A formal denotational semantics for protocol machines is developed and used to establish various properties; in particular that composition is closed and preserves type safety. The formal semantics is extended to cover instantiation of objects. Comparison is made with other process algebras and an approach to unification of different formulations of the semantics of process composition is proposed. The second half of the thesis explores three applications of Protocol Modelling: Object Modelling. This explores the use of Protocol Modelling ...

Scheduling of scientific workflows on hybrid cloud architecture, which contains private and public clouds, is a challenging task because schedulers should be aware of task inter-dependencies, underlying heterogeneity, cost diversity, and virtual machine (VM) variable configurations during the scheduling process. On the one side, reaching a minimum total execution time or makespan is a favorable issue for users whereas the cost of utilizing quicker VMs may lead to conflict with their budget on the other side. Existing works in the literature scarcely consider VM’s monetary cost in the scheduling process but mainly focus on makespan. Therefore, in this paper, the problem of scientific workflow scheduling running on hybrid cloud architecture is formulated to a bi-objective optimization problem with makespan and monetary cost minimization viewpoint. To address this combinatorial discrete problem, this paper presents a hybrid bi-objective optimization based on simulated annealing and tas...

Workflow technology has been adopted in scientific domains to orchestrate and automate scientific processes in order to facilitate experimentation. Such scientific workflows often involve large data sets and intensive computation that necessitate the use of the Grid. To execute a scientific workflow in the Grid, tasks within the workflow are assigned to Grid resources. Thus, to ensure efficient execution of the workflow, Grid workflow scheduling is required to manage the allocation of Grid resources. Although many Grid workflow scheduling techniques exist, they are mainly designed for the execution of a single workflow. This is not the case with parameter sweep workflows, which are used for parametric study and optimisation. A parameter sweep workflow is executed numerous times with different input parameters in order to determine the effect of each parameter combination on the experiment. While executing multiple instances of a parameter sweep workflow in parallel can reduce the time required for the overall execution, this parallel execution introduces new challenges to Grid workflow scheduling. Not only is a scheduling algorithm that is able to manage multiple workflow instances required, but this algorithm also needs the ability to schedule tasks across multiple workflow instances judiciously, as tasks may require the same set of Grid resources. Without appropriate resource allocation, resource competition problem could arise. We propose a new Grid workflow scheduling technique for parameter sweep workflow called the Besom scheduling algorithm. The scheduling decision of our algorithm is based on the resource dependencies of tasks in the workflow, as well as conventional Grid resource-performance metrics. In addition, the proposed technique is extended to handle loop structures in scientific workflows without using existing loop-unrolling techniques. The Besom algorithm is evaluated using simulations with a variety of scenarios. A comparison between the simulation results of the Besom algorithm and of the three existing Grid workflow scheduling algorithms shows that the Besom algorithm is able to perform better than the existing algorithms for workflows that have complex structures and that involve overlapping resource dependencies of tasks.

Scheduling multiple large-scale parallel workflow applications on heterogeneous computing systems like hybrid clouds is a fundamental NP-complete problem that is critical to meeting various types of QoS (Quality of Service) requirements. This paper addresses the scheduling problem of large-scale applications inspired from real-world, characterized by a huge number of homogeneous and concurrent bags-of-tasks that are the main sources of bottlenecks but open great potential for optimization. The scheduling problem is formulated as a new sequential cooperative game and propose a communication and storage-aware multiobjective algorithm that optimizes two user objectives (execution time and economic cost) while fulfilling two constraints (network bandwidth and storage requirements). We present comprehensive experiments using both simulation and real-world applications that demonstrate the efficiency and effectiveness of our approach in terms of algorithm complexity, makespan, cost, system-level efficiency, fairness, and other aspects compared with other related algorithms.

This paper presents a fully decentralized justin-time workflow scheduling method in a P2P Grid system. The proposed solution allows each peer node to autonomously dispatch interdependent tasks of workflows to run on geographically distributed computers. To reduce the workflow completion time and enhance the overall execution efficiency, not only does each node perform as a scheduler to distribute its tasks to execution nodes (or resource nodes), but the resource nodes will also set the execution priorities for the received tasks. By taking into account the unpredictability of tasks' finish time, we devise an efficient task scheduling heuristic, namely dynamic shortest makespan first (DSMF), which could be applied at both scheduling phases for determining the priority of the workflow tasks. We compare the performance of the proposed algorithm against seven other heuristics by simulation. Our algorithm achieves 20%∼60% reduction on the average completion time and 37.5%∼90% improvement on the average workflow execution efficiency over other decentralized algorithms.

Several real-world problems in domain of healthcare, large scale scientific simulations, and manufacturing are organised as workflow applications. Efficiently managing workflow applications on the Cloud computing data-centres is challenging due to the following problems: (i) they need to perform computation over sensitive data (e.g. Healthcare workflows) hence leading to additional security and legal risks especially considering public cloud environments and (ii) the dynamism of the cloud environment can lead to several run-time problems such as data loss and abnormal termination of workflow task due to failures of computing, storage, and network services. To tackle above challenges, this paper proposes a novel workflow management framework call DoFCF (Deploy on Federated Cloud Framework) that can dynamically partition scientific workflows across federated cloud (public/private) data-centres for minimising the financial cost, adhering to security requirements, while gracefully handling run-time failures. The framework is validated in cloud simulation tool (CloudSim) as well as in a realistic workflow-based cloud platform (e-Science Central). The results showed that our approach is practical and is successful in meeting users security requirements and reduces overall cost, and dynamically adapts to the run-time failures.

This paper explores the feasibility of an experimentation strategy for investigating sensitivities in fast components of atmospheric general circulation models. The basic idea is to replace the traditional serial-in-time long-term climate integrations by representative ensembles of shorter simulations. The key advantage of the proposed method lies in its efficiency: since fewer days of simulation are needed, the computational cost is less, and because individual realizations are independent and can be integrated simultaneously, the new dimension of parallelism can dramatically reduce the turnaround time in benchmark tests, sensitivities studies, and model tuning exercises. The strategy is not appropriate for exploring sensitivity of all model features, but it is very effective in many situations. Two examples are presented using the Community Atmosphere Model, version 5. In the first example, the method is used to characterize sensitivities of the simulated clouds to time-step length. Results show that 3-day ensembles of 20 to 50 members are sufficient to reproduce the main signals revealed by traditional 5-year simulations. A nudging technique is applied to an additional set of simulations to help understand the contribution of physics-dynamics interaction to the detected time-step sensitivity. In the second example, multiple empirical parameters related to cloud microphysics and aerosol life cycle are perturbed simultaneously in order to find out which parameters have the largest impact on the simulated global mean top-of-atmosphere radiation balance. It turns out that 12-member ensembles of 10-day simulations are able to reveal the same sensitivities as seen in 4-year simulations performed in a previous study. In both cases, the ensemble method reduces the total computational time by a factor of about 15, and the turnaround time by a factor of several hundred. The efficiency of the method makes it particularly useful for the development of high-resolution, costly, and complex climate models.

In the last decades, the Internet has become an information and communication network which reaches a wide audience and which has spread all over the world. Within this communicative context it is of paramount importance to know who hides behind a specific linguistic profile in computer-based communication. In order to establish the features of male and female genderlects, sociolinguistics has been based on oral interactions, but, this traditional classification of male and female language still valid, or should it be updated adapting to this new communication medium? The aim of this project has two sides. On the one hand, we have carried out an analysis just to detect if the traditional characterization of genderlects matches with the linguistic traits which are observed in computer-based communicative exchanges between men and women. On the other hand, we have tried to offer a genderlect characterization which could be useful concerning automatic gender detection tasks.

Components of Society 4.0 are taken as those currently most significantly influencing human being, common activities related to the existence of individual in society. It is closely related to changes in approach to information and its use. Modern ways of data sharing and processing are used massively, what is reflected also in changes of interpersonal communication generally. Positive impacts of this state are discussed at conferences and other events closely related to the issue of Society 4.0. On the other hand, it is also necessary to deal with possible negatives and risks related to use of new technologies that may arise in the future. Objective of this contribution is to explain and discuss selected aspects of society transformation to Society 4.0 which is based on specific principles. To reach the defined objective, literary research of relevant area and initial analyses of current state in the area of understanding principles of Society 4.0 by the representatives of small and medium sized companies specified in the research were used. Main focus was given to the new ways of data processing, changes of current conditions in relation to job positions, education and overall quality of life. Selected findings are presented in individual sections of the contribution. The emphasis was given on approaches to information and communication technologies and approach of individuals to changes visible in the whole society. This contribution should be taken as the summary of selected information coming from the initial research phase.

Cloud computing is a model for enabling ubiquitous and ondemand network access to a shared pool of configurable computing resources that can be rapidly provisioned and released with minimal management effort or service provider interaction. Cloud computing is the latest distributed and utility computing paradigm and it differs tremendous opportunities to solve large scale scientific problems. Largescale scientific applications typically have to execute a large number of homogeneous and concurrent activities. Scientific applications can be modeled as workflows. Scheduling the tasks in the workflow is an NP-hard problem and in this work we focus on optimizing the scheduling process. One of the most challenging problems in Cloud computing is the workflow scheduling the problem of satisfying the Quality of Service of the users as well as minimizing the cost of workflows executions .We have to formulate a task scheduling problem to minimize the workflow end-to-end delay under a user-specified financial constraint. In this paper we have proposed Greedy-Based Algorithm in cloud computing to implement a new scheduling algorithm that can minimize the End to end delay in cloud environment.

Cloud computing is the latest utility computing that enables the dynamic provisioning for applications over the Internet. Cloud computing provide large number of opportunities to solve large scale scientific problems. Scheduling the tasks in the workflows is an NPhard problem and in this work we focus on optimizing the scheduling process of the workflow. Scheduling of the workflow applications that satisfy the given constraints for the scientific tasks is an essential requirement for the workflow scheduling .Mapping of each task to suitable resource and allowing the task to satisfy performance constraints is the main aim of this paper. In the present work we propose game theoretic algorithm for multiobjective scheduling of scientific workflows in cloud computing environment. The scheduling problem is formulated as a new sequential cooperative game based on two user objectives that are execution time and economic cost while fulfilling two constraints network bandwidth and storage requirements. We call it as Game Multi Objective (GMO) algorithm. In this paper we apply Game Multi Objective algorithm for minimizing the execution time and cost of an workflow application.