Page Size Research Articles

On Spatial Orders and Location Codes

Spatial orders such as the Morton (Z) order, U-order, or X-order have applications in matrix manipulation, graphic rendering and data encryption. It is shown that these spatial orders are single examples of entire classes of spatial orders which can be defined in arbitrary numbers of dimensions and base values. Secondly, an algorithm is proposed which can be used to transform between these spatial orders and Cartesian coordinates. It is shown that the efficiency of the algorithm improves with a larger base value. By choosing a base value that corresponds to the available memory page size, the computational effort required to perform operations such as matrix multiplication can be optimized.

Celebrations and Introductions

Celebrations and Introductions Pearl A. McHaney We celebrate the one hundredth anniversary of Eudora Welty’s birth with the metamorphosis of the Eudora Welty Newsletter into an annual journal, the Eudora Welty Review. This inaugural issue of the Eudora Welty Review follows thirty-two years, sixty-five issues in all, of the Eudora Welty Newsletter, and with its reprint of twenty-seven selections, marks the Eudora Welty Centennial. Begun in 1977 as “a relatively informal medium of communication among Welty scholars and collectors” by W. U. McDonald, Jr., the Newsletter biannually fulfilled its aim of publishing bibliographic notes, textual collations, checklists of scholarship, announcements of new works by the author, and lists of newspaper clippings. The first issue included a progress report on Noel Polk’s descriptive bibliography. (Polk was typing, noting collations, and measuring page size in Columbia, South Carolina, at the time.) Michael Kreyling, then at Mississippi State, contributed evidence of his critical acuity with a note on “The Reginald Birch Illustration in The Golden Apples.” In his introduction, “Readers Encouraged,” McDonald wrote, “Believing that journals aplenty exist for their publication, EWN is not intended as an outlet for explications, critical analyses, and more broadly scholarly studies.” In 1997, the Newsletter moved from the University of Toledo and McDonald’s steady and wise editorship to Georgia State University. Noel Polk wrote an appreciation for Bill “Mac” McDonald, recognizing “Mac for having been not just a pioneer in Welty studies, but the inspiration and a sustaining presence as the field had developed over the past three and a half decades” (EWN XXI.1 [Winter 1997]: 15). My contributions to the cosmos of Welty studies are but in their infancy compared to the work of the two great constellations of W. U. McDonald and Noel Polk. They gave me my first opportunities, corrected my wanderings, and offered their Newsletter to my care. Although the Eudora Welty Review veers from the course McDonald first set, it has his blessing. We will continue to publish bibliographic and textual notes, queries, and checklists, but EWR will be primarily a journal of Welty scholarship and criticism. In determining which of the more than three hundred pieces published between 1977 and 2008 to reprint in the inaugural EWR, we wished [End Page 1] to show the variety, the significance, and the imaginativeness of Welty studies. We selected John Bayne’s textual collation and research on the musical phrases in the Levee Press limited edition of Music From Spain to illustrate Noel Polk’s brief comments about textual analyses. Over the last decade EWN published research on international Welty studies, represented in this issue by Maria Sciacco’s essay on Welty in Italy with a case study of the translations of “Livvie.” Exploring Welty’s cosmos with essays on books Welty or her characters read and on the author’s peers has been a rewarding enterprise in EWN; here we reprint essays by James Shimkus relating “Sir Rabbit” to texts by Joel Chandler Harris and Zora Neale Hurston, Joan Wylie on Elsie Dinsmore, and Leslie Gordon on The Re-Creation of Brian Kent. EWR is delighted to reprint reminiscences by renowned author Elizabeth Spencer and the editor of Collected Stories John Ferrone; a seriocomic essay on humor by Lois Welch; and an essay on Welty’s photographs by British historian Stuart Kidd. Other essays add to our understanding of “A Worn Path,” “Clytie,” “Why I Live at the P. O.,” Delta Wedding, The Shoe Bird, The Ponder Heart, and The Robber Bridegroom. The last two essays illustrate the kind of specific critical assessments that we hope to bring back to Welty studies with serious analytical book reviews: Danièle Pitavy-Souques’s appraisal of Delta V and Michael Kreyling’s review of three books of essays on Welty. EWR is now prepared to accept submissions for the 2010 issue. Guidelines and peer review policies are outlined on our website (www2.gsu.edu/~wwwewn). In the 2010 issue, Geraldine Chouard will conclude her study “Welty A to Z,” and Cathy Chengges’s annual checklist of Welty scholarship 2008–2009 will update the compendium checklist from 1986 to May 2008 published in the 2009 Mississippi Quarterly Eudora Welty...

