Dynamic contrast-enhanced magnetic resonance imaging as a biomarker for the pharmacological response of PTK787/ZK 222584, an inhibitor of the vascular endothelial growth factor receptor tyrosine kinases, in patients with advanced colorectal cancer and liver metastases: Results from two phase I studies

Purpose: PTK787/ZK 222584 (PTK/ZK), an orally active inhibitor of vascular endothelial growth factor (VEGF) receptor tyrosine kinases, inhibits VEGF-mediated angiogenesis. The pharmacodynamic effects of PTK/ZK were evaluated by assessing changes in contrast-enhancement parameters of metastatic liver lesions using dynamic contrast-enhanced magnetic resonance imaging (DCE-MRI) in patients with advanced colorectal cancer treated in two ongoing, dose-escalating phase I studies. Patients and Methods: Twenty-six patients had DCE-MRI performed at baseline, day 2, and at the end of each 28-day cycle. Doses of oral PTK/ZK ranged from 50 to 2000 mg once daily. Tumor permeability and vascularity were assessed by calculating the bidirectional transfer constant (Ki). The percentage of baseline Ki (% of baseline Ki) at each time point was compared with pharmacokinetic and clinical end points. Results: A significant negative correlation exists between the % of baseline Ki and increase in PTK/ZK oral dose and plasma levels (P = .01 for oral dose; P = .0001 for area under the plasma concentration curve at day 2). Patients with a best response of stable disease had a significantly greater reduction in Ki at both day 2 and at the end of cycle 1 compared with progressors (mean difference in % of baseline Ki, 47%, P = .004%; and 51%, P = .006; respectively). The difference in % of baseline Ki remained statistically significant after adjusting for baseline WHO performance status. Conclusion: These findings should help to define a biologically active dose of PTK/ZK. These results suggest that DCE-MRI may be a useful biomarker for defining the pharmacological response and dose of angiogenesis inhibitiors, such as PTK/ZK, for further clinical development. © 2003 by American Society of Clinical Oncology.

Demand response to improved walking infrastructure: A study into the economics of walking and health behaviour change

Walking is the most common form of moderate‐intensity physical activity among adults, is widely accessible and especially appealing to obese people. Most often policy makers are interested in valuing the effect on walking of changes in some characteristics of a neighbourhood, the demand response for walking, of infrastructure changes. A positive demand response to improvements in the walking environment could help meet the public health target of 150 minutes of at least moderate‐intensity physical activity per week. We model walking in an individual’s local neighbourhood as a ‘weak complement’ to the characteristics of the neighbourhood itself. Walking is affected by neighbourhood
characteristics, substitutes, and individual’s characteristics, including their opportunity cost of time.  Using compensating variation, we assess the economic benefits of walking and how walking behaviour is affected by improvements to the neighbourhood.  Using a sample of 1,209 respondents surveyed over a 12 month period (Feb 2010‐Jan 2011) in East Belfast, United Kingdom, we find that a policy that increased walkability and people’s perception of access to shops and facilities  would lead to an increase in walking of about 36 minutes/person/week, valued at £13.65/person/week. When focusing on inactive residents, a policy that improved the walkability of the area would lead to guidelines for physical activity being reached by only 12.8% of the population who are currently inactive. Additional interventions would therefore be needed to encourage inactive residents to
achieve the recommended levels of physical activity, as it appears that interventions that improve the walkability of an area are particularly effective in increasing walking among already active citizens, and, among the inactive ones, the best response is found among healthier, younger and wealthier citizens.

Treatment with the HIV protease inhibitor Nelfinavir triggers the unfolded protein response and may overcome proteasome inhibitor resistance of multiple myeloma in combination with bortezomib: a phase I trial (SAKK 65/08).

