bluuebunny/crossref_metadata_2025_split huggingface dataset:
Post BWT stages of the Burrows–Wheeler compression algorithm
Authors: Abel Jürgen 
Published: July 2010

AbstractThe lossless Burrows–Wheeler compression algorithm has received considerable attention over recent years for both its simplicity and effectiveness. It is based on a permutation of the input sequence—the Burrows–Wheeler transformation (BWT)—which groups symbols with a similar context close together. In the original version, this permutation was followed by a Move‐To‐Front transformation and a final entropy coding stage. Later versions used different algorithms, placed after the BWT, since the following stages have a significant influence on the compression rate. This paper describes different algorithms and improvements for these post BWT stages including a new context‐based approach. The results for compression rates are presented together with compression and decompression times on the Calgary corpus, the Canterbury corpus, the large Canterbury corpus and the Lukas 2D 16‐bit medical image corpus. Copyright © 2010 John Wiley & Sons, Ltd.
Constructing climate knowledge with computer models
Authors: Müller Peter 
Published: July 2010

AbstractComputer models are powerful tools that allow us to analyze problems in unprecedented detail and to conduct experiments impossible with the real system. Reliance on computer models in science and policy decisions has been challenged by philosophers of science on methodological and epistemological grounds. This challenge is examined for the case of climate models by reviewing what they are and what climate scientists do with them, followed by an analysis of how they can be used to construct new trustworthy knowledge. A climate model is an executable computer code that solves a set of mathematical equations assumed to represent the climate system. Climate modelers use these models to simulate present and past climates and forecast likely and plausible future evolutions. Model uncertainties and model calibration are identified as the two major concerns. Climate models of different complexity address different question. Their interplay helps to weed out model errors, identify robust features, understand the climate system, and build confidence in the models, but is no guard against flaws in the underlying physics. Copyright © 2010 John Wiley & Sons, Ltd.This article is categorized under:Climate Models and Modeling > Knowledge Generation with Models
Adaptive concentric chains protocol for energy efficient routing in wireless sensor networks
Authors: Lin Yih‐Chuan , Jiang Kai‐Wei 
Published: July 2010

AbstractThis paper addresses the energy efficiency of data collection based on a concentric chain clustering topology for wireless sensor networks (WSNs). To conserve the energy dissipation of nodes spent in data routing, the paper attempts to take advantage of the two opportunities: (a) the impact of the relative positions of wireless nodes to the base station on the energy efficiency of the routing chain within each cluster; (b) the effect of the varying‐sized chains on the selection rule of cluster heads (CHs). To establish an energy‐efficient chain to connect all the nodes in a cluster, the paper proposes aprincipal vector projectionapproach, which takes into account both the position of each node and that of the base station, to determine the order to which a node can be linked into the chain in order to reduce the energy requirement of the chain. Since the CH selection rules in the concentric chains are mutually independent, solely based on their self‐cluster sizes, the multi‐hop path passing through all the CHs will consist of longer links and thus consume a significant fraction of the total energy. Thus, in order to suppress the effect of the unequal cluster sizes on decreasing the energy efficiency of the multi‐hop path of CHs, the paper offers anaverage‐cluster‐size‐based rule(ACSB) for each cluster in order to adapt the CH selection with both the number of active nodes in the current cluster and the average value of all cluster sizes. With these two proposed schemes, an adaptive concentric chain‐based routing algorithm is proposed which enables nodes to collaboratively reduce the energy dissipation incurred in gathering sensory data. By computer simulation, the results demonstrate that the proposed algorithm performs better than other similar protocols in terms of energy saved and lifetime increased capabilities for WSNs which deploy random sensor nodes. Copyright © 2010 John Wiley & Sons, Ltd.
Development of digital forensics practice and research in Japan
Authors: Liu Jigang , Uehara Tetsutaroh , Sasaki Ryoichi 
Published: July 2010