The Possible Relationship of the Beowulf and the Blickling Homilies Manuscripts

WHILE the specific literary connection between Blickling Homily XVII and Beowulf is often noted and well discussed, there has been some recent debate regarding the possibility of a codicological relationship between the two manuscripts.1 There are general paleographical similarities, namely a broad resemblance of a hand in each manuscript (as noted by Max Förster2) and the two manuscripts’ peculiar paleographical situation of having what appears to be a late tenth-century hand working contemporarily with an early eleventh-century hand,3 but the evidence of scripts alone does not make the case, and Kevin Kiernan's argument for the possibility of a link between the two manuscripts has been queried accordingly.4 However, an examination of codicological details—gatherings, arrangement, ruling, etc.—of a wider range of books suggests that the question of a shared origin for the Beowulf and Blickling manuscripts ought to remain open. Kiernan calls attention to physical similarities in the construction of the two manuscripts. As N. R. Ker describes, the fire-damaged Beowulf has leaves of c. 195 × 115–30 mm, with a written space, or grid, of c. 175 × 105 mm, ruled for 20 long lines in most quires, 21 lines in three quires, and 22 lines in one, with single bounding lines.5 Similarly, Blickling has leaves of c. 200 × 145 mm and a written space of 180 × 108 mm, and is ruled for 21 lines of text, with some sides bearing an extra unruled twenty-second line of text, with double bounding lines.6Beowulf is constructed mainly in quires of eight with two quires of ten (possibly with some other irregular quires),7 and while most of the quires in the manuscript are regularly arranged hair facing hair and flesh facing flesh, in the first quire and in all of scribe B's quires, all leaves are arranged hair-side out, while some others are irregular. In Blickling, the quires are of two, four, six, eight, and ten, usually with hair-side out, and yet there are several that vary from this practice, including one with all flesh-sides out, and other irregularities.8 However, Blickling seems to have been constructed using quire signatures, which remain extant or in traces at the bottom centre of the last verso in many quires. The Beowulf manuscript does not bear quire signatures. Thus, both manuscripts are similarly unconventional and inconsistent in physical structure, even as they both present very similar page sizes, writing grids, and ruling patterns, though differing in bounding lines and quire signatures.

A Fully Performance Compatible 45 nm 4-Gigabit Three Dimensional Double-Stacked Multi-Level NAND Flash Memory With Shared Bit-Line Structure

A 3-dimensional double stacked 4 gigabit multilevel cell NAND flash memory device with shared bitline structure have successfully developed. The device is fabricated by 45 nm floating-gate CMOS and single-crystal Si layer stacking technologies. To support fully compatible device performance and characteristics with conventional planar device, shared bitline architecture including Si layer-dedicated decoder and Si layer-compensated control schemes are also developed. By using the architecture and the design techniques, a memory cell size of 0.0021 mum <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> /bit per unit feature area which is smallest cell size and 2.5 MB/s program throughput with 2 kB page size which is almost equivalent performance compared to conventional planar device are realized.

Self-tuning of data allocation and storage management : advantages and implications