Downregulation of the unfolded protein response mediates proteasome inhibitor resistance in Multiple Myeloma.The Human Immunodeficieny Virus protease inhibitor nelfinavir activates the unfolded protein response in vitro. We determined dose limiting toxicity and recommended dose for phase II of nelfinavir in combination with the proteasome inhibitor bortezomib. 12 patients with advanced hematological malignancies were treated with nelfinavir (2500 - 5000 mg/d p.o., d 1-14, 3+3 dose escalation) and bortezomib (1.3 mg/m2, d 1, 4, 8, 11; 21 day cycles). A run in phase with nelfinavir monotherapy allowed pharmakokinetic/pharmakodynamic assessment of nelfinavir in the presence or absence of concomittant bortezomib. Endpoints included dose limiting toxicity, activation of the unfolded protein response, proteasome activity, toxicity and response to trial treatment. Nelfinavir 2 x 2500 mg was the recommended phase II dose identified. Nelfinavir alone significantly upregulated expression of proteins related to the unfolded protein response in peripheral blood mononuclear cells and inhibited proteasome activity. Of 10 evaluable patients in the dose escalation cohort, 3 achieved a partial response, 4 stable disease for ≥ 2 cycles, while 3 had progressive disease as best response. In an exploratory extension cohort with 6 relapsed, bortezomib-refractory, lenalidomide-resistant myeloma patients treated at the recommended phase II dose, 3 reached a partial response, 2 a minor response and one progressive disease. The combination of nelfinavir with bortezomib is safe and shows promising signals for activity in advanced, bortezomib-refractory MM. Induction of the unfolded protein response by nelfinavir may overcome the biological features of proteasome inhibitor resistance. (Trial registration NCT01164709).

Response toolkit to provide an active response against intrusions using Ontology-Based IRS

Los sistemas de respuesta activa tienen por objetivo ejecutar una respuesta en contra de una intrusión de forma automática. Sin embargo, ejecutar una respuesta automáticamente no es una tarea trivial ya que el costo de ejecutar una respuesta podría ser más grande que el efecto que cause la intrusión propiamente dicha. También, el sistema debe contar con un amplio conjunto de acciones de respuesta y un algoritmo que seleccione la respuesta óptima. Este artículo propone un toolkit de respuestas que será integrado a un IRS basado en Ontologías para permitir la ejecución automática de la mejor respuesta cuando una intrusión es detectada. Se presenta un conjunto de respuestas basadas en host y basadas en red que pueden ser ejecutadas por el IRS, dicha ejecución es llevada a cabo mediante agentes basados en plugins que han sido distribuidos en la red. Finalmente, se realiza la verificación del sistema propuesto, tomando como caso de uso un ataque de defacement obteniéndose resultados satisfactorios.

Bidding Dynamics of Rational Advertisers in Sponsored Search Auctions on the Web

In this paper, we address a key problem faced by advertisers in sponsored search auctions on the web: how much to bid, given the bids of the other advertisers, so as to maximize individual payoffs? Assuming the generalized second price auction as the auction mechanism, we formulate this problem in the framework of an infinite horizon alternative-move game of advertiser bidding behavior. For a sponsored search auction involving two advertisers, we characterize all the pure strategy and mixed strategy Nash equilibria. We also prove that the bid prices will lead to a Nash equilibrium, if the advertisers follow a myopic best response bidding strategy. Following this, we investigate the bidding behavior of the advertisers if they use Q-learning. We discover empirically an interesting trend that the Q-values converge even if both the advertisers learn simultaneously.

Forming Networks of Strategic Agents with Desired Topologies

Many networks such as social networks and organizational networks in global companies consist of self-interested agents. The topology of these networks often plays a crucial role in important tasks such as information diffusion and information extraction. Consequently, growing a stable network having a certain topology is of interest. Motivated by this, we study the following important problem: given a certain desired network topology, under what conditions would best response (link addition/deletion) strategies played by self-interested agents lead to formation of a stable network having that topology. We study this interesting reverse engineering problem by proposing a natural model of recursive network formation and a utility model that captures many key features. Based on this model, we analyze relevant network topologies and derive a set of sufficient conditions under which these topologies emerge as pairwise stable networks, wherein no node wants to delete any of its links and no two nodes would want to create a link between them.

