bluuebunny/crossref_metadata_2025_split huggingface dataset:
Deep-water manganese deposits in the mid- to late Proterozoic Penganga Group of the Pranhita-Godavari Valley, South India
Authors: Mukhopadhyay Joydip , Chaudhuri Asru K. , Chanda S. K. 
Published: September 2007

Abstract
Facies analysis of the unmetamorphosed sediments enclosing the stratiform manganese oxide deposits of the mid- to late Proterozoic Penganga Group identifies the base of slope of a distally steepened deep-water ramp as their site of accumulation. The interpretation is based on their close association with a variety of mass flow deposits ranging from limestone conglomerates to calcarenites and deep-water, plane-bedded micritic limestone devoid of current- or wave-generated structures as well as detritus coarser than fine silt. These deposits occur within a major transgressive succession. The base of slope origin of stratiform manganese deposits is uncommon in the rock record and their origin is to be constrained against the background of base of slope depositional setting.
Growth history of manganese nodules and crusts of the Peru Basin
Authors: Von Stackelberg U. 
Published: September 2007

Abstract

In the nodule field of the Peru Basin, situated south of the zone of high bioproductivity, a relatively high flux of biogenic matter explains a distinct redox boundary at about 10 cm depth separating very soft oxic surface sediments from stiffer suboxic sediments. Maximum abundance (50 kg m
−2
) of diagenetic nodules is found near the calcite compensation depth (CCD), currently at 4250 m. There, the accretion rate of nodules is much higher (100 mm Ma
−1
) than on ridges (5 mm Ma
−1
). Highest accretion rates are found at the bottom of large nodules that repeatedly sink to a level immediately above the redox boundary. There, distinct diagenetic growth conditions prevail and layers of dense laminated Mn oxide of very pure todorokite are formed. The layering of nodules is mainly the result of organisms moving nodules within the oxic surface sediment from diagenetic to hydrogenetic environments. The frequency of such movements is much higher than that of climatic changes. Two types of nodule burial occur in the Peru Basin. Large nodules are less easily moved by organisms and become buried. Consequently, buried nodules generally are larger than surface nodules. This type of burial predominates in basins. At ridges where smaller nodules prevail, burial is mainly controlled by statistical selection where some nodules are not moved up by organisms.
Distribution and composition of marine hydrogenetic and hydrothermal manganese deposits in the northwest Pacific
Authors: Usui Akira , Someya Masao 
Published: September 2007

Abstract
The distribution and composition of Mn deposits in the northwest Pacific (15–50°N and 120–160°E) are characterized using a Mn deposits database compiled from our original data, published and unpublished papers, published databases, and other international sources. The results demonstrate a close association with geological settings. Hydrogenetic nodules and crusts formed in areas of erosion or nondeposition on Cretaceous seamounts and plateaus of the Pacific plate, and to a lesser extent on seamounts of remnant arcs of Palaeogene to Neogene ages. The Cretaceous seamount deposits are most enriched in Co, and the plateaus less so, while both show moderate Ni enrichment. Nodules and crusts are rare in enclosed backarc basins, which have not been affected by deep water circulation. A slight early-diagenetic influence is observed in some Pacific basin nodules. By contrast, modern hydrothermal Mn deposits are broadly distributed on active submarine volcanoes and backarc rifts. These hydrothermal Mn deposits consist typically of pure Mn oxide containing negligible levels of metals except for Mg, Ba, K and Li. Similar fossil hydrothermal Mn deposits are observed in places on old basement or within deep cores as geological records of past hydrothermal activity.
The partitioning of petrophysical data: a review
Authors: Moss Brian P. 
Published: September 2007

Abstract
Petrophysical analyses are undertaken within a framework of ordered geological systems. The recognition of the natural geological ordering through the grouping and partitioning of petrophysical data is known to be a fundamental requirement of successful petrophysical interpretations.
The mathematical basis and examples of the use of a variety of techniques of value in partitioning data are reviewed. Beginning with the simple use of curve discrimination on conventional crossplots, the discussion proceeds by covering increasingly complex but relatively well-known methods including discriminant function analysis, cluster analysis and principal component analysis, and goes on to include multi-dimensional scaling, ‘pigeon-holing’, fuzzy clustering, characteristic analysis, projection pursuit and neural networks. The discussion highlights some of the benefits, and some of the pitfalls, of each technique through the included examples.
The discussion encourages the use of exploratory data analysis techniques in the processing and interpretation of petrophysical data and provides a reference framework from which can follow further evaluation of the value of the techniques in circumstances particular to the interested reader
An application of the Moiré Method to a study of local strains during rock failure in tension
Authors: Passas N. , Butenuth C. , De Freitas M. H. 
Published: September 2007