Many important business applications use complex database management systems (DBMS). These DBMS have to be administrated and optimized for an optimal performance, especially in time-critical applications. Administration and optimization are very complex and costly tasks. Therefore, researchers and DBMS vendors focus on development of self-tuning techniques for a continuous adaption, e.g., the COMFORT automatic tuning project [6] or the MAPE approach by IBM [2]. However, the optimization and usage of self-tuning techniques for allocation and storage management of data are less investigated. DBMS vendors inform their customers about advantages and disadvantages of optimizing data storage in their user manuals and tuning guidelines. They recommend usage of functionality to optimize data storage with respect to the higher administration costs. But, DBMS vendors do not publish guidelines for this. Optimization of data storage is a complex (high administrative needs) task with many of options and parameters. For instance, the number of parameters for table space creation is huge, e.g., page size or database partition group. These two parameters affect essentially the performance of data allocation and storage management. In the scope of data allocation and storage management, many parameters dependencies and implications are unobserved. Our approach will observe the affect of the parameters. This paper presents first steps for better solutions and estimations for data allocation and storage management based on the parameter page size and its configuration.

플래시 메모리 상에서 B+-트리 노드 크기 증가에 따른 성능 평가

플래시 메모리는 크기가 작고 적은 전력을 사용하며 충격에 강하기 때문에 휴대폰, MP3 플레이어, PDA와 같은 이동 기기에 널리 사용되고 있다. 또한, 노트북과 개인용 컴퓨터에서 사용하던 하드디스크를 플래시 메모리로 교체하려는 시도도 진행되고 있다. 최근에는 플래시 메모리 저장 시스템에서 대용량의 데이터를 효율적으로 검색하기 위한 플래시 메모리용 <TEX>$B^+$</TEX>-트리 인덱스를 개발하려는 연구가 이루어지고 있다. 이러한 연구는 <TEX>$B^+$</TEX>-트리에 키의 삽입 또는 삭제 시 발생하는 "덮어쓰기"를 최소화하는데 초점을 두고 있다. 그러나 이것뿐만 아니라 하나의 <TEX>$B^+$</TEX>-트리 노드에 할당되는 물리적 페이지의 크기도 <TEX>$B^+$</TEX>-트리 성능에 영향을 줄 수 있다. 본 논문에서는 다양한 실험을 통해 노드 크기에 따른 <TEX>$B^+$</TEX>-트리의 구축 성능, 검색 성능, 그리고 저장 공간 사용량을 비교 및 분석한다. 노드에 키 삽입 시 정렬 및 비정렬 알고리즘을 제시하며, 또한 효율적인 노드 검색을 위한 적절한 인덱스 노드 헤드 구조를 제안한다. Flash memory is widely used as a storage medium for mobile devices such as cell phones, MP3 players, PDA's due to its tiny size, low power consumption and shock resistant characteristics. Additionally, some computer manufacturers try to replace hard-disk drives used in Laptops or personal computers with flash memory. More recently, there are some literatures on developing a flash memory-aware <TEX>$B^+$</TEX>-tree index for an efficient key-based search in the flash memory storage system. They focus on minimizing the number of "overwrites" resulting from inserting or deleting a sequence of key values to/from the <TEX>$B^+$</TEX>-tree. However, in addition to this factor, the size of a physical page allocated to a node can affect the maintenance cost of the <TEX>$B^+$</TEX>-tree. In this paper, with diverse experiments, we compare and analyze the costs of construction and search of the <TEX>$B^+$</TEX>-tree and the space requirement on flash memory as the node size increases. We also provide sorting-based or non-sorting-based algorithms to be used when inserting a key value into the node and suggest an header structure of the index node for searching a given key inside it efficiently.

Reducing the TLB Context Switching Miss Ratio With Banked and Prefetching Mechanism