Sufficient conditions for formation of a network topology by self-interested agents

Networks such as organizational network of a global company play an important role in a variety of knowledge management and information diffusion tasks. The nodes in these networks correspond to individuals who are self-interested. The topology of these networks often plays a crucial role in deciding the ease and speed with which certain tasks can be accomplished using these networks. Consequently, growing a stable network having a certain topology is of interest. Motivated by this, we study the following important problem: given a certain desired network topology, under what conditions would best response (link addition/deletion) strategies played by self-interested agents lead to formation of a pairwise stable network with only that topology. We study this interesting reverse engineering problem by proposing a natural model of recursive network formation. In this model, nodes enter the network sequentially and the utility of a node captures principal determinants of network formation, namely (1) benefits from immediate neighbors, (2) costs of maintaining links with immediate neighbors, (3) benefits from indirect neighbors, (4) bridging benefits, and (5) network entry fee. Based on this model, we analyze relevant network topologies such as star graph, complete graph, bipartite Turan graph, and multiple stars with interconnected centers, and derive a set of sufficient conditions under which these topologies emerge as pairwise stable networks. We also study the social welfare properties of the above topologies.

Effect of choice of basis functions in neural network for capturing unknown function for dynamic inversion control

The basic requirement for an autopilot is fast response and minimum steady state error for better guidance performance. The highly nonlinear nature of the missile dynamics due to the severe kinematic and inertial coupling of the missile airframe as well as the aerodynamics has been a challenge for an autopilot that is required to have satisfactory performance for all flight conditions in probable engagements. Dynamic inversion is very popular nonlinear controller for this kind of scenario. But the drawback of this controller is that it is sensitive to parameter perturbation. To overcome this problem, neural network has been used to capture the parameter uncertainty on line. The choice of basis function plays the major role in capturing the unknown dynamics. Here in this paper, many basis function has been studied for approximation of unknown dynamics. Cosine basis function has yield the best response compared to any other basis function for capturing the unknown dynamics. Neural network with Cosine basis function has improved the autopilot performance as well as robustness compared to Dynamic inversion without Neural network.

Necessary and sufficient conditions for optimality in constrained general sum stochastic games

In this paper we first derive a necessary and sufficient condition for a stationary strategy to be the Nash equilibrium of discounted constrained stochastic game under certain assumptions. In this process we also develop a nonlinear (non-convex) optimization problem for a discounted constrained stochastic game. We use the linear best response functions of every player and complementary slackness theorem for linear programs to derive both the optimization problem and the equivalent condition. We then extend this result to average reward constrained stochastic games. Finally, we present a heuristic algorithm motivated by our necessary and sufficient conditions for a discounted cost constrained stochastic game. We numerically observe the convergence of this algorithm to Nash equilibrium. (C) 2015 Elsevier B.V. All rights reserved.

Learning in Network Games

We report the findings of an experiment designed to study how people learn and make decisions in network games. Network games offer new opportunities to identify learning rules, since on networks (compared to e.g. random matching) more rules differ in terms of their information requirements. Our experimental design enables us to observe both which actions participants choose and which information they consult before making their choices. We use this information to estimate learning types using maximum likelihood methods. There is substantial heterogeneity in learning types. However, the vast majority of our participants' decisions are best characterized by reinforcement learning or (myopic) best-response learning. The distribution of learning types seems fairly stable across contexts. Neither network topology nor the position of a player in the network seem to substantially affect the estimated distribution of learning types.

Gold nanoparticle-based near-infrared fluorescent detection of biological thiols in human plasma

