Time filter

Source Type

Palma R.,Ontology Engineering Group | Palma R.,Poznan Supercomputing and Networking Center | Corcho O.,Ontology Engineering Group | Gomez-Perez A.,Ontology Engineering Group | And 2 more authors.
Journal of Web Semantics | Year: 2011

This paper describes our methodological and technological approach for collaborative ontology development in inter-organizational settings. It is based on the formalization of the collaborative ontology development process by means of an explicit editorial workflow, which coordinates proposals for changes among ontology editors in a flexible manner. This approach is supported by new models, methods and strategies for ontology change management in distributed environments: we propose a new form of ontology change representation, organized in layers so as to provide as much independence as possible from the underlying ontology languages, together with methods and strategies for their manipulation, version management, capture, storage and maintenance, some of which are based on existing proposals in the state of the art. Moreover, we propose a set of change propagation strategies that allow keeping distributed copies of the same ontology synchronized. Finally, we illustrate and evaluate our approach with a test case in the fishery domain from the United Nations Food and Agriculture Organisation (FAO). The preliminary results obtained from our evaluation suggest positive indication on the practical value and usability of the work here presented. © 2011 Elsevier B.V. All rights reserved.

Kowalik K.,Nicolaus Copernicus University | Hanasz M.,Nicolaus Copernicus University | Woltanski D.,Nicolaus Copernicus University | Gawryszczak A.,Poznan Supercomputing and Networking Center
Monthly Notices of the Royal Astronomical Society | Year: 2013

We investigate streaming instability using two-fluid approximation (neutral gas and dust) in a quasi-global, unstratified protoplanetary disc, with the help of PIERNIK code. We compare amplification rate of the eigenmode in numerical simulations, with the corresponding growth resulting from the linear stability analysis of full system of Euler's equation including aerodynamic drag. Following Youdin & Goodman (2005), we show that (1) rapid dust clumping occurs due to the difference in azimuthal velocities of gas and dust, coupled by the drag force, (2) initial density perturbations are amplified by several orders of magnitude. We demonstrate that the multifluid extension of the simple and efficient Relaxing TVD scheme, implemented in PIERNIK, leads to results, which are compatible with those obtained with other methods. ©2013 The Authors Published by Oxford University Press on behalf of the Royal Astronomical Society.

Kurowski K.,Poznan Supercomputing and Networking Center | Oleksiak A.,Poznan Supercomputing and Networking Center | Weglarz J.,Poznan Supercomputing and Networking Center
Journal of Scheduling | Year: 2010

In this paper, we propose a new method for multiuser, multicriteria job scheduling in Grid environments with QoS guarantees concerning time and cost. The main goal of our method is to find a fair schedule of jobs that were submitted by multiple users. To obtain a schedule which is satisfactory for each user we aim at finding a set of advance reservations (ARs) for multiple users at once. This goal is achieved by adequate use of the Ordered Weighted Averaging (OWA) operator and Multiobjective Evolutionary Algorithm (MOEA) with carefully designed problem representation and operators. We also propose a data structure and algorithm used to manage and search for resource availability time slots. Efficiency and usefulness of our approach was demonstrated by computational experiments conducted within a simulation environment. © Springer Science+Business Media, LLC 2010.

Walter B.,Poznan University of Technology | Alkhaeir T.,Poznan Supercomputing and Networking Center
Information and Software Technology | Year: 2016

Context - Design patterns represent recommended generic solutions to various design problems, whereas code smells are symptoms of design issues that could hinder further maintenance of a software system. We can intuitively expect that both concepts are mutually exclusive, and the presence of patterns is correlated with the absence of code smells. However, the existing experimental evidence supporting this claim is still insufficient, and studies separately analyzing the impact of smells and patterns on code quality deliver diverse results. Objective - The aim of the paper is threefold: (1) to determine if and how the presence of the design patterns is linked to the presence of code smells, (2) to investigate if and how these relationships change throughout evolution of code, and (3) to identify the relationships between individual patterns and code smells. Method - We analyze nine design patterns and seven code smells in two medium-size, long-evolving, open source Java systems. In particular, we explore how the presence of design patterns impacts the presence of code smells, analyze if this link evolves over time, and extract association rules that describe their individual relationships. Results - Classes participating in design patterns appear to display code smells less frequently than other classes. The observed effect is stronger for some patterns (e.g., Singleton, State-Strategy) and weaker for others (e.g., Composite). The ratio between the relative number of smells in the classes participating in patterns and the relative number of smells in other classes, is approximately stable or slightly decreasing in time. Conclusion - This observation could be used to anticipate the smell-proneness of individual classes, and improve code smell detectors. Overall, our findings indicate that the presence of design patterns is linked with a lower number of code smell instances. This could support programmers in a context-sensitive analysis of smells in code. © 2016 Elsevier B.V. All rights reserved.

Olejnik L.,CERN | Olejnik L.,Poznan Supercomputing and Networking Center
Physical Review A - Atomic, Molecular, and Optical Physics | Year: 2011

We propose a quantum solution to the classical private information retrieval (PIR) problem, which allows one to query a database in a private manner. The protocol offers privacy thresholds and allows the user to obtain information from a database in a way that offers the potential adversary, in this model the database owner, no possibility of deterministically establishing the query contents. This protocol may also be viewed as a solution to the symmetrically private information retrieval problem in that it can offer database security (inability for a querying user to steal its contents). Compared to classical solutions, the protocol offers substantial improvement in terms of communication complexity. In comparison with the recent quantum private queries protocol, it is more efficient in terms of communication complexity and the number of rounds, while offering a clear privacy parameter. We discuss the security of the protocol and analyze its strengths and conclude that using this technique makes it challenging to obtain the unconditional (in the information-theoretic sense) privacy degree; nevertheless, in addition to being simple, the protocol still offers a privacy level. The oracle used in the protocol is inspired both by the classical computational PIR solutions as well as the Deutsch-Jozsa oracle. © 2011 American Physical Society.