Address translations from virtual addresses to physical addresses are widely considered as one of the most important issue for memory system performance. In order to improve the performance, the Translation Lookaside Buffer (TLB) is used. Lots of different methodologies are proposed to reduce TLB misses. Most designs just simply try to increase the total size of their TLBs to reduce the capacity misses or just simply use the fully associativity to reduce the conflict misses. Furthermore, some designs even try to incorporate the operating system (OS) and TLBs with very complex methods. Only some studies consider influence of performance on the context switching issue. Most traditional designs just simply added some types of address space identifier within the TLB tags. Nevertheless, the worse case of all is the x86 architecture which flushes all its TLB entries on context switching. This paper proposes a banked TLB structure with prefetching mechanism to reduce the miss rate in context switching for 32K page size. All simulations were done with modified SimpleScalar 3.0d tool suite and SPEC95 benchmarks. The results show that the proposed mechanism can provide acceptable performance improvement than the worse case x86 style design. The miss rate may even be only 1/10 or less. Thus, the proposed architecture may be suitable to be implemented inside processors to reduce the context switching misses. Furthermore, we'll try to implement it inside our new asynchronous processor.

The Bulletin at 60: from scientific organ to public health journal

The Bulletin of the World Health Organization is recognized as one of the world's pre-eminent public health journals, having maintained its role as the organization's principal scientific organ, This dual focus has not sprung up overnight but has been the result of an evolutionary process over its 60-year history. Several changes to both its content and format and, crucially, the publication of several landmark articles have helped forge the journal's unique identity. When it was launched in 1948, as a deliberate continuation of the earlier Bulletin of the League of Nations Health Organization, the Bulletin was expected to have an important influence on medical opinion in the widest sense, and especially on the opinions of those responsible for formulating and guiding medical theory and practice: that is, medical scientists and teachers, and public health administrators. The first few issues of the Bulletin were distributed free to national health and research institutes, medical schools and faculty libraries, often in exchange for medical journals. Subscriptions were soon offered; in June 1948, there were almost 600 paid subscribers, though few were private individuals. The work of WHO'S Expert Advisory Committees--external experts invited to advise WHO on specific subjects--was the main inspiration for much of the Bulletin's early content. The journal's main function at that time was also to publish studies relevant to the Expert Committees' work and to cover subjects for which there were experts within the WHO secretariat. The Executive Board believed the Bulletin should publish articles on the following six categories: * laboratory studies on topics such as biological standardization and communicable diseases, one of the main objectives being to encourage the use of uniform methods to obtain comparable results; * internationally significant studies of results achieved by specific disease control methods; * studies of the geographical distribution of diseases; * reports of surveys, especially those involving studies of relevant world literature and visits to countries; reports of original findings made in the course of field programmes; and * review articles based primarily on surveys of literature summarizing the present state of knowledge in different fields By October 1958, the Bulletin was mainly publishing articles on communicable diseases, especially malaria and tuberculosis. By this time, entire issues of the Bulletin dedicated to a specific topic had started to appear, ranging from plague control (1953) and environmental sanitation (1954) to occupational health (1955) and the serology of syphilis (1956). In 1963, the Bulletin started to publish supplements to the regular volumes, covering topics of interest to the public health community--often with a more public health than scientific focus. One of the first was devoted to meningitis in Africa. This balance between science and its application for public health purposes would continue to characterize the journal for decades to come. By the end of the 1950s, the Bulletin had established a clear character. A report delivered to the 25th session of the WHO Executive Board in 1959 noted that 67% of articles published since the journal's inception qualified as international or unrelated to a geographical area. The Bulletin's format was also evolving along with the content. In 1950, a bibliographical section (containing references relevant to the sanitary conventions) was included and the Executive Board authorized the publication of a single edition containing articles in French or English, with summaries in both these working languages. In 1959, the format and the cover were redesigned, with a larger page size and smaller print with a double-column layout, facilitating the inclusion of more tables, graphs, maps and other illustrative material. …

Rose