In this work, a new fluorescent method for sensitive detection of biological thiols in human plasma was developed using a near-infrared (NIR) fluorescent dye, FR 730. The sensing approach was based on the strong affinity of thiols to gold and highly efficient fluorescent quenching ability of gold nanoparticles (Au NPs). In the presence of thiols, the NIR fluorescence would enhance dramatically due to desorption of FR 730 from the surfaces of Au NPs, which allowed the analysis of thiol-containing amino acids in a very simple approach. The size of Au NPs was found to affect the fluorescent assay and the best response for cysteine detection was achieved when using Au NPs with the diameter of 24 nm, where a linear range of 2.5 x 10(-8) M to 4.0 x 10(-6) M and a detection limit of as low as 10 nM was obtained. This method also demonstrated a high selectivity to thiol-containing amino acids due to the strong affinity of thiols to gold.

Overlay Network Creation and Maintenance with Selfish Users

Overlay networks have been used for adding and enhancing functionality to the end-users without requiring modifications in the Internet core mechanisms. Overlay networks have been used for a variety of popular applications including routing, file sharing, content distribution, and server deployment. Previous work has focused on devising practical neighbor selection heuristics under the assumption that users conform to a specific wiring protocol. This is not a valid assumption in highly decentralized systems like overlay networks. Overlay users may act selfishly and deviate from the default wiring protocols by utilizing knowledge they have about the network when selecting neighbors to improve the performance they receive from the overlay. This thesis goes against the conventional thinking that overlay users conform to a specific protocol. The contributions of this thesis are threefold. It provides a systematic evaluation of the design space of selfish neighbor selection strategies in real overlays, evaluates the performance of overlay networks that consist of users that select their neighbors selfishly, and examines the implications of selfish neighbor and server selection to overlay protocol design and service provisioning respectively. This thesis develops a game-theoretic framework that provides a unified approach to modeling Selfish Neighbor Selection (SNS) wiring procedures on behalf of selfish users. The model is general, and takes into consideration costs reflecting network latency and user preference profiles, the inherent directionality in overlay maintenance protocols, and connectivity constraints imposed on the system designer. Within this framework the notion of user’s "best response" wiring strategy is formalized as a k-median problem on asymmetric distance and is used to obtain overlay structures in which no node can re-wire to improve the performance it receives from the overlay. Evaluation results presented in this thesis indicate that selfish users can reap substantial performance benefits when connecting to overlay networks composed of non-selfish users. In addition, in overlays that are dominated by selfish users, the resulting stable wirings are optimized to such great extent that even non-selfish newcomers can extract near-optimal performance through naïve wiring strategies. To capitalize on the performance advantages of optimal neighbor selection strategies and the emergent global wirings that result, this thesis presents EGOIST: an SNS-inspired overlay network creation and maintenance routing system. Through an extensive measurement study on the deployed prototype, results presented in this thesis show that EGOIST’s neighbor selection primitives outperform existing heuristics on a variety of performance metrics, including delay, available bandwidth, and node utilization. Moreover, these results demonstrate that EGOIST is competitive with an optimal but unscalable full-mesh approach, remains highly effective under significant churn, is robust to cheating, and incurs minimal overheads. This thesis also studies selfish neighbor selection strategies for swarming applications. The main focus is on n-way broadcast applications where each of n overlay user wants to push its own distinct file to all other destinations as well as download their respective data files. Results presented in this thesis demonstrate that the performance of our swarming protocol for n-way broadcast on top of overlays of selfish users is far superior than the performance on top of existing overlays. In the context of service provisioning, this thesis examines the use of distributed approaches that enable a provider to determine the number and location of servers for optimal delivery of content or services to its selfish end-users. To leverage recent advances in virtualization technologies, this thesis develops and evaluates a distributed protocol to migrate servers based on end-users demand and only on local topological knowledge. Results under a range of network topologies and workloads suggest that the performance of the distributed deployment is comparable to that of the optimal but unscalable centralized deployment.

Implications of Selfish Neighbor Selection in Overlay Networks

