4 resultados para The job network
em Bulgarian Digital Mathematics Library at IMI-BAS
Resumo:
MINERVA is a project funded by the European Commission IST Programme within the 5th Framework Programme. It created a network of EU Ministries and other agencies in charge of cultural policies and programmes, which is open to enlargement to new countries and new sectors of the civil society. The network discusses, correlates and harmonises the activities carried out in the field of digitisation of cultural and scientific heritage, aiming at creating a common European platform made up of agreed recommendations, guidelines, standards. The network acts also to foster collaboration between European Commission and Member States, to ensure awareness of European policies at national level, to exchange good practice, to coordinate national programmes in order to embed in national digitisation activities the technical results achieved by the network. Some main outcomes of the activities are presented.
Resumo:
Non-preemptive two-machine flow-shop scheduling problem with uncertain processing times of n jobs is studied. In an uncertain version of a scheduling problem, there may not exist a unique schedule that remains optimal for all possible realizations of the job processing times. We find necessary and sufficient conditions (Theorem 1) when there exists a dominant permutation that is optimal for all possible realizations of the job processing times. Our computational studies show the percentage of the problems solvable under these conditions for the cases of randomly generated instances with n ≤ 100 . We also show how to use additional information about the processing times of the completed jobs during optimal realization of a schedule (Theorems 2 – 4). Computational studies for randomly generated instances with n ≤ 50 show the percentage of the two- machine flow-shop scheduling problems solvable under the sufficient conditions given in Theorems 2 – 4.
Resumo:
This work presents a theoretical-graph method of determining the fault tolerance degree of the computer network interconnections and nodes. Experimental results received from simulations of this method over a distributed computing network environment are also presented.
Resumo:
Distributed and/or composite web applications are driven by intercommunication via web services, which employ application-level protocols, such as SOAP. However, these protocols usually rely on the classic HTTP for transportation. HTTP is quite efficient for what it does — delivering web page content, but has never been intended to carry complex web service oriented communication. Today there exist modern protocols that are much better fit for the job. Such a candidate is XMPP. It is an XML-based, asynchronous, open protocol that has built-in security and authentication mechanisms and utilizes a network of federated servers. Sophisticated asynchronous multi-party communication patterns can be established, effectively aiding web service developers. This paper’s purpose is to prove by facts, comparisons, and practical examples that XMPP is not only better suited than HTTP to serve as middleware for web service protocols, but can also contribute to the overall development state of web services.