AbstractAs a new frontier for fighting against cyber crime and cyber terrorism, digital forensics has experienced a rapid development in the last decade. Many countries have created new laws and legal procedures, developed new technologies, and enhanced education and research in this emerging field. Japan is no exception. In this paper, we first provide a nutshell of the Japanese political structures, legal systems, and law enforcement practice, and then present an overview of updated and new laws, awareness programs, and the research activities in digital forensics. Our views on the current issues and future work are also discussed. We believe that the result of our study will provide an opportunity for the world to see what has been done and what we are doing in this field in Japan. Meanwhile, it also provides a foundation to advance the digital forensics research and development in Japan as well as in the world. Copyright © 2010 John Wiley & Sons, Ltd.
M‐DART: multi‐path dynamic address routing
Authors: Caleffi Marcello , Paura Luigi 
Published: July 2010

AbstractThe paper proposes a Distributed Hash Table (DHT)‐based multi‐path routing protocol for scalablead hocnetworks. Specifically, we propose a multipath‐based improvement to a recently proposed DHT‐based shortest‐path routing protocol, namely the Dynamic Address RouTing (DART). The resulting protocol, referred to as multi‐path DART (M‐DART), guarantees multi‐path forwarding without introducing any additional communication or coordination overhead with respect to DART. The performances of M‐DART have been evaluated by means of numerical simulations across a wide range of environments and workloads. The results show that M‐DART performs the best or at least comparable with respect to widely adopted routing protocols in all the considered scenarios. Moreover, unlike these protocols, it is able to assure satisfactory performances for large networks by reducing the packet loss by up to 75%. Copyright © 2010 John Wiley & Sons, Ltd.
Multiuser detectors for large CDMA random access systems over Rayleigh fading channels
Authors: Yu Kai , Fan Pingzhi , Hao Li , Lei Xianfu 
Published: July 2010

AbstractIn this paper, large code division multiple access (CDMA) random access systems employing the decorrelator and minimum mean square error (MMSE) detectors are investigated over Rayleigh fading channels under the assumption that both the number of users and the spreading gain tend to infinity, but their ratio converges to a constant. The signal to interference ratio (SIR) is shown to converge almost surely to a constant and the bit‐error rate (BER) is expressed as a function of the traffic load, transmission probability, channel coefficient, and distribution of transmission power. Furthermore, the throughput, the spectrum efficiency, and the stability region are analyzed and simulated. For dominating systems, it is shown that the MMSE detector achieves much higher throughput and spectral efficiency than decorrelator detector. Besides, it is also disclosed that, when the signal to noise ratio (SNR) is larger than an optimum value, the spectrum efficiency increases as the ratio of bit energy to noise power spectrum density (Eb/N0) increases; however, when SNR is smaller than the optimum value, the spectrum efficiency decreases as Eb/N0 increases. For ordinary stable systems, it is demonstrated that their stability region gets narrower as the traffic load increases. Copyright © 2010 John Wiley & Sons, Ltd.
QoS‐aware routing and power control algorithm for multimedia service over multi‐hop mobilead hocnetwork
Authors: Lee Zae‐Kwun , Lee GyeongCheol , Oh Hyung Rai , Song Hwangjun 
Published: July 2010

AbstractThis paper presents a QoS (quality of service) aware routing and power control algorithm consuming low transmission power for multimedia service over mobilead hocnetwork. Generally, multimedia services need stringent QoS over the network. However, it is not easy to guarantee the QoS over mobilead hocnetwork since its network resources are very limited and time‐varying. Furthermore, only a limited amount of power is available at mobile nodes, which makes the problem more challenging. We propose an effective routing and power control algorithm for multimedia services that satisfies end‐to‐end delay constraint with low transmission power consumption. The proposed algorithm supports the required bandwidth by controlling each link channel quality over route in a tolerable range. In addition, a simple but effective route maintenance mechanism is implemented to avoid link failures that may significantly degrade streaming video quality. Finally, performance comparison with existing algorithms is presented in respect to traditional routing performance metrics, and an achievable video quality comparison is provided to demonstrate the superiority of the proposed algorithm for multimedia services over mobilead hocnetwork. Copyright © 2010 John Wiley & Sons, Ltd.
Principal component analysis
Authors: Abdi Hervé , Williams Lynne J. 
Published: July 2010

