Boxes, Inkwells, Speech and Formulas DRAFT

Size: px
Start display at page:

Download "Boxes, Inkwells, Speech and Formulas DRAFT"

Transcription

1 Boxes, Inkwells, Speech an Formulas DRAFT Richar J. Fateman March 0, 2006 Introuction This paper sets out some esigns for entering mathematical formulas into a computer system. An initial approach to this task suggests that the previous moel, namely writing mathematics on paper or chalkboar, shoul lea to a natural computer system using a stylus for writing on a tablet. For feeback an for presentation such as in this paper, we use the typesetting capabilities of Knuth s TEX system to show how properly typeset expressions might appear. We use TEX here to show our esign for an interactive input scheme, uner implementation. For this to work, an interactive system must make expressions appear approximately in the same sequences as illustrate, on a computer isplay. The soli color boxes that appear in the incomplete forms are intene as invitations for the user to continue writing out a formula, continuing from within one of those boxes. Think of them as virtual inkwells. For example, an attempt to write a superscript must begin by ipping the stylus (or mouse) in the superscript inkwell. An attempt to write an operan ajacent to an existing must begin in that inkwell. Initiating writing elsewhere on the screen will have no proper ink an will not contribute to the formula entry. We also point out that speaking the terms, rather than writing them, may provie more accurate communication. At this point we suggest you look ahea a page or two to see some pictures of inkwells.. Why Inkwells? This ink-well-base constraine input provies an obvious basis for cooperation between the human entering a formula an the supporting computer program. The program promises to try to parse the formula into something meaningful; the user must be able to express the intent of the writing using the provie paths that can be interprete successfully. Experience with other programs written without such constraints [8], but using a free-format input emonstrates substantial problems. The user (especially one who is unfamiliar with or uncomfortable using a stylus or mouse) will generally not be able to write glyphs of the proper size, an will not precisely position them. Other programs [7] repeately analyze the sequence of strokes to fin new an possibly better interpretations of the markings. This reinterpretation may convert correctlyrecognize symbols into incorrect ones. On the other han, since the input is unstructure, one can go back an insert extra parentheses or other markers as necessary. We make a simplifying assumption that the input will always procee roughly left-to-right, with occasional iversions up an own. The appearance of inkwells will force this irection. The strategy for the stylus once it has been inke, is critical. The user is not constraine to keep the stroke insie the inkwell. Once there is ink, a lower-case escener letter like p woul be expecte to rop below the inkwell.

2 The user oes not have to write small letters: once the stylus has ink, it can be use to write any size characters. (We coul also zoom in on the expression.) The treatment of secon an subsequent strokes can be unifie in two ways: If they are rawn close together in time, they are part of the same character. Thus a multiplestroke K or E woul have to be written so that the interval between the strokes is brief. A new (large) rawing pa can be isplaye so that anything within that pa is part of the same collection. This woul allow a user to write more extensive content for a box. Instea of writing ax + b in 4 separate steps, it coul be written in one. The Microsoft writing-pa application which can be ocke anywhere on the screen is attractive to serious users. The alternative write anywhere esign appears to be trickier to use, but this is a human-factors issue neeing stuy. As inicate below, speech input may be appropriate. If we can accurately recognize spoken eks square sign square of eks as x 2 sin 2 x then we have a potential for rapi input. Consier the symbol which is unicoe (hex) You might speak it as neither a subset of nor equal to [3], but reliable recognition of the hanwritten glyph, given the number of similar symbols, woul be pretty ifficult. The sizes an spacing of some objects in the formulas will have to aapt as the formula is written. These growing objects inclue ivie bars, parentheses an other brackets, matrix elimiters, integral signs, proucts, summations. The size of variables will epen not on how large a user writes them, but their positions relative to other symbols. The rules for TEX provie for careful evaluation of appropriate spacing an size, with the possibility of user-specifie exceptions. The context (isplay or in-line) as well as global irectives, can also affect size. A functional escription of TEX layout [4] may be more useful a guie as to how to re-implement this than the original escription or coe..2 Inkwells may be speech cues It is not require to enter material in these boxes by writing. Once a position is selecte, it may be preferable to speak the glyph. As an example, a vertical bar may be nearly the same as a slash mark / or the number, or a number of other glyphs that look similar. A vertical stroke may also be part of any number of multistroke symbols such as K or P. A horizontal line might, among many possibilities, be minus or ivies, or part of =. Speaking removes some ambiguity. It may also be faster as a consequence. Saying bol small tee to prouce t may be quicker an more accurate than trying to write a symbol which might easily be confuse with +. There seems to be no intuitive embolen written notation. (In the past, instructions given to an ol-fashione human typesetter tene to require unerlining with color pencils). A simple speech application that allows recognition of symbols spoken as (for example) Greek capital gamma seems to be quite accurate, at least for a small set of alternatives. Once one begins to use special symbols, the nee for isambiguation of apparently similar glyphs increases. A hanwriting recognizer aske to istinguish similar isolate characters woul not be reliable, an even if one coul be constructe to make such istinctions, it woul require an exceptionally careful human writer:, <, an, L an even α. Whereas left angle bracket, less than, an angle, to use the TEX names, are rather ifferent spoken utterances. There are thousans of spoken symbols that coul be taught to the computer system. Names nee not be unique; any of several common names might be use for the same glyph. The human writer woul not have to signify fonts by writing in Fraktur or Blackboar glyphs. A combination of speech an hanwriting may be most helpful. Our working hypothesis at this moment is that in a multimoal input metho base on ink-well constraints relies primarily on position information for which we can use a mouse. The hanwriting recognition can be own-playe if the symbol specification 2

3 buren is (mostly) carrie by speech. We woner how natural this might be to someone who comes to this task with a preconception that mathematics is normally hanwritten. The listing of MathML entities running from variations on the letter A through greater-than-or-equal, slante, ot insie to script letter z has 293 glyphs. This oes not however inclue all font variations or moifiers such as bol, unerline, etc. It oes not correspon irectly to TEX notation, but the latter is extensible through font-construction programs..3 Checking Display Preliminaries In orer for you to rea this paper, we must first be assure that the system that is being use to view or print it isplays the right size boxes in our TEX macros relative to the usual typeset material. The re rectangles below shoul approximate the sizes of the A an the x. (The same macro is use for each rectangle, but the expansion of the macro epens on the context within the TEX expression). A x X Here are some samples showing expressions an their transcriptions with pieces replace by rectangles. The geometrical arrangements shoul be similar. A y xb = X B A C = X x y + z A + B = A typeset example In orer to be concrete, we will use a running example for several sections. Here is one sample expression, isplaye as TEX typesets it: y 2 + z 2 + x x 2 Constrain by Leftmost Entry of Expressions The principal rule we nee to provie for our users is that whenever possible expressions shoul be written from left to right. This is the normal irection, but occasionally one makes mistakes. We allow the user to select an expression previously entere, an write over it perhaps with a much more elaborate expression, but not all previously written sub-expressions can be selecte (for example, in a sum of five items, select the mile three.) 2. Templates for Super/Subscript an Right Let us begin the entry of a particular expression, in pieces, using our first esign. The general expression template allows for a superscript an a subscript, an a position to its immeiate right. Only rarely are all three fille, so this may seem like overkill for proviing templates, an to the user both complicate an clumsy. y 2 + z 2 + x x 3