Rose is a database storage engine for high-throughput replication. It targets seek-limited, write-intensive transaction processing workloads that perform near real-time decision support and analytical processing queries. Rose uses log structured merge (LSM) trees to create full database replicas using purely sequential I/O, allowing it to provide orders of magnitude more write throughput than B-tree based replicas. Also, LSM-trees cannot become fragmented and provide fast, predictable index scans. Rose's write performance relies on replicas' ability to perform writes without looking up old values. LSM-tree lookups have performance comparable to B-tree lookups. If Rose read each value that it updated then its write throughput would also be comparable to a B-tree. Although we target replication, Rose provides high write throughput to any application that updates tuples without reading existing data, such as append-only, streaming and versioning databases. We introduce a page compression format that takes advantage of LSM-tree's sequential, sorted data layout. It increases replication throughput by reducing sequential I/O, and enables efficient tree lookups by supporting small page sizes and doubling as an index of the values it stores. Any scheme that can compress data in a single pass and provide random access to compressed values could be used by Rose. Replication environments have multiple readers but only one writer. This allows Rose to provide atomicity, consistency and isolation to concurrent transactions without resorting to rollback, blocking index requests or interfering with maintenance tasks. Rose avoids random I/O during replication and scans, leaving more I/O capacity for queries than existing systems, and providing scalable, real-time replication of seek-bound workloads. Analytical models and experiments show that Rose provides orders of magnitude greater replication bandwidth over larger databases than conventional techniques.

Energy and Fuels Research in South African Universities: A Comparative Assessment

This article was e-mailed by Kia Prelorenzo on 18 June 2008. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.5/), which permits unrestrictive use, distribution, and reproduction in any medium, provided the original work is properly cited. PDF Producer: Acrobat Distiller 7.0.5 for Macintosh. PDF Version: 1.4 (Acrobat 5.x). File Size: 121.98 KB (124.904 Bytes). Page Size: 8.50 x 11.00 in. Number of Pages: 9. Tables on pages 3 - 8.

The Parkinson Disease-associated Leucine-rich Repeat Kinase 2 (LRRK2) Is a Dimer That Undergoes Intramolecular Autophosphorylation

Mutations in leucine-rich repeat kinase 2 (LRRK2) are a common cause of familial and apparently sporadic Parkinson disease. LRRK2 is a multidomain protein kinase with autophosphorylation activity. It has previously been shown that the kinase activity of LRRK2 is required for neuronal toxicity, suggesting that understanding the mechanism of kinase activation and regulation may be important for the development of specific kinase inhibitors for Parkinson disease treatment. Here, we show that LRRK2 predominantly exists as a dimer under native conditions, a state that appears to be stabilized by multiple domain-domain interactions. Furthermore, an intact C terminus, but not N terminus, is required for autophosphorylation activity. We identify two residues in the activation loop that contribute to the regulation of LRRK2 autophosphorylation. Finally, we demonstrate that LRRK2 undergoes intramolecular autophosphorylation. Together, these results provide insight into the mechanism and regulation of LRRK2 kinase activity.

Dynamic scratchpad memory management for code in portable systems with an MMU

In this work, we present a dynamic memory allocation technique for a novel, horizontally partitioned memory subsystem targeting contemporary embedded processors with a memory management unit (MMU). We propose to replace the on-chip instruction cache with a scratchpad memory (SPM) and a small minicache. Serializing the address translation with the actual memory access enables the memory system to access either only the SPM or the minicache. Independent of the SPM size and based solely on profiling information, a postpass optimizer classifies the code of an application binary into a pageable and a cacheable code region. The latter is placed at a fixed location in the external memory and cached by the minicache. The former, the pageable code region, is copied on demand to the SPM before execution. Both the pageable code region and the SPM are logically divided into pages the size of an MMU memory page. Using the MMU's pagefault exception mechanism, a runtime scratchpad memory manager (SPMM) tracks page accesses and copies frequently executed code pages to the SPM before they get executed. In order to minimize the number of page transfers from the external memory to the SPM, good code placement techniques become more important with increasing sizes of the MMU pages. We discuss code-grouping techniques and provide an analysis of the effect of the MMU's page size on execution time, energy consumption, and external memory accesses. We show that by using the data cache as a victim buffer for the SPM, significant energy savings are possible. We evaluate our SPM allocation strategy with fifteen applications, including H.264, MP3, MPEG-4, and PGP. The proposed memory system requires 8% less die are compared to a fully-cached configuration. On average, we achieve a 31% improvement in runtime performance and a 35% reduction in energy consumption with an MMU page size of 256 bytes.