Abstract
The hoop tension test has proved to be a reliable and sensitive test to measure rock strength in tension and provides a convenient method for studying petrophysical aspects of rock failure. However, to make best use of this test it is necessary to be able to compare the strains associated with measured strengths. This paper describes initial experiments to measure by moiré fringes the distribution of strain over the surface of specimens of sandstone, failed under tension in the hoop tension test. The method utilizes the optical interference between two grids of similar size, one on the surface of the specimen which is deformed with the specimen during the test, and another remote from the specimen which remains undeformed. The moiré fringes produced and the strains so measured, were obtained so as to be compared with those obtained from previous investigations on similar samples using holographic and strain gauge measurements. The fringes acquired can be transformed into iso-deformation lines based on the geometrical relationships of the interference grids, to reveal the distribution of strain over the specimen surface observed.
Volume illustration using wang cubes
Authors: Lu Aidong , Ebert David S. , Qiao Wei , Kraus Martin , Mora Benjamin 
Published: September 2007

To create a new, flexible system for volume illustration, we have explored the use of Wang Cubes, the 3D extension of 2D Wang Tiles. We use small sets of Wang Cubes to generate a large variety of nonperiodic illustrative 3D patterns and texture, which otherwise would be too large to use in real applications. We also develop a direct volume rendering framework with the generated patterns and textures. Our framework can be used to render volume datasets effectively and a variety of rendering styles can be achieved with less storage.Specifically, we extend the nonperiodic tiling process of Wang Tiles to Wang Cubes and modify it for multipurpose tiling. We automatically generate isotropic Wang Cubes consisting of 3D patterns or textures to simulate various illustrative effects. Anisotropic Wang Cubes are generated to yield patterns by using the volume data, curvature, and gradient information. We also extend the definition of Wang Cubes into a set of different sized cubes to provide multiresolution volume rendering. Finally, we provide both coherent 3D geometry-based and texture-based rendering frameworks that can be integrated with arbitrary feature exploration methods.
Ordinary interactive small-step algorithms, II
Authors: Blass Andreas , Gurevich Yuri 
Published: September 2007

This is the second in a series of three articles extending the proof of the Abstract State Machine Thesis---that arbitrary algorithms are behaviorally equivalent to abstract state machines---to algorithms that can interact with their environments during a step, rather than only between steps. As in the first article of the series, we are concerned here with ordinary, small-step, interactive algorithms. This means that the algorithms:
(1) proceed in discrete, global steps,
(2) perform only a bounded amount of work in each step,
(3) use only such information from the environment as can be regarded as answers to queries, and
(4) never complete a step until all queries from that step have been answered.
After reviewing the previous article's formal description of such algorithms and the definition of behavioral equivalence, we define ordinary, interactive, small-step abstract state machines (ASMs). Except for very minor modifications, these are the machines commonly used in the ASM literature. We define their semantics in the framework of ordinary algorithms and show that they satisfy the postulates for these algorithms.
This material lays the groundwork for the final article in the series, in which we shall prove the Abstract State Machine thesis for ordinary, intractive, small-step algorithms: All such algorithms are equivalent to ASMs.
Ordinary interactive small-step algorithms, III
Authors: Blass Andreas , Gurevich Yuri 
Published: September 2007

This is the third in a series of three articles extending the proof of the Abstract State Machine thesis---that arbitrary algorithms are behaviorally equivalent to abstract state machines---to algorithms that can interact with their environments during a step, rather than only between steps. As in the first two articles of the series, we are concerned here with ordinary, small-step, interactive algorithms. This means that the algorithms:
(1) proceed in discrete, global steps,
(2) perform only a bounded amount of work in each step,
(3) use only such information from the environment as can be regarded as answers to queries, and
(4) never complete a step until all queries from that step have been answered.
After reviewing the previous articles' definitions of such algorithms, of behavioral equivalence, and of abstract state machines (ASMs), we prove the main result: Every ordinary, interactive, small-step algorithm is behaviorally equivalent to an ASM.
We also discuss some possible variations of and additions to the ASM semantics.
Discovering personally meaningful places
Authors: Zhou Changqing , Frankowski Dan , Ludford Pamela , Shekhar Shashi , Terveen Loren 
Published: September 2007