4 Enter the symbol x, then 3, 2 in any sequence. Here we enter 2 then 3. x x 2 x 3 2 In this esign both the 2 an the 3 might themselves have super or subscripts, accoring to this template. Again, most of the confusion evaporates at the next step where we enter the +. Then the system can abanon some of the extraneous boxes an retypeset: Let us skip 5 steps to reach: x x x If we introuce a part of a notation that is always compoun, like (balance) brackets or parentheses, we isplay the match immeiately. Parentheses can grow epening upon what is subsequently place within them. In the case of an integral, the of the x is immeiately inserte: x The next two steps will orinarily be contracte to one if the user is able to write 45 in one box. If the user pauses for a longer time (lets the ink ry ), the system has no recourse but to try to make sense of what has been receive so far. We return to this point in a later section: how much can be written in one box? x x Next, rawing a ivie bar makes a ifference. In our system, the user must learn to raw a ivie bar (same as a minus sign) prior to rawing the numerator or enominator. This is consistent with our view that the user must generally enter the Leftmost expression. (An alternative is to write the numerator an then eit it into a fraction) We continue: (this automatic placement of the x is problematical for x x, an alternative notation. Perhaps we nee integral: no x option as a menu selection, as well as other integral-like variations.) A template with a possible ivie-bar everywhere is far more cluttere than the sub/super/right template, an seems unacceptable. 4

5 We continue in this way to eventually reach: y 2 + z 2 + x x The only way we coul make this sequence even more cluttere might be to allow expressions to grow to the left, above, below, as well as pre-sub an pre-superscripts. 2.2 Clearing some clutter Here is another esign. We leave off the subscript template boxes an require that a writer who nees to prouce x 2 writes simply x an later goes back (e.g. click with right mouse button within the glyph bouning box) to choose from a menu: {elete, copy, eit, subscript, font, size}. Choosing subscript then opens up a subscript template. A selection metho (where exactly oes one point?), as well as appropriate menu items for compoun expressions requires careful esign. One metho we have use requires selecting α + β by clicking insie the box for the expression, but outsie the boxes for the three components. Another metho uses a rectangular lasso to contain some or all of the selection. The menu available for a selection epens on what is selecte: an integral sign woul have ifferent menu properties from symbolic atoms, or from the sum of two terms. It seems that a programming type structure woul be almost inevitable, at least for most sophisticate users. We coul eclare (within a elimite sub-scope of the formula entry program) that all use of specific symbols have special attributes. For example we coul eclare that A shoul always be set in bol as A, the sequence of two letters sn shoul be set in Roman as sn, an symbols otherwise not in the hanwriting lexicon (or ifficult to istinguish from other symbols) shoul be entere in istinct forms. That is, one might really want to write A B as A vee B, since the letter v (hanwritten) is not istinct from. One coul also specify temporary shorthans like D mapping to b 2 4ac, or long-hans like ot to represent the perio, or cots to represent three centere ots each of which woul otherwise be har to recognize in hanwritten form. (See section on speech for more iscussion on this ambiguity.) Returning to our constraint-box esign, if we eliminate the subscript template box by efault, our example above becomes simpler to view. Introucing subscripts then requires the user to go to an eit menu to make the x into an x 2 or use some kin of macro-expansion that makes the utterance xsub2 into a subscripte x.) Here s how it might look: Eit (using a metho not shown here) the x to make it x 2, either now or later. x x 2 x 3 2 At the point where we enter the +, the system has only one extraneous box, an then it has no extraneous boxes at all. x x x y x y 2 x y 2 + 5

6 x y 2 + z x y 2 + z 2 x x x x x y 2 + z 2 + x x. Comparison of the entire sequence makes it even clearer that removing the subscripts from most templates makes the overall construction more comprehensible. 2.3 Speech, again Remember our suggestion for speech input: the symbol above coul be written as vee but perhaps more easily spoken as logical or. We have just begun to experiment on the hypothesis that speech input generally to the computer coul actually remove the nee for some of these macro commans an also make the symbol recognition far more accurate. The point is particularly clear when the hanwritten glyphs are problematical. Speaking ot may be a key to recognizing what might otherwise be a (small) piece of essentially ranom ink. 2.4 Other improvements Another possibility is to use color coing to keep track of what is likely to be the main course (most likely continuation) of the expression. Thus we coul illustrate that we expect that the user to use (one of) the blue boxes next. We coul even avance the point of insertion to the blue box so that a continuation of speaking or typing woul procee automatically to the next blue box. Or voice commans coul navigate among the boxes. x x 3 x 3 4 x

7 x 34 + x sin x In this example, speaking eks up three four own plus eks sign eks woul be acceptable. There are a host of features that may make sense, especially for serious users, beyon simple hanwriting an speech. Here are some options: We coul ask users up front: Do you expect to enter any subscripte variables? If so, what are their names? Do they have subscripts or other marks? (This context an other similar information below coul be save, restore, eite, etc.) We coul ask about unusual notations, especially those that might be easily confuse in hanwriting like <> versus rangle? How woul you prefer to notate these? How o you plan to speak their names? Are they constraine as in the typical bracketing of parentheses? We shoul provie a metho for aing new templates, such as a template that starts out with equation numbers on the left ( ). Another template that might be use in tables of integrals, woul have spaces for sie-conitions restricting the omain of some of the extra parameters, cross reference to relate formulas, an even a reference to the literature. Once an expression is entere (or compute), there is a potential nee for alterations. The esign for such eiting is not covere in this ocument. We shoul explore this further [2]. It shoul be possible to scroll a large expression, zoom in or out of expressions for ease in writing or reaing, an it shoul be possible to fol expressions over more than one line. This last issue is consierably more ifficult to aress aequately, an may be best ignore for lack of a goo automate solution. A goo multi-line expression coul be entere on several lines or in a matrix by a skille typesetter. We have written as though a ocument consists entirely of a single formula. This is, of course, unlikely 2. A useful entry system shoul allow intersperse orinary text both in-line an in complete paragraphs surrouning isplaye mathematics. More specialize combinations of text an formulas as in theorems or proofs shoul be accomoate. 2.5 How much can be written in one box? It is clear that the tiny boxes are insufficient space to write characters; that is why we refer to them as inkwell. But it woul be convenient to insert many characters in a box: in fact, as many as can be conveniently written or spoken. Thus e sin ax woul most plausibly be written in only two boxes, at least if the whole exponent can be written before the ink ries. One technique use in Microsoft Office s hanwriting interface is to provie a separate writing pa, as oppose to the write anywhere moe. (The major recognition avantage is that the user/computer have a baseline on which to write/recognize. The major isavantage is that you probably want to use the stylus as a pseuo-mouse, too. Dual use is confusing.) In our case a writing pa coul be implemente by a local pop-up winow pa which allows more written material. How large shoul this pa be? (Shoul it grow?) How long shoul it last before the ink ries? Shoul it always appear? 2 Except in spy novels where the formula is secret. 7