Bande dessinée and the Cinematograph: Visual Narrative in 1895

Abstract The Lumiere brothers' L'Arroseur arrose ['The Sprinkler Sprinkled'] of 1895 was probably the first staged fiction film to be shown in public, but also the first cinematic adaptation of a comic strip, previous treatments of the subject including an Imagerie Quantin broadsheet by Hermann Vogel, a cartoon by Christophe in Le Petit Francais Illustre and an illustrated sequence by Uzes in Le Chat Noir. What emerges from direct comparison is an appreciation of the sophisticated narrative devices that French comic illustrators employed by the 1880s, namely a dynamic combination of shot scales, angles and heights that still conforms to the diegetic demands of consistent spatial continuity. In short, these were the techniques that, perversely, would come to be known as 'cinematic'. In the basement of the Grand Cafe in the Boulevard des Capucines, Paris, on 28 December 1895, the Lumiere brothers gave the first commercial public exhibition of their Cinematographe. The twenty-minute programme was a mixed one: ten short films, mostly of documentary or actuality subjects, demonstrating the camera's ability to capture large public scenes and small domestic incidents alike. The audience - which included a deeply affected George Melies - paid a one-franc admission fee, indicating the commercial possibilities of the medium. As an early example of a public exhibition of projected moving pictures, and despite technical improvements, the event used the same fundamental arrangement and apparatus that would become standard throughout the coming century. Perhaps most significantly, the sixth short film on the programme, between Les Forgerons ['The Smiths'] (1895) and Le Repas de bebe ['Baby's Dinner'] (1895), was a simple, 46-second record of a practical joke, popularly called L'Arroseur arrose, widely regarded as one of the earliest staged film narratives and the world's first film comedy.1 Such a litany of 'firsts' doubtless contributes to the simplified teleological view of cinematic history as a single developmental timeline, beginning in Paris in 1895 and concluding as an unbroken thread in today's multiplexes. Yet, as John Fell and others have shown,2 early experiments in film narrative took place, not in a cinematic vacuum, but against a complex and vital background of varied and innovative visual media activity. New curiosities and traditional entertainments jostled against each other for the attention of an increasingly sophisticated and demanding public, and techniques, ideas and subject matter flowed rapidly and freely between the various media. Cinema and popular picture strips in the late nineteenth century, for instance, often featured strikingly similar characters, stories, jokes and narrative developments, were motivated by similar objectives - to hold the audience's attention, to interest and amuse - and were often similarly constrained by limited time or space, whether because of the length of a reel of film or the size of a magazine page. Famously, the Lumieres' first fiction film has a number of more or less well-known antecedents in contemporary bande dessinee, and therefore offers a unique opportunity to compare the treatment of the same material in different visual media in the very period that would mark the emergence of cinema as both an industry and an art form. There were three separate versions of the Lumieres' comedy film: the first shot by Louis Lumiere sometime between 22 March and 10 June 1895; the second between spring 1896 and 1 May 1897; and the third between summer 1896 and May 1897.3 Confusingly, all three versions were listed and sold as film 99 in the Catalogue Lumiere from the first edition of 1897, while a 1993 article by Claude Beylie appears to demonstrate that no Lumiere film was originally titled L'Arroseur arrose.4 Their first 'hosepipe' comedy, included in the 1895 Grand Cafe programme, was entitled Le Jardinier ['The Gardener'], but was swiftly renamed Le Jardinier et le petit espiegle ['The Gardener and the Little Urchin']. …

Barbara L. Wheeler (Ed) (2005). Music Therapy Research. Second Edition. Gilsum, NH: Barcelona Publishers. 586 pages. ISBN 1-891278-26-6. Hardback: $72

