Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 11 - 20
of
19,826
Table 1: Parameters for authentification between the network provider and the mobile endpoint.
"... In PAGE 10: ... These old custodians send any stored bundles to the mobile according to its new route mappings. Here are the contents of the control bundles: MessageType Fields Sender Receiver Callback Control Bundle DTN tuple (endpoint), DTN tuple (new custody node) CM Mobile Contact - gt; DTN DHT Update Control Bundle GUID, DTN node ID CM Mobile Contact - gt; Regional Gateway for Routing to Internet Table1 0: Contents of control bundles for updating router and custody information of endpoint engaging in near mobility. 5.... In PAGE 11: ....7.2 The DHT looks up the given GUID and responds with a control bundle containing the region information of the endpoint in question. Here are the contents of these control bundles: MessageType Fields Sender Receiver DTH Look-Up Control Bundle GUID (query), GUID (sender) DHT-AM DHT DHT Response Control Bundle GUID, DTN Region ID DHT DHT-AM Table1 1: Contents of control bundles for querying a GUID in global DHT. 5.... In PAGE 13: ....10.4 The mobile contact delivers all bundles addressed to the endpoint, terminates the connection, and replies to the custody DTN node with the state of the delivery. The parameters involved in the interactions are described below: MessageType Fields Sender Receiver Proxy Bundle Delivery (security), lt;num bundles gt;, lt;bundle size gt; lt;bundle gt; DTN Mobile Contact DTN Bundle Request (security), DTN tuple CL Mobile Contact DTN Bundle Delivery lt;num bundles gt;, lt;bundle size gt; lt;bundle gt; Mobile Contact DTN CL Table1 2: Parameters for endpoint to receive bundles from custody DTN node by proxy through a mobile contact. 5.... In PAGE 13: .... lt;contact flight path info gt; APS CM Table1... ..."
Table 3: The average number of slave nodes assigned to a node with master role. graph nodeswith piconets piconets averageslavesper
"... In PAGE 11: ... method comparing degrees of two end-points of a link. Table3 presents the average number of slave nodes assigned to a node with master role, i.... ..."
Table 1: a. The steady state beliefs for the loopy net- work in gure 8a with arbitrarily chosen local evidence probabilities. The belief of a given node being in state 0 is shown. b. The steady state beliefs in the corre- sponding unwrapped network of length 6 which includes 6 replicas of all nodes in the loopy network, except node 1 that appears once too many. Note that except at the endpoints of the unwrapped network, all beliefs are iden- tical to the corresponding ones in the loopy network. In the text we prove that if belief revision converges, a sub- sequence of arbitrary length with this property can be found.
1997
"... In PAGE 9: ... Let us consider a concrete example. Table1 a shows the steady state beliefs for the loopy network in gure 8a with arbitrarily chosen local evidence probabilities. Table 1b shows the steady state beliefs in the corresponding unwrapped network which includes 9 replicas of the nodes in the loopy network.... In PAGE 9: ... Table 1a shows the steady state beliefs for the loopy network in gure 8a with arbitrarily chosen local evidence probabilities. Table1 b shows the steady state beliefs in the corresponding unwrapped network which includes 9 replicas of the nodes in the loopy network. Note that except at the endpoints of the unwrapped net- work, all beliefs are identical to the corresponding ones in the loopy network.... ..."
Cited by 55
Table 8: Breakdown of time spent in token loss detection and fault recovery. Besides fault detection, fault recovery also includes the time to close a connection at the sender and receiver end-points. On an average, it should take around half the token cycle time to terminate the sender end-point of a connection. This is because the termination takes place when an RT token arrives. This time was measured to take 14.70 msec, which is consistent with the expected value. The receiver end-point, on the other hand, terminates as soon as it receives a connection termination message or a message that the sender end-point of its connection has crashed. The termination is done by a user daemon executing in the kernel through a system call. Closing of the receiver end was measured to take 120 sec.
1996
"... In PAGE 89: ... Depending upon when the timeout was registered, the timeout could occur any time between 30 and 40 msec later. In Table8 , the timeout occurs about 37 msec after the token was forwarded to the crashed node. The monitoring node then sends a polling message to the crashed node with a timeout value of 10 msec.... In PAGE 89: ... On an average, this timeout occurs after 9.95msec as shown in Row 2 in Table8 . After this, the token is updated and a message reporting the crash of the node is broadcast on the network.... In PAGE 89: ... Finally, any streams that have this node as either sender or receiver end-point, are terminated. As can be seen from Table8 , the actual fault processing overhead is only 177 sec and all other major components in fault detection are due to the timeout granularity. If the timeout were available with a one msec granularity, the worst case time for token loss detection would be 33 msec and for the polling timer would be 1 msec, thereby reducing the overhead to a... ..."
Cited by 10
Table 8: Breakdown of time spent in token loss detection and fault recovery. Besides fault detection, fault recovery also includes the time to close a connection at the sender and receiver end-points. On an average, it should take around half the token cycle time to terminate the sender end-point of a connection. This is because the termination takes place when an RT token arrives. This time was measured to take 14.70 msec, which is consistent with the expected value. The receiver end-point, on the other hand, terminates as soon as it receives a connection termination message or a message that the sender end-point of its connection has crashed. The termination is done by a user daemon executing in the kernel through a system call. Closing of the receiver end was measured to take 120 sec.
"... In PAGE 90: ... Depending upon when the timeout was registered, the timeout could occur any time between 30 and 40 msec later. In Table8 , the timeout occurs about 37 msec after the token was forwarded to the crashed node. The monitoring node then sends a polling message to the crashed node with a timeout value of 10 msec.... In PAGE 90: ... On an average, this timeout occurs after 9.95msec as shown in Row 2 in Table8 . After this, the token is updated and a message reporting the crash of the node is broadcast on the network.... In PAGE 90: ... Finally, any streams that have this node as either sender or receiver end-point, are terminated. As can be seen from Table8 , the actual fault processing overhead is only 177 sec and all other major components in fault detection are due to the timeout granularity. If the timeout were available with a one msec granularity, the worst case time for token loss detection would be 33 msec and for the polling timer would be 1 msec, thereby reducing the overhead to a... ..."
Table 3 Summary of endpoints
in Summary
"... In PAGE 6: ... In general, the study groups were well balanced, although vascular risk factors were slightly more prevalent in patients from intervention centres. Table3 summarizes the primary and secondary endpoint results. The intra-class correlation coeffi- cient of the estimated RRR among patients within hospitals was 0.... ..."
Table 1: Star Topology Memory Usage Method Star Size Node Count/Federate Memory Execution Time
in DEDICATION
2007
"... In PAGE 44: ... One hundred and fty TCP ow endpoints were assigned to leaf nodes, and 1MB transfers were simulated. The memory usage and execution time of each simulation is shown in Table1 . Since in this experiment, all federates model an identical subnetwork, results are only shown for federate zero.... ..."
Table 2. edge class. endpoints
"... In PAGE 10: ... Table2 : Classi cation of vertices from edge classi cation. The classi cation of the endpoints of edges, in turn, determines where the vertices of P must lie.... ..."
Table 2. edge class. endpoints
"... In PAGE 10: ... Table2 : Classi cation of vertices from edge classi cation. The classi cation of the endpoints of edges, in turn, determines where the vertices of P must lie.... ..."
Table 1 Definition of Endpoint Calculations
"... In PAGE 24: ... The StO2 data file for each leg of each patient was processed to obtain specific endpoints. Definitions of the endpoints are shown in Table1 . The choice of endpoints was based on clinical observations and on results of previous studies in the litera- ture.... In PAGE 36: ... Each NIRS data file contained marks to indicate the start and stop of tread- mill exercise. The NIRS data file for each leg of each patient was processed to obtain specific endpoints, based on results as published in earlier studies ( Table1 ).18-20 The analysis was performed in the same manner as published... In PAGE 52: ...indows. Differences were accepted as statistically significant with p lt; 0.05. Results Seventeen healthy volunteers with dark skin pigmentation participated in the study. Table1 shows their characteristics. In six cases only the new software- version was used and in eleven both the old and new software were used simultaneously, so that 28 logs from 17 volunteers were available for analysis.... In PAGE 66: ... This indicates that the overall level of activity in the whole group had decreased significantly (paired T-test, p lt;0.05) ( Table1 ). This fall in activity level was even more clearly in those patients who refused fasciotomy (10421 (index) vs.... In PAGE 87: ...1 prostate carcinoma lap. radical 7 hours 65 50 prostatectomy Legend Table1 : Patient characteristics. IPAA: Proctocolectomy and ileal pouch anal anastomosis BMI: body mass index INRA: ileo-neorectal anastomosis23 FAP: familial adenomatous polyposis... ..."
Results 11 - 20
of
19,826
