SUMMARY: The UNited RESisdue (UNRES) package for coarse-grained simulations, which has recently been optimized to treat large protein systems, has been implemented on Graphical Processor Units (GPUs). An over 100-time speed-up of the GPU code (run on an NVIDIA A100) with respect to the sequential code and an 8.5 speed-up with respect to the parallel Open Multi-Processing (OpenMP) code (run on 32 cores of 2 AMD EPYC 7313 Central Processor Units (CPUs)) has been achieved for large proteins (with size over 10 000 residues). Due to the averaging over the fine-grain degrees of freedom, 1 time unit of UNRES simulations is equivalent to about 1000 time units of laboratory time; therefore, millisecond time scale of large protein systems can be reached with the UNRES-GPU code. AVAILABILITY AND IMPLEMENTATION: The source code of UNRES-GPU along with the benchmarks used for tests is available at https://projects.task.gda.pl/eurohpcpl-public/unres.

We consider binary classification algorithms, which operate on single frames from video sequences. Such a class of algorithms is named OFA (One Frame Analyzed). Two such algorithms for facial detection are compared in terms of their susceptibility to the FSA (Frame Sequence Analysis) method. It introduces a shifting time-window improvement, which includes the temporal context of frames in a post-processing step that improves the classification quality. Error measures are proposed to express the frame-wise accuracy of classifying algorithms, as well as the segmentation of the result sequences which they produce. The two compared algorithms, after applying the FSA improvement, perform better in terms of all the considered measures. The performed experiments have allowed to draw conclusions regarding preferred methods of measuring accuracy of such algorithms and the selection of suitable classification algorithms for being improved. In the end of the work, the resulting future possibilities of further developing the FSA methods are noted.

The algorithm for people counting in crowded scenes, based on the idea of virtual gate which uses optical flow method is presented. The concept and practical application of the developed algorithm under real conditions is depicted. The aim of the work is to estimate the number of people passing through entrances of a large sport hall. The most challenging problem was the unpredicted behavior of people while entering the building. The examined flow of people fluctuated between individual persons and dense crowd. A series of experiments during sport and entertainment events was made. The results of the experiments show a high efficiency of the elaborated algorithm.

Volunteer computing systems like BOINC or Comcute are strongly supported by a great number of volunteers who contribute resources of their computers via the Web. So, the high efficiency of such grid system is required, and that is why we have formulated a multi-criterion optimization problem for a volunteer grid system design. In that dilemma, both the cost of the host system and workload of a bottleneck host are minimized. On the other hand, a reliability of this grid structure is maximized. Moreover, genetic programming has been applied to determine the Pareto solutions. Finally, a negative selection procedure to handle constraints has been discussed.

This paper describes the lifecycle of a digital historical document, from template-based structure definition through to content extraction from the scanned pages and its final reconstitution as an electronic document (combining content and semantic information) along with the tools that have been created to realise each stage in the lifecycle. The whole approach is described in the context of different types of typewritten documents relating to prisoners in World-War II concentration camps and is the result of a multinational collaboration under the MEMORIAL project funded (€1.5M) by the European Union (www.memorial-project.info). Extensive tests with historians/archivists and evaluation of the content extraction results indicate the superior performance of the whole semantics-driven approach both over manual transcription and over the semi-automated application of off-the-shelf OCR and the use of a conventional (text and layout) document format.

article Free Access Share on Teaching parallel processing: development of curriculum and software tools Authors: Jan Kwiatkowski Technical University of Wroclaw, Computer Science Department, Poland Technical University of Wroclaw, Computer Science Department, PolandView Profile , Marek Andruszkiewicz Technical University of Wroclaw, Computer Science Department, Poland Technical University of Wroclaw, Computer Science Department, PolandView Profile , Emilio Luque Universitat Autonoma de Barcelona, Computer Science Department, Spain Universitat Autonoma de Barcelona, Computer Science Department, SpainView Profile , Tomas Margalef Universitat Autonoma de Barcelona, Computer Science Department, Spain Universitat Autonoma de Barcelona, Computer Science Department, SpainView Profile , Jose Cunha Universidade Nova de Lisboa, Departamento de Informatica, Portugal Universidade Nova de Lisboa, Departamento de Informatica, PortugalView Profile , Joao Lourenco Universidade Nova de Lisboa, Departamento de Informatica, Portugal Universidade Nova de Lisboa, Departamento de Informatica, PortugalView Profile , Henryk Krawczyk Technical University of Gdansk Electronics Faculty, Poland Technical University of Gdansk Electronics Faculty, PolandView Profile , Stanislaw Szejko Technical University of Gdansk Electronics Faculty, Poland Technical University of Gdansk Electronics Faculty, PolandView Profile Authors Info & Claims ACM SIGCSE BulletinVolume 28Issue SI1996 pp 159–161https://doi.org/10.1145/237477.237633Published:01 January 1996Publication History 4citation199DownloadsMetricsTotal Citations4Total Downloads199Last 12 Months15Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

A new diagnostic model of multimicrocomputer systems is defined and analysed. It is assumed that a system consists of units which are able to perform a permissible set of tests. Three kinds of system units can be engaged in each test: active (deciding) units, passive units, and the tested units. From the invalidation point of view the proposed model is located between Preparata-Metze-Chien's (1967) model (symmetric invalidation) and Chwa-Hakimi-Malek's (1980, 1981) model (asymmetric invalidation for comparison testing). Moreover, we assume multiple invalidation per test and single unit per test. The new category of (/spl alpha/,/spl beta/)-diagnosable systems is proposed and described Some relationships between the (/spl alpha/,/spl beta/)-diagnosability and the traditional diagnosability are shown and proved. Besides, the (/spl alpha/,/spl beta/)-part diagnosability for different determined. Hierarchical systems such as microprocessors and voting systems are considered and compared.>

A comparison-based system-level fault diagnosis model is considered. Provided the number of faulty units and the number of incorrect outcomes (in the sense that a fault-free unit evaluates a faulty one to be fault-free) do not exceed given bounds, the necessary and sufficient conditions for the comparison assignment to achieve correct and complete diagnosis are determined. An O(n mod E mod ) fault identification algorithm and optimal comparison assignments, in terms of minimum time of complete fault localization, are also proposed. The proposed diagnosis strategy can be performed concurrently with application tasks execution and the suitable comparison assignment can minimize the latency of fault identification. It makes the model more attractive for real-time applications.>

A generalized PMC model, where only a subset of possible unit faults (the same for each unit) can be detected by unit tests, is considered. A category of visible faults is introduced and the necessary and sufficient condition for the new class of t/sub v/-diagnosable systems is determined. Moreover, an O( mod T mod ) diagnosis algorithm is presented.>

The problem of diagnostic test scheduling (DTS) is to assign to each edge e of a diagnostic graph G a time interval of length l(e) so that intervals corresponding to edges at any given vertex do not overlap and the overall finishing time is minimum. In this correspondence we show that the DTS problem is NP-complete. Then we present a longest, first sequential scheduling algorithm which runs in worst case time O(dm log n) and uses O(m) space to produce a solution of length less than four times optimal. Then we show that the general performance bound can be strengthened to 3 * OPT(G) for low-degree graphs and to 2 ·OPT(G) in some special cases of binomial diagnostic graphs.