Barbara L. Wheeler (Ed) (2005). Music Therapy Research. Second Edition. Gilsum, NH: Barcelona Publishers. 586 pages. ISBN 1-891278-26-6. Hardback: $72. imagine that, like me, when many people learn of second edition of that they already have, they think to themselves I already own this book, so what is the point in buying another copy? Well, in the case of Music Therapy Research edited by Barbara Wheeler, there are certainly many compelling reasons. While it is marketed as the second edition of the 1 995 publication Music Therapy Research: Quantitative and Qualitative Perspectives, it is really completely different text - in size and content. At first glance, you can see that it is very different book. In contrast to the earlier smaller page size paperback version, the second edition is an 8% × 11 hardcover that is black with silver lettering. The second edition is divided into five parts rather than four, with only Part retaining its original title. And the second edition has 41 chapters, 17 than the first edition. Not only are there chapters, but only 13 of the original chapters remain in the second edition and most of these have been revised substantially. Part One is entitled Music Therapy Research: Overview and Issues. Wheeler states that this section provides a brief overview of therapy research . . . [and] can be read alone, using the overviews of quantitative and qualitative research rather than the detailed coverage included in the remainder of the book (p. xi). The first chapter, Introduction: Overview of Music Therapy Research, is thoroughly updated from the first edition. In this chapter, Wheeler defines therapy research, describes how it has grown and changed over the years, examines the distinctions and reciprocal relationships between research, theory, and practice, and broadly classifies types of research. Her chapter, as does the entire book, reveals the diversity in therapy research. In the second chapter, Developments and Issues in Music Therapy Research, which is entirely new material, Edwards provides an overview of the rich and varied history of music therapy research since the establishment of the first therapy peer-reviewed journal in 1964 (p. 20). She chronicles the peer reviewed/refereed journals in therapy that are published in English and that are continuing to be published. Edwards also raises issues about who is conducting and disseminating therapy research, discusses issues concerning research training, and highlights some of the characteristics and achievements, trends and opportunities, of research in therapy. In chapter three, Philosophy and Theory of Science, also an entirely new chapter, Ruud provides brief overview of different philosophies of that inform research decisions. For each philosophy covered (positivism, phenomenology, hermeneutics, critical theory, systems theories, semiotics and structuralism, and postmodern currents), he provides brief historical background, epistemologica! issues (that is, what is possible to know), critical issues (criticisms of the approach), and its relevance to therapy. With so much to be covered in such chapter, Ruud provides brief overview and encourages the reader to explore more extensive introductory texts as well as to extensive literature within the different philosophies of science (p. 43). He states: What we can learn from the study of the theory of is to be critical, aware, and reflexive concerning our own theorizing and understanding of our work (p. 43). He warns against the temptation to treat his overview as way to obtain a method that is precise and easy to administer - short route to truth (p. 43)! Chapters four (by Prickett) and five (by Wheeler and Kenny) outline the principles of quantitative and qualitative research respectively and provide taste for parts three and four that provide much detail on these perspectives. …

A Data Mining Approach for Selecting Bitmap Join Indices

Index selection is one of the most important decisions to take in the physical design of relational data warehouses. Indices reduce significantly the cost of processing complex OLAP queries, but require storage cost and induce maintenance overhead. Two main types of indices are available: mono-attribute indices (e.g., B-tree, bitmap, hash, etc.) and multi-attribute indices (join indices, bitmap join indices). To optimize star join queries characterized by joins between a large fact table and multiple dimension tables and selections on dimension tables, bitmap join indices are well adapted. They require less storage cost due to their binary representation. However, selecting these indices is a difficult task due to the exponential number of candidate attributes to be indexed. Most of approaches for index selection follow two main steps: (1) pruning the search space (i.e., reducing the number of candidate attributes) and (2) selecting indices using the pruned search space. In this paper, we first propose a data mining driven approach to prune the search space of bitmap join index selection problem. As opposed to an existing our technique that only uses frequency of attributes in queries as a pruning metric, our technique uses not only frequencies, but also other parameters such as the size of dimension tables involved in the indexing process, size of each dimension tuple, and page size on disk. We then define a greedy algorithm to select bitmap join indices that minimize processing cost and verify storage constraint. Finally, in order to evaluate the efficiency of our approach, we compare it with some existing techniques.