AbstractPrincipal component analysis (PCA) is a multivariate technique that analyzes a data table in which observations are described by several inter‐correlated quantitative dependent variables. Its goal is to extract the important information from the table, to represent it as a set of new orthogonal variables called principal components, and to display the pattern of similarity of the observations and of the variables as points in maps. The quality of the PCA model can be evaluated using cross‐validation techniques such as the bootstrap and the jackknife. PCA can be generalized ascorrespondence analysis(CA) in order to handle qualitative variables and asmultiple factor analysis(MFA) in order to handle heterogeneous sets of variables. Mathematically, PCA depends upon the eigen‐decomposition of positive semi‐definite matrices and upon the singular value decomposition (SVD) of rectangular matrices. Copyright © 2010 John Wiley & Sons, Inc.This article is categorized under:Statistical and Graphical Methods of Data Analysis > Multivariate AnalysisStatistical and Graphical Methods of Data Analysis > Dimension Reduction
Crossover experiments
Authors: Johnson Dallas E. 
Published: July 2010

AbstractCrossover designs and within‐subject designs are designs where each experimental unit receives a series of treatments over time. Because treatments are assigned at different time points, one must worry about whether there is carryover or residual effects from a treatment given in a previous period to a subsequent period. This article introduces crossover designs and discusses the statistical analysis of crossover designs. When one has more than two periods and/or more than three treatments, then special designs can be obtained where one can measure a direct comparison between the treatments even if carryover effects exist. Copyright © 2010 John Wiley & Sons, Inc.This article is categorized under:

Statistical Models > Linear Models
Workplace practices for engineered nanomaterial manufacturers
Authors: Woskie Susan 
Published: July 2010

AbstractThe growth in nanotechnology has prompted a focus on the development of occupational health and safety recommendations for those working with engineered nanomaterials (ENM) at both the laboratory and the manufacturing levels. Although the nascent field of nanotoxicology has shown that some nanoparticles may present a health hazard to humans, risk assessments for all types of ENM are not possible. Hence, a precautionary approach to handling of these materials is recommended along with the development of a comprehensive health and safety program for the workplace. The traditional hierarchy of exposure controls emphasizes reducing the hazard as close to the source as possible by using elimination or substitution. Alternative control methods include engineering controls, administrative or work practice controls, and finally personal protective equipment, in order of decreasing priority. There is now ample evidence that some degree of exposure control can be achieved with each of these control methods, so that a comprehensive program will incorporate each, depending on the circumstances of the engineered nanomaterial use. WIREs Nanomed Nanobiotechnol 2010 2 685–692This article is categorized under:

Toxicology and Regulatory Issues in Nanomedicine > Regulatory and Policy Issues in Nanomedicine
A novel Hansenula polymorpha transcriptional factor HpHAP4‐B, able to functionally replace the S. cerevisiae HAP4 gene, contains an additional bZip motif
Authors: Sybirna K. , Petryk N. , Zhou Y.‐F. , Sibirny A. , Bolotin‐Fukuhara M. 
Published: July 2010

AbstractThe transcriptional regulator HAP4, whose expression is induced on respiratory substrates, has been shown to be involved in the balance between fermentation and respiration in Saccharomyces cerevisiae. We have previously identified a HAP4 orthologue in the yeast Hansenula polymorpha, called HpHAP4‐A, which, despite its very limited sequence conservation (a 16 amino acid N‐terminal motif), is fully functional in S. cerevisiae. Based on the same N‐terminal motif, a second gene has now been identified in the same organism. It was shown to contain an additional cis‐binding motif of the bZip type. We report on the cloning, heterologous expression and analysis in S. cerevisiae of this novel ScHAP4 orthologue. From these experiments we could conclude that, as with HpHAP4‐A, the novel orthologue, designated HpHAP4‐B, could functionally replace the S. cerevisiae gene but to a lesser extent. The relationship between the presence of the additional cis‐binding motif and the weaker potential as a HAP4 functional homologue is discussed. Copyright © 2010 John Wiley & Sons, Ltd.
Knr4 N‐terminal domain controls its localization and function during sexual differentiation and vegetative growth
Authors: Dagkessamanskaia Adilia , Azzouzi Karim El , Kikuchi Yo , Timmers Ton , Ohya Yoshikazu , François Jean‐Marie , Martin‐Yken Hélène 
Published: July 2010

