Wyszukiwarka
Filtry
wszystkich: 523
wybranych: 468
-
Katalog
Filtry wybranego katalogu
Wyniki wyszukiwania dla: agents
-
Contribution of UDP-glucuronosyltransferases (UGTs) in metabolism of acridinone antitumor agents, C-1311, C-1305, and their less active structural analogues, C-1330 and C-1299
PublikacjaCelem prowadzonych badań było określenie roli UDP-glukuronylotransferaz, uważanych za najważniejsze enzymy detoksykujące, w metabolizmie pochodnych imidazo- i triazoloakrydonu. Wykazano, że najbardziej aktywne przeciwnowotworowo związki z obu grup, tj. C-1311 i C-1305 są transformowane do O-glukuronidów, w przeciwieństwie do ich metoksylowych analogów, odpowiednio związku C-1330 i C-1299. Analiza składu mieszanin reakcyjnych zawierających...
-
Novel 2-(2-alkylthiobenzenesulfonyl)-3-(phenylprop-2-ynylideneamino)guanidine derivatives as potent anticancer agents – Synthesis, molecular structure, QSAR studies and metabolic stability
PublikacjaA series of new 2-(2-alkylthiobenzenesulfonyl)-3-(phenylprop-2-ynylideneamino)guanidine derivatives have been synthesized and evaluated in vitro by MTT assays for their antiproliferative activity against cell lines of colon cancer HCT-116, cervical cancer HeLa and breast cancer MCF-7. The obtained results indicated that these compounds display prominent cytotoxic effect. The best anticancer properties have been observed for derivatives...
-
Pregnane X receptor dependent up-regulation of CYP2C9 and CYP3A4 in tumor cells by antitumor acridine agents, C-1748 and C-1305, selectively diminished under hypoxia
PublikacjaInduction of proteins involved in drug metabolism and in drug delivery has a significant impact on drug-drug interactions and on the final therapeutic effects. Two antitumor acridine derivatives selected for present studies, C-1748 (9-(2’-hydroxyethylamino)-4-methyl-1-nitroacridine) and C-1305 (5-dimethylaminopropylamino-8-hydroxy-triazoloacridinone), expressed high and low susceptibility to metabolic transformations with liver...
-
Ultrasound assisted one-pot synthesis of rosuvastatin based novel azaindole derivatives via coupling–cyclization strategy under Pd/Cu-catalysis: Their evaluation as potential cytotoxic agents
Publikacja -
2,7-Dihydro-3H-pyridazino[5,4,3-kl]acridin-3-one derivatives, novel type of cytotoxic agents active on multidrug-resistant cell lines. Synthesis and biological evaluation.
PublikacjaOtrzymano serię pirydazyno akrydyn-3-onów w reakcji 9-okso-9,10-dihydroakrydyno-1-karboksylanu etylu z POCl3, następnie dodanie odpowiedniej alkiloaminoalkilohydrazyny. Badane związki wykazują w porównaniu z referencyjnymi cytostatykami DX, MIT niższe wartości indeksu RI, a także niższe aktywności cytotoksyczne.
-
Human CYP2 family of cytochrome P-450 takes part in metabolism of two acridine antitumor agents, C-1311 and C-1748, selected for I phase of clinical trials
PublikacjaPraca zawiera wyniki badań metabolicznej transformacji przeciwnowotworowych pochodnych akrydyny wobec zestawu 16 prób enzymów mikrosomalnych, pochodzących z wątroby 16 różnych pacjentów. Wykazano, że za metabolizm tych związków u człowieka odpowiedzialne są głównie izoenzymy z rodziny CYP2.
-
Antibiotic resistance in Staphylococcus aureus strains isolated from cows with mastitis in the eastern Poland and analysis of susceptibility of resistant strains to alternative non-antibiotic agents: lysostaphin, nisin and polymyxin B.
PublikacjaThe aim of the studies was analysis of resistance of Staphylococcus aureus isolates from bovine mastitis in eastern part of Poland to a set of 20 antibiotics and three alternative agents: lysostaphin, nisin and polymyxin B. Eighty-six out of 123 examined isolates were susceptible to all of 20 tested antibiotics (70 %). The highest percentage of resistance was observed in the case of β-lactam antibiotics: amoxicillin (n=22, 17.9...
-
Synthesis and biological evaluation of 2,7-Dihydro-3H-dibenzo[de,h]cinnoli- ne-3,7-done derivatives a novel group of anticancer agents active on a multidrug resistance cell line.
PublikacjaZsyntezowano serię pochodnych pirydazonu z jednym lub dwoma łańcuchami bocznymi w różnych pozycjach chromoforu tetracyklicznego. Związki wykazały aktywność cytoksyczną na mysią białaczkę L1210 i ludzką k562 oraz na linii komórkowej oporności krzyżowej MDR (k562/DX). Dwa najbardziej aktywne związki przetestowano in vivo na mysiej białaczce P388. Wykazały one aktywność przeciwnowotworową porównywalną z aktywnością Mitoxantronu.
-
Phytotoxic Metabolites from Three Neofusicoccum Species Causal Agents of Botryosphaeria Dieback in Australia, Luteopyroxin, Neoanthraquinone, and Luteoxepinone, a Disubstituted Furo-α-pyrone, a Hexasubstituted Anthraquinone, and a Trisubstituted Oxepi-2-one from Neofusicoccum luteum
Publikacja -
Synthesis, molecular structure, and metabolic stability of new series of N' -(2-alkylthio-4-chloro-5-methylbenzenesulfonyl)-1-(5-phenyl-1 H -pyrazol-1-yl)amidine as potential anti-cancer agents
PublikacjaA series of new N'-(2-alkylthio-4-chloro-5-methylbenzenesulfonyl)-1-(5-phenyl-1H-pyrazol-1-yl)amidine derivatives have been synthesized and evaluated in vitro by MTT assays for their antiproliferative activity against cell lines of colon cancer HCT-116, cervical cancer HeLa and breast cancer MCF-7. The studied compounds display selective activity mainly against HCT-116 and HeLa cells. Thus, five compounds show selective cytotoxic...
-
Nonstationary Pharmacokinetics of Caspofungin in ICU Patients
Publikacja -
Complete Nucleotide Sequence of the pCTX-M3 Plasmid and Its Involvement in Spread of the Extended-Spectrum β-Lactamase GeneblaCTX-M-3
Publikacja -
Mosaic Structure of p1658/97, a 125-Kilobase Plasmid Harboring an Active Amplicon with the Extended-Spectrum β-Lactamase Gene bla SHV-5
Publikacja -
Phenethyl Isothiocyanate Inhibits Shiga Toxin Production in Enterohemorrhagic Escherichia coli by Stringent Response Induction
Publikacja -
Enhanced susceptibility to antifungal oligopeptides in yeast strains overexpressing ABC multidrug efflux pumps
PublikacjaPorównano podatność na działanie związków przeciwgrzybowych o strukturze oligopeptydowej oraz aminokwasowej szczepów Saccharomyces cerevisiae z usuniętymi genami kodującymi białka oporności wielolekowej oraz transformantów tych szczepów, zawierających geny CDR1, CDR2 lub MDR1, kodujące główne pompy wielolekowe Candida albicans. Rekombinowane szczepy nadprodukujące białka Cdr1p i Cdr2p wykazywały zwiększoną wrażliwość na wszystkie...
-
Method-Dependent Epidemiological Cutoff Values for Detection of Triazole Resistance in Candida and Aspergillus Species for the Sensititre YeastOne Colorimetric Broth and Etest Agar Diffusion Methods
PublikacjaAlthough the Sensititre Yeast-One (SYO) and Etest methods are widely utilized, interpretive criteria are not available for triazole susceptibility testing of Candida or Aspergillus species. We collected fluconazole, itraconazole, posaconazole, and voriconazole SYO and Etest MICs from 39 laboratories representing all continents for (method/agent-dependent) 11,171 Candida albicans, 215 C. dubliniensis, 4,418 C. glabrata species complex,...
-
Molecular typing of clinical isolates of Escherichia coli by a new PCR MP method
PublikacjaTypowanie epidemiologiczne bakterii jest rutynową procedurą stosowaną w badaniach zakażeń szpitalnych i wymaga stosowania odpowiednich metod o wysokim potencjale różnicującym. Przedstawiliśmy możliwości nowej techniki PCR MP w różnicowaniu szczepów E. coli. Rezultaty zostały porównane z wynikami uzyskanymi metodą PFGE.
-
Anticancer Properties of Amino Acid and Peptide Derivatives of Mycophenolic Acid
PublikacjaBackground: Although Mycophenolic Acid (MPA) is applied as prodrugs in clinic as an immunosuppressant, it also possesses anticancer activity. MPA acts as Inosine-5’-Monophosphate Dehydrogenase (IMPDH) inhibitor, where the carboxylic group at the end of the side chain interacts with Ser 276 of the enzyme via hydrogen bonds. Therefore, MPA derivatives with other polar groups indicated high inhibition too. On the other hand, potent...
-
Cytochromes P450 and Skin Cancer: Role of Local Endocrine Pathways
Publikacja -
The gaseous messenger carbon monoxide is released from the eye into the ophthalmic venous blood depending on the intensity of sunlight
PublikacjaCircadian and seasonal rhythms in daylight affect many physiological processes. In the eye, energy of intense visible light not only initiates a well-studied neural reaction in the retina that modulates the secretory function of the hypothalamus and pineal gland, but also activates the heme oxygenase (HO) to produce carbon monoxide (CO). This study was designed to determine whether the concentration of carbon monoxide (CO) in the...
-
Synthesis of Combretastatin A-4 Analogs and their Biological Activities
PublikacjaCombretastatin A-4 (CA-4) is a natural product, which consists of two phenyl rings, linked by an ethylene bridge. CA-4, inhibitor of polymerization of tubulin to microtubules, possesses a strong antitumor and anti-vascular properties both in vitro and in vivo. Previous studies showed that disodium phosphate salt of CA-4, a water-soluble prodrug is well tolerated at therapeutically useful doses. However, it should be noted that...
-
Distributed Evacuation in Graphs with Multiple Exits
PublikacjaWe consider the problem of efficient evacuation using multiple exits. We formulate this problem as a discrete problem on graphs where mobile agents located in distinct nodes of a given graph must quickly reach one of multiple possible exit nodes, while avoiding congestion and bottlenecks. Each node of the graph has the capacity of holding at most one agent at each time step. Thus, the agents must choose their movements strategy...
-
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...
-
A multi-agent method for periodicity detection in distributed events
PublikacjaMulti-agent systems working in constantly changing environments may be challenged by instantaneous unavailability of their autonomous agents caused e.g. by limited computing resources. A new method of self-organization of distributed service components is proposed, suitable for multi-agent systems. This method relies on particular agents carrying out separate analyzes of their individual processing loads or other specific events....
-
BeesyBees: A mobile agent-based middleware for a reliable and secure execution of service-based workflow applications in BeesyCluster
PublikacjaIntegrating distributed services into workflows comes with its own set of challenges, including security, coordination, fault tolerance and optimisation of execution time. This paper presents an architecture and implementation - nicknamed BeesyBees - that allows distributed execution of workflow applications in BeesyCluster using agents. BeesyCluster is a middleware that allows users to access distributed resources as well as publish...
-
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...
-
Selected Features of Dynamic Voting
PublikacjaIn multi-agent systems composed of autonomous agents with local knowledge, it is often desirable to aggregate their knowledge in order to make an educated decision. One of the methods of agreeing to a common decision is voting. A new history-based dynamic weight protocol allows for identification of the agents which contribute to the correct system decision. The main advantage of this approach, compared to static weighted system...
-
The Use of an Autoencoder in the Problem of Shepherding
PublikacjaThis paper refers to the problem of shepherding clusters of passive agents consisting of a large number of objects by a team of active agents. The problem of shepherding and the difficulties that arise with the increasing number of data describing the location of agents have been described. Several methods for reducing the dimensionality of data are presented. Selected autoencoding method using a Restricted Boltzmann Machine is...
-
Collision-free network exploration
PublikacjaMobile agents start at different nodes of an n-node network. The agents synchronously move along the network edges in a collision-free way, i.e., in no round two agents may occupy the same node. An agent has no knowledge of the number and initial positions of other agents. We are looking for the shortest time required to reach a configuration in which each agent has visited all nodes and returned to its starting location. In...
-
Harmony Search for Data Mining with Big Data
PublikacjaIn this paper, some harmony search algorithms have been proposed for data mining with big data. Three areas of big data processing have been studied to apply new metaheuristics. The first problem is related to MapReduce architecture that can be supported by a team of harmony search agents in grid infrastructure. The second dilemma involves development of harmony search in preprocessing of data series before data mining. Moreover,...
-
Optymalizacja strategii sieci inteligentnych agentów za pomocą programowania genetycznego w systemie rozproszonym realizującym paradygmat volunteer computing
PublikacjaDynamicznie rosnąca złożoność i wymagania w odniesieniu do rozproszonych systemów informatycznych utrudnia zarządzanie dostępnymi zasobami sprzętowymi i programistycznymi. Z tego powodu celem rozprawy jest opracowanie wielokryterialnej metody programowania genetycznego, która pozwala na optymalizację strategii zespołu inteligentnych agentów programistycznych w zakresie zarządzania systemem realizującym paradygmat volunteer computing....
-
Effect of User Mobility upon Trust Building among Autonomous Content Routers in an Information-Centric Network
PublikacjaThe capability of proactive in-network caching and sharing of content is one of the most important features of an informationcentric network (ICN). We describe an ICN model featuring autonomous agents controlling the content routers. Such agents are unlikely to share cached content with other agents without an incentive to do so. To stimulate cooperation between agents, we adopt a reputation and trust building scheme that is able...
-
Trust Dynamics Analysis of CTR Scheme Subversion under Virtual Anonymity and Trust-Unaware Partner Selection
PublikacjaWe propose a framework to study Markovian trust value dynamics in a centralized Computational Trust and Reputation (CTR) scheme under trust-unaware partner selection using a mean-value approximation. Analytically founded answers are sought to questions like: Can dishonest agents subvert the CTR scheme (i.e., acquire higher trust values than honest agents)? Is indirect reciprocity incentivized? Is there a qualitative impact of a...
-
Trustworthiness and Subversion in Large Service- Oriented Multi-Agent Systems under Virtual Anonymity and Blind Provider Selection
PublikacjaTo promote honest service provision in multi-agent systems, a Computational Trustworthiness and Rating scheme collects service ratings and computes agents' trustworthiness levels (TLs). Studies of existing schemes fail to reflect closed-loop dynamics of TLs arising from the mutual influence of agents' behavior and TLs, and to capture relevant properties. Recent simulative and analytical models produce results tied to a particular...
-
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...
-
Old Problems - New Solutions: Conversion of Capitals as a Tool for Shaping the Competitive Position in the Economic Field
PublikacjaThe acts and operations any social actor effectuates in each of the logically distinguished spheres of reality are conditioned by many factors, among which a reliable analysis of the strengths and weaknesses of an agent should be considered of utmost importance. The concept of capitals presented in this article divides the quantity of resources available to all acting agents into four main categories (which allows for determining...
-
Old Problems - New Solutions: Conversion of Capitals as a Tool for Shaping the Competitive Position in the Economic Field
PublikacjaThe acts and operations any social actor effectuates in each of the logically distinguished spheres of reality are conditioned by many factors, among which a reliable analysis of the strengths and weaknesses of an agent should be considered of utmost importance. The concept of capitals presented in this article divides the quantity of resources available to all acting agents into four main categories (which allows for determining...
-
Multi-agent systems registration and maintenance of address mapping without agent self-registation
PublikacjaMonitoring of dynamic multi-agent systems, here agents are allowed to appear and disappear, and can migrate between network nodes is a complex tasks. Applying the traditional monitoring methods is not effective, as little can be assumed in advance about such environments. It is necessary to track changes in addressing and availability of agents to create and maintain mapping between agents and their network addresses. The...
-
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...
-
Reputacja i zaufanie w systemach teleinformatycznych z podmiotami anonimowymi podejście dynamiczne
PublikacjaAbstrakcją współczesnego systemu teleinformatycznego jest system wieloagentowy z autonomicznymi, racjonalnymi i wirtualnie anonimowymi agentami wchodzącymi we wzajemne interakcje dla wymiany usług. W referacie uzasadniono konieczność projektowania dla niego podsystemu budowy reputacji i zaufania oraz odpowiednich analiz w ujęciu dynamicznym. Dokonano przeglądu motywacyjnie zgodnych mechanizmów uczciwego raportowania usług oraz...
-
Student model representation for pedagogical virtual mentors
PublikacjaThe paper concerns technological aspects of virtual mentors construction, especially concentrating on the student model representation. The article distinguishes several types of information that is gathered by the pedagogical agents and other educational platforms, including student knowledge model, student progress tracking, interaction process patterns and learner preferences. A set of technologies used for the student model...
-
Multi-agent graph searching and exploration algorithms
PublikacjaA team of mobile entities, which we refer to as agents or searchers interchangeably, starting from homebases needs to complete a given task in a graph.The goal is to build a strategy, which allows agents to accomplish their task. We analyze strategies for their effectiveness (e.g., the number of used agents, the total number of performed moves by the agents or the completion time).Currently, the fields of on-line (i.e., agents...
-
Application of genetic algorithms in graph searching problem
PublikacjaGraph searching is a common approach to solving a problem of capturing a hostile intruder by a group of mobile agents. We assume that this task is performed in environment which we are able to model as a graph G. The question asked is how many agents are needed to capture an arbitrary fast, invisible and smart intruder. This number is called the (edge) search number of G. The strategy which must be performed by agents is called...
-
Topology Discovery of Hierarchical Ethernet LANs without SNMP support
PublikacjaThis paper presents an algorithm that allows for discovery of layer-2 hierarchical Ethernet network topology using agents running on selected end nodes. No SNMP, MIB, hardware, firmware, or operating system-level software modification is required. The method is based on transmission of customized Ethernet frames among installed software agents. It can be used to discover the topology of LAN or one VLAN segment as long as no MAC...
-
The Snow Team Problem
PublikacjaWe study several problems of clearing subgraphs by mobile agents in digraphs. The agents can move only along directed walks of a digraph and, depending on the variant, their initial positions may be pre-specified. In general, for a given subset~$\cS$ of vertices of a digraph $D$ and a positive integer $k$, the objective is to determine whether there is a subgraph $H=(\cV_H,\cA_H)$ of $D$ such that (a) $\cS \subseteq \cV_H$, (b)...
-
Fast collaborative graph exploration
PublikacjaWe study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph. At every time step, each agent can traverse an edge of the graph. All vertices have unique identifiers, and upon entering a vertex, an agent obtains the list of identifiers of all its neighbors. We ask how many time steps are required to complete exploration, i.e., to make sure...
-
Fast Collaborative Graph Exploration
PublikacjaWe study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph. At every time step, each agent can traverse an edge of the graph. All vertices have unique identifiers, and upon entering a vertex, an agent obtains the list of identifiers of all its neighbors. We ask how many time steps are required to complete exploration, i.e., to make sure...
-
Multi-agent large-scale parallel crowd simulation with NVRAM-based distributed cache
PublikacjaThis paper presents the architecture, main components and performance results for a parallel and modu-lar agent-based environment aimed at crowd simulation. The environment allows to simulate thousandsor more agents on maps of square kilometers or more, features a modular design and incorporates non-volatile RAM (NVRAM) with a fail-safe mode that can be activated to allow to continue computationsfrom a recently analyzed state in...
-
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...
-
Particle swarm optimization algorithms for autonomous robots with deterministic leaders using space filling movements
PublikacjaIn this work the swarm behavior principles of Craig W. Reynolds are combined with deterministic traits. This is done by using leaders with motions based on space filling curves like Peano and Hilbert. Our goal is to evaluate how the swarm of agents works with this approach, supposing the entire swarm will better explore the entire space. Therefore, we examine different combinations of Peano and Hilbert with the already known swarm...