Kurowski K.,Poznan Supercomputing and Networking Center
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2012

The keynote will address various ICT aspects related to future platforms, applications and services that may impact and hopefully improve the way various business and enterprise processes will be organized in the future. New development tools, easy-to-program powerful mobile devices, interactive panels, etc. enable users to prototype new IT systems with much better interfaces, to quickly setup collaborative environments and easily deploy online applications. However, many people have not realized how quickly data, computational and networking requirements of these new information systems have increased and what constraints are behind existing underlying e-Infrastructures. Therefore, the main aim of this keynote will be to share with the audience example scenarios and lessons learned. Additionally, various challenges encountered in practice for future information systems and software development methods will be briefly discussed. The keynote will be summarized by an updated report on existing research e-Infrastructures in Poland and worldwide. © 2012 Springer-Verlag Berlin Heidelberg.

Walkowska J.,Poznan Supercomputing and Networking Center | Werla M.,Poznan Supercomputing and Networking Center
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2012

This paper is dedicated to the issue of automatic mapping from flat or hierarchical metadata schemas to Semantic Web data formats. It proposes a checklist of requirements for such mappings and, based on this checklist, tries to compare functionalities of existing mapping tools. Finally, it introduces jMet2Ont, an open source mapping tool created by PSNC during the SYNAT research project. © 2012 Springer-Verlag.

Piatek W.,Poznan Supercomputing and Networking Center
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2013

The focus of this paper is a Data Center Workload and Resource Management Simulator (DCworms) which enables modeling and simulation of data centers to estimate their performance, energy consumption, and energy-efficiency metrics for diverse workloads and management policies. We present its functionality in terms of energy-efficiency modeling and methods of power usage estimations available in the simulator. Moreover, we show an application of DCworms within the CoolEmAll project that addresses the important problem of data center energy efficiency. © 2013 Springer-Verlag.

Kurowski K.,Poznan Supercomputing and Networking Center | Kulczewski M.,Poznan Supercomputing and Networking Center | Dobski M.,Poznan Supercomputing and Networking Center
Environmental Science and Engineering (Subseries: Environmental Science) | Year: 2011

In recent years we have observed a huge increase in natural disasters, such as earthquakes, tornadoes and floods. Even Poland as a relatively stable region has experienced many big natural disasters, in particular three floods early this year with the estimated cost around 3 billion Euro. To address the dramatic changes in our climate, hydrometeo scientists have to work together to share important data, tweak existing meteorological models, even couple them, ultimately achieving the goal of preventing such disasters in the future. The computing power and data capacity grow every day, and scientists are willing to run the hydro-meteo simulations at greater model size as well as use new archiving and back up services for historical analysis. However, to benefit from modern architectures, applications and data structures have to be adapted properly. In this chapter we discuss various ideas to improve the performance of Eulag - a numerical solver for all-scale geophysical flows using innovative computing technologies. We present preliminary results of applying the GPGPU and OpenMP shared memory model to Eulag, so that the application can be well scaled on cluster of GPUs or cluster of SMPs nodes respectively. Moreover, we present additional useful solutions to visualize the hydro- meteorological data at speed, as well as to share data in a secure way among end-users. © Springer-Verlag Berlin Heidelberg 2011.

Hanasz M.,Nicolaus Copernicus University | Lesch H.,Universitats Sternwarte Munich | Naab T.,Max Planck Institute for Astrophysics | Gawryszczak A.,Poznan Supercomputing and Networking Center | And 3 more authors.
Astrophysical Journal Letters | Year: 2013

We present simulations of the magnetized interstellar medium (ISM) in models of massive star-forming (40 M⊙ yr-1) disk galaxies with high gas surface densities (Σgas ∼ 100 M ⊙ pc-2) similar to observed star-forming high-redshift disks. We assume that type II supernovae deposit 10% of their energy into the ISM as cosmic rays (CRs) and neglect the additional deposition of thermal energy or momentum. With a typical Galactic diffusion coefficient for CRs (3 × 1028 cm2 s-1), we demonstrate that this process alone can trigger the local formation of a strong low-density galactic wind maintaining vertically open field lines. Driven by the additional pressure gradient of the relativistic fluid, the wind speed can exceed 10 3 km s-1, much higher than the escape velocity of the galaxy. The global mass loading, i.e., the ratio of the gas mass leaving the galactic disk in a wind to the star formation rate, becomes of order unity once the system has settled into an equilibrium. We conclude that relativistic particles accelerated in supernova remnants alone provide a natural and efficient mechanism to trigger winds similar to observed mass-loaded galactic winds in high-redshift galaxies. These winds also help in explaining the low efficiencies for the conversion of gas into stars in galaxies, as well as the early enrichment of the intergalactic medium with metals. This mechanism may be at least of similar importance to the traditionally considered momentum feedback from massive stars and thermal and kinetic feedback from supernova explosions. © 2013. The American Astronomical Society. All rights reserved.

Loading Poznan Supercomputing and Networking Center collaborators
Loading Poznan Supercomputing and Networking Center collaborators