AbstractThe Saccharomyces cerevisiae protein Knr4 is composed of a globular central core flanked by two natively disordered regions. Although the central part of the protein holds most of its biological function, the N‐terminal domain (amino acids 1–80) is essential in the absence of a functional CWI pathway. We show that this specific protein domain is required for the proper cellular localization of Knr4 at sites of polarized growth during vegetative growth and sexual differentiation (bud tip and ‘shmoo’ tip). Moreover, Knr4 N‐terminal domain is also necessary for cell cycle arrest and shmoo formation in response to pheromone to occur at the correct speed. Thus, the presence of Knr4 at the incipient mating projection site seems important for the establishment of the following polarized growth. Cell wall integrity (CWI) and calcineurin pathways are known to share a common essential function, for which they can substitute for one another. Searching for Knr4 partners responsible for survival in a CWI‐defective background, we found that the catalytic subunit of calcineurin Cna1 physically interacts with Knr4 in the yeast two‐hybrid assay, in a manner dependent on the presence of the Knr4 N‐terminal domain. In addition, we present evidence that Knr4 protein participates in the morphogenesis checkpoint, a safety mechanism that holds the cell cycle in response to bud formation defects or insults in cytoskeleton organization, and in which both the CWI pathway and calcineurin are involved. Copyright © 2010 John Wiley & Sons, Ltd.
Oxorhenium(V) Complexes with 2,3‐Dihydroxynaphthalene
Authors: de Souza Elizeu J. , Fernandes André G. de A. , Maia Pedro Ivo da S. , Lemos Sebastião S. , Ellena Javier , Abram Ulrich , Deflon Victor M. 
Published: July 2010

Abstract2,3‐Dihydroxynaphthalene (H2dhn) reacts with [ReOCl3(PPh3)2] or [ReOBr3(PPh3)2] in a 1:1 molar ratio with formation of the isostructural complexes [ReOCl2(PPh3)2(Hdhn)] (4) and [ReOBr2(PPh3)2(Hdhn)] (5). They have distorted octahedral coordination spheres with the halide and the triphenylphosphine ligands arranged in equatorial trans positions to each other. The Hdhn– ligand coordinates monodentately in trans position to the oxo ligand. Intramolecular hydrogen bonds between the Hdhn– and the halogeno ligands stabilize this coordination mode. The products represent the first examples of oxorhenium(V) complexes with monodentate catecholate‐type ligands.
Removal of frontal sinus keratoma solely via endoscopic sinus surgery
Authors: Lai J-C , Liu C-K , Chen M-L , Chen M-K 
Published: July 2010

AbstractObjectives:To present a patient with a frontal sinus keratoma removed solely via endoscopic sinus surgery, including presentation of characteristic computed tomography and magnetic resonance images; to discuss the differential diagnosis of this condition; and to report the current knowledge on and treatment of frontal sinus keratoma.Case report:A 53-year-old man presented to our department with a 10-month history of rhinorrhoea and postnasal drip. After computed tomography and magnetic resonance imaging studies, the patient underwent surgery utilising a modified Lothrop procedure. An extensive soft tissue lesion was removed from the frontal sinus. Histological examination revealed a lamellated cluster of keratinous material. The pathological diagnosis was keratoma of the frontal sinus. There was no recurrence of keratoma over a two-year follow-up period.Conclusions:Following review of the English language literature, we believe this case report to represent the first successful application of a modified endoscopic Lothrop procedure for resection of an extensive frontal sinus keratoma. Thus, the applications of endoscopic sinus surgery may be expanded to include frontal sinus keratoma removal.
The structure of the perineuronal sheath of satellite glial cells (SGCs) in sensory ganglia
Authors: Pannese Ennio 
Published: July 2010

In sensory ganglia each nerve cell body is usually enveloped by a satellite glial cell (SGC) sheath, sharply separated from sheaths encircling adjacent neurons by connective tissue. However, following axon injury SGCs may form bridges connecting previously separate perineuronal sheaths. Each sheath consists of one or several layers of cells that overlap in a more or less complex fashion; sometimes SGCs form a perineuronal myelin sheath. SGCs are flattened mononucleate cells containing the usual cell organelles. Several ion channels, receptors and adhesion molecules have been identified in these cells. SGCs of the same sheath are usually linked by adherent and gap junctions, and are functionally coupled. Following axon injury, both the number of gap junctions and the coupling of SGCs increase markedly. The apposed plasma membranes of adjacent cells are separated by 15–20 nm gaps, which form a potential pathway, usually long and tortuous, between connective tissue and neuronal surface. The boundary between neuron and SGC sheath is usually complicated, mainly by many projections arising from the neuron. The outer surface of the SGC sheath is covered by a basal lamina. The number of SGCs enveloping a nerve cell body is proportional to the cell body volume; the volume of the SGC sheath is proportional to the volume and surface area of the nerve cell body. In old animals, both the number of SGCs and the mean volume of the SGC sheaths are significantly lower than in young adults. Furthermore, extensive portions of the neuronal surface are not covered by SGCs, exposing neurons of aged animals to damage by harmful substances.
Doubling measures with doubling continuous part
Authors: Lou Man-Li , Wu Min 
Published: July 2010

