John Fitzgerald. Private Communication. March 1993.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....example is spatial decomposition in which state variables are distributed among processors, and as new states are accepted, they are broadcast to other processors. But no one method will work on all problems. In one of our test problems, the gene circuit problem, the above methods fail to converge [45]. These diculities show the importance of having a general purpose parallel algorithm. We introduce a new class of algorithms for parallel SA that we make to be problem independent, in the sense that if a problem can be solved by serial SA, it can be solved by our parallelization method. Our ....

.... stats[32] l vari; stats[33] l estimate mean; stats[34] l estimate sd; stats[35] l alpha; stats[36] l acc ratio; stats[37] l vsyy; stats[38] l vsxy; stats[39] l vsxx; stats[40] l vsx; stats[41] l vsy; stats[42] l vsum; stats[43] l D; stats[44] l E; stats[45] = l usyy; stats[46] l usxy; stats[47] l usxx; stats[48] l usx; stats[49] l usy; stats[50] l usum; stats[51] l A; stats[52] l B; stats[53] l mean2; stats[54] l vari2; stats[55] l estimate mean2; stats[56] l estimate sd2; stats[57] l alpha2; stats[58] ....

[Article contains additional citation context not shown here]

John Reinitz and George Marnellos. Private communication.

....routing. The multicast cost sharing problem is a mechanism design problem that was first in3 troduced by Feigenbaum et al. FPS01] and has since been studied by many researchers, including Jain and Vazirani [JV01] Adler and Rubenstein [AR02] Fiat et al. FGHK02] and Mitchell and Teague [MT02] The problem is described in detail in Chapter 3; here, we only outline it in brief. The problem is as follows: There is some digital content (say, a movie) at one node of the network and a set of users who are potentially interested in receiving that content. The content can be delivered to any ....

....multicast transmissions. In the first paper on the topic, Herzog et al. HSE97] considered axiomatic and implementation aspects of the problem. Subsequently, Moulin and Shenker [MS01] studied the problem from a purely economic point of view. Several more recent papers [FPS01, AR02, FGHK02, MT02] adopt the distributed algorithmic mechanism design approach, which augments a game theoretic perspective with distributed computational concerns. In this chapter, we extend the results of [FPS01] by considering a more general computational model and approximate solutions. We also extend a ....

[Article contains additional citation context not shown here]

John Mitchell and Vanessa Teague, 2002. Private communication.

....of the tones [7] Generally, the OFDM system is designed so that the cyclic extension is a small percentage of the total symbol length. This paper discusses channel estimation techniques in wireless OFDM systems, that use this property of the channel impulse response. Hoeher [6] and Cio# [8] have also addressed this property. In Section II, we describe the system model. Section III discusses the minimum mean square error (MMSE) and least squares (LS) channel estimators. The MMSE estimator has good performance but high complexity. The LS estimator has low complexity, but its ....

....The LS estimator does not use the statistics of the channel. Intuitively, excluding low energy taps of g will to some extent compensate for this shortcoming since the energy of g decreases rapidly outside the first L taps, whilst the noise energy is assumed to be constant over the entire range [6, 8]. Taking only the first L taps of g into account, thus implicitly using channel statistics, the modified LS estimator becomes h LS = TQ # LS T Q # LS = T XT) 17) The modified LS estimator also has the structure as shown in Fig. 5. C. Estimator Complexity The complexity of ....

John M. Cio#, Stanford University, Private communication.

....the existing collection of mock objects provided by the MockObjects project framework, but is about tools for creating new mock objects. Keywords Mock objects, unit testing, testing. INTRODUCTION If a collection of rocks is a rockery, a collection of mock objects must be a mockery. [1] Mock objects[2] are used by many Extreme Programmers [3] Some programmers consider them to require too much extra coding or to be too difficult. One of the features of the mock object approach is that mock objects, known as mocks in this paper, have uniform functionality and predictable code. ....

John Nolan, private communication, 2001.

....a debugger. In trying to elicit various behaviors, the user may click in a client window that establishes a synchronous passive grab while the debugger has the client paused. Mouse and keyboard event processing freezes, and the user loses control. The situation in the Sprite operating system [5] is even worse. When a program crashes, Sprite doesn t dump core, but leaves the program halted under a special debugging process. This makes much more context available than post mortem debuggers provide for example, the user can see the contents of the X windows that the program owns. Of ....