8 These are elicate issues but resolving them may not be important. In our experience, a hanwritten version of a + b sin θ is har to recognize regarless of where it is written. A result of at b sino is typical. Even the untraine speech program in Microsoft Office comes out pretty close: a+be sign ata. A more restricte speech grammar we are eveloping (Fall, 2003) to emonstrate applications of the Speech SDK seems to work rather more accurately, given a subset of wors or phrases typical of mathematics, incluing stanar alphabetic characters. 3 More examples It is tempting to provie special treatment for known functions. That is, we can assert that uttering the symbol sin immeiately prouces a template which provies for three new boxes: the power of the sin, its argument, an the (optional) continuation. That is one coul create sin 2 (xy) by starting with this template: sin ( ). This template suggests (a) the parentheses are not optional. (b) The next atum to be entere shoul be the argument of the sin. (c) The power an the continuation to the right are optional or seconary after the argument is fille in. The ownsie to this is that it becomes impossible to typeset sin x without parentheses. Whether this is an issue or not is a matter of taste, about which it is ifficult to legislate. A complete implementation shoul provie isplay of glyphs that grow, such as brackets an matrices. See how TeX hanles them: ( ) (a + b) c + + sin (x + y) e /(+x) We can aress the nee of someone who writes a + bc + an subsequently ecies to enclose this expression in parentheses as (a+b)c+ by eiting operations, since it woul otherwise violate our proceural guielines of starting from the left an proceeing to the right. One technique is essentially to use another piece of canvas to write a ( ), then select the insie a + b out of an existing form, an past it into the. The complete scenario is thus more elaborate than just overwriting an expression with some parentheses. 4 Comparison with Other Programs The lengthy A Survey of User Interfaces for Computer Algebra Systems [6] provies a broa perspective on the topic prior to about 998. The historical highpoints inclue, in our view (R. Anerson s early thesis, W. Martin s program, MS equation eitor, recent tour-e-force programs such as Milo/PacificTech, Expressionist/Theorist/Livemath, an Soiffer s work in Mathematica). Recent progress in hanwriting or speech input is not inclue. 4. Keyboar input It is har for us to be critical of keyboar input of mathematics: we have been using this metho for many years, an there are several programs that provie excellent support for the higher levels of expertise. We first point out some, perhaps obvious, points against the keyboar for math input. Math is inherently locally two-imensional as x 2 an therefore is a mismatch to the unaorne keyboar, which provies a locally linear string. By this we mean that the two-imensional page layout of text is one by a global operation of inserting new line characters. Given that a pen or a mouse is use for geometric positioning, forcing the user to switch to the keyboar to provie the content is inconvenient. 8

9 In favor of keyboars, we have these consierations: Hanwriting (or speech) is not always accurate an efficient. If errors cannot be hanle in the same moe, the user may be force to learn about keyboar entry in orer to use it for corrections. Once the keyboar is introuce either for content or correction, the esign can easily go a step further an use it (via arrow keys or other coes) as a replacement for the mouse/stylus selection. This is a possibility: using the tab key to circulate sequentially among possible selectable boxes is a convention with filling in HTML forms. One program (Mathematica) uses control+space to rop out of a construction; TeXmacs uses the rarrow key similarly. With such a convention an a few clues as to how to navigate aroun a matrix or a, a skille typist can o very well in positioning. Making use of macro efinitions for common subexpressions or frameworks, a common tool for the expert in TEX can provie even more efficiency. We mention a few examples of keyboar input (although the [6] provies much more). TeXmacs is a free open-source eiting system [5], inspire by the emacs eitor an TEX. It is not implemente using either one, however. TeXmacs (once it is successfully installe) allows you to interactively type (an see as immeiate feeback) almost anything in TEX, as well as various extensions to images or other objects. TeXmacs allows alternative methos. For example you can choose from a menu a fraction template or alternatively type \frac in place or the shortcut em alt-f, to then be shown an in-place template for numerator an enominator. The non-menu approach is preferable since you can keep your fingers on the keyboar. (TeXmacs has keyboar shortcuts, but this coul presumably be ae.) To change from text to math an enter a fraction a b you type 8 characters: $ alt-f return a own-arrow b right-arrow $. TeXmacs uses font erive from the excellent TEX repertoire. Occasionally (most often when first starting up with a new installation) it pauses to compute new font sizes as they are neee for the first time. TeXmacs is a highly competent text typesetting system, but as a math system it is esigne to interface with other systems, an oes quite well orinarily. There are issues with conflicting system constraints on interfaces, hanling errors, etc. One of the more popular computer algebra systems, Mathematica [9], provies for keyboar/mouse input. The stanar input is a linear keyboar input format, but recent versions of the system have ae 2-D input formatting which can be accesse by menu or by keyboar escapes. The running WYSIWYG input/output is not as elegant in appearance as the TeXmacs system, but is similar in that it refers back to a similar repository of mathematical symbols from TEX. Mathematica generally assumes you are in math moe so to enter a fraction a b you can type a control-/ b control-space. Comman completion is available in either systems so you can avoi typing some long names. In each of these systems you can move a cursor to the left into expressions. TeXmacs provies both visual feeback (boxes) as well as a brief written escription in the lower right corner of your location in an expression (e.g. hints of the containing operators of the selection point). The Mathematica program places some emans on the input expressions that are not entirely commonplace, such as enclosing function arguments in square brackets, an using a special for the ifferential marker in integrals. (It is possible to type material in Traitional form with conventional appearance: this can sometimes be properly interprete an eite, but frankly traitional form is ambiguous: a(r + s) means one thing if a is a function, but if a is a constant it inicates invisible multiplication). Expressions entere into computer algebra systems like Mathematica ten to get simplifie an rearrange, sometimes to a isconcertingly ifferent form, an sometimes to great benefit. The TeXmacs program is generally less concerne about the meaning of expressions than Mathematica because TeXmacs oes not have to fit every utterance into a particular computer algebra moel of representation an evaluation. This can be use to avantage when especially when efining new notations. Certainly consiering the price, TeXmacs eserves careful scrutiny as a mathematics entry program. For Winows users, TeXmacs currently requires an installation of Cygwin, an in my experience takes some filing to get to work. It can export files as TEX although that is not the native form for TeXmacs. 9

10 We shoul also mention the equation-entry keyboar system that probably requires minimal filing to install (for Microsoft Wor/Office users): the Microsoft equation eitor an its upgrae to MathType ( from Design Science). This program is capable of goo typeset results, although it too seems to be ifficult to use without interspersing significant mouse activity between keystrokes. The esign is not any more keyboar-hostile that others: many of the menu choices can be reache by combination keystrokes or reache by navigating menus by arrows. Every program requires some effort for o symbols; the palettes may be extensible, an as unicoe becomes more easily available, the symbol set can presumably have thousans of glyphs in ifference fonts an sizes. Conclusion: We can t count out the keyboar as an important input evice, especially for people who are using avance notations an can type accurately. Furthermore, it is likely that unusual notations an glyphs will be introuce first via keyboar input. By the same token, the steep initial learning curve is a barrier for naive users. 4.2 Other Math+Speech Efforts What appears to be a primitive version of speaking math is emboie in a program Mathtalk using a version of the software Dragon Naturally Speaking. The emonstrations are not encouraging, but the fact that it works with MacKichan Scientific Notebook is promising. (A iscouraging aspect is the suggestion in the emos that a military-style alphabet is use: thus x might be spoken as elta x-ray. It is not clear if this is essential. In our own experiments, single-letter recognition is somewhat unreliable with the letters {b,, t, p} sometimes confuse. Recognition of phrases like y by x is far more reliable.) 5 Conclusions an Further Work We have suggeste a novel hanwritten technique which isplays all possible continuations of a formula, writing it left to right. The user is constraine to raw ink from these continuation spots. This feeback promotes the relatively painless construction of well-forme formulas. Seconly, we have suggeste that, as a minimal effort to take avantage of multimoal input, iniviual symbols or short phrases inserte by speech input can be synchronize with hanwriting or pointing. It may in fact be easier to replace the entering of most hanwritten symbols by speaking them. Other uses of speech might inclue using voice commans to eit a symbol or make an alternative recognition choice, or to give higher-level commans like begin bolface. We complete a emonstratin prototype; actually two.) The first by Kevin Lin (SKEME) emonstrates the boxing an isplay, an is written in Lisp. The stubs for speech an hanwriting were not fully evelope. A system calle Math Speak an Write, with a somewhat less evolve isplay, but one linke to both speech an hanwriting was written by three stuents, is of sufficient robustness that we offer a ownloa of it, Continue improvement of this system leas us to go back to basics an fin a way to recognize math symbols without extensive training on a per-user basis, an also voice recognition, with error correction, using a context-free grammar that escribes math. We hope to be able to test our esign against other systems [, 8, 7, 5] for use in two areas: proucing ocuments, an as an alternative (to typing) as a moe of input for computer algebra systems. Finally, we feel it appropriate to point out that even recognition of forms syntactically, an reucing them to an apparently unambiguous linear form oes not imply that the recognition program has a complete semantic moel of the utterance. The meaning behin a notation is necessarily context epenent. One of my favorite examples occurs in the use of x in a publishe integral table entry for the formula (a+bx)/(c+ x)x. 0