In a typical overlay network for routing or content sharing, each node must select a fixed number of immediate overlay neighbors for routing traffic or content queries. A selfish node entering such a network would select neighbors so as to minimize the weighted sum of expected access costs to all its destinations. Previous work on selfish neighbor selection has built intuition with simple models where edges are undirected, access costs are modeled by hop-counts, and nodes have potentially unbounded degrees. However, in practice, important constraints not captured by these models lead to richer games with substantively and fundamentally different outcomes. Our work models neighbor selection as a game involving directed links, constraints on the number of allowed neighbors, and costs reflecting both network latency and node preference. We express a node's "best response" wiring strategy as a k-median problem on asymmetric distance, and use this formulation to obtain pure Nash equilibria. We experimentally examine the properties of such stable wirings on synthetic topologies, as well as on real topologies and maps constructed from PlanetLab and AS-level Internet measurements. Our results indicate that selfish nodes can reap substantial performance benefits when connecting to overlay networks composed of non-selfish nodes. On the other hand, in overlays that are dominated by selfish nodes, the resulting stable wirings are optimized to such great extent that even non-selfish newcomers can extract near-optimal performance through naive wiring strategies.

Effect of Selfish Node Behavior on Efficient Topology Design

The problem of topology control is to assign per-node transmission power such that the resulting topology is energy efficient and satisfies certain global properties such as connectivity. The conventional approach to achieve these objectives is based on the fundamental assumption that nodes are socially responsible. We examine the following question: if nodes behave in a selfish manner, how does it impact the overall connectivity and energy consumption in the resulting topologies? We pose the above problem as a noncooperative game and use game-theoretic analysis to address it. We study Nash equilibrium properties of the topology control game and evaluate the efficiency of the induced topology when nodes employ a greedy best response algorithm. We show that even when the nodes have complete information about the network, the steady-state topologies are suboptimal. We propose a modified algorithm based on a better response dynamic and show that this algorithm is guaranteed to converge to energy-efficient and connected topologies. Moreover, the node transmit power levels are more evenly distributed, and the network performance is comparable to that obtained from centralized algorithms.

Phase I study of GSK461364, a specific and competitive Polo-like Kinase 1 (PLK1) inhibitor in patients with advanced solid malignancies.

Purpose: GSK461364 is an ATP-competitive inhibitor of polo-like kinase 1 (Plk1). A phase I study of two schedules of intravenous GSK461364 was conducted. Experimental Design: GSK461364 was administered in escalating doses to patients with solid malignancies by two schedules, either on days 1, 8, and 15 of 28-day cycles (schedule A) or on days 1, 2, 8, 9, 15, and 16 of 28-day cycles (schedule B). Assessments included pharmacokinetic and pharmacodynamic profiles, as well as marker expression studies in pretreatment tumor biopsies. Results: Forty patients received GSK461364: 23 patients in schedule A and 17 in schedule B. Dose-limiting toxicities (DLT) in schedule A at 300 mg (2 of 7 patients) and 225 mg (1 of 8 patients) cohorts included grade 4 neutropenia and/or grade 3–4 thrombocytopenia. In schedule B, DLTs of grade 4 pulmonary emboli and grade 4 neutropenia occurred at 7 or more days at 100 mg dose level. Venous thrombotic emboli (VTE) and myelosuppression were the most common grade 3–4, drug-related events. Pharmacokinetic data indicated that AUC (area under the curve) and C max (maximum concentration) were proportional across doses, with a half-life of 9 to 13 hours. Pharmacodynamic studies in circulating tumor cells revealed an increase in phosphorylated histone H3 (pHH3) following drug administration. A best response of prolonged stable disease of more than 16 weeks occurred in 6 (15%) patients, including 4 esophageal cancer patients. Those with prolonged stable disease had greater expression of Ki-67, pHH3, and Plk1 in archived tumor biopsies. Conclusions: The final recommended phase II dose for GSK461364 was 225 mg administered intravenously in schedule A. Because of the high incidence (20%) of VTE, for further clinical evaluation, GSK461364 should involve coadministration of prophylactic anticoagulation.