Reduced in vitro clot lysis and release of more active platelet PAI-1 in polycythemia vera and essential thrombocythemia

The accuracy of image to patient registration is a critical issue in the intraoperative use of frameless stereotaxic instruments for surgical guidance. This study was performed to assess the accuracy of image to head phantom registration using several standard registration techniques and a clinical frameless stereotaxic instrument. Two types of radioopaque fiducial markers were fixed to a plastic head phantom, and a computed tomography scan of the phantom was performed in the routine fashion. Image to phantom registration was carried out using fiducial markers, fiducial markers plus surface fit, anatomic landmarks, and anatomic landmarks plus surface fit. After each registration, linear inaccuracy measurements were performed for each of 32 markers. Each registration was performed 10 times, and the overall mean error measurements and anterior and posterior error were computed and compared. The overall mean error was smallest for the fiducial registration alone (2.07 mm). The magnitude of error increased significantly for posterior locations for all other registration techniques, but it was not significantly increased for the fiducial registration method. For this hardware configuration, registration with surface-applied fiducial markers is measurably more accurate than registration with surface anatomic landmarks. The addition of surface points to the fiducial registration does not increase the registration accuracy but, in fact, increases the degree of error.     

Modeling and Analysis of Broadband Cellular Networks with Multimedia Connections

As mobile networking is moving towards the direction of providing high-speed multimedia services, the presence of connections that do not generate traffic at constant rate is becoming reality in wireless environment. For preliminary network design purposes analytical models are necessary that examine the performance or wireless networks with such connections. In this paper an analytical method is presented to calculate call-level system parameters of cellular networks with multimedia connections. The method is based on an approximate recursive calculation. The accuracy of the approximation is verified by computer simulations. The derivation of the distributions of user describing time variables and two simple admission control policies are also presented and investigated.     

Scalable Schemes for Call Admission and Handover in Cellular Networks with Multiple Services

The introduction of new service categories withdifferent bandwidth requirements, e.g., data and multimedia, to cellularmobile radio networks makes many of the traditional mechanisms for controlingtraffic unusable orless efficient. The call admission and the handover handling are of the mostsensitive issues in this extension to new services. The performance of allservices includingthe traditional voice and the new services can be dramatically affected ifappropriate schemes are not used. In this paper, we propose call admission andhandover handling schemes for a cellular mobile network that offers twoservice types: voice and data. The data connections are assumed to transmitatdifferent transmission rates that are integer multiples to that of one radiochannel. In the case of congestion, the base station asks the active dataconnections to reduce their transmission rate in order to provide freechannels for the newly arrived request of both service types. This isbasically intended for incoming handover requests. The request will berejected if the transmission rate of the active connections reaches a givenminimum rate. Similar mechanism can also be used for new call arrivals, butsome priority can be given to handovers by setting a higher transmission ratethreshold for the new call rejection. As an extension to the proposedscalability, aqueuing of new calls is also proposed and analyzed. Analytical models werebuilt for the two proposed schemes together with the traditional channelreservation scheme. The effect of different traffic and configurationparameters on the performance measures like the grade of service, blockingprobabilities, and utilization, are studied using the proposed technique.Results show that the proposed schemes provide very good performance and morefairness among the different service types.     

Extension of some MAP results to transient MAPs and Markovian binary trees

In this work we extend previous results on moment-based characterization and minimal representation of stationary Markovian arrival processes (MAPs) and rational arrival processes (RAPs) to transient Markovian arrival processes (TMAPs) and Markovian binary trees (MBTs).     

Network Awareness of P2P Live Streaming Applications: A Measurement Study