John Ousterhout. Private communication.

....to a MIX network using a Dc Net. In this setting, even if the MIX network security is violated, the attacker can only ascertain that the sender a given message is one of the parties using the Dc Net. 4. 2 MIX Network A comprehensive listing of attacks against MIX networks is discussed in [3, 9, 14, 15, 23, 27, 28, 33, 36, 38, 45]. Message Coding Attack The MIX network provides protection using public key cryptography against message coding attack. Timing Attack An attacker having access to just one of the communicating parties might be able to infer which route is taken by simply computing the round trip time. ....

....attacker might be able to rule out some routes (e.g. if a message exits the MIX network faster than the minimum time needed to go through some routes then these routes can be ruled out) Hence, the minimum time needed to go through each route should be the same. This kind of attack is mentioned in [27, 33] The Chaum s MIX network provides protection against timing attack, but it causes high delay. Recently, the MIX network has been improved by means of dummy traffic and chop and slice algorithm. Message Volume Attack The Attacker could distinguish the messages sent by a MIX, if they would be ....

[Article contains additional citation context not shown here]

John Kelsey. Private Communication, 1999.

....a TCP acknowledgement problem is to consider algorithms which probabilistically vary the amount of latency they tolerate until an acknowledgment is performed. Unfortunately, Noga and Seiden have shown that the most natural variants of such algorithms do not give an e= e Gamma 1) competitive ratio [12]. The key to our solution is to define a one parameter family of deterministic online algorithms Az , where 0 z 1, that measures cost that can be directly charged to the optimal offline algorithm. Algorithm Az is defined as follows: Let P (t; t 0 ) be the set of packets that arrive between ....

John Noga and Steven S. Seiden. Private Communication.

....online without knowledge of when future arrivals will occur. Dooly et al. showed that the natural algorithm which waits until the latency since the previous acknowledgement equals the cost of the acknowledgement has a competitive ratio of 2. Subsequently, Seiden [13] and independently Noga [11], obtained a lower bound of e= e Gamma1) on the competitive ratio of randomized online algorithms for this problem. A matching upper bound remained elusive, and in fact no randomized algorithm was known to beat the 2 competitive ratio achieved by the deterministic algorithm. The variant of the ....

John Noga. Private Communication.

....a TCP acknowledgement problem is to consider algorithms which probabilistically vary the amount of latency they tolerate until an acknowledgment is performed. Unfortunately, Noga and Seiden have shown that the most natural variants of such algorithms do not give an e= e Gamma 1) competitive ratio [12]. The key to our solution is to define a one parameter family of deterministic online algorithms Az , where 0 z 1, that measures cost that can be directly charged to the optimal offline algorithm. Algorithm Az is defined as follows: Let P (t; t 0 ) be the set of packets that arrive between ....

John Noga and Steven S. Seiden. Private Communication.

....times must be chosen online without knowledge of when future arrivals will occur. Dooly et al. showed that the natural algorithm which waits until the latency since the previous acknowledgement equals the cost of the acknowledgement is 2 . Subsequently, Seiden [13] and independently Noga [11], got a lower bound of e= e Gamma 1) on the competitive ratio of randomized online algorithms for this problem. A matching upper bound remained elusive, and in fact no randomized algorithm was known to beat the 2competitive ratio achieved by the deterministic algorithm. The variant of the ....

John Noga. Private Communication.

....a generalization of monads. His motivating application is the design of a CGI library that implements sessions. Indeed, the functionality of his library was the major source of inspiration for our work. Our work indicates that monads are sucient to implement sessions (Hughes also realized that [10]) Furthermore, it extends the functionality o ered by the arrow CGI library with a novel representation of HTML, compositional forms, and graphics. Also, the callback style of programming advocated here is not encouraged by the arrow library. Hanus s library [8] for server side scripting in the ....

John Hughes. Private communication, September 2000.

