检索结果-内蒙古大学图书馆

Developing combinatorial multi-component therapies (CMCT) of drugs that are more specific and have fewer side effects than traditional one drug therapies

引用

Nonlinear Biomedical Physics 2007年第1期1卷 11-11页

作者： Liebovitch, Larry S. Tsinoremas, Nicholas Pandya, Abhijit Florida Atlantic University Center for Complex Systems and Brain Sciences Center for Molecular Biology and Biotechnology Department of Psychology Department of Biomedical Science Boca Raton FL 33431 United States The Scripps Research Institute Scripps Florida Informatics Jupiter FL 33458 United States Florida Atlantic University Department of Computer Science and Engineering Boca Raton FL 33431 United States

Drugs designed for a specific target are always found to have multiple effects. Rather than hope that one bullet can be designed to hit only one target, nonlinear interactions across genomic and proteomic networks could be used to design Combinatorial Multi-Component Therapies (CMCT) that are more targeted with fewer side effects. We show here how computational approaches can be used to predict which combinations of drugs would produce the best effects. Using a nonlinear model of how the output effect depends on multiple input drugs, we show that an artificial neural network can accurately predict the effect of all 2¹⁵= 32,768 combinations of drug inputs using only the limited data of the output effect of the drugs presented one-at-a-time and pairs-at-a-time. © 2007 Liebovitch et al;licensee BioMed Central Ltd.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An efficient multicast packet delivery scheme for UMTS

An efficient multicast packet delivery scheme for UMTS

引用

ACM MSWiM 2006 - 9th ACM Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems

作者： Alexiou, Antonios Antonellis, Dimitrios Bouras, Christos Papazois, Andreas Research Academic Computer Technology Institute GR 26500 Patras Greece Computer Engineering and Informatics Department University of Patras GR 26500 Patras Greece

ISBN: (纸本)1595934774

In this paper we present an efficient scheme for the multicast transmission of the data in the Universal Mobile Telecommunications System (UMTS). We take advantage of the tree topology of the examined network and we introduce the use of Routing Lists (RLs) in the nodes of the UMTS. The adoption of these lists leads to the decrement of the transmitted packets and the efficient use of network resources during the multicast transmission of the data. We describe in detail the necessary steps for the successful multicast transfer of data. Furthermore, we analyze the handling of special cases such as user mobility scenarios. Especially, the various handover types are examined along with the Serving Radio Network Subsystem (SRNS) relocation procedure. Copyright 2006 ACM.

关键词： Packet switching

来源：评论

学校读者我要写书评

暂无评论

Design aspects of open municipal broadband networks 06

Design aspects of open municipal broadband networks

引用

1st International Conference on Access Networks, AcessNets '06

作者： Alexiou, Antonios Bouras, Christos Primpas, Dimitrios Research Academic Computer Technology Institute Computer Engineering and Informatics Dept. Univ. of Patras N. Kazantzaki Str 26500 Rio Greece

ISBN: (纸本)1595935134

This paper presents the design principles that cover the implementation of broadband infrastructure in the region of Western Greece, by examining all the necessary parameters that arise while implementing such a critical developmental project. Furthermore, we present as a case study, all issues of the designing of the Metropolitan Area Network of Patras, the third biggest city of Greece. The major target of the MAN of Patras is to interconnect the buildings of the public sector in the city and also deploy fibers that will create conditions of competition in providing both access and content services in advantage of the end consumer. The usage of the broadband infrastructure by service providers will be based on the open availability of the fiber optics infrastructure in a cost effective way. Finally, we present the main characteristics of a proposed business plan that ensures financial viability of the broadband infrastructure. Copyright 2006 ACM.

关键词： Broadband networks

来源：评论

学校读者我要写书评

暂无评论

The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions 06

The price of optimum in Stackelberg games on arbitrary singl...

引用

SPAA 2006: 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures

作者： Kaporis, A.C. Spirakis, P.G. Department of Computer Engineering and Informatics University of Patras 26500 Patras Greece Research Academic Computer Technology Institute University of Patras P.O. Box 1122 Patras Greece

ISBN: (纸本)1595934529

Let M be a single s-t network of parallel links with load dependent latency functions shared by an infinite number of selfish users. This may yield a Nash equilibrium with unbounded Coordination Ratio [12, 26]. A Leader can decrease the coordination ratio by assigning flow αr on M, and then all Followers assign selfishly the (1 - α)r remaining flow. This is a Stackelberg Scheduling Instance (M, r, α), 0 ≤ α ≤ 1. It was shown [23] that it is weakly NP-hard to compute the optimal Leader's strategy. For any such network M we efficiently compute the minimum portion βM of flow r needed by a Leader to induce M's optimum cost, as well as his optimal strategy. Unfortunately, Stackelberg routing in more general nets can be arbitrarily hard. Roughgarden presented a modification of Braess's Paradox graph, such that no strategy controlling αr flow can induce ≤ 1/α times the optimum cost. However, we show that our main result also applies to any s-t net G. We take care of the Braess's graph explicitly, as a convincing example. Copyright 2006 ACM.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

