Results 21 - 30 of 23,048

Table 1: Transformation representation rules (TRR)

in Integrating Design and Development in the Production of Multimedia Documents
by Stephen J. Morris, Anthony C. W. Finkelstein
"... In PAGE 7: ... The first of these extensions is essential for tracing the origin of media elements in any record of production and the second for direction of any new production. The set of transformation representation rules (TRR) shown in Table1 uses Backus-Naur Form to define a syntax for describing media transformations in a way that meets these requirements. Use of TRR provides a more succinct description of the production process, defining more clearly the relationships between activities, their sources and products.... ..."

Table 2 A comparison of the wave-function percentages in the favoured representations of U(6), rst row, and of the new chain C, O(18) O(15), in the second row for each nucleus. The favoured representations in chain C are = N and = 0, 1, 2 (3 if T = 0) and 2 for J = 0, 2, 3 and 4 respectively.

in unknown title
by unknown authors
"... In PAGE 3: ... It is therefore of interest to analyse our wave-functions in the new group chain C since the examples above suggest that this chain is not incompatible with a coupling scheme close to U(6). Table2 shows the results of such an analysis for the low states of each spin for the nuclei considered. The rst... ..."

Table 2 A comparison of the wave-function percentages in the favoured representations of U(6), rst row, and of the new chain C, O(18) O(15), in the second row for each nucleus. The favoured representations in chain C are = N and =0,1,2(3if T=0)and2forJ= 0, 2, 3 and 4 respectively.

in unknown title
by unknown authors
"... In PAGE 3: ... It is therefore of interest to analyse our wave-functions in the new group chain C since the examples above suggest that this chain is not incompatible with a coupling scheme close to U(6). Table2 shows the results of such an analysis for the low states of each spin for the nuclei considered. The rst... ..."

Table 3. Overview of CFDL source element representations

in Variability Management With Feature Models
by Danilo Beuche, Holger Papajewski, Wolfgang Schröder-preikschat 2004
"... In PAGE 5: ... Some source elements are more sophisticated, like classalias or flagfile, and require generation of new source code by the backends. Table3 lists the cur- rently available source element representations. The actual interpretation of these source elements is handed over to the CONSUL component generator back- ends.... ..."
Cited by 12

Table 3. Overview of CFDL source element representations

in Table of Contents
by unknown authors
"... In PAGE 78: ... Some source elements are more sophisticated, like classalias or flagfile, and require generation of new source code by the backends. Table3 lists the cur- rently available source element representations. The actual interpretation of these source elements is handed over to the CONSUL component generator back- ends.... ..."

Table 2: Plan Memory Representation.

in unknown title
by unknown authors 2001
"... In PAGE 14: ... 2.2 Transformational or Derivational Representation Case-based planning systems may be discriminated depending on whether they store ground plans or derivational traces (see Table2 ). This choice is in uenced by the adaptation method which is used (see Section 4).... In PAGE 15: ... 2.3 Indexed or Flat Representation Case-based planning systems may also be discriminated depending on whether they use an indexing scheme or not (see Table2 ). Most of the authors claim that an indexing scheme is needed to make the retrieval easier.... In PAGE 15: ..., 1998; Kamp, 1996; Giretti and Spalazzi, 1997; Plaza et al., 1997] (see Table2 ). They claim that this fact makes it di cult to compare di erent approaches, to prove their properties, and to extend them to new di erent applications.... ..."
Cited by 12

Table 5.2: Type and decidability of some sorted uni cation problems As a corollary of the results in Chapter 6, we ll in the previous unknowns in Table 5.2, showing that uni cation and regularity are decidable for linear signatures. Even though these signatures are in general of type in nitary, we can always obtain a nite number of ssc-uni ers after translating the original uni cation problem into the new ssc representation. Further- more, this result is extended to a broader class of signatures, which we call semi-linear (see Section 6.3).

in Sorted Unification And The Solution Of Semi-Linear Membership Constraints
by Tomás Esteban Uribe 1991
Cited by 1

Table 1. Switch request representations.

in Multicast Control in Optical Circuit-Switched Banyan Networks
by C. Salisbury, R. Melhem
"... In PAGE 3: ... To accommodate a wide range of network control pro- tocols and both full and partial multicast, we will represent switch state requests using three bits. Table1 summarizes these states and the notation that will be used in the exam- ples that follow. The last two values in the table support full multicast, and will be described later.... In PAGE 5: ... Contention is resolved in favor of processors with the lower addresses, and the switch will be set in the straight state. Using the representations in the lower two lines of Table1 , the contention resolution algo- rithm may optionally give multicast requests a differ- ent prioritythan unicast requests. The circuit requested 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 0 stage 2 stage 0 stage 1 Figure 3.... In PAGE 8: ... Circuits are reserved until explicitly released. This can be indicated using a new request state, #28r#29, and repre- sented as #28001#29in Table1 . RER depends on proces- sors to be well-behaved and release unneeded circuits.... ..."

Table 1. Classification of the representation formalism.

in Case-Based Plan Adaptation: An Analysis and Review
by Héctor Muñoz-avila, Michael T. Cox
"... In PAGE 11: ... Planning graphs have been shown to be more efficient than other forms of STRIPS planning but encoding domain-specific control rules into graphs is difficult. As shown in Table1 , CBP systems have been proposed using each of these planning techniques and even combinations of those techniques such as in Paris and Priar. This table lists a new case-based planner named CPG (Gerevi amp; Serina, 2000) that combines both transformation and memory search.... ..."

Table 1. Representation of Pousadas UGP

in User Group Profile Modeling based on User Transactional Data for Personalized Systems
by Yiling Yang, Nuno C. Marques, Faculdade Ciências E Tecnologia
"... In PAGE 7: ... The category names are extracted from pousadas_DB. Table1 sketches the content of one UGP that covers 15 user transactions. Table 1.... In PAGE 10: ... For example, let us consider that a fishing site is announcing a new sport area in north of Portugal. If this information is inserted in the database the UGP of Table1 should be matched. Indeed it is possible to convert text extracted information by using the database (assuming there are database relations between nature - pousadas_type- and interest_activities as natural tours) to an UGP data structure.... ..."
Results 21 - 30 of 23,048