11 6 Acknowlegments This research was supporte in part by NSF grant CCR aministere through the Electronics Research Laboratory, University of California, Berkeley. Stuent assistents were supporte in part by an Unergrauate Research Opportunities grant from the UC College of Engineering an the Haas Scholars fun. We are aware of the irony that a Berkeley project shoul avocate constraine speech input, as oppose to free speech. References [] J. Arvo, FFES: Freehan Formula Entry System. [2] S. Dooley. Eiting mathematical content an presentation markup in interactive mathematical ocuments, Proc. ISSAC 2002, (Lille, France) [3] R. Fateman. How can we speak math? [4] R. Heckman an Reinhar Wilhelm. A Functional Description of TEX s Formula Layout, J. Functional Programming 7(5), (997) heckmann/oc.html [5] Joris van er Hoeven. TeXmacs ( [6] Norbert Kajler, Neil Soiffer. A Survey of User Interfaces for Computer Algebra Systems. J. Symbolic Computing 25(2): (998) [7] N. E. Matsakis. Recognition of Hanwritten Mathematical Expressions, MS report, MIT viola/research/publications/matsakis-ms-99.pf (999) also emo at [8] M. Suzuki, Infty Project. suzuki/inex-e.html (inclues links to ownloa of emo) [9] S. Wolfram et. al. Mathematica,

CS 106 Winter 2016 Craig S. Kaplan. Module 01 Processing Recap. Topics

CS 106 Winter 2016 Craig S. Kaplan. Module 01 Processing Recap. Topics CS 106 Winter 2016 Craig S. Kaplan Moule 01 Processing Recap Topics The basic parts of speech in a Processing program Scope Review of syntax for classes an objects Reaings Your CS 105 notes Learning Processing,

More information

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed. Preface Here are my online notes for my Calculus I course that I teach here at Lamar University. Despite the fact that these are my class notes, they shoul be accessible to anyone wanting to learn Calculus

More information

Preamble. Singly linked lists. Collaboration policy and academic integrity. Getting help

Preamble. Singly linked lists. Collaboration policy and academic integrity. Getting help CS2110 Spring 2016 Assignment A. Linke Lists Due on the CMS by: See the CMS 1 Preamble Linke Lists This assignment begins our iscussions of structures. In this assignment, you will implement a structure

More information

Coupling the User Interfaces of a Multiuser Program

Coupling the User Interfaces of a Multiuser Program Coupling the User Interfaces of a Multiuser Program PRASUN DEWAN University of North Carolina at Chapel Hill RAJIV CHOUDHARY Intel Corporation We have evelope a new moel for coupling the user-interfaces

More information

Computer Organization

Computer Organization Computer Organization Douglas Comer Computer Science Department Purue University 250 N. University Street West Lafayette, IN 47907-2066 http://www.cs.purue.eu/people/comer Copyright 2006. All rights reserve.

More information

Generalized Edge Coloring for Channel Assignment in Wireless Networks

Generalized Edge Coloring for Channel Assignment in Wireless Networks TR-IIS-05-021 Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu, Pangfeng Liu, Da-Wei Wang, Jan-Jan Wu December 2005 Technical Report No. TR-IIS-05-021 http://www.iis.sinica.eu.tw/lib/techreport/tr2005/tr05.html

More information

Learning Polynomial Functions. by Feature Construction

Learning Polynomial Functions. by Feature Construction I Proceeings of the Eighth International Workshop on Machine Learning Chicago, Illinois, June 27-29 1991 Learning Polynomial Functions by Feature Construction Richar S. Sutton GTE Laboratories Incorporate

More information

Cluster Center Initialization Method for K-means Algorithm Over Data Sets with Two Clusters

Cluster Center Initialization Method for K-means Algorithm Over Data Sets with Two Clusters Available online at www.scienceirect.com Proceia Engineering 4 (011 ) 34 38 011 International Conference on Avances in Engineering Cluster Center Initialization Metho for K-means Algorithm Over Data Sets

More information

Message Transport With The User Datagram Protocol

Message Transport With The User Datagram Protocol Message Transport With The User Datagram Protocol User Datagram Protocol (UDP) Use During startup For VoIP an some vieo applications Accounts for less than 10% of Internet traffic Blocke by some ISPs Computer

More information

Figure 1: Schematic of an SEM [source: ]

Figure 1: Schematic of an SEM [source:   ] EECI Course: -9 May 1 by R. Sanfelice Hybri Control Systems Eelco van Horssen E.P.v.Horssen@tue.nl Project: Scanning Electron Microscopy Introuction In Scanning Electron Microscopy (SEM) a (bunle) beam

More information

Lecture 1 September 4, 2013

Lecture 1 September 4, 2013 CS 84r: Incentives an Information in Networks Fall 013 Prof. Yaron Singer Lecture 1 September 4, 013 Scribe: Bo Waggoner 1 Overview In this course we will try to evelop a mathematical unerstaning for the

More information

Loop Scheduling and Partitions for Hiding Memory Latencies

Loop Scheduling and Partitions for Hiding Memory Latencies Loop Scheuling an Partitions for Hiing Memory Latencies Fei Chen Ewin Hsing-Mean Sha Dept. of Computer Science an Engineering University of Notre Dame Notre Dame, IN 46556 Email: fchen,esha @cse.n.eu Tel:

More information

Classifying Facial Expression with Radial Basis Function Networks, using Gradient Descent and K-means

Classifying Facial Expression with Radial Basis Function Networks, using Gradient Descent and K-means Classifying Facial Expression with Raial Basis Function Networks, using Graient Descent an K-means Neil Allrin Department of Computer Science University of California, San Diego La Jolla, CA 9237 nallrin@cs.ucs.eu

More information

0607 CAMBRIDGE INTERNATIONAL MATHEMATICS

0607 CAMBRIDGE INTERNATIONAL MATHEMATICS CAMBRIDGE INTERNATIONAL EXAMINATIONS International General Certificate of Seconary Eucation MARK SCHEME for the May/June 03 series 0607 CAMBRIDGE INTERNATIONAL MATHEMATICS 0607/4 Paper 4 (Extene), maximum

More information

0607 CAMBRIDGE INTERNATIONAL MATHEMATICS

0607 CAMBRIDGE INTERNATIONAL MATHEMATICS PAPA CAMBRIDGE CAMBRIDGE INTERNATIONAL EXAMINATIONS International General Certificate of Seconary Eucation MARK SCHEME for the May/June 0 series CAMBRIDGE INTERNATIONAL MATHEMATICS /4 4 (Extene), maximum

More information

SURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH

SURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH SURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH Galen H Sasaki Dept Elec Engg, U Hawaii 2540 Dole Street Honolul HI 96822 USA Ching-Fong Su Fuitsu Laboratories of America 595 Lawrence Expressway

More information

Random Clustering for Multiple Sampling Units to Speed Up Run-time Sample Generation

Random Clustering for Multiple Sampling Units to Speed Up Run-time Sample Generation DEIM Forum 2018 I4-4 Abstract Ranom Clustering for Multiple Sampling Units to Spee Up Run-time Sample Generation uzuru OKAJIMA an Koichi MARUAMA NEC Solution Innovators, Lt. 1-18-7 Shinkiba, Koto-ku, Tokyo,

More information

Generalized Edge Coloring for Channel Assignment in Wireless Networks

Generalized Edge Coloring for Channel Assignment in Wireless Networks Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu Institute of Information Science Acaemia Sinica Taipei, Taiwan Da-wei Wang Jan-Jan Wu Institute of Information Science

More information

Kinematic Analysis of a Family of 3R Manipulators

Kinematic Analysis of a Family of 3R Manipulators Kinematic Analysis of a Family of R Manipulators Maher Baili, Philippe Wenger an Damien Chablat Institut e Recherche en Communications et Cybernétique e Nantes, UMR C.N.R.S. 6597 1, rue e la Noë, BP 92101,

More information

Name: Dr. Fritz Wilhelm Lab 1, Presentation of lab reports Page # 1 of 7 5/17/2012 Physics 120 Section: ####

Name: Dr. Fritz Wilhelm Lab 1, Presentation of lab reports Page # 1 of 7 5/17/2012 Physics 120 Section: #### Name: Dr. Fritz Wilhelm Lab 1, Presentation of lab reports Page # 1 of 7 Lab partners: Lab#1 Presentation of lab reports The first thing we do is to create page headers. In Word 2007 do the following:

More information

Recitation Caches and Blocking. 4 March 2019

Recitation Caches and Blocking. 4 March 2019 15-213 Recitation Caches an Blocking 4 March 2019 Agena Reminers Revisiting Cache Lab Caching Review Blocking to reuce cache misses Cache alignment Reminers Due Dates Cache Lab (Thursay 3/7) Miterm Exam

More information

1 Surprises in high dimensions

1 Surprises in high dimensions 1 Surprises in high imensions Our intuition about space is base on two an three imensions an can often be misleaing in high imensions. It is instructive to analyze the shape an properties of some basic

More information

Figure 1: 2D arm. Figure 2: 2D arm with labelled angles

Figure 1: 2D arm. Figure 2: 2D arm with labelled angles 2D Kinematics Consier a robotic arm. We can sen it commans like, move that joint so it bens at an angle θ. Once we ve set each joint, that s all well an goo. More interesting, though, is the question of

More information

Offloading Cellular Traffic through Opportunistic Communications: Analysis and Optimization

Offloading Cellular Traffic through Opportunistic Communications: Analysis and Optimization 1 Offloaing Cellular Traffic through Opportunistic Communications: Analysis an Optimization Vincenzo Sciancalepore, Domenico Giustiniano, Albert Banchs, Anreea Picu arxiv:1405.3548v1 [cs.ni] 14 May 24

More information

Math 131. Implicit Differentiation Larson Section 2.5

Math 131. Implicit Differentiation Larson Section 2.5 Math 131. Implicit Differentiation Larson Section.5 So far we have ealt with ifferentiating explicitly efine functions, that is, we are given the expression efining the function, such as f(x) = 5 x. However,

More information

BIJECTIONS FOR PLANAR MAPS WITH BOUNDARIES

BIJECTIONS FOR PLANAR MAPS WITH BOUNDARIES BIJECTIONS FOR PLANAR MAPS WITH BOUNDARIES OLIVIER BERNARDI AND ÉRIC FUSY Abstract. We present bijections for planar maps with bounaries. In particular, we obtain bijections for triangulations an quarangulations

More information

Non-homogeneous Generalization in Privacy Preserving Data Publishing

Non-homogeneous Generalization in Privacy Preserving Data Publishing Non-homogeneous Generalization in Privacy Preserving Data Publishing W. K. Wong, Nios Mamoulis an Davi W. Cheung Department of Computer Science, The University of Hong Kong Pofulam Roa, Hong Kong {wwong2,nios,cheung}@cs.hu.h

More information

Chapter 5 Proposed models for reconstituting/ adapting three stereoscopes

Chapter 5 Proposed models for reconstituting/ adapting three stereoscopes Chapter 5 Propose moels for reconstituting/ aapting three stereoscopes - 89 - 5. Propose moels for reconstituting/aapting three stereoscopes This chapter offers three contributions in the Stereoscopy area,

More information

Questions? Post on piazza, or Radhika (radhika at eecs.berkeley) or Sameer (sa at berkeley)!

Questions? Post on piazza, or  Radhika (radhika at eecs.berkeley) or Sameer (sa at berkeley)! EE122 Fall 2013 HW3 Instructions Recor your answers in a file calle hw3.pf. Make sure to write your name an SID at the top of your assignment. For each problem, clearly inicate your final answer, bol an

More information

Lesson 11 Interference of Light

Lesson 11 Interference of Light Physics 30 Lesson 11 Interference of Light I. Light Wave or Particle? The fact that light carries energy is obvious to anyone who has focuse the sun's rays with a magnifying glass on a piece of paper an

More information

Cloud Search Service Product Introduction. Issue 01 Date HUAWEI TECHNOLOGIES CO., LTD.

Cloud Search Service Product Introduction. Issue 01 Date HUAWEI TECHNOLOGIES CO., LTD. 1.3.15 Issue 01 Date 2018-11-21 HUAWEI TECHNOLOGIES CO., LTD. Copyright Huawei Technologies Co., Lt. 2019. All rights reserve. No part of this ocument may be reprouce or transmitte in any form or by any

More information

Teacher Activity: page 1/9 Mathematical Expressions in Microsoft Word

Teacher Activity: page 1/9 Mathematical Expressions in Microsoft Word Teacher Activity: page 1/9 Mathematical Expressions in Microsoft Word These instructions assume that you are familiar with using MS Word for ordinary word processing *. If you are not comfortable entering

More information

An Algorithm for Building an Enterprise Network Topology Using Widespread Data Sources

An Algorithm for Building an Enterprise Network Topology Using Widespread Data Sources An Algorithm for Builing an Enterprise Network Topology Using Wiesprea Data Sources Anton Anreev, Iurii Bogoiavlenskii Petrozavosk State University Petrozavosk, Russia {anreev, ybgv}@cs.petrsu.ru Abstract

More information

Almost Disjunct Codes in Large Scale Multihop Wireless Network Media Access Control

Almost Disjunct Codes in Large Scale Multihop Wireless Network Media Access Control Almost Disjunct Coes in Large Scale Multihop Wireless Network Meia Access Control D. Charles Engelhart Anan Sivasubramaniam Penn. State University University Park PA 682 engelhar,anan @cse.psu.eu Abstract

More information

6.823 Computer System Architecture. Problem Set #3 Spring 2002

6.823 Computer System Architecture. Problem Set #3 Spring 2002 6.823 Computer System Architecture Problem Set #3 Spring 2002 Stuents are strongly encourage to collaborate in groups of up to three people. A group shoul han in only one copy of the solution to the problem

More information

The MathType Window. The picture below shows MathType with all parts of its toolbar visible: Small bar. Tabs. Ruler. Selection.

The MathType Window. The picture below shows MathType with all parts of its toolbar visible: Small bar. Tabs. Ruler. Selection. Handle MathType User Manual The MathType Window The picture below shows MathType with all parts of its toolbar visible: Symbol palettes Template palettes Tabs Small bar Large tabbed bar Small tabbed bar

More information

Shift-map Image Registration

Shift-map Image Registration Shift-map Image Registration Svärm, Linus; Stranmark, Petter Unpublishe: 2010-01-01 Link to publication Citation for publishe version (APA): Svärm, L., & Stranmark, P. (2010). Shift-map Image Registration.

More information

Lab1: Use of Word and Excel

Lab1: Use of Word and Excel Dr. Fritz Wilhelm; physics 230 Lab1: Use of Word and Excel Page 1 of 9 Lab partners: Download this page onto your computer. Also download the template file which you can use whenever you start your lab

More information

Computer Graphics Chapter 7 Three-Dimensional Viewing Viewing

Computer Graphics Chapter 7 Three-Dimensional Viewing Viewing Computer Graphics Chapter 7 Three-Dimensional Viewing Outline Overview of Three-Dimensional Viewing Concepts The Three-Dimensional Viewing Pipeline Three-Dimensional Viewing-Coorinate Parameters Transformation

More information

UNIT 9 INTERFEROMETRY

UNIT 9 INTERFEROMETRY UNIT 9 INTERFEROMETRY Structure 9.1 Introuction Objectives 9. Interference of Light 9.3 Light Sources for 9.4 Applie to Flatness Testing 9.5 in Testing of Surface Contour an Measurement of Height 9.6 Interferometers

More information

THE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE

THE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE БСУ Международна конференция - 2 THE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE Evgeniya Nikolova, Veselina Jecheva Burgas Free University Abstract:

More information

Politehnica University of Timisoara Mobile Computing, Sensors Network and Embedded Systems Laboratory. Testing Techniques

Politehnica University of Timisoara Mobile Computing, Sensors Network and Embedded Systems Laboratory. Testing Techniques Politehnica University of Timisoara Mobile Computing, Sensors Network an Embee Systems Laboratory ing Techniques What is testing? ing is the process of emonstrating that errors are not present. The purpose

More information

Blind Data Classification using Hyper-Dimensional Convex Polytopes

Blind Data Classification using Hyper-Dimensional Convex Polytopes Blin Data Classification using Hyper-Dimensional Convex Polytopes Brent T. McBrie an Gilbert L. Peterson Department of Electrical an Computer Engineering Air Force Institute of Technology 9 Hobson Way

More information

2.7 Implicit Differentiation

2.7 Implicit Differentiation 2.7 Implicit Differentiation [ y] = = = [ x] 1 Sometimes we may be intereste in fining the erivative of an equation that is not solve or able to be solve for a particular epenent variable explicitly. In

More information

Guidelines for Writing Mathematical Proofs

Guidelines for Writing Mathematical Proofs Appendix A Guidelines for Writing Mathematical Proofs One of the most important forms of mathematical writing is writing mathematical proofs. The writing of mathematical proofs is an acquired skill and

More information

CordEx. >> Operating instructions. English

CordEx. >> Operating instructions. English CorEx >> Operating instructions English Symbols use in this manual Important information concerning your safety is specifically marke. Follow these instructions closely to prevent accients an amage to

More information

1 Finding Trigonometric Derivatives

1 Finding Trigonometric Derivatives MTH 121 Fall 2008 Essex County College Division of Matematics Hanout Version 8 1 October 2, 2008 1 Fining Trigonometric Derivatives 1.1 Te Derivative as a Function Te efinition of te erivative as a function

More information

On-Line Recognition of Mathematical Expressions Using Automatic Rewriting Method

On-Line Recognition of Mathematical Expressions Using Automatic Rewriting Method On-Line Recognition of Mathematical Expressions Using Automatic Rewriting Method T. Kanahori 1, K. Tabata 1, W. Cong 2, F.Tamari 2, and M. Suzuki 1 1 Graduate School of Mathematics, Kyushu University 36,

More information

William S. Law. Erik K. Antonsson. Engineering Design Research Laboratory. California Institute of Technology. Abstract

William S. Law. Erik K. Antonsson. Engineering Design Research Laboratory. California Institute of Technology. Abstract Optimization Methos for Calculating Design Imprecision y William S. Law Eri K. Antonsson Engineering Design Research Laboratory Division of Engineering an Applie Science California Institute of Technology

More information

Bends, Jogs, And Wiggles for Railroad Tracks and Vehicle Guide Ways

Bends, Jogs, And Wiggles for Railroad Tracks and Vehicle Guide Ways Ben, Jogs, An Wiggles for Railroa Tracks an Vehicle Guie Ways Louis T. Klauer Jr., PhD, PE. Work Soft 833 Galer Dr. Newtown Square, PA 19073 lklauer@wsof.com Preprint, June 4, 00 Copyright 00 by Louis

More information

Considering bounds for approximation of 2 M to 3 N

Considering bounds for approximation of 2 M to 3 N Consiering bouns for approximation of to (version. Abstract: Estimating bouns of best approximations of to is iscusse. In the first part I evelop a powerseries, which shoul give practicable limits for

More information

Introduction to MCS 220 and L A TEX

Introduction to MCS 220 and L A TEX Introduction to MCS 220 and L A TEX Tom LoFaro August 28, 2009 1 Introduction to MCS 220 MCS 220, Introduction to Analysis, carries a WRITD (writing in the discipline) designation. What this means to you

More information

Try It. Implicit and Explicit Functions. Video. Exploration A. Differentiating with Respect to x

Try It. Implicit and Explicit Functions. Video. Exploration A. Differentiating with Respect to x SECTION 5 Implicit Differentiation Section 5 Implicit Differentiation Distinguish between functions written in implicit form an eplicit form Use implicit ifferentiation to fin the erivative of a function

More information

4.2 Implicit Differentiation

4.2 Implicit Differentiation 6 Chapter 4 More Derivatives 4. Implicit Differentiation What ou will learn about... Implicitl Define Functions Lenses, Tangents, an Normal Lines Derivatives of Higher Orer Rational Powers of Differentiable

More information

ELECTRONIC SCALE WB-380. Instruction manual

ELECTRONIC SCALE WB-380. Instruction manual ELECTRONIC SCALE WB-380 Instruction manual Temperature Range for Use : 5 C 35 C Relative Humiity : 30% 80% (without conensation) Temperature Range of Environment :

More information

Matrices. Chapter Matrix A Mathematical Definition Matrix Dimensions and Notation

Matrices. Chapter Matrix A Mathematical Definition Matrix Dimensions and Notation Chapter 7 Introduction to Matrices This chapter introduces the theory and application of matrices. It is divided into two main sections. Section 7.1 discusses some of the basic properties and operations

More information

DEVELOPMENT OF DamageCALC APPLICATION FOR AUTOMATIC CALCULATION OF THE DAMAGE INDICATOR

DEVELOPMENT OF DamageCALC APPLICATION FOR AUTOMATIC CALCULATION OF THE DAMAGE INDICATOR Mechanical Testing an Diagnosis ISSN 2247 9635, 2012 (II), Volume 4, 28-36 DEVELOPMENT OF DamageCALC APPLICATION FOR AUTOMATIC CALCULATION OF THE DAMAGE INDICATOR Valentina GOLUBOVIĆ-BUGARSKI, Branislav

More information

Modifying ROC Curves to Incorporate Predicted Probabilities

Modifying ROC Curves to Incorporate Predicted Probabilities Moifying ROC Curves to Incorporate Preicte Probabilities Cèsar Ferri DSIC, Universitat Politècnica e València Peter Flach Department of Computer Science, University of Bristol José Hernánez-Orallo DSIC,

More information

The Mathcad Workspace 7

The Mathcad Workspace 7 For information on system requirements and how to install Mathcad on your computer, refer to Chapter 1, Welcome to Mathcad. When you start Mathcad, you ll see a window like that shown in Figure 2-1. By

More information

Implicit and Explicit Functions

Implicit and Explicit Functions 60_005.q //0 :5 PM Page SECTION.5 Implicit Differentiation Section.5 EXPLORATION Graphing an Implicit Equation How coul ou use a graphing utilit to sketch the graph of the equation? Here are two possible

More information

A Plane Tracker for AEC-automation Applications

A Plane Tracker for AEC-automation Applications A Plane Tracker for AEC-automation Applications Chen Feng *, an Vineet R. Kamat Department of Civil an Environmental Engineering, University of Michigan, Ann Arbor, USA * Corresponing author (cforrest@umich.eu)

More information

State Indexed Policy Search by Dynamic Programming. Abstract. 1. Introduction. 2. System parameterization. Charles DuHadway

State Indexed Policy Search by Dynamic Programming. Abstract. 1. Introduction. 2. System parameterization. Charles DuHadway State Inexe Policy Search by Dynamic Programming Charles DuHaway Yi Gu 5435537 503372 December 4, 2007 Abstract We consier the reinforcement learning problem of simultaneous trajectory-following an obstacle

More information

L A TEX Primer. Randall R. Holmes. August 17, 2018

L A TEX Primer. Randall R. Holmes. August 17, 2018 L A TEX Primer Randall R. Holmes August 17, 2018 Note: For this to make sense it needs to be read with the code and the compiled output side by side. And in order for the compiling to be successful, the

More information

Multilevel Linear Dimensionality Reduction using Hypergraphs for Data Analysis

Multilevel Linear Dimensionality Reduction using Hypergraphs for Data Analysis Multilevel Linear Dimensionality Reuction using Hypergraphs for Data Analysis Haw-ren Fang Department of Computer Science an Engineering University of Minnesota; Minneapolis, MN 55455 hrfang@csumneu ABSTRACT

More information

EFFICIENT ON-LINE TESTING METHOD FOR A FLOATING-POINT ADDER

EFFICIENT ON-LINE TESTING METHOD FOR A FLOATING-POINT ADDER FFICINT ON-LIN TSTING MTHOD FOR A FLOATING-POINT ADDR A. Droz, M. Lobachev Department of Computer Systems, Oessa State Polytechnic University, Oessa, Ukraine Droz@ukr.net, Lobachev@ukr.net Abstract In

More information

Using Vector and Raster-Based Techniques in Categorical Map Generalization

Using Vector and Raster-Based Techniques in Categorical Map Generalization Thir ICA Workshop on Progress in Automate Map Generalization, Ottawa, 12-14 August 1999 1 Using Vector an Raster-Base Techniques in Categorical Map Generalization Beat Peter an Robert Weibel Department

More information

Research Article Inviscid Uniform Shear Flow past a Smooth Concave Body

Research Article Inviscid Uniform Shear Flow past a Smooth Concave Body International Engineering Mathematics Volume 04, Article ID 46593, 7 pages http://x.oi.org/0.55/04/46593 Research Article Invisci Uniform Shear Flow past a Smooth Concave Boy Abullah Mura Department of

More information

A Versatile Model-Based Visibility Measure for Geometric Primitives

A Versatile Model-Based Visibility Measure for Geometric Primitives A Versatile Moel-Base Visibility Measure for Geometric Primitives Marc M. Ellenrieer 1,LarsKrüger 1, Dirk Stößel 2, an Marc Hanheie 2 1 DaimlerChrysler AG, Research & Technology, 89013 Ulm, Germany 2 Faculty

More information

ACE: And/Or-parallel Copying-based Execution of Logic Programs

ACE: And/Or-parallel Copying-based Execution of Logic Programs ACE: An/Or-parallel Copying-base Execution of Logic Programs Gopal GuptaJ Manuel Hermenegilo* Enrico PontelliJ an Vítor Santos Costa' Abstract In this paper we present a novel execution moel for parallel

More information

Shift-map Image Registration

Shift-map Image Registration Shift-map Image Registration Linus Svärm Petter Stranmark Centre for Mathematical Sciences, Lun University {linus,petter}@maths.lth.se Abstract Shift-map image processing is a new framework base on energy

More information

Online Appendix to: Generalizing Database Forensics

Online Appendix to: Generalizing Database Forensics Online Appenix to: Generalizing Database Forensics KYRIACOS E. PAVLOU an RICHARD T. SNODGRASS, University of Arizona This appenix presents a step-by-step iscussion of the forensic analysis protocol that

More information

Adjacency Matrix Based Full-Text Indexing Models

Adjacency Matrix Based Full-Text Indexing Models 1000-9825/2002/13(10)1933-10 2002 Journal of Software Vol.13, No.10 Ajacency Matrix Base Full-Text Inexing Moels ZHOU Shui-geng 1, HU Yun-fa 2, GUAN Ji-hong 3 1 (Department of Computer Science an Engineering,

More information

Open Access Adaptive Image Enhancement Algorithm with Complex Background

Open Access Adaptive Image Enhancement Algorithm with Complex Background Sen Orers for Reprints to reprints@benthamscience.ae 594 The Open Cybernetics & Systemics Journal, 205, 9, 594-600 Open Access Aaptive Image Enhancement Algorithm with Complex Bacgroun Zhang Pai * epartment

More information

Learning Subproblem Complexities in Distributed Branch and Bound

Learning Subproblem Complexities in Distributed Branch and Bound Learning Subproblem Complexities in Distribute Branch an Boun Lars Otten Department of Computer Science University of California, Irvine lotten@ics.uci.eu Rina Dechter Department of Computer Science University

More information

Experion PKS R500 Migration Planning Guide

Experion PKS R500 Migration Planning Guide Experion PKS R500 Migration Planning Guie EPDOC-XX70-en-500E May 2018 Release 500 Document Release Issue Date EPDOC-XX70- en-500e 500 0 May 2018 Disclaimer This ocument contains Honeywell proprietary information.

More information

A Classification of 3R Orthogonal Manipulators by the Topology of their Workspace

A Classification of 3R Orthogonal Manipulators by the Topology of their Workspace A Classification of R Orthogonal Manipulators by the Topology of their Workspace Maher aili, Philippe Wenger an Damien Chablat Institut e Recherche en Communications et Cybernétique e Nantes, UMR C.N.R.S.

More information

Lab work #8. Congestion control

Lab work #8. Congestion control TEORÍA DE REDES DE TELECOMUNICACIONES Grao en Ingeniería Telemática Grao en Ingeniería en Sistemas e Telecomunicación Curso 2015-2016 Lab work #8. Congestion control (1 session) Author: Pablo Pavón Mariño

More information

Analysis of Virtual Machine System Policies

Analysis of Virtual Machine System Policies Analysis of Virtual Machine System Policies Sanra Ruea, Hayawarh Vijayakumar, Trent Jaeger Systems an Internet Infrastructure Security Laboratory The Pennsylvania State University University Park, PA,

More information

Comparison of Methods for Increasing the Performance of a DUA Computation

Comparison of Methods for Increasing the Performance of a DUA Computation Comparison of Methos for Increasing the Performance of a DUA Computation Michael Behrisch, Daniel Krajzewicz, Peter Wagner an Yun-Pang Wang Institute of Transportation Systems, German Aerospace Center,

More information

Cool Things To Do with Word, Excel & PowerPoint!

Cool Things To Do with Word, Excel & PowerPoint! Cool Things To Do with Word, Excel & PowerPoint! Northside ISD Department of Instructional Technology Table of Contents Microsoft Equation Editor... 3 What Is Equation Editor?... 3 Easy-to-Use Toolbar

More information

Automation of Bird Front Half Deboning Procedure: Design and Analysis

Automation of Bird Front Half Deboning Procedure: Design and Analysis Automation of Bir Front Half Deboning Proceure: Design an Analysis Debao Zhou, Jonathan Holmes, Wiley Holcombe, Kok-Meng Lee * an Gary McMurray Foo Processing echnology Division, AAS Laboratory, Georgia

More information

Particle Swarm Optimization Based on Smoothing Approach for Solving a Class of Bi-Level Multiobjective Programming Problem

Particle Swarm Optimization Based on Smoothing Approach for Solving a Class of Bi-Level Multiobjective Programming Problem BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 17, No 3 Sofia 017 Print ISSN: 1311-970; Online ISSN: 1314-4081 DOI: 10.1515/cait-017-0030 Particle Swarm Optimization Base

More information

Queueing Model and Optimization of Packet Dropping in Real-Time Wireless Sensor Networks

Queueing Model and Optimization of Packet Dropping in Real-Time Wireless Sensor Networks Queueing Moel an Optimization of Packet Dropping in Real-Time Wireless Sensor Networks Marc Aoun, Antonios Argyriou, Philips Research, Einhoven, 66AE, The Netherlans Department of Computer an Communication

More information

Technical Report TR Navigation Around an Unknown Obstacle for Autonomous Surface Vehicles Using a Forward-Facing Sonar

Technical Report TR Navigation Around an Unknown Obstacle for Autonomous Surface Vehicles Using a Forward-Facing Sonar Technical Report Department of Computer Science an Engineering niversity of Minnesota 4-192 Keller Hall 2 nion Street SE Minneapolis, MN 55455-159 SA TR 15-5 Navigation Aroun an nknown Obstacle for Autonomous

More information

Chapter 9 Memory Management

Chapter 9 Memory Management Contents 1. Introuction 2. Computer-System Structures 3. Operating-System Structures 4. Processes 5. Threas 6. CPU Scheuling 7. Process Synchronization 8. Dealocks 9. Memory Management 10.Virtual Memory

More information

A Neural Network Model Based on Graph Matching and Annealing :Application to Hand-Written Digits Recognition

A Neural Network Model Based on Graph Matching and Annealing :Application to Hand-Written Digits Recognition ITERATIOAL JOURAL OF MATHEMATICS AD COMPUTERS I SIMULATIO A eural etwork Moel Base on Graph Matching an Annealing :Application to Han-Written Digits Recognition Kyunghee Lee Abstract We present a neural

More information

Multi-camera tracking algorithm study based on information fusion

Multi-camera tracking algorithm study based on information fusion International Conference on Avance Electronic Science an Technolog (AEST 016) Multi-camera tracking algorithm stu base on information fusion a Guoqiang Wang, Shangfu Li an Xue Wen School of Electronic

More information

Introduction to the Emacs Editor

Introduction to the Emacs Editor Introduction to the Emacs Editor Scott D. Anderson Wellesley College Scott.Anderson@acm.org c Fall 2004 1 What is Emacs? Emacs is an editor: a program that allows you to modify files. Many of you have

More information

Software Reliability Modeling and Cost Estimation Incorporating Testing-Effort and Efficiency

Software Reliability Modeling and Cost Estimation Incorporating Testing-Effort and Efficiency Software Reliability Moeling an Cost Estimation Incorporating esting-effort an Efficiency Chin-Yu Huang, Jung-Hua Lo, Sy-Yen Kuo, an Michael R. Lyu -+ Department of Electrical Engineering Computer Science

More information

An Introduction to LATEX

An Introduction to LATEX An Introduction to LATEX Mathematics 23a, Fall 2012 By: Isabel Vogt, Will Rafey, and Neil Gat Last Updated: 13 September, 2012 1 Introduction The simplest way to learn TeX is by example. Copy the heading

More information

Estimating Velocity Fields on a Freeway from Low Resolution Video

Estimating Velocity Fields on a Freeway from Low Resolution Video Estimating Velocity Fiels on a Freeway from Low Resolution Vieo Young Cho Department of Statistics University of California, Berkeley Berkeley, CA 94720-3860 Email: young@stat.berkeley.eu John Rice Department

More information

Yet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama and Hayato Ohwada Faculty of Sci. and Tech. Tokyo University of Scien

Yet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama and Hayato Ohwada Faculty of Sci. and Tech. Tokyo University of Scien Yet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama an Hayato Ohwaa Faculty of Sci. an Tech. Tokyo University of Science, 2641 Yamazaki, Noa-shi, CHIBA, 278-8510, Japan hiroyuki@rs.noa.tus.ac.jp,

More information

STEPHEN WOLFRAM MATHEMATICADO. Fourth Edition WOLFRAM MEDIA CAMBRIDGE UNIVERSITY PRESS

STEPHEN WOLFRAM MATHEMATICADO. Fourth Edition WOLFRAM MEDIA CAMBRIDGE UNIVERSITY PRESS STEPHEN WOLFRAM MATHEMATICADO OO Fourth Edition WOLFRAM MEDIA CAMBRIDGE UNIVERSITY PRESS Table of Contents XXI a section new for Version 3 a section new for Version 4 a section substantially modified for

More information

Characterizing Decoding Robustness under Parametric Channel Uncertainty

Characterizing Decoding Robustness under Parametric Channel Uncertainty Characterizing Decoing Robustness uner Parametric Channel Uncertainty Jay D. Wierer, Wahee U. Bajwa, Nigel Boston, an Robert D. Nowak Abstract This paper characterizes the robustness of ecoing uner parametric

More information

Intensive Hypercube Communication: Prearranged Communication in Link-Bound Machines 1 2

Intensive Hypercube Communication: Prearranged Communication in Link-Bound Machines 1 2 This paper appears in J. of Parallel an Distribute Computing 10 (1990), pp. 167 181. Intensive Hypercube Communication: Prearrange Communication in Link-Boun Machines 1 2 Quentin F. Stout an Bruce Wagar

More information

On the Role of Multiply Sectioned Bayesian Networks to Cooperative Multiagent Systems

On the Role of Multiply Sectioned Bayesian Networks to Cooperative Multiagent Systems On the Role of Multiply Sectione Bayesian Networks to Cooperative Multiagent Systems Y. Xiang University of Guelph, Canaa, yxiang@cis.uoguelph.ca V. Lesser University of Massachusetts at Amherst, USA,

More information

Learning convex bodies is hard

Learning convex bodies is hard Learning convex boies is har Navin Goyal Microsoft Research Inia navingo@microsoftcom Luis Raemacher Georgia Tech lraemac@ccgatecheu Abstract We show that learning a convex boy in R, given ranom samples

More information

Problem Paper Atoms Tree. atoms.pas. atoms.cpp. atoms.c. atoms.java. Time limit per test 1 second 1 second 2 seconds. Number of tests

Problem Paper Atoms Tree. atoms.pas. atoms.cpp. atoms.c. atoms.java. Time limit per test 1 second 1 second 2 seconds. Number of tests ! " # %$ & Overview Problem Paper Atoms Tree Shen Tian Harry Wiggins Carl Hultquist Program name paper.exe atoms.exe tree.exe Source name paper.pas atoms.pas tree.pas paper.cpp atoms.cpp tree.cpp paper.c

More information

6 Gradient Descent. 6.1 Functions

6 Gradient Descent. 6.1 Functions 6 Graient Descent In this topic we will iscuss optimizing over general functions f. Typically the function is efine f : R! R; that is its omain is multi-imensional (in this case -imensional) an output

More information

Study of Network Optimization Method Based on ACL

Study of Network Optimization Method Based on ACL Available online at www.scienceirect.com Proceia Engineering 5 (20) 3959 3963 Avance in Control Engineering an Information Science Stuy of Network Optimization Metho Base on ACL Liu Zhian * Department

More information