• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 25,969
Next 10 →

Table 6.3 was used in the following way: once entered with the measured lengths of tibia

in Computerized anthropometric analysis of the Man of the Turin Shroud
by Giulio Fanti Emanuela, Emanuela Marinelli Aless, Ro Cagnazzo

Table 2 Minimum Distance Between Aircraft Entering the Final Approach Corridor Following

in unknown title
by unknown authors 2005
"... In PAGE 7: ...able 1 Runway Configuration Usage according to weather conditions .................................... 13 Table2 Minimum Distance Between Aircraft Entering the Final Approach Corridor .... In PAGE 23: ... But since it is subject to measurement errors on the part of the air traffic controller, the actual buffer is assumed to be normally distributed with a mean of 2100 meters and a standard deviation of 1260 meters, but truncated two standard deviations at either side of the mean. The minimum distance between successive aircraft is shown in Table2 . When the trailing airplane is slower than the leading airplane, the minimum separation occurs when the airplane that follows enters the common approach path.... In PAGE 23: ... When the trailing airplane is faster than the leading airplane, the minimum separation occurs when the leading airplane crosses the runway threshold. In addition to the minimum distance, Table2 shows the necessary separation between aircraft when the trailing airplane enters the common approach path. In Table 2 and throughout this study, aircraft are classified according to the wake vortex criteria: light, medium and heavy.... In PAGE 23: ... In addition to the minimum distance, Table 2 shows the necessary separation between aircraft when the trailing airplane enters the common approach path. In Table2 and throughout this study, aircraft are classified according to the wake vortex criteria: light, medium and heavy. This classification is ... In PAGE 32: ... MinLeadTime is a property of Plane, which specifies the minimum separation time between the arriving plane and the next plane to arrive. This value is determined by looking up in Table2 (which is represented by a matrix in STROBOSCOPE), adding a stochastic buffer, and dividing by the approach speed. This is defined in the model with the following expression: ONRELEASE AP1 ASSIGN MinLeadTime apos;Min [ComAppL, (MatrixIJ[NextArvType==Heavy ?0:NextArvType==Medium?1:2, Type] +Max[MinBufferd,Min[sNormal[BufferDist,BuffDistsd,2],MaxBufferd]])]/AppSpeed; It is after this time has passed that a resource is released to AppSignals, thus preventing other airplanes that may be in AppR21L to begin approaching during that time.... ..."
Cited by 1

Table 1 Valid SDO_GTYPE Values For a polygon with holes, the user should enter the exterior boundary first, followed by any interior boundaries. In a multi-polygon all polygons in the collection must be disjoint. The d in the Value column of the previous

in An Oracle Data Cartridge for Moving Objects
by Nikos Pelekis, Nikos Pelekis, Yannis Theodoridis, Yannis Theodoridis 2005
Cited by 1

Table 3 This issue becomes crucial, when inheriting annotation schemes and expert lexico-grammatical wordclass annotation classification rationales, for the interpretation of what criteria constitute the allocation of a word-tag pairing: is a verb a verb in every language regardless of the fact that the word describes an action? To illustrate this point, the following words were entered into an online translator for single words entries of Thai-English to ascertain whether the parts-of-speech allocated agreed with the English interpretation.

in unknown title
by unknown authors
"... In PAGE 4: ... A zero indicates that it distinguishes no features for that part-of-speech. However, as illustrated in Table3 below, interpretation of grammatical tokens suffers from a lack of classification universality and devices indicated as absent or... ..."

Table 3 This issue becomes crucial, when inheriting annotation schemes and expert lexico-grammatical wordclass annotation classification rationales, for the interpretation of what criteria constitute the allocation of a word-tag pairing: is a verb a verb in every language regardless of the fact that the word describes an action? To illustrate this point, the following words were entered into an online translator for single words entries of Thai-English to ascertain whether the parts-of-speech allocated agreed with the English interpretation.

in Leeds Metropolitan University,
by Ls He, Co-author Debbie Elliott, Centre For Computer Analysis Of
"... In PAGE 4: ... A zero indicates that it distinguishes no features for that part-of-speech. However, as illustrated in Table3 below, interpretation of grammatical tokens suffers from a lack of classification universality and devices indicated as absent or rare in a language may well exist. ... ..."

Table 2: Minimum distance between aircraft entering the final approach corridor

in SIMULATION AND VISUALIZATION OF AIR-SIDE OPERATIONS AT
by R. M. Fujimoto
"... In PAGE 6: ... MinLeadTime is a property of Plane, which specifies the minimum separation time between the arriving plane and the next plane to arrive. This value is determined by looking up in Table2 (which is represented by a matrix in STROBOSCOPE), adding a stochastic buffer, and dividing by the approach speed. This is defined in the model with the following expression: ONRELEASE AP1 ASSIGN MinLeadTime apos;Min [ComAppL, (MatrixIJ[NextArvType==Heavy ?0:NextArvType==Medium?1:2, Type] +Max[MinBufferd,Min[sNormal[BufferDist,BuffDists d,2],MaxBufferd]])]/AppSpeed; It is after this time has passed that a resource is released to AppSignals, thus preventing other airplanes that may be in AppR21L to begin approaching during that time.... ..."

