• 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 316,659
Next 10 →

Table 7: Information Available to the Parties In a Privacy - Enhanced NetBill Transaction

in Token and Notational Money in Electronic Commerce
by L. Jean Camp, Marvin Sirbu, J. D. Tygar, L. Jean, Camp Marvin, Sirbu J. D. Tygar
"... In PAGE 10: ...encryption, hashing, etc.) The information known to parties in a privacy-enhanced version of NetBill is shown in Table7 , with the changes from Table 6 in boldface 5 Conclusions All physical currency has innate anonymity losses due to the possibility of physical observation. Any merchant or observer can narrow the range of possible customer identities by simply looking at the customer! However, disclosure of information so obtained is limited by the relative difficulty of recording the data, and of physical, as opposed to data, surveillance.... ..."

Table 7: Information Available to the Parties In a Privacy -Enhanced NetBill Transaction

in Token and Notational Money in Electronic Commerce
by L. Jean Camp, Marvin Sirbu, J. D. Tygar, L. Jean, Jean Camp Marvin, Sirbu J. D. Tygar 1995
"... In PAGE 11: ...by any number of cryptographic techniques: public key encryption, private key encryption, hashing, etc.) The information known to parties in a privacy-enhanced version of NetBill is shown in Table7 , with the changes from Table 6 in boldface 5 Conclusions All physical currency has innate anonymity losses due to the possibility of physical observation. Any merchant or observer can narrow the range of possible customer identities by simply looking at the customer! However, disclosure of information so obtained is limited by the relative difficulty of recording the data, and of physical, as opposed to data, surveillance.... ..."
Cited by 13

Table 5: Results of misclassification for K-Means and Chameleon with privacy enhance = 10%

in Privacy Preserving Clustering By Data Transformation
by Stanley R. M. Oliveira, Osmar R. Zaïane 2003
"... In PAGE 13: ...27; 5.07] Table 4: Results of privacy provided by the GDTMs with privacy enhance =5% accuracy of our GDTMs as shown in Table5 . On the other hand, we improved the privacy level as can... ..."
Cited by 24

Table 3: Results of misclassification for K-Means and Chameleon with privacy enhance =5%

in Privacy Preserving Clustering By Data Transformation
by Stanley R. M. Oliveira, Osmar R. Zaïane 2003
"... In PAGE 12: ... This example yielded the results of misclassification showed in Table 3. As can be seen in Table3 , the misclassification error was slightly affected when compared with Table 1. However the privacy level of our GDTMs, presented in Table 4, was improved as expected.... ..."
Cited by 24

Table 5.Basic privacy protection techniques used in privacy-enhanced prsonalizaton solutions

in unknown title
by unknown authors

Table 1 The LTO roadmap.

in
by unknown authors
"... In PAGE 3: ...2 Each of these technological advances is described in detail in the following sections. LTO tape layout and servo pattern When the LTO roadmap was laid out, the goal was to achieve a native cartridge capacity of 800 GB in Gen 4 LTO drives and the products were to have backward write and read capability ( Table1 ). The backward capability meant that advances from one generation to the next had to be achieved via small evolutionary steps, and thus it was very desirable that the lateral span of the tape head remain unchanged from one generation to the next.... In PAGE 4: ... TBS and LPOS have enabled LTO drives to achieve a high level of data integrity without adding cost to the drive. Enabling write backward To enable data migration, the LTO format set out to make it possible for each drive generation after the first to be able to write one generation back and read two generations back, as shown in Table1 . In the case of Gen 2 tape drives, which by definition can write Gen 2 cartridges (512 data tracks), this means that they must also be able to read and write the Gen 1 format (384 data tracks) to Gen 1 cartridges.... ..."

Table 6: Information Available to the Parties In a NetBill Transaction

