Wyniki wyszukiwania - BazTech

1

Mobile Cloud for Parallel and Distributed Green Computing

Siwik L., Kala D., Godzik M., Turek W., Byrski A., Kisiel-Dorohinicki M.

Journal of Telecommunications and Information Technology

|

2017

|

nr 4

60--70

EN

Mobile Computing and Mobile Cloud Computing are the areas where intensive research is observed. The “mobility” landscape (devices, technologies, apps, etc.) evolves so fast that deﬁnitions and taxonomies do not catch up with so dynamic changes and there is still an ambiguity in deﬁnitions and common understanding of basic ideas and models. This research focuses on Mobile Cloud understood as parallel and distributed system consisting of a collection of interconnected (and virtualized) mobile devices dynamically provisioned and presented as one uniﬁed computing resource. This paper focuses on the mobile green computing cloud applied for parallel and distributed computations and consisting of outdated, abandoned or no longer needed smartphones being able to set up a powerful computing cluster. Besides showing the general idea and background, an actual computing cluster is constructed and its scalability and efficiency is checked versus the results obtained from the virtualized set of smartphones. All the experiments are performed using a dedicated software framework constructed in order to leverage the nolonger-needed smartphones, creating a computing cloud.

2

Realization of a system of efficient querying of hierarchical data transformed into a quasi-relational model

Furmanek A., Tokaj J., Marcjan R., Siwik L.

Computer Science

|

2016

|

Vol. 17 (3)

353--369

EN

Extensible Markup Language was mainly designed to easily represent documents; however, it has evolved and is now widely used for the representation of arbitrary data structures. There are many Application Programming Interfaces (APIs) to aid software developers with processing XML data. There are also many languages for querying and transforming XML, such as XPath or XQuery, which are widely used in this field. However, because of the great flexibility of XML documents, there are no unified data storing and processing standards, tools, or systems. On the other hand, a relational model is still the most-commonly and widely used standard for storing and querying data. Many Database Management Systems consist of components for loading and transforming hierarchical data. DB2 pureXML or Oracle SQLX are some of the most-recognized examples. Unfortunately, all of them require knowledge of additional tools, standards, and languages dedicated to accessing hierarchical data (for example, XPath or XQuery). Transforming XML documents into a (quasi)relational model and then querying (transformed) documents with SQL or SQL–like queries would significantly simplify the development of data-oriented systems and applications. In this paper, an implementation of the SQLxD query system is proposed. The XML documents are converted into a quasi-relational model (preserving their hierarchical structure), and the SQL–like language based on SQL-92 allows for efficient data querying.

3

Cassiopeia – Towards a Distributed and Composable Crawling Platform

Siwik L., Marcjan R., Włodarczyk K.

Journal of Telecommunications and Information Technology

|

2014

|

nr 2

79--89

EN

When it comes to designing and implementing crawling systems or Internet robots, it is of the utmost importance to first address efficiency and scalability issues (from a technical and architectural point of view), due to the enormous size and unimaginable structural complexity of the World Wide Web. There are, however, a significant number of users for whom flexibility and ease of execution are as important as efficiency. Running, defining, and composing Internet robots and crawlers according to dynamically-changing requirements and use-cases in the easiest possible way (e.g. in a graphical, drag & drop manner) is necessary especially for criminal analysts. The goal of this paper is to present the idea, design, crucial architectural elements, Proof-of-Concept (PoC) implementation, and preliminary experimental assessment of Cassiopeia framework, i.e. an all-in-one studio addressing both of the above-mentioned aspects.

4

Staged event-driven architecture as a micro-architecture of distributed and pluginable crawling platform

Siwik L., Włodarczyk K., Kluczny M.

Computer Science

|

2013

|

Vol. 14 (4)

645--665

EN

Crawling systems available on the market are usually closed solutions dedicated to performing a particular kind of task. There is a meaningful group of users, however, which require an all–in–one studio, not only for executing and running Internet robots, but also for (graphical) (re)defining and (re)composing crawlers according to dynamically changing requirements and use–cases. The Cassiopeia framework addresses the above idea. The crucial aspect regarding its efficiency and scalability is concurrency model applied. One of the promising models is staged event–driven architecture providing some useful benefits, such as splitting an application into separate stages connected by events’ queues–which is interesting, taking into account Cassiopeia’s assumptions regarding crawler (re)composition. The goal of this paper is to present the idea and PoC implementation of the Cassiopeia framework, with special attention paid to its crucial architectural element; i.e., design, implementation, and application of staged event–driven architecture.

5

Agentowo-ewolucyjna platforma obliczeń optymalizacyjnych

Nawarecki E., Siwik L.

Automatyka / Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie

|

2009

|

T. 13, z. 2

501-512

PL

Na tle ogólnej koncepcji realizacji wirtualnych systemów agentowych przedstawiono skondensowany opis inteligentnej platformy obliczeniowej dedykowanej do rozwiązywania złożonych problemów optymalizacji wielokryterialnej. Jako ilustrację podano wybrane rezultaty eksperymentów obliczeniowych.

EN

Against the general idea of realization of virtual agent systems, condensed description of intelligent computational platform dedicated for solving complex multiobjective optimization problems is presented. As an illustration a selected results of experiments are also presented.