Filtry
wszystkich: 4129
-
Katalog
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: SELFISH NODES
-
LYMPH NODES, Lymph node face, head ,neck - Unknown, 62 - Tissue image [3300730069383321]
Dane BadawczeThis is the histopathological image of LYMPH NODES tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.
-
LYMPH NODES, Lymph node face, head ,neck - Unknown, 62 - Tissue image [3300730069384081]
Dane BadawczeThis is the histopathological image of LYMPH NODES tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.
-
LYMPH NODES, Lymph node face, head ,neck - Unknown, 62 - Tissue image [3300730069384551]
Dane BadawczeThis is the histopathological image of LYMPH NODES tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.
-
LYMPH NODES, Lymph node face, head ,neck - Unknown, 62 - Tissue image [3300730069382121]
Dane BadawczeThis is the histopathological image of LYMPH NODES tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.
-
LYMPH NODES, Lymph node face, head ,neck - Female, 45 - Tissue image [6300730028261461]
Dane BadawczeThis is the histopathological image of LYMPH NODES tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.
-
LYMPH NODES, Lymph node face, head ,neck - Unknown, 62 - Tissue image [3300730069382081]
Dane BadawczeThis is the histopathological image of LYMPH NODES tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.
-
LYMPH NODES, Lymph node face, head ,neck - Female, 45 - Tissue image [7040247104964931]
Dane BadawczeThis is the histopathological image of LYMPH NODES tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.
-
LYMPH NODES, Lymph node face, head ,neck - Unknown, 62 - Tissue image [3300730069381851]
Dane BadawczeThis is the histopathological image of LYMPH NODES tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.
-
LYMPH NODES, Lymph node face, head ,neck - Unknown, 62 - Tissue image [330073006938321]
Dane BadawczeThis is the histopathological image of LYMPH NODES tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.
-
LYMPH NODES, Lymph node face, head ,neck - Female, 45 - Tissue image [6300730028266871]
Dane BadawczeThis is the histopathological image of LYMPH NODES tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.
-
LYMPH NODES, Lymph node face, head ,neck - Unknown, 62 - Tissue image [3300730069384201]
Dane BadawczeThis is the histopathological image of LYMPH NODES tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.
-
KernelHive: a new workflow-based framework for multilevel high performance computing using clusters and workstations with CPUs and GPUs
PublikacjaThe paper presents a new open-source framework called KernelHive for multilevel parallelization of computations among various clusters, cluster nodes, and finally, among both CPUs and GPUs for a particular application. An application is modeled as an acyclic directed graph with a possibility to run nodes in parallel and automatic expansion of nodes (called node unrolling) depending on the number of computation units available....
-
Collaborative Exploration of Trees by Energy-Constrained Mobile Robots
PublikacjaWe study the problem of exploration of a tree by mobile agents (robots) that have limited energy. The energy constraint bounds the number of edges that can be traversed by a single agent. We use a team of agents to collectively explore the tree and the objective is to minimize the size of this team. The agents start at a single node, the designated root of the tree and the height of the tree is assumed to be less than the energy...
-
On-line Search in Two-Dimensional Environment
PublikacjaWe consider the following on-line pursuit-evasion problem. A team of mobile agents called searchers starts at an arbitrary node of an unknown network. Their goal is to execute a search strategy that guarantees capturing a fast and invisible intruder regardless of its movements using as few searchers as possible. As a way of modeling two-dimensional shapes, we restrict our attention to networks that are embedded into partial grids:...
-
Electronic Notes in Theoretical Computer Science
Czasopisma -
NODEA-NONLINEAR DIFFERENTIAL EQUATIONS AND APPLICATIONS
Czasopisma -
Toward Fast Calculation of Communication Paths for Resilient Routing
PublikacjaUtilization of alternate communication paths is a common technique to provide protection of transmission against failures of network nodes/links. However, a noticeable delay is encountered when calculating the relevant sets of disjoint paths using the available algorithms (e.g., using Bhandari’s approach). This, in turn, may have a serious impact on the ability of a network to serve dynamic demands...
-
On-line Search in Two-Dimensional Environment
PublikacjaWe consider the following on-line pursuit-evasion problem. A team of mobile agents called searchers starts at an arbitrary node of an unknown network. Their goal is to execute a search strategy that guarantees capturing a fast and invisible intruder regardless of its movements using as few searchers as possible. We require that the strategy is connected and monotone, that is, at each point of the execution the part of the graph...
-
Improving the Survivability of Carrier Networks to Large-Scale Disasters
PublikacjaThis chapter is dedicated to the description of methods aiming to improve the survivability of carrier networks to large-scale disasters. First, a disaster classification and associated risk analysis is described, and the disaster-aware submarine fibre-optic cable deployment is addressed aiming to minimize the expected costs in case of natural disasters. Then, the chapter addresses the improvement of the network connectivity resilience...
-
Mobility Oriented Development (MOD): Public-Private Partnership in Urban Parking & Traffic Management with the Use of Autonomous Automobiles, Car-Sharing, Ridesharing Modes of Transport & Mobility as a Service (MaaS)
PublikacjaThe focus of the following research are relations between mobility technologies and metropolitan (urban and suburban) spatial structures. In this paper the author discusses various urban modes of transport (automobile, mass transit) in the context of emerging technical (autonomous vehicles, self-driving cars and driverless shuttles) and organizational (carpooling, ridesharing, car-sharing, on-demand mobility) solutions for " mobility...
-
BMC Research Notes
Czasopisma -
Time versus space trade-offs for randezvous in trees
PublikacjaTwo identical (anonymous) mobile agents start from arbitrary nodes of an unknown tree and have to meet at some node. Agents move in synchronous rounds: in each round an agent can either stay at the current node or move to one of its neighbors. We consider deterministic algorithms for this rendezvous task. The main result of this paper is a tight trade-off between the optimal time of completing rendezvous and the size of memory...
-
Collision-Free Network Exploration
PublikacjaA set of mobile agents is placed at different nodes of a n-node network. The agents synchronously move along the network edges in a collision-free way, i.e., in no round may two agents occupy the same node. In each round, an agent may choose to stay at its currently occupied node or to move to one of its neighbors. An agent has no knowledge of the number and initial positions of other agents. We are looking for the shortest possible...
-
Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots
PublikacjaWe study two variants of delivery problems for mobile robots sharing energy. Each mobile robot can store at any given moment at most two units of energy, and whenever two robots are at the same location, they can transfer energy between each other, respecting the maximum capacity. The robots operate in a simple graph and initially each robot has two units of energy. A single edge traversal by an robot reduces its energy by one...
-
Modelowanie kratownicy z kształtowników giętych na zimno z mimośrodami dodatnimi w węźle = Modelling of truss with cold-formed section and positive eccentricyty in the node.
PublikacjaThe topic of this research is establishing load-carrying capacity of compressed and tensed chords of trusses made of cold-formed open cross-sections. Occurrence of bending in the truss’ chord is the result of specific production technology assumed by the designer and producer of lattice girder’s systems. The aim of this research is to present methodology of conduct while creating numerical models that best depict the behaviour...
-
Drawing maps with advice
PublikacjaW pracy podejmujemy temat konstrukcji algorytmu dla agenta, który zostaje umieszczony w dowolnym wierzchołku grafu (wierzchołki są nierozróżnialne, krawędzie mają etykiety portów), po czym realizuje algorytm zmierzający do znalezienia drzewa spinającego grafu lub izomorficznej kopii grafu. Dla obu problemów podajemy asymptotycznie dokładne lub prawie dokładne oszacowania na ilość bitów dodatkowej informacji, którą agent musi otrzymać...
-
Modeling of the alcohol dehydrogenase active site. Two different modes of alcohol binding in crystals of zinc and cadmium tri-tert-butoxysilanethiolates evidenced by X-ray diffraction and solid state vibrational spectroscopy
PublikacjaOpisano syntezę, struktury cząsteczkowe oraz widma FT-IR, 1H. 13C, 29Si, 113Cd NMR dziesięciu nowych, mieszanoligandowych kompleksów cynku i kadmu z ligandem tri-tert-butoksysilanotiolanowym i pochodnymi imidazolu. Za pomocą rentgenowskiej analizy strukturalnej i spektroskopii w podczerwieni udokumentowano dwa różne sposoby wiązania etanolu i metanolu w kryształach tych związków. Opisane kompleksy stanowią modele miejsca aktywnego...
-
The reliability of tree and star networks.
PublikacjaOne of the important parameters characterizing the quality of computer networks is the network's reliability with respect to failures of the communication links and nodes. This chapter investigated the reliability of tree and star networks. The tree and star topology is used in centralized computer networks. In centralized computer networks all communication must take place through some central computer. Following measures of network...
-
Discouraging Traffic Remapping Attacks in Local Ad Hoc Networks
PublikacjaQuality of Service (QoS) is usually provided in ad hoc networks using a class-based approach which, without dedicated security measures in place, paves the way to various abuses by selfish stations. Such actions include traffic remapping attacks (TRAs), which consist in claiming a higher traffic priority, i.e., false designation of the intrinsic traffic class so that it can be mapped onto a higher-priority class. In practice, TRAs...
-
Synchronous black hole search in directed graphs
PublikacjaThe paper considers a team of robots which has to explore a graph G, where some nodes can be harmful. Robots are initially located at the so-called home base node. The dangerous nodes are the so-called black hole nodes, and once a robot enters in one of them, it is destroyed. The goal is to find a strategy in order to explore G in such a way that minimum number of robots is wasted. The exploration ends if there is at least one...
-
Transmission Protocol Simulation Framework For The Resource-Constrained Wireless Sensor Network
PublikacjaIn this paper a prototype framework for simulation of wireless sensor network and its protocols are presented. The framework simulates operation of a sensor network with data transmission, which enables simultaneous development of the sensor network software, its hardware and the protocols for wireless data transmission. An advantage of using the framework is converging simulation with the real software. Instead of creating...
-
The validation process of truss model with joint eccentricities
PublikacjaNowadays, due to the technological reasons in modern lightweight steel trusses, fabricated from cold-formed sections, positive eccentricities appear in the truss nodes, to induce additional forces truss chords. In order to account for the real load-carrying capacity of truss node area the steel structure research was conducted in scale 1:1. As a result of experimental research, the forms of deformation and strains of the walls...
-
Paweł Czarnul dr hab. inż.
OsobyPaweł Czarnul uzyskał stopień doktora habilitowanego w dziedzinie nauk technicznych w dyscyplinie informatyka w roku 2015 zaś stopień doktora nauk technicznych w zakresie informatyki(z wyróżnieniem) nadany przez Radę Wydziału Elektroniki, Telekomunikacji i Informatyki Politechniki Gdańskiej w roku 2003. Dziedziny jego zainteresowań obejmują: przetwarzanie równoległei rozproszone w tym programowanie równoległe na klastrach obliczeniowych,...
-
Three levels of fail-safe mode in MPI I/O NVRAM distributed cache
PublikacjaThe paper presents architecture and design of three versions for fail-safe data storage in a distributed cache using NVRAM in cluster nodes. In the first one, cache consistency is assured through additional buffering write requests. The second one is based on additional write log managers running on different nodes. The third one benefits from synchronization with a Parallel File System (PFS) for saving data into a new file which...
-
Bounds on the cover time of parallel rotor walks
PublikacjaThe rotor-router mechanism was introduced as a deterministic alternative to the random walk in undirected graphs. In this model, a set of k identical walkers is deployed in parallel, starting from a chosen subset of nodes, and moving around the graph in synchronous steps. During the process, each node successively propagates walkers visiting it along its outgoing arcs in round-robin fashion, according to a fixed ordering. We consider...
-
Network Graph Transformation Providing Fast Calculation of Paths for Resilient Routing
PublikacjaProtection of transmission against failures can be appropriately dealt with by alternative paths. However, common schemes (e.g., Bhandaris scheme) are characterized by a remarkable delay while determining the transmission paths. This in turn may have a serious impact on serving dynamic demands (characterized by relatively short duration time). As a remedy to this problem, we introduce an approach to pre-compute the sets of disjoint...
-
Thin-walled frames and grids - statics and dynamics
PublikacjaFrames and grids assembled with thin-walled beams of open cross-section are widely applied in various civil engineering and vehicle or machine structures. Static and dynamic analysis of theses structures may be carried out by means of different models, startingfrom the classical models made of beam elements undergoing the Kirchhoff assumptions to the FE discretization of whole frame into plane elements. The former model is very...
-
Zastosowanie modułu symulacji dynamicznej programu CAD w analizie układu napędowego elektronarzędzia
PublikacjaW referacie przedstawiono analizę mechanicznego układu przeniesienia napędu elektronarzędzia (wyrzynarki elektrycznej) przy zastosowaniu Modułu Symulacji Dynamicznej (MSD) programu Autodesk Inventor (AI). Opracowano modele 3D poszczególnych części elektronarzędzia i połączono je przy zachowaniu tzw. kinematyki odwrotnej. Przeprowadzono analizę wpływu poszczególnych węzłów kinetycznych na przebieg momentu na wale silnika elektrycznego....
-
LYMPH NODES, Intra-abdominal lymph nodes - Female, 71 - Tissue image [5310730015837311]
Dane BadawczeThis is the histopathological image of LYMPH NODES tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: VS200 Olympus slide scanner (20x magnification) and saved to DICOM format.
-
Zapiski pożeracza ksiąg : o rodzajach i funkcjach marginaliów na podstawie notatek Jana Bernarda Bonifacia = Marginalia of the book devourer : about the kind and functions of marginal notes on the basic of Giovanni Bernardino Bonifacio's annotations.
PublikacjaThe aim of this study is to show the rich variety of marginalia written in the books by the hand of their owner, Giovanni Bernardo Bonifacio (1517—1597)‘, also known as "helluo librorum", a "book devourer". Most of the author’s attention has been focused upon recognizing the types and functions of the hand written comments left in the margins of the books by the Italian humanist. The role of the annotations has been seen as...
-
Zapiski pożeracza ksiąg : o rodzajach i funkcjach marginaliów na podstawie notatek Jana Bernarda Bonifacia = Marginalia of the book devourer : about the kind and functions of marginal notes on the basic of Giovanni Bernardino Bonifacio's annotations.
PublikacjaThe aim of this study is to show the rich variety of marginalia written in the books by the hand of their owner, Giovanni Bernardo Bonifacio (1517—1597)‘, also known as "helluo librorum", a "book devourer". Most of the author’s attention has been focused upon recognizing the types and functions of the hand written comments left in the margins of the books by the Italian humanist. The role of the annotations has been seen as a...
-
Service-based Resilience via Shared Protection in Mission-critical Embedded Networks
PublikacjaMission-critical networks, which for example can be found in autonomous cars and avionics, are complex systems with a multitude of interconnected embedded nodes and various service demands. Their resilience against failures and attacks is a crucial property and has to be already considered in their design phase. In this paper, we introduce a novel approach for optimal joint service allocation and routing, leveraging virtualized...
-
Visual Data Encryption for Privacy Enhancement in Surveillance Systems
PublikacjaIn this paper a methodology for employing reversible visual encryption of data is proposed. The developed algorithms are focused on privacy enhancement in distributed surveillance architectures. First, motivation of the study performed and a short review of preexisting methods of privacy enhancement are presented. The algorithmic background, system architecture along with a solution for anonymization of sensitive regions of interest...
-
TRUSS JOINT WITH POSITIVE ECCENTRICITY EXPERIMENTAL RESEARCH
PublikacjaDue to the technological reasons in modern lightweight steel trusses, fabricated from cold- formed sections, positive eccentricities appear in the truss nodes what induce additional forces in the truss chords. To account for the real load-carrying capacity of truss node area the steel structure research in scale 1:1 were conducted. The experiments consisted of two parts: preliminary and proper one, when conclusions from...
-
Harmony Search for Self-configuration of Fault–Tolerant and Intelligent Grids
PublikacjaIn this paper, harmony search algorithms have been proposed to self-configuration of fault-tolerant grids for big data processing. Self-configuration of computer grids lies in the fact that new computer nodes are automatically configured by software agents and then integrated into the grid. A base node works due to several configuration parameters that define some aspects of data communications and energy power consumption. We...
-
Traffic Remapping Attacks in Ad Hoc Networks
PublikacjaAd hoc networks rely on the mutual cooperation of stations. As such, they are susceptible to selfish attacks that abuse network mechanisms. Class-based QoS provisioning mechanisms, such as the EDCA function of IEEE 802.11, are particularly prone to traffic remapping attacks, which may bring an attacker better QoS without exposing it to easy detection. Such attacks have been studied in wireless LANs, whereas their impact in multihop...
-
Controlling nodal displacement of pantographic structures using matrix condensation and interior-point optimization: A numerical and experimental study
PublikacjaThis study presents an innovative approach for the precise control of nodal displacements in pantographic structures. The method is founded on the Matrix Condensation of Force Method, seamlessly integrated with an Interior Point Optimization algorithm. This combination offers a unique advantage by allowing users to manipulate displaced nodes within a defined coordination domain. Furthermore, this approach introduces the Interior...
-
Theory and implementation of a virtualisation level Future Internet defence in depth architecture
PublikacjaAn EU Future Internet Engineering project currently underway in Poland defines three parallel internets (PIs). The emerging IIP system (IIPS, abbreviating the project’s Polish name), has a four-level architecture, with level 2 responsible for creation of virtual resources of the PIs. This paper proposes a three-tier security architecture to address level 2 threats of unauthorised traffic injection and IIPS traffic manipulation...
-
International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Konferencje -
How to meet when you forget: log-space rendezvous in arbitrary graphs
PublikacjaTwo identical (anonymous) mobile agents start from arbitrary nodes in an a priori unknown graph and move synchronously from node to node with the goal of meeting. This rendezvous problem has been thoroughly studied, both for anonymous and for labeled agents, along with another basic task, that of exploring graphs by mobile agents. The rendezvous problem is known to be not easier than graph exploration. A well-known recent result...