....different from the one I implemented. Sprite keeps track of the first dirty time for the oldest dirty block of each file. Every five seconds, it scans all the dirty files in its cache, and if a file s oldest dirty block is more than 30 seconds old, all of the file s dirty blocks are written back [4]. 2 Actually, instead of creating a true system call, I added an ioctl request, since this involved writing less code. The net effect should be identical. I added one more ioctl, to write file system meta data to disk; this can be called once every 30 seconds, to preserve existing sync( ....

John Hartman. Private communication. 1993.

....utilized the same 53rd harmonic quad family (with opposite polarity) as used in MI 52 resonant extraction for test beams to the existing Experimental Areas. The quad circuits are pulsed in a half sine wave to produce a spill with a minimum duration of roughly 1 ms (100 turns) as shown in Figure 6 [10]. For this design, an initial normalized emittance at 120 GeV c prior to extraction is assumed to be 30 mm mr in both planes. An ensemble of 1000 particles are tracked through the MI during extraction. Figure 7 shows the normalized phase space of the the beam midway through extraction at the ....

John Johnstone, private communication.

....a worst case scenario; if clients are allowed to cache attributes of files that they do not currently have open (see section 10) the potential size of the state table could be proportional to the number of files in the server s file system multiplied by the number of clients. John Ousterhout [21] has suggested that if the server runs out of space in its state table, it could select certain entries (perhaps using an LRU scheme) to be discarded. Before discarding an entry, the server would inform the relevant clients via a callback RPC. Clients with cached dirty data would have to write it ....

John Ousterhout. Private communication. 1992.

....IPU and PU perform identically. Sprite originally used a modified version of the PU policy [19] It now uses a policy similar to IPU: every five seconds, the system iterates over modified files and writes out all the cached blocks of any file whose oldest dirty block is at least 30 seconds old [10]. The motivation behind this version of the IPU policy was not, apparently, to reduce read latency by reducing peak queue length, but rather to maximize the average write back delay without increasing the worst case exposure to crashes. Increasing write back delay should improve performance if, ....

John H. Hartman. Private communication. 1993.

....full scale fin target described in the Task C IHEP Report [1] taking into account distributions of the proton beam obtained from more detail simulations of the MI extracting system. The phase space distribution of the proton beam (x,x 0 ,y,y 0 ,p; total number of particles is equal to 100000) [2] at the input of the electrostatic septum was used by TURTLE code for simulation of beam parameters in the target. Strengths at last five quadrupoles (Q6 XiQ10) of the proton beamline optics [3] were calculated using TRANSPORT code in order to obtain needed proton beam spot size. Energy ....

John Johnstone, Private communication.

....by appropriate proof strategies, a problem arises when one wishes to apply a lemma previously proved for one of the automata in the course of a proof: this automaton has been specified and reasoned about in a separate theory. When theory instantiations become available in PVS as planned [32], support for simulation proofs is feasible in a form we desire. Acknowledgments We wish to thank the anonymous reviewers of [1] for insightful comments and our colleagues Ramesh Bharadwaj and Ralph Jeffords for very helpful discussions. We also wish to thank Natarajan Shankar and Sam Owre of ....

John Rushby. Private communication. NRL, Jan. 1997.

....4.3. Linear Recursive Sequences and Composed Products. A method of computing f g and f ffig which allows us to work entirely within F q is to use linear recursive sequences (LRS) and the Berlekamp Massey Algorithm. The method for finding f ffi g using LRS s was described to us by John Brillhart [2], who attributed the method to D.H. Lehmer. We derive a formula for the k th term of the sequence whose minimal polynomial is f g, and use this to compute f g. Recall that a linear recursive sequence fa j g is generated by a polynomial f(x) x m m Gamma1 X k=0 f k x k 2 F [x] F a ....

Brillhart, John. Private Communication.

No context found.

John Fitzgerald. Private Communication. March 1993.

No context found.

John Przybysz, private communication.

No context found.

John Noga and Steven S. Seiden. Private Communication. 2000.

No context found.

John Noga. Private Communication. 2000.

No context found.

John Kelsey. Private Communication, 1999.

No context found.

John L. Casti, private communication, May 1996.

No context found.

John Wilkes. Private communication. 1998.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC