Michael Cheng. University of Middlesex, London, UK. Personal Communication, 2004.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....or undirected. In either case, a forma is characterised by a set of edges which a tour must contain in order to be an instance of the forma. Radcliffe [23] has show that non directed edge formae are not separable using the example in figure 12. The example in figure 13, which is due to Vose [31], suffices to show that directed edge formae are also non separable. It should be noted, however, that this second example relies on the introduction of a cycle, which is only permitted if the cycle forms the entire tour. In this sense, the problem with directed edges is perhaps less severe than ....

Michael D. Vose. Personal Communication, 1991.

....the resulting parts feeder is fully programmable and can be automatically programmed as part geometry changes. By establishing that an algorithm is complete in the sense that it works for all parts in some class, the algorithm can be used as a dependable component in a modular automation system [45]. However, as discussed in section 2, such algorithms are rare for compliant motion planning since one can usually construct cases for which a guaranteed plan does not exist. Making an analogy with the theory of compilers, which has defined classes of languages that can be automatically compiled, ....

Michael Erdmann. Personal Communication, 1990.

....event redundancy when applying formulae to raw numbers, and ensured correctness by calculating each result in using multiple sets of correlated events. Finally, we stayed in contact with the processor vendors who helped decipher the counter values and approved the accuracy of our methodology [ 17] [21] [33] Section 8.1 describes the additional software and hardware used in the third experimentation stage. The experiments for the first and second stages were conducted on a Dell 6400 PII Xeon MT system running Windows NT 4.0. This computer features a Pentium II Xeon processor at 400MHz, a ....

Michael Koster, Sun Microsystems. Personal Communication, September-October 2000.