High performance set associative translation lookaside buffers for low power microprocessors

A fast low power four-way set-associative translation lookaside buffer (TLB) is proposed. The proposed TLB allows single clock phase accesses at clock frequencies above 1 GHz. Comparisons to a conventional fully associative CAM tagged TLB, which is the type most commonly used in embedded processors, with the same number of entries on a 65 nm low standby power process show that the proposed design has 28% lower delay and up to 50% lower energy delay product. Unlike previous set-associative TLBs, which replicate the TLB to support multiple page sizes, multiple page sizes are supported on a way-by-way basis. Alternative conventional CAM tagged and set-associative TLBs are investigated with regard to access latency, power dissipation and hit rates.

Effectiveness of multiple pageable page sizes for commercial applications

AbstractThis paper investigates the computational characteristics of the software applications that are developed to support typical modern e‐commerce applications. These applications have a significant impact on global commerce, and their influence is expected to continue. We show that the micro‐architectural features of the memory subsystem, assisted by the operating system (such as the use of concurrent pageable page sizes), can significantly improve the performance of these applications. In particular, we show that using 64 kB page size in addition to the default 4 kB page size provides substantial throughput improvements for a typical commercial application (Trade6) without adding any complexity for the application developer or the system administrator. Copyright © 2007 John Wiley &amp; Sons, Ltd.

Efficient temporal counting with bounded error

This paper studies aggregate search in transaction time databases. Specifically, each object in such a database can be modeled as a horizontal segment, whose y-projection is its search key, and its x-projection represents the period when the key was valid in history. Given a query timestamp q t and a key range $$\vec{q_k}$$ , a count-query retrieves the number of objects that are alive at q t , and their keys fall in $$\vec{q_k}$$ . We provide a method that accurately answers such queries, with error less than $$\frac{1}{\varepsilon} + \varepsilon \cdot N_{\rm alive}(q_t)$$ , where N alive(q t ) is the number of objects alive at time q t , and ? is any constant in (0, 1]. Denoting the disk page size as B, and n = N / B, our technique requires O(n) space, processes any query in O(log B n) time, and supports each update in O(log B n) amortized I/Os. As demonstrated by extensive experiments, the proposed solutions guarantee query results with extremely high precision (median relative error below 5%), while consuming only a fraction of the space occupied by the existing approaches that promise precise results.

The 'pair of straight bodies' and 'a pair of drawers' dating from 1603 which Clothe the Effigy of Queen Elizabeth I in Westminster Abbey

Janet Arnold left this paper virtually complete at her death in 1998. It is an important piece of work to which she had given a substantial amount of time, but it does not fit with her plans for the forthcoming volume of Patterns of Fashion: The Cut and Construction of Linen Clothes for Men and Women. However, because of the rarity of the 'pair of straight bodies' and the need to make the fruits of her research available to others, it was decided to follow Janet's own practice with one-off items of importance and to submit the article to Costume. Janet's full-scale pattern of the 'pair of straight bodies' has been scaled down to fit the page size of Costume, otherwise all the descriptions and queries are Janet's own, as are the drawings and photographs chosen to illustrate her text. She continued to work on the project after she had written the first draft text; consequently two references have been added to clarify the role of John Colte, and to illustrate the silk materials used to cover the 'bodies' made for the queen by William Jones.

Kohonen Self-organizing Feature Maps as a Means to Benchmark College and University Websites

Websites for colleges and universities have become the primary means for students to obtain information in the college search process. Consequently, institutions of higher education should target their websites toward prospective and current students’ needs, interests, and tastes. Numerous parameters must be determined in creating a school website (e.g. number of links, page size, use of graphics, utilization of dynamic elements, and menuing options). This research details a decision support framework based upon Kohonen self-organizing feature maps to determine students’ specific preferences for school websites. This research attempts to remove some of the subjectivity in designing a school website by finding the commonalities among websites that students find appealing and effective. Self-organizing feature maps are employed as a clustering method to compare the school’s current website to other sites that students find both appealing and effective.