Table 1 onto the first and last columns. In conventional Prolog, the user has to be in planned mode, so it does not matter much that projec- tions have to be prepared in advance by adding the required rules. In TuplePipes, however, where the user is improvising a long incremental query it is a serious handicap to have to interrupt a query every time one has to do a projection. We have therefore incorporated a facility to allow the user to perform the projection, and to name the result, as part of the query. We do this by entering a right arrow followed by a new predicate symbol and those arguments to be included in the projection. For example, again with the data of the previous examples,

in Tables as a User Interface for Logic Programs
by M. H. M. Cheng, Cheng Van Emden, J. H. M. Lee 1988
"... In PAGE 2: ...test 1 test 2 test 3 savg ayre 69 47 49 55 bell 74 76 84 78 coe 82 82 85 83 dare 58 56 90 68 eames 82 72 71 75 fixx 44 56 41 47 gore 81 59 91 77 tavg 70 64 73 69 Table1 : A display which can be a spreadsheet or a table. for doodling with data.... In PAGE 2: ... This is because a table represents a relation in the sense of the relational data model: each row is a tuple of the relation represented by the table and each column is an attribute. Consider as an example the display in Table1 , showing the result of seven students in three tests, together with averages per student and per test. If the display is a table, then it represents a relation.... In PAGE 2: ...uples. Thus we see that in the table the rows and columns play different roles. Also, the averages for the students (s-avg) are part of the relation, but those for the tests (t-avg) are not. If the display in Table1 is regarded as a spreadsheet, we do not make such distinctions: rows and columns have the same status. Spreadsheets got to computers before tables did, exploding into the vacuum of the initially empty niche for exploratory computer use.... In PAGE 3: ... If this partial query succeeds (and it must, if the entire query is to succeed), then there are answer substitutions, and these are transmitted through that channel. Let us illustrate the dataflow model with an example based on the data in Table1 . When we view these data as a relational table, then the relation has five arguments: name, testl, test2, test3, and s-avg.... In PAGE 3: ... We call these binary relations tl, relating the name to testl; t2 and t3 are similarly defined. With these relations we can build up a table as in Table1 step by step by means of a query with several goals; see Figure 1 for an example.... In PAGE 5: ... We give examples to illustrate how joins, selections, and projections can be done in logic programming. The examples are based on the data introduced in Table1 , assuming that the available relations are the binary tl, t2, and t3 used in Figure 1 and Figure 2.... ..."
Cited by 5

Table 3 Parameters of Best-Fit Functions for Digit-Entering Task Empirical and Simulation Results

in Theoretical and computational analysis of skill learning, repetition priming, and procedural memory
by Prahlad Gupta, Neal J. Cohen 2002
"... In PAGE 6: ... This follows from the definition of skill learning as being the improvement in performance on unique stimuli over blocks. What can we say about performance on repeating stimuli? Data pertinent to this question come, once again, from Kirsner and Speelman (1996), who showed that power functions also provided an excellent fit to performance on the repeating words and non- words in their lexical decision task (Kirsner amp; Speelman, 1996, Figure 5, and Table3 ). Further evidence that multiple repetitions give rise to a reaction time function that follows the power law comes from Logan (1990, Table 1, and Figures 5 and 6).... In PAGE 25: ..., 1999, Experiment 1). Parameters of the best-fit power functions are shown in the upper half of Table3 , along with two goodness-of-fit measures, root-mean-squared deviation (RMSD) and r2, which show that these power functions provide a good fit to performance on unique stimuli and performance on repeating stimuli in the digit-entering task. For IRP, we found that a linear power function provided as good a fit in terms of RMSD and r2 as did the best fitting nonlinear power function.... In PAGE 25: ... For IRP, we found that a linear power function provided as good a fit in terms of RMSD and r2 as did the best fitting nonlinear power function.8 This best linear fit is also graphed in Figure 13a, and its parameters are shown in the upper half of Table3 . These fits to empirical data from the digit-entering task exhibit the same pattern as that obtained by Kirsner and Speelman (1996): Perfor- mance on unique stimuli and performance on repeating stimuli follow the nonlinear power law, but repetition priming is linear.... In PAGE 25: ... For IRP, however (again, as with the empirical data), a linear power function provided as good a fit as did the best fitting nonlinear power function. The parameters of these fitted functions are shown in the lower half of Table3 , along with the goodness-of-fit measures. Even though these measures arise from a single learning mechanism in the model, they exhibit the same pattern of dissociation as in the digit-entering task empirical re- sults, viz.... In PAGE 26: ...974 and .950, respectively ( Table3 ). Similarly, the RMSD and r2 values for the comparison between empirical and simulated performance on repeating stimuli curves, Figure 13a vs.... ..."
Cited by 5

Table D. Crab Process Codes. (1)If multiple processes were used during a crab fishery, record the information for each process on a separate line. (2) If more than one of the following processes was used to create a specific product (such as brined and frozen crab, or cooked and frozen crab) you may enter more than one process code in the process code

in unknown title
by unknown authors 2006

Table displays the extracted values along with parameter values. To extract values and enter them automatically in the Family Table, INSPECT must contain appropriate commands in the commands file (ins.cmd). For example, in the nmos,process project, the following lines define four output variables (VT1, VT3, S, and gm) and their respective values:

in unknown title
by unknown authors
Next 10 →
Results 1 - 10 of 25,969
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University