....a constant factor larger than optimal. The fact that each bit of the extracted string depends on only O(log(1 #) bits of the source in previous constructions has one other potential benefit: it may be useful for incorporating errorcorrection in case the random source cannot be accessed perfectly [Rab01]. Assume the extracted strings are used as one time pads for encryption. Then, in the previous schemes, a bit error probability of O(1 log(1 #) in accessing the source can be viewed as a constant bit error probability in the plaintext, which can be handled by using a standard, asymptotically ....

Michael O. Rabin. Personal communication, December 2001.

....only on assumptions about an enemy s available memory. Such a system for key agreement was described by Mitchell [Mit95] but without security proof. Our analysis provides the first proof that unconditional security can be achieved against memory bounded adversaries. Recently, Aumann and Rabin [Rab97] proved a conjecture of Maurer s paper [Mau92] with the same effect. We borrow some methods from the work of Zuckerman and others on so called extractors of uniform randomness from weak random sources [Zuc96b] that are described in Section 4.3.6. This section is organized as follows. In ....

Michael Rabin, Personal Communication, 1997.

....of Susumu Hayashi and Yukihide Takeyama [10] includes a formulation of union types in the context of an intuitionistic logic. Like Barbanera s, this system has a union elimination form exactly analogous to the rule Union E given here. 5. 3 Cartwright and Fagan Michael Fagan and Robert Cartwright [6] are developing an extension of the ML type system [9, 12] that includes both recursive types and a notion of true union of disjoint types. This is not quite the same idea as the union types described in this report, since for Fagan and Cartwright oe is defined only when oe and have different ....

Michael Fagan. Personal communication, June 1990.

.... cache as many requests as it can in available memory [9] The Solaris NFS client, for example, flush write requests only when the application requests it (via fsync( or close( or unless the client cannot allocate more memory for new requests, in which case the VFS layer blocks the writer [4]. We see in Figure 3 that the periodic latency spikes are gone. However, mean latency does not improve: for the entire run (6400 writes in this case) the average latency is 484.7 microseconds. Furthermore, latency increases over time. We investigate this behavior in the next section. 3.4. List ....

Eisler, Michael. Personal communication, September 2001.

....increases our confidence that the annotation is correct. When a static checker fails to verify an invariant detected by Daikon it often reveals interesting properties about the static checker, test data or program. Daikon was use in a limited way in MIT s Software Engineering course in Spring 2001 [Ernst01]. 2.2 Pedagogical Uses of Analysis This section uses some examples to illustrate how analysis tools can be used to enhance the teaching of software engineering. These examples are not intended to be comprehensive, but should provide some understanding of how analysis tools might be used to teach ....

....in the test suite (for example, it never attempts to pop an empty stack) Students would use Daikon in conjunction with static analysis tools to check invariants produced by Daikon. This approach has been used with ESC Java with promising results [Nimmer01] and will be attempted with LCLint soon [Ernst01]. Security Vulnerabilities Bad software is by far the most common technical cause of security vulnerabilities [MV01] The preponderance of security problems stem from programming errors, not from flaws in algorithms or protocols. Nevertheless, security is often not part of an undergraduate ....

Michael D. Ernst. Personal Communication, April 2001.

....ACM 1 58113 231 X 00 0006. 5.00 206 from a few dozen items to over 127,000 acronym definitions in Acronym Finder [1] The accuracy seems to vary widely. The primary problem with many large lists on the web is that they allow people to submit expansions. Some sites screen submissions carefully [12], others do not. As far as we can determine, no previous automatic extraction efforts have resulted in publicly searchable online databases of acronyms and none have received thorough evaluations. IBM advertises a tool for abbreviation extraction, IBM Intelligent Miner for Text, which allows ....

Molloy, Michael (Acronym Finder), personal communication. February, 2000.

.... at the University of California, Berkeley used the Click IP router as the definition of IP routing, upon which they are building their own modular router in a hardware focused setting; they appear to have chosen Click because its high level description of IP routing is so easy to understand [43]. At MIT, Click is in use as a mixed simulation execution environment for the Grid ad hoc routing system [9] future work Since the optimized Click IP router appears close to the performance limits of our hardware, future performance work must focus on breaking these limits. 111 For instance, ....

Michael Shilman. Personal communication, 2000.

....in this research are the ADIFOR (Automatic Differentiation of Fortran) BCKM96] and ADIC (AD of C) BRM97] systems. Given code for a function f(u) in Fortran 77 or ANSI C, these tools generate code for the computation of f 0 (u) and, if desired, f 00 (u) 5 Experimental Results Other work [LP99, FMM98, Ger00, LH00] has demonstrated the benefits of well defined interfaces for automating the AD process. The object oriented 4 J. Abate, S. Benson, L. Grignon, P. Hovland, L. McInnes, B. Norris Global to local scatter of ghost values Parallel function assembly Parallel Jacobian assembly ADIFOR or ADIC ....

Michael Gertz, 2000. Personal communication.

....and automated process for computing sensitivity derivatives within SensPVODE. 3 Scaled Sensitivities Using AD Automatic differentiation must be nearly as easy to use as finite differences, or it will only be used when finite differences fail, if at all. Previous work [LP99, FMM98, ABG 00, Ger00] has demonstrated that it is possible to automate the AD process by exploiting the existence of well defined interfaces for the user s function implementing f(t; y; p) This makes it easy to identify the independent and dependent variables and to initialize the seed matrices properly. Applying ....

Michael Gertz, 2000. Personal communication.

....application of confidence annotation to improving document retrieval. 21] 22] Finding the optimal LW=IP pair for a speaker: Initial analysis indicates that simply trying to optimize the LW=IP pair for a single speaker within the Switchboard task could improve base word error rate substantially [15]. This could potentially be accomplished via repeated rescoring of lattices under a variety of LW=IP pairs and selecting the values that yield the best confidence rating over a complete conversation side. Dynamic adaptation of LW : Initial results from IBM [41] using a rudimentary confidence ....

Michael Finke. Personal Communication. unpublished, 1997.

....These results are definitely over dramatic. They are due to a known weakness of Sun RMI, which is that local invocations of remote objects are just as expensive as truly remote invocations (on the order of 1 ms) This is 30,000 times slower than an ordinary local invocation of a Java object [8]. Note to the program committee: in the final version of this paper, we will try to use an optimized RMI implementation (e.g. KaRMI) for the measurements as well. Local invocations of remote objects have been reported to be still two orders of magnitude slower than true local invocations here, so ....

Michael Philippsen. Personal communication, 1999.

....rendering [1] there are several ways to extract silhouettes. The algorithm presented in the SIGGRAPH 1998 OpenGL Course does not capture internal silhouette edges and requires four passes of rendering. We recently found out that there is concurrent work similar in spirit to our hardware methods [2]. Below we provide algorithms which require two or three rendering passes and capture internal silhouettes. In a polyhedral model, a silhouette is an edge that is connected to both a front facing and a back facing polygon. The following is pseudo code for the basic algorithm: draw shaded front ....

Michael Cohen and Ramesh Raskar. Personal Communication. 1998.

.... In particular, they have shown that isolated conceptual clusters are separated from each other and bounded by concentric circular boundaries constituting the contour lines of each cluster (more generally, these boundaries are ellipsoidal, depending on the dispersion pattern of the data [Bourassa1999] This interpretation of the results of Figure 5.2 can be better explained in the equivalent representation of Figure 5.3 which illustrates the contour lines (50 of them) for the L and L L autoassociators prior to full convergence as well as the contour lines for the NL L and NL NL ....

Michael Bourassa. Personal communication, 1999.

....model, entities are not added to the DC until the addressee acknowledges the utterance, thereby explicitly entering the entity into common ground. In our examination of human human dialogs, this model is preferred over one in which entities are added to the DC as soon as they are mentioned [11]. Unfortunately, users of the TRIPS 98 system do not use as many acknowledgments when speaking to the system compared to the frequent use of acknowledgments when speaking to another human. So we were unable to factor acknowledgments into the model. In the future, when the language handled by the ....

Michael Strube. Personal communication, December, 1998.

....In particular, the approach does not handle a relocation by one of the end points after a connection has been established. Also, it is not certain whether it would be practical to update the database frequently enough to track the movement of a mobile ES. 2.6. 3 ARDIS and RAM Mobile Data ARDIS [1, 2, 65] is a wireless data network in the United States that is owned and operated by Motorola. ARDIS is designed for the transmission of short, 40 bursty, interactive traffic. Message delivery is guaranteed, and occurs approximately 4 to 10 seconds after transmission. A message can be sent between two ....

....can be sent between two subscriber units, or between a subscriber unit and a customer owned computer. Full duplex bandwidth over the wireless links is currently 4800 bits per second. Selected geographic regions are being upgraded to 19,200 bits per second, in order to increase channel capacity [65]. The ARDIS network is hierarchically organized and centrally routed. There are approximately 35,000 subscribers, 1350 base stations, 30 network control processors, and 2 message switches (the second message switch is for redundancy) A group of base stations is connected to a network control ....

Jan-Michael Wyckoff. Personal communication (via telephone). ARDIS Company, Lincolnshire, Illinois, 6 July 1994.

....in the open literature. The details of the A5 algorithm were only recently revealed to the public [1] so it is perhaps not surprising that it has received less attention. Several cryptographers initial reaction was that there must be a trivial brute force attack on A5 requiring 2 40 operations [26, 1]. No such attack ever materialized, and it became clear that the matter was not so trivial as initially imagined [26, 2] The current consensus appears to be that A5 s strength is possibly somewhat more than a 40 bit cipher but less than its 64 bit key might indicate. There have not been any ....

....not surprising that it has received less attention. Several cryptographers initial reaction was that there must be a trivial brute force attack on A5 requiring 2 40 operations [26, 1] No such attack ever materialized, and it became clear that the matter was not so trivial as initially imagined [26, 2]. The current consensus appears to be that A5 s strength is possibly somewhat more than a 40 bit cipher but less than its 64 bit key might indicate. There have not been any reports on CDMF exhaustive keysearch in the literature, either. On the other hand, CDMF is very similar to DES it is ....

[Article contains additional citation context not shown here]

Michael Roe, April 1996. Personal communication.

....at a particular moment in time. Figure 1 shows a sample of the frame images I am working with and demonstrates the channel formation in myoglobin. Each photorealistic rendered image shows the channel space as an opaque solid embedded in a transparent jelly representing the solvent excluded volume. [3] Unfortunately, a full explanation of the simulation, geometric analysis, and rendering techniques is beyond the scope of this paper. The reader is encouraged to read the cited works for more information. My task has been to take these still images and produce video animations. I what follows I ....

....light grey jelly. In the opening part of the cycle, the cavity associated with the oxygen binding site can be seen deforming into a channel which eventually opens to the outside. In the contracting part of the cycle, this channel closes and shrinks to a small region around the binding site. [3] Figure 1: An example of myoglobin in simulation. 3 Memory Video Equipment Frame Buffer Hard Drive Image Data Analog Video Out Analog Video In Figure 2: Frame bu er ow chart. uncompressed images per second. Bandwidth is the amount of data that can be moved at once. In our case each ....

[Article contains additional citation context not shown here]

Michael G. Prisant. Personal communication, 2000.

No context found.

Michael Kifer and Inderpal Singh Mumick. Personal Communications, December 1989.

No context found.

Michael Cheng. University of Middlesex, London, UK. Personal Communication, 2004.

No context found.

Michael Barr. Personal communication, 1999.

No context found.

Michael Waidner. Personal communication, August 2002.

No context found.

Michael Burrows. Personal communication, July 1989.

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