The power of the defender

The power of the defender

引用

26th IEEE International Conference on Distributed Computing Systems Workshops, ICDCS 2006

作者： Gelastou, Marina Mavronicolas, Marios Papadopoulou, Vicky Philippou, Anna Spirakis, Paul Department of Computer Science University of Cyprus Nicosia CY-1678 Cyprus Department of Computer Engineering and Informatics University of Patras 265 00 Patras Greece Research and Academic Computer Technology Institute 261 10 Patras Greece

ISBN: (纸本)0769525415

We consider a security problem on a distributed network. We assume a network whose nodes are vulnerable to infection by threats (e.g. viruses), the attackers. A system security software, the defender, is available in the system. However, due to the network's size, economic and performance reasons, it is capable to provide safety, i.e. clean nodes from the possible presence of attackers, only to a limited part of it. The objective of the defender is to place itself in such a way as to maximize the number of attackers caught, while each attacker aims not to be caught. In [7], a basic case of this problem was modeled as a non-cooperative game, called the Edge model. There, the defender could protect a single link of the network. Here, we consider a more general case of the problem where the defender is able to scan and protect a set of k links of the network, which we call the Tuple model. It is natural to expect that this increased power of the defender should result in a better quality of protection for the network. Ideally, this would be achieved at little expense on the existence and complexity of Nash equilibria (profiles where no entity can improve its local objective unilaterally by switching placements on the network). In this paper we study pure and mixed Nash equilibria in the model. In particular, we propose algorithms for computing such equilibria in polynomial time and we provide a polynomial-time transformation of a special class of Nash equilibria, called matching equilibria, between the Edge model and the Tuple model, and vice versa. Finally, we establish that the increased power of the defender results in higher-quality protection of the network. © 2006 IEEE.

关键词： Viruses

来源：评论

学校读者我要写书评

暂无评论

Investigating bandwidth broker's inter-domain operation for dynamic and automatic end to end provisioning 6

Investigating bandwidth broker's inter-domain operation for ...

引用

6th International Network Conference, INC 2006

作者： Bouras, C. Primpas, D. Research Academic Computer Technology Institute N.Kazantzaki Str. RionPatras26500 Greece Department of Computer Engineering and Informatics University of Patras RionPatras26500 Greece

ISBN: (纸本)1841021571

This paper deals with a distributed bandwidth broker that we try to extend in order to perform inter-domain operation. The basic issues for inter-domain operation are discussed and we try to approach the most demanding issues as the selection of the best inter domain routing path. Generally, we discuss three models for inter domain routing through bandwidth broker, analyzing their advantages. Also, a very important point that affects the interdomain operation is the SLAs between adjacent domains and the capability that a bandwidth broker should have to ask and perform dynamic negotiation. Finally, we analyze the best model and present how it should be incorporated in the existing distributed implementation.

关键词： Bandwidth broker End to end provisioning SLA

来源：评论

学校读者我要写书评

暂无评论

Clustering of mobile ad hoc networks: An adaptive broadcast period approach

Clustering of mobile ad hoc networks: An adaptive broadcast ...

引用

2006 IEEE International Conference on Communications, ICC 2006

作者： Gavalas, Damianos Pantziou, Grammati Konstantopoulos, Charalampos Mamalis, Basilis Department of Cultural Technology and Communication University of the Aegean Greece Department of Informatics Technological Education Institute of Athens Greece Research Academic Computer Technology Institute Patras Greece

ISBN: (纸本)1424403553

Organization, scalability and routing have been identified as key problems hindering viability and commercial success of mobile ad hoc networks. Clustering of mobile nodes among separate domains has been proposed as an efficient approach to address those issues. In this work, we introduce an efficient distributed clustering algorithm that uses both location and energy metrics for cluster formation. Our proposed solution mainly addresses cluster stability, manageability and energy efficiency issues. Also, unlike existing active clustering methods, our algorithm relieves the network from the unnecessary burden of control messages broadcasting, especially for relatively static network topologies. This is achieved through adapting broadcast period according to mobile nodes mobility pattern. The efficiency, scalability and competence of our algorithm against alternative approaches have been demonstrated through simulation results. © 2006 IEEE.

关键词： Ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

A delay-based analytical provisioning model for a QoS-enabled service

A delay-based analytical provisioning model for a QoS-enable...

引用

2006 IEEE International Conference on Communications, ICC 2006

作者： Bouras, Christos Sevasti, Afrodite RA Computer Technology Institute-RACTI Department of Computer Engineering and Informatics University of Patras Patras Greece Greek Research and Technology Network-GRNET Athens Greece