We prove that every compact subset of

R

d

\mathbb R^d

of positive Lebesgue measure carries a doubling measure which is not purely atomic. Also, we prove that for every compact and nowhere dense subset

E
E

of

R

d

\mathbb R^d

without isolated points and for every doubling measure

μ
\mu

on

E
E

there is a countable set

F
F

with

E
∩
F
=
∅

E\cap F=\emptyset

and a doubling measure

ν
\nu

on

E
∪
F

E\cup F

such that

ν

|

E

=
μ

\nu |_E=\mu

. This shows that there are many doubling measures whose continuous part is doubling.
Euler characteristics, Akashi series and compact 𝑝-adic Lie groups
Authors: Wadsley Simon 
Published: July 2010

We discuss Euler characteristics for finitely generated modules over Iwasawa algebras. We show that the Euler characteristic of a module is well-defined whenever the

0
0

th homology group is finite if and only if the relevant compact

p
p

-adic Lie group is finite-by-nilpotent and that in this case all pseudo-null modules have trivial Euler characteristic. We also prove some other results relating to the triviality of Euler characteristics for pseudo-null modules as well as some analogous results for the Akashi series of Coates et al.
An easier extra head scheme for the Poisson process on 𝐑ⁿ
Authors: Service Robert 
Published: July 2010

A simple construction is presented whereby a nonrandomized extra head scheme for stationary ergodic point processes on the line due to T. Liggett (2002) is lifted to

R

n

\mathbf {R}^{n}

in the Poisson case. This gives the simplest construction for a nonrandomized extra head scheme in higher dimensions, yet the method has been overlooked in previous work on the subject.
REVIEW: Variability in Fine Structures of Noncellulosic Cell Wall Polysaccharides from Cereal Grains: Potential Importance in Human Health and Nutrition
Authors: Collins Helen M. , Burton Rachel A. , Topping David L. , Liao Ming‐Long , Bacic Antony , Fincher Geoffrey B. 
Published: July 2010

ABSTRACTNoncellulosic polysaccharides from the cell walls of cereal grains are not digested by human small intestinal enzymes and so contribute to total dietary fiber intake. These polysaccharides are becoming recognized increasingly for their potential to lower the risk of serious diet‐related conditions such as type II diabetes, cardiovascular disease, colorectal cancer, and diverticular disease. The effectiveness of noncellulosic cell wall polysaccharides in improving health outcomes is related to the fine structure and associated physicochemical properties. The two most nutritionally relevant wall polysaccharides of cereal grains are the arabinoxylans and the (1‐3,1‐4)‐β‐d‐glucans. These polysaccharides have high molecular mass values but are nevertheless soluble in aqueous media, at least in part, where they adopt highly asymmetrical conformations and consequently form high viscosity solutions. Thus, arabinoxylans and (1‐3,1‐4)‐β‐d‐glucans contribute to the soluble fiber component of human diets. The molecular size, solubility, and viscosity of the polysaccharides vary widely not only between different cereals but also within a single species. The variability in these properties reflects differences in the chemical structure of the polysaccharides, which in turn influences the beneficial effects of arabinoxylans and (1‐3,1‐4)‐β‐d‐glucans in human diets. Here, we summarize information on the variability of fine structures of the arabinoxylans and (1‐3,1‐4)‐β‐d‐glucans in common cereals and relate these to solubility, viscosity, and health benefits. The recent identification of genes involved in the biosynthesis of the (1‐3,1‐4)‐β‐d‐glucans opens the way for the genetic improvement of cereal quality parameters that are important in human health.