Early P2P-TV systems have already attracted millions of users, and many new commercial solutions are entering this market. Little information is however available about how these systems work, due to their closed and proprietary design. In this paper, we present large scale experiments to compare three of the most successful P2P-TV systems, namely PPLive, SopCast and TVAnts. Our goal is to assess what level of "network awareness" has been embedded in the applications. We first define a general framework to quantify which network layer parameters leverage application choices, i.e., what parameters mainly drive the peer selection and data exchange. We then apply the methodology to a large dataset, collected during a number of experiments where we deployed about 40 peers in several European countries. From analysis of the dataset, we observe that TVAnts and PPLive exhibit a mild preference to exchange data among peers in the same autonomous system the peer belongs to, while this clustering effect is less intense in SopCast. However, no preference versus country, subnet or hop count is shown. Therefore, we believe that next-generation P2P live streaming applications definitively need to improve the level of network-awareness, so to better localize the traffic in the network and thus increase their network-friendliness as well.     

N‐Methyl‐Substituted Fluorescent DAG–Indololactone Isomers Exhibit Dramatic Differences in Membrane Interactions and Biological Activity

N‐methyl‐substituted diacylglycerol–indololactones (DAG–indololactones) are newly synthesized effectors of protein kinase C (PKC) isoforms and exhibit substantial selectivity between RasGRP3 and PKCα. We present a comprehensive analysis of membrane interactions and biological activities of several DAG–indololactones. Translocation and binding activity assays underline significant variations between the PKC translocation characteristics affected by the ligands as compared to their binding activities. In parallel, the fluorescent properties of the ligands were employed for analysis of their membrane association profiles. Specifically, we found that a slight change in the linkage to the indole ring resulted in significant differences in membrane binding and association of the DAG–indololactones with lipid bilayers. Our analysis shows that seemingly small structural modifications of the hydrophobic regions of these biomimetic PKC effectors contribute to pronounced modulation of membrane interactions of the ligands.     

Some phorbol esters might partially resemble bryostatin 1 in their actions on LNCaP prostate cancer cells and U937 leukemia cells

Phorbol 12‐myristate 13‐acetate (PMA) and bryostatin 1 are both potent protein kinase C (PKC) activators. In LNCaP human prostate cancer cells, PMA induces tumor necrosis factor alpha (TNFα) secretion and inhibits proliferation; bryostatin 1 does not, and indeed blocks the response to PMA. This difference has been attributed to bryostatin 1 not localizing PKCδ to the plasma membrane. Since phorbol ester lipophilicity influences PKCδ localization, we have examined in LNCaP cells a series of phorbol esters and related derivatives spanning some eight logs in lipophilicity (logP) to see if any behave like bryostatin 1. The compounds showed marked differences in their effects on proliferation and TNFα secretion. For example, maximal responses for TNFα secretion relative to PMA ranged from 97 % for octyl‐indolactam V to 24 % for phorbol 12,13‐dibenzoate. Dose–response curves ranged from monophasic for indolactam V to markedly biphasic for sapintoxin D. The divergent patterns of response, however, correlated neither to lipophilicity, to plasma membrane translocation of PKCδ, nor to the ability to interact with model membranes. In U937 human leukemia cells, a second system in which PMA and bryostatin 1 have divergent effects, viz. PMA but not bryostatin 1 inhibits proliferation and induces attachment, all the compounds acted like PMA for proliferation, but several induced a reduced level or a biphasic dose–response curve for attachment. We conclude that active phorbol esters are not all equivalent. Depending on the system, some might partially resemble bryostatin 1 in their behavior; this encourages the concept that bryostatin‐like behavior may be obtained from other structural templates.     

Link Capacity Sharing between Guaranteed- and Best Effort Services on an ATM Transmission Link under GoS Constraints

While link allocation policies in multi-rate circuit switched loss models have drawn much attention in recent years, it is still an open question how to share the link capacity between service classes in a fair manner. In particular, when an ATM link is offered calls from service classes with/without strict QoS guarantees one is interested in link capacity sharing policies that maximize throughput and keep the per-class blocking probabilities under some GoS constraints. In this paper we propose a model and associated computational technique for an ATM transmission link to which CBR/VBR and ABR classes offer calls. We also propose a simple link allocation rule which takes into account blocking probability constraints for the CBR/VBR calls and a throughput constraint for the ABR calls and attempts to minimize the blocking probability of ABR calls. Numerical examples demonstrate the effectiveness of the policy and of the applied computational technique.