in Token and Notational Money in Electronic Commerce
by L. Jean Camp, Marvin Sirbu, J. D. Tygar, L. Jean, Camp Marvin, Sirbu J. D. Tygar
"... In PAGE 9: ... NetBill normally provides no anonymity since users are identified to merchants and NetBill can trace transactions. The anonymity provided by NetBill is shown in Table6 . Since NetBill is an electronic notational system, the items in boldface are those that differ from a checking transaction.... In PAGE 10: ...Observer None None Full None None Table 7: Information Available to the Parties In a Privacy - Enhanced NetBill Transaction simply hidden by any number of cryptographic techniques: public key encryption, private key encryption, hashing, etc.) The information known to parties in a privacy-enhanced version of NetBill is shown in Table 7, with the changes from Table6 in boldface 5 Conclusions All physical currency has innate anonymity losses due to the possibility of physical observation. Any merchant or observer can narrow the range of possible customer identities by simply looking at the customer! However, disclosure of information so obtained is limited by the relative difficulty of recording the data, and of physical, as opposed to data, surveillance.... ..."

Table 1. Comparison of PAKEs proven to be secure in the standard model

in Pretty-simple password-authenticated key-exchange under standard assumptions
by Kazukuni Kobara, Hideki Imai 2002
"... In PAGE 2: ... In this paper, we propose a more efficient protocol that is also provably secure in the standard model. Comparative results with the previous schemes [7, 9] are summarized in Table1 . As shown in the table, our protocol is efficient in both the communication costs and the computation costs.... ..."
Cited by 9

Table 2-3: Tertiary storage roadmap

