• 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 175,091
Next 10 →

Table 2 Participants of the conferences

in Interactive computer support in decision conferencing: Two cases on
by Jyri Mustajoki A, Raimo P. Hämäläinen A, Kari Sinkko B 2006
"... In PAGE 7: ... It is also worth noticing that since the positive experiences of these cases, the Web- HIPRE software has been implemented as a part of the related RODOS system (Real-time On-line DecisiOn Support system) [10]. The participants of the conferences were authorities and high-level representatives from the organizations that would also be involved in the decision making process in a real accident situation ( Table2 ). Before the conferences, we organized preparatory meetings with the staff of the radiation authority and other experts on the issues at hand to learn the need for background information on the problem, and to calculate the impacts of different countermeasures.... ..."

Table 2 Participants of the conferences

in DECSUP-11287; No of Pages 14 Interactive computer support in decision conferencing: Two cases on
by Jyri Mustajoki A, Raimo P. Hämäläinen A, Kari Sinkko B 2006
"... In PAGE 7: ... It is also worth noticing that since the positive experiences of these cases, the Web- HIPRE software has been implemented as a part of the related RODOS system (Real-time On-line DecisiOn Support system) [10]. The participants of the conferences were authorities and high-level representatives from the organizations that would also be involved in the decision making process in a real accident situation ( Table2 ). Before the conferences, we organized preparatory meetings with the staff of the radiation authority and other experts on the issues at hand to learn the need for background information on the problem, and to calculate the impacts of different countermeasures.... ..."

Table 1 A DTD for Conference.

in CPI: Constraints-Preserving Inlining Algorithm for Mapping XML DTD to Relational Schema
by Dongwon Lee, Wesley W. Chu 2001
"... In PAGE 4: ... In general, components in DTD are speci ed by the following BNF syntax: lt;!ELEMENT gt; lt;element-name gt; lt;element-type gt; lt;!ATTLIST gt; lt;attr-name gt; lt;attr-type gt; lt;attr-option gt; For a detailed description of a DTD model, refer to Lee and Chu (2000a). Table1 shows a DTD for Conference which states that a conf element can have four sub-elements: title, date, editor and paper in that order. As common in regular expressions, 0 or 1 occurrence (i.... In PAGE 5: ... On the other hand, the contact element has a mandatory aid attribute that must point to the id attribute of the contacting author of the current paper. One interesting de nition in Table1 is the cite element; it can have zero or more paper ele- ments as sub-elements, thus creating a cyclic de nition. Table 2 shows a valid XML document conforming to the DTD for Conference.... In PAGE 13: ...A relational scheme (S) along with the associated data that are converted from the DTD of Table1 and XML document of Table 2 by the hybrid algorithm. Note that the hybrid algorithm does not generate semantic constraints ( ).... In PAGE 15: ...onf, conf.editor conf, conf.paper confg. Another form of IDs can be found in the attribute de nition part of the DTD with the use of the IDREF(S) keyword. For instance, consider the contact and editor elements in the DTD in Table1 shown below: lt;!ELEMENT person (name,(email|phone)? gt; lt;!ATTLIST person id ID #REQUIRED gt; lt;!ELEMENT contact EMPTY gt; lt;!ATTLIST contact aid IDREF #REQUIRED gt; lt;!ELEMENT editor (person*) gt; lt;!ATTLIST editor eids IDREFS #IMPLIED gt; The DTD restricts the aid attribute of the contact element such that it can only point to the id attribute of the person element 4 . Further, the eids attribute can only point to multiple id attributes of the person element.... In PAGE 16: ...Table1 . This kind of EGDs can be enforced by SQL UNIQUE construct.... In PAGE 16: ... This is the case of the (1,1) and (1,N) mappings in the cardinality constraints. For in- stance, from the DTD in Table1 , because the conf element must contain the title and date sub-elements, the child constraint conf ftitle, dateg holds. (2) Parent constraint: quot;Child Parent quot; states that every element of type Child must have a parent element of type P arent.... ..."
Cited by 12

Table II Selected uses of conference proceedings

in The Roles of Video in the Design, Development, and Use of Interactive Electronic Conference Proceedings
by Samuel A. Rebelsky, Fillia Makedon, James Ford, Charles Owen, Peter A. Gloor, Coopers Lybrand, P. Takis Metaxas

Table 5 International conference on software engineering

in Abstract Experimental validation in software engineering’
by Marvin V. Zelkowitzayb, Dolores Wallace