The discovery of a person's meaningful places involves obtaining the physical locations and their labels for a person's places that matter to his daily life and routines. This problem is driven by the requirements from emerging location-aware applications, which allow a user to pose queries and obtain information in reference to places, for example, “home”, “work” or “Northwest Health Club”. It is a challenge to map from physical locations to personally meaningful places due to a lack of understanding of what constitutes the real users' personally meaningful places. Previous work has explored algorithms to discover personal places from location data. However, we know of no systematic empirical evaluations of these algorithms, leaving designers of location-aware applications in the dark about their choices.
Our work remedies this situation. We extended a clustering algorithm to discover places. We also defined a set of essential evaluation metrics and an interactive evaluation framework. We then conducted a large-scale experiment that collected real users' location data and personally meaningful places, and illustrated the utility of our evaluation framework. Our results establish a baseline that future work can measure itself against. They also demonstrate that that our algorithm discovers places with reasonable accuracy and outperforms the well-known K-Means clustering algorithm for place discovery. Finally, we provide evidence that shapes more complex than “points” are required to represent the full range of people's everyday places.
A self-organizing defect tolerant SIMD architecture
Authors: Patwardhan Jaidev , Dwyer Chris , Lebeck Alvin R. 
Published: September 2007

The continual decrease in transistor size (through either scaled CMOS or emerging nanotechnologies) promises to usher in an era of tera to peta-scale integration but with increasing defects. Regardless of fabrication methodology (top-down or bottom-up), defect-tolerant architectures are necessary to exploit the full potential of future increased device densities.
This article explores a defect-tolerant SIMD architecture (SOSA) that self-organizes a large number of limited capability nodes with high defect rates into SIMD processing elements. Simulation results show that SOSA matches or exceeds the performance of conventional systems for moderate to large problems, but with lower power density.
Sizing sketches
Authors: Wang Zhe , Dong Wei , Josephson William , Lv Qin , Charikar Moses , Li Kai 
Published: September 2007

Sketches are compact data structures that can be used to estimate properties of the original data in building large-scale search engines and data analysis systems. Recent theoretical and experimental studies have shown that sketches constructed from feature vectors using randomized projections can effectively approximate L1 distance on the feature vectors with the Hamming distance on their sketches. Furthermore, such sketches can achieve good filtering accuracy while reducing the metadata space requirement and speeding up similarity searches by an order of magnitude. However, it is not clear how to choose the size of the sketches since it depends ondata type, dataset size, and desired filtering quality. In real systems designs, it is necessary to understand how to choose sketch size without the dataset, or at least without the whole datase.
This paper presents an analytical model and experimental results to help system designers make such design decisions. We present arank-based filtering model that describes the relationship between sketch size and data set size based on the dataset distance distribution. Our experimental results with several datasets including images, audio, and 3D shapes show that the model yields good, conservative predictions. We show that the parameters of the model can be set with a small sample data set and the resulting model can make good predictions for a large dataset. We illustrate how to apply the approach with a concrete example.
An algorithm for approximate counting using limited memory resources
Authors: Cvetkovski Andrej 
Published: September 2007

This paper describes a randomized algorithm for approximate counting that preserves the same modest memory requirements of log(log n) bits per counter as the approximate counting algorithm introduced in the seminal paper of R. Morris (1978), and in addition, is characterized by (i) lower expected number of memory accesses and (ii) lower standard error on more than 99 percent of its counting range. An exact analysis of the relevant statistical properties of the algorithm is carried out. Performance evaluation via simulations is also provided to validate the presented theory.
Given its properties, the presented algorithm is suitable as a basic building block of data streaming applications having a large number of simultaneous counters and/or operating at very high speeds. As such, it is applicable to a wide range of measurement and monitoring operations, including performance monitoring of communication hardware, measurements for optimization in large database systems, and gathering statistics for data compression.
Evaluating SIP server performance
Authors: Nahum Erich M. , Tracey John , Wright Charles P. 
Published: September 2007

SIP is a protocol of growing importance, with uses for VoIP, instant messaging, presence, and more. However, its performance is not well-studied or understood. In this extended abstract we overview our experimental evaluation of common SIP server scenarios using open-source SIP software such as OpenSER and SIP prunning on Linux.
We show performance varies greatly depending on the server scenario and how the protocol is used. Depending on the configuration, through put can vary from hundreds to thousands of operations per second. For example, we observe that the choice of stateless vs. stateful proxying, using TCP rather than UDP, or including MD5-based authentication can each can affect performance by a factor of 2-4. We also provide kernel and application profiles using Oprofile that help explain and illustrate processing costs. Finally, we provide a simple fix for transaction-stateful proxying that improves performance by a factor of 10. Full details can be found in our accompanying technical report.
Inclusive thinking in computer science education
Authors: Hanson Vicki L. 
Published: September 2007