in ENACTS-Data Management in HPC 1 The ENACTS Project.......................................................................................................1
by unknown authors 2003
"... In PAGE 7: ...able 1-1: ENACTS Participants by Role and Skills..............................................................2 Table2 -1: Level for RAID technology.... In PAGE 7: ...able 2-1: Level for RAID technology................................................................................12 Table2 -2: Secondary storage technology.... In PAGE 7: ...able 2-2: Secondary storage technology. .........................................................................13 Table2 -3: Tertiary storage roadmap .... In PAGE 7: ...able 2-3: Tertiary storage roadmap ...................................................................................15 Table2 -4: interconnection protocols comparaison.... In PAGE 7: ...able 2-4: interconnection protocols comparaison..............................................................16 Table2 -5: SAN vs.... In PAGE 7: ...able 2-5: SAN vs. NAS ........................................................................................................17 Table2 -6: Sample of RasQL.... In PAGE 19: ... The RAID array is the configuration used to assemble disks, in order to obtain performance and reliability. The basic characteristics of different configurations are found in Table2 -1. RAID A disk array in which part of the physical storage capacity is used to store redundant information about user data stored on the remainder of the storage capacity.... In PAGE 19: ... Level 6 As RAID 5, but with additional independently computed check data. Table2 -1: Level for RAID technology. ... In PAGE 20: ...onsequence, the aggregate I/O rates required for challenging applications (e.g., those involved ASCI) can be achieved only by coupling thousands of disks or hundreds of tapes in parallel. Using the low-end of projected individual disk and tape drive rates, Table2 -2 shows how many drives are necessary to meet high-end machine and network I/O requirements. Secondary Storage Technology Timeline 1999 2001 2004 Disk Transfer Rate 10-15 MB/sec (SCSI/Fibre Channel) 20-40 MB/s 40-60 MB/s (may be higher with new technology) Positioning Latency Milliseconds Milliseconds Milliseconds Single Volume Capacity 18 GB 72 GB 288 GB Active Disks per RAID 8 8 8 Number of RAIDs (100% of I/O rate) 75 375 625 Total Parallel Disks 600 3000 5000 Table 2-2: Secondary storage technology.... In PAGE 20: ... Using the low-end of projected individual disk and tape drive rates, Table 2-2 shows how many drives are necessary to meet high-end machine and network I/O requirements. Secondary Storage Technology Timeline 1999 2001 2004 Disk Transfer Rate 10-15 MB/sec (SCSI/Fibre Channel) 20-40 MB/s 40-60 MB/s (may be higher with new technology) Positioning Latency Milliseconds Milliseconds Milliseconds Single Volume Capacity 18 GB 72 GB 288 GB Active Disks per RAID 8 8 8 Number of RAIDs (100% of I/O rate) 75 375 625 Total Parallel Disks 600 3000 5000 Table2 -2: Secondary storage technology. In contrast to secondary storage, assembling tertiary systems from commodity components is much more difficult, although individual tertiary drives may be as fast as or faster than disk.... In PAGE 22: ... The latter, as standard command protocol is carried also over Fibre Channel connections and over IP connections (called iSCSI). A comparison between these protocols is briefly described in Table2 -4. ... In PAGE 23: ...3, 66.6, 100 SCSI 1 8-bit 5 Fast Wide SCSI 16-bit 20 Ultra SCSI 8-bit 20 Wide Ultra SCSI 16-bit 40 Ultra2 SCSI 8-bit 40 Wide Ultra2 SCSI 16-bit 80 Ultra3 SCSI (Ultra160 SCSI) 16-bit 160 Ultra320 SCSI 16-bit 320 Table2 -4: interconnection protocols comparaison The universal Fiber Channel (FC) protocol, based on fibre optics, has reached a wide diffusion due to its multi protocol interface support. This protocol also supports reliable topologies such as FC-AL (ring).... In PAGE 24: ... All NAS and SAN configurations use available, standard technologies: NAS takes RAID disks and connects them to the network using Ethernet or other LAN topologies, while SAN implementations will provide a separate data network for disks and tape devices using the Fibre Channel equivalents of hubs, switches and cabling. Table2 -5 highlights some of the key characteristics of both SAN and NAS. SAN NAS Protocol Fibre Channel (Fibre Channel-to- SCSI) TCP/IP Application Mission-critical transactions.... In PAGE 24: ...apacity. No distance limitations. Easy deployment and maintenance. Table2 -5: SAN vs. NAS SAN can provide high-bandwidth block storage access over a long distance via extended Fibre Channel links.... In PAGE 36: ...enacts.org October 2003 29 MARRAY Select marray n in [0:255] values condense + over x in sdom(v) using v[x]=n from VolumetricImages as v For each 3-D image its histogram COND Select condense + over x in sdom(w) using w[x] gt; t from Warehouse as w For each datacube in the warehouse, count all cells exceeding threshold value t Table2 -6: Sample of RasQL 2.6.... ..."

Table 1 Summary of characteristics of surveyed data provenance techniques