Table 1: Load Balancing Statistics [18] Shasha D. and Goodman N. Concurrent Search Tree Algorithms, ACM Transactions on Database Systems, 13(1), 1988, pp. 53-90. [19] Weihl E. W. and Wang P. Multi-version Memory: Software cache Management for Concurrent B- Trees, Proceedings of the 2nd IEEE Symposium on Parallel and Distributed Processing, 1990, pp. 650-655. [20] Yen I. and Bastani F. Hash Table in Massively Parallel Systems, Proceedings of the 1992 Interna- tional Conferences on Computer Languages, April 20-23, 1992, pp. 660-664.

in Implementing Distributed Search Structures
by Padmashree Krishna, Theodore Johnson 1992
"... In PAGE 16: ... With hot spots the variation is much greater, indicating the nice e ect load balancing has for smoothing the variation and reducing the gradient. Finally Table1 shows the calculated average number of moves made by a node in the entire system, with and without hot spots and with and without load balancing, and the normalized variation of the capacity at each processor from the mean. The table shows that the load balancing reduces the coe cient of variation at the cost of a very small increase in the average moves in the system, indicating that load balancing is e ective with low overhead.... ..."
Cited by 4

(Table) Figure 12.7 Software Architecture of a part of the IFIP Conference Planning Systembefore the change request

in Towards A Flexible Software Architecture of Interactive Systems
by M. Goedicke, B. Sucrow

Table 5: Test pattern generation IDDQ statistics (standard cell) VLSI. In Proceedings of International Test Conference, pages 938{947. IEEE, 1990. [SM90] Thomas Storey and Wojciech Maly. CMOS bridging fault detection. In Proceedings of International Test Conference, pages 842{ 851. IEEE, 1990.

in Test Pattern Generation for Realistic Bridge Faults in CMOS ICs
by Joel Ferguson, Tracy Larrabee 1991
"... In PAGE 6: ... Possible solutions are to em- ploy IDDQ testing [Ack83], apply more accurate circuit simulation of faults, detect the bridge as a delay fault, or redesign the cells so that a discrepancy is guaran- teed for at least one input combination for each cell. In Table5 we show the results of our system generating IDDQ test patterns for same set of bridging faults that produced the results in Table 4. We also plan on integrating the testing for breaks on the interconnection lines, and the testing for defects within the cells to Carafe and Nemesis.... ..."
Cited by 41

Table 1: Tableau expansion rules for ALCHR+ Spring Symposium (AAAI apos;97). AAAI Press, Menlo Park, California, 1997. To appear. [Sat95] U. Sattler. A concept language for engineer- ing applications with part{whole relations. In Proceedings of the International Conference on Description Logics|DL apos;95, pages 119{ 123, Roma, Italy, 1995.

in Description Logics with Transitive Roles
by Ian Horrocks, Graham Gough 1997
"... In PAGE 3: ...isMadeOf + hasLayer+ ProcessPartitiveAttribute StructuralPartitiveAttribute+ hasSubprocess+ PartitiveAttribute+ Figure 1: A fraction of the Galen role hierarchy node x0, called the root node, with L(x0) = fDg. T is then expanded by repeatedly applying the rules from Table1 until either the root node is marked satis able or none of the rules is applicable. If the root node is marked satis able then the algorithm returns satis able; otherwise it returns unsatis able.... ..."
Cited by 12

Table 1: Tableau expansion rules for ALCHR+ Spring Symposium (AAAI apos;97). AAAI Press, Menlo Park, California, 1997. To appear. [Sat95] U. Sattler. A concept language for engineer- ing applications with part{whole relations. In Proceedings of the International Conference on Description Logics|DL apos;95, pages 119{ 123, Roma, Italy, 1995.

in Description Logics with Transitive Roles
by Ian Horrocks Graham, Graham Gough 1997
"... In PAGE 3: ...isMadeOf + hasLayer+ ProcessPartitiveAttribute StructuralPartitiveAttribute+ hasSubprocess+ PartitiveAttribute+ Figure 1: A fraction of the Galen role hierarchy node x0, called the root node, with L(x0) = fDg. T is then expanded by repeatedly applying the rules from Table1 until either the root node is marked satis able or none of the rules is applicable. If the root node is marked satis able then the algorithm returns satis able; otherwise it returns unsatis able.... ..."
Cited by 12
Next 10 →
Results 1 - 10 of 175,091
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