On average, one in every five people has a disability. There is a growing, worldwide attention to the rights and needs of disabled users to access information technologies (IT). This technology is not simply for recreational use, but in many cases is a disabled user's lifeline to services and a path to employment. To address this issue, there has been enactment of legislation in countries worldwide aimed at making technology accessible. Such legislation has led to the creation of standards, guidelines, and checklists for accessibility, with the goal of having a common understanding of what is needed to make IT accessible and thereby enabling developers to create accessible applications.
Despite these efforts, however, technology remains largely unusable for people with disabilities. A number of factors may contribute to this state. Here we consider one of the key factors--that developers, in large part, do not understand and are not attuned to the needs of disabled users. The checklists are not intuitive and provide developers with little insight into the very real problems that disabled users have with computing. Moreover, these checklists address issues of "compliance", but do not meet the needs of a large number of users whose needs fall outside of traditional accessibility concerns. Older adults are an excellent example of users whose needs are often not considered during development.
A conference theater event will highlight computer use by persons with disabilities. Following up on that event, inclusive design in computer science education will be considered. The focus will be on populations that are often not considered in the design process.
Mental models and programming aptitude
Authors: Caspersen Michael E. , Larsen Kasper Dalgaard , Bennedsen Jens 
Published: September 2007

Predicting the success of students participating in introductory programming courses has been an active research area for more than 25 years. Until recently, no variables or tests have had any significant predictive power. However, Dehnadi and Bornat claim to have found a simple test for programming aptitude to cleanly separate programming sheep from non-programming goats. We briefly present their theory and test instrument.
We have repeated their test in our local context in order to verify and perhaps generalise their findings, but we could not show that the test predicts students' success in our introductory program-ming course.
Based on this failure of the test instrument, we discuss various explanations for our differing results and suggest a research method from which it may be possible to generalise local results in this area. Furthermore, we discuss and criticize Dehnadi and Bornat's programming aptitude test and devise alternative test instruments.
'Touching the void'...
Authors: Dickinson Anne 
Published: September 2007

The author's previous role within the Further Education sector, at North Warwickshire and Hinckley College, was to teach Information Technology (IT) to diverse groups of students who had varied abilities. This role was drawn upon in the author's current role when asked to tutor a student who had enrolled for a Degree in Business and IT at Coventry University.
The author was asked to tutor the student for the IT workshops of a year-long module. This included translating the instructional handouts from mouse-based to keyboard-based, being aware of potential problems with specialist software and the quirks of the online learning system (WebCT) and finding ways of working around them all. There were also occasions where it was necessary to create tactile diagrams [1] for the student. One of the diagrams produced was for critical path analysis. It was created to allow interactivity and to reflect a piece of specialist software that was used for helping students learn the topic. The materials used included using Euro cents, Wikki sticks [3] and string!.
A technician had been assigned to produce tactile diagrams for other modules. The technician realised that there were problems with some of the requests for tactile diagrams that were being received from some tutors. From discussions, it was clear that tutors were unaware of the issues involved with creating and using tactile diagrams. A void existed between their understanding from a visual context and how a tactile diagram worked. For many instances, creating a tactile diagram would not be appropriate as the complexity would be multiplied. A set of simple guidelines were produced that the technician could use as an aid to explaining issues to the tutors - 'touching the void' [5].
The tactile diagrams produced were using heated "swell paper" [2]. This meant that the diagram could be printed from an image on a computer. The resulting printout would be raised where lines were. However, it was discovered that this method gave some disappointing results. As there were no standards for tactile diagrams but some conventions and guidelines [4], a strategy was produced, from the experiences gained, to give optimum results when translating a diagram from the computer to the "swell paper".
This poster displays examples of tactile diagrams, guidelines given to tutors for requesting tactile diagrams and strategies for creating printable tactile diagrams.
Dryad
Authors: Isard Michael , Budiu Mihai , Yu Yuan , Birrell Andrew , Fetterly Dennis 
Published: September 2007

Dryad is a general-purpose distributed execution engine for coarse-grain data-parallel applications. A Dryad application combines computational "vertices" with communication "channels" to form a dataflow graph. Dryad runs the application by executing the vertices of this graph on a set of available computers, communicating as appropriate through flies, TCP pipes, and shared-memory FIFOs.
The vertices provided by the application developer are quite simple and are usually written as sequential programs with no thread creation or locking. Concurrency arises from Dryad scheduling vertices to run simultaneously on multiple computers, or on multiple CPU cores within a computer. The application can discover the size and placement of data at run time, and modify the graph as the computation progresses to make efficient use of the available resources.
Dryad is designed to scale from powerful multi-core single computers, through small clusters of computers, to data centers with thousands of computers. The Dryad execution engine handles all the difficult problems of creating a large distributed, concurrent application: scheduling the use of computers and their CPUs, recovering from communication or computer failures, and transporting data between vertices.