ISBN: (纸本)1424403553

Carefully designed and managed services are essential for quality-demanding traffic, especially in large-scale IP networks where the aggregation of flows and the variety of traffic types are extensive. Although individual mechanisms have been widely investigated, not much related work exists on integrated approaches to QoS provisioning that are also feasible to implement. This work presents a thorough approach to the design, dimensioning and provisioning of a high priority service for high-quality demanding traffic over an IP network. Our approach employs efficient scheduling and a dynamic admission control scheme while demonstrating novel characteristics in terms of the quality offered to IP flows. © 2006 IEEE.

关键词： Telecommunication services

来源：评论

学校读者我要写书评

暂无评论

Cost Sharing Mechanisms for Fair Pricing of Resources Usage

Cost Sharing Mechanisms for Fair Pricing of Resources Usage

引用

Algorithmic Aspects of Large and Complex Networks 2005

作者： Mavronicolas, Marios Panagopoulou, Panagiota N. Spirakis, Paul G. Department of Computer Science University of Cyprus Nicosia CY-1678 Cyprus Department of Computer Engineering and Informatics Patras University Greece Research Academic Computer Technology Institute Patras University N. Kazantzaki Str. Rion PatrasGR 26500 Greece

We propose a simple and intuitive cost mechanism which assigns costs for the competitive usage of m resources by n selfish agents. Each agent has an individual demand;demands are drawn according to some probability distribution. The cost paid by an agent for a resource she chooses is the total demand put on the resource divided by the number of agents who chose that same resource. So, resources charge costs in an equitable, fair way, while each resource makes no profit out of the agents. We call our model the Fair Pricing model. Its fair cost mechanism induces a non-cooperative game among the agents. To evaluate the Nash equilibria of this game, we introduce the Diffuse Price of Anarchy, as an extension of the Price of Anarchy that takes into account the probability distribution on the demands. We prove: - Pure Nash equilibria may not exist, unless all chosen demands are identical. In contrast, we have been able to prove that pure Nash equilibria do exist for two closely related cost sharing models, namely the Average Cost Pricing and the Serial Cost Sharing models. - A fully mixed Nash equilibrium exists for all possible choices of the demands. Further on, the fully mixed Nash equilibrium is the unique Nash equilibrium in case there are only two agents. - In the worst-case choice of demands, the Price of Anarchy is Θ(n);for the special case of two agents, the Price of Anarchy is less than 2 − 1/m. - Assume now that demands are drawn from a bounded, independent probability distribution, where all demands are identically distributed and each is at most a (universal for the class) constant times its expectation. Then, the Diffuse Price of Anarchy is at most that same constant, which is just 2 when each demand is distributed symmetrically around its expectation. © 2006 Dagstuhl Seminar Proceedings. All rights reserved.

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

A Cost Mechanism for Fair Pricing of Resource Usage

A Cost Mechanism for Fair Pricing of Resource Usage

引用

Algorithmic Aspects of Large and Complex Networks 2005

作者： Mavronicolas, Marios Panagopoulou, Panagiota N. Spirakis, Paul G. Department of Computer Science University of Cyprus NicosiaCY-1678 Cyprus Department of Computer Engineering and Informatics Patras University Greece Research Academic Computer Technology Institute Patras University N. Kazantzaki Str. Rion PatrasGR 26500 Greece

We propose a simple and intuitive cost mechanism which assigns costs for the competitive usage of m resources by n selfish agents. Each agent has an individual demand;demands are drawn according to some probability distribution. The cost paid by an agent for a resource she chooses is the total demand put on the resource divided by the number of agents who chose that same resource. So, resources charge costs in an equitable, fair way, while each resource makes no profit out of the agents. We call our model the Fair Pricing model. Its fair cost mechanism induces a non-cooperative game among the agents. To evaluate the Nash equilibria of this game, we introduce the Diffuse Price of Anarchy, as an extension of the Price of Anarchy that takes into account the probability distribution on the demands. We prove: - Pure Nash equilibria may not exist, unless all chosen demands are identical;in contrast, a fully mixed Nash equilibrium exists for all possible choices of the demands. Further on, the fully mixed Nash equilibrium is the unique Nash equilibrium in case there are only two agents. - In the worst-case choice of demands, the Price of Anarchy is Θ(n);for the special case of two agents, the Price of Anarchy is less than 2 − 1/m. - Assume now that demands are drawn from a bounded, independent probability distribution, where all demands are identically distributed and each is at most a (universal for the class) constant times its expectation. Then, the Diffuse Price of Anarchy is at most that same constant, which is just 2 when each demand is distributed symmetrically around its expectation. © 2006 Dagstuhl Seminar Proceedings. All rights reserved.

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：