in An Approach for Pipelining Nested Collections in Scientific Workflows................................... 12
by B. Ludaescher, C. Goble, S. Shankar, A. Kini, D. J. Dewitt, J. Naughton, T. M. Mcphillips, S. Bowers
"... In PAGE 43: ... The primary focus of our work is to increase productivity [13]. As an approximate measure of this, we compare in Table1 the lines of code needed to express five different fMRI workflows, coded in our new VDL, with two other approaches, one based on ad- hoc shell scripts ( Script, able to execute only on a single computer) and a second ( Generator ) that uses Perl scripts to generate older, pre-XDTM VDL. Table 1: Lines of code with different workflow encodings Workflow Script Generator VDL GENATLAS1 49 72 6 GENATLAS2 97 135 10 FILM1 63 134 17 FEAT 84 191 13 AIRSN 215 ~400 37 42... In PAGE 43: ... As an approximate measure of this, we compare in Table 1 the lines of code needed to express five different fMRI workflows, coded in our new VDL, with two other approaches, one based on ad- hoc shell scripts ( Script, able to execute only on a single computer) and a second ( Generator ) that uses Perl scripts to generate older, pre-XDTM VDL. Table1 : Lines of code with different workflow encodings Workflow Script Generator VDL GENATLAS1 49 72 6 GENATLAS2 97 135 10 FILM1 63 134 17 FEAT 84 191 13 AIRSN 215 ~400 37 42... In PAGE 49: ...5 3. GRID WORKFLOW SYSTEM SURVEY A mapping of taxonomy to several existing Grid workflow systems is shown in Table1 . The detailed discussion on these systems along with identification of areas that need further work can be found in [23].... In PAGE 49: ... This paper thus helps to understand key Workflow Design Workflow Scheduling Project Structure Model Composition System Architecture Decision Making Planning Scheme Strategies Fault-tolerance Data Movement DAGMan [19] DAG Abstract User-directed -Language-based Centralized Local Dynamic -Just in-time Performance- driven Task Level -Migration -Retrying Workflow Level -Rescue workflow User-directed Pegasus [6] DAG Abstract User-directed -Language-based Automatic Centralized Local Global Static -user-directed Dynamic -Just in-time Performance- driven Based on DAGMan Mediated Triana [20] Non-DAG Abstract User-directed -Graph-based Decentralized Local Dynamic -Just in-time Performance -driven Based on GAT manger Peer-to-Peer ICENI [16] Non-DAG Abstract User-directed -Language-based -Graph-based Centralized Global Dynamic -Prediction- based Performance- driven Market- driven Based on ICENI middleware Mediated Taverna [17] DAG Abstract Concrete User-directed -Language-based -Graph-based Centralized Local Dynamic -Just in-time Performance- driven Task Level -Retry -Alternate Resource Centralized GrADS [3] DAG Abstract User-directed -Language-based Centralized Local Global Dynamic -Prediction- based Performance- driven Task Level in rescheduling work in GrADS, but not in workflows. Peer-to-Peer GridFlow [4] DAG Abstract User-directed -Graph-based -Language-based Hierarchical Local Static -Simulation- based Performance- driven Task Level -Alternate resource Peer-to-Peer UNICORE [1] Non-DAG Concrete User-directed -Graph-based Centralized User- defined* Static -User-directed User- defined* Based on UNICORE middleware Mediated Gridbus workflow [22] DAG Abstract Concrete User-directed -Language-based Hierarchical Local Static -User-directed Dynamic -Just in-time Market- driven Task Level -Alternate resource Centralized Peer-to-Peer Askalon [7] Non-DAG Abstract User-directed -Graph-based -Language-based Decentralized Global Dynamic -Just in-time -Prediction- based Performance- driven Market- driven Task Level -Retry -Alternate resource Workflow level -Rescue workflow Centralized User-directed Karajan [13] Non-DAG Abstract User-directed -Graph-based -Language-based Centralized User-defined* Task Level -Retry -Alternate resource -checkpoint/restart Workflow Level -User-defined exception handling User-directed Kepler [14] Non-DAG Abstract Concrete User-directed -Graph-based Centralized User-defined* Task Level - Alternate resource Workflow Level - User-defined exception handling - Workflow rescue Centralized Mediated Peer-to-Peer Table1 . Taxonomy mapping to Grid workflow systems.... In PAGE 66: ... Example 1 Let the first three column of the table be our running transaction id, transaction item and date in which the transaction happened. Trans Id Items Date Frequent items Projection 100 c,d,e,f,g,i lt;*,01,04 gt; {c,d,e} 200 a,c,d,e,m,b lt;*,01,04 gt; {a,c,d,e,b} 500 a,c,d,e,b lt;*,01,04 gt; {a,c,d,e,b} 400 a,c,d,h lt;*,06,04 gt; {a,d,h} 600 a,b,d,h,i lt;*,06,04 gt; {a,b,d,h} 300 a,b,d,e,g,k lt;*,06,04 gt; {a,b,d,h} Table1 : Transaction Database Figure 1: Divide and Conquer method on the basis of time Database Only the frequent items play roles in frequent pattern mining. A item with lifespan is frequent for some period of time may be infrequent in whole dataset.... ..."
Next 10 →
Results 1 - 10 of 316,659
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