bluuebunny/crossref_metadata_2025_split huggingface dataset:
Telesio's dictionary of Latin color terms
Authors: Osborne Roy 
Published: August 2002

AbstractIn 1528 the Calabrian poet Antonio Telesio (Antonius Thylesius) published his Booklet on Colors (Libellus de Coloribus), the most extensive color dictionary of its time. Following an alphabetical index of 115 Latin color terms, Table I, his text attempted to establish the correct meaning and application of each within a highly organized sequence of categories. A dozen of these were based on general similarities in appearance, whereas others segregated the austere colors from the florid, the agreeable from the mournful, or brought together colors named after metals, places, plants, and animals. This article not only translates the individual color terms but also examines the manner in which they are grouped and sequenced within the text as a whole. © 2002 Wiley Periodicals, Inc. Col Res Appl, 27, 140–146, 2002; Published online in Wiley Interscience (www.interscience.wiley.com). DOI 10.1002/col.10044
Implementation and evaluation of a communication intensive application on the EARTH multithreaded system
Authors: Theobald Kevin B. , Kumar Rishi , Agrawal Gagan , Heber Gerd , Thulasiram Ruppa K. , Gao Guang R. 
Published: August 2002

AbstractThis paper reports a study of sparse Matrix Vector Multiplication (MVM) on a parallel computing platform based on a fine‐grained multithreaded program execution model. Such sparse MVM computations, when parallelized without performing graph partitioning, suffers a very high communication to computation ratio, and is well known to have a very limited scalability on traditional distributed‐memory machines. The particular multithreaded system we use is the Efficient Architecture for Running THreads (EARTH) model, which can be implemented from off‐the‐shelf processors.With the Class B input sparse matrix from the NAS CG benchmark (75 000 rows), we attain an absolute speedup of 90 on 120 nodes of a distributed memory configuration. This is achieved without using inspector/executor or graph partitioning, or any communication minimization phase, which means that similar results can be expected for adaptive problems as well. High scalability is achieved because of a number of characteristics of the EARTH architecture: local synchronizations, low communication overheads, ability to overlap communication and computation, and low context‐switching costs. Copyright © 2002 John Wiley & Sons, Ltd.
A flexible framework for consistency management
Authors: Weber S. , Nixon P. A. , Tangney B. 
Published: August 2002

AbstractRecent distributed shared memory (DSM) systems provide increasingly more support for the sharing of objects rather than portions of memory. However, like earlier DSM systems these distributed shared object systems (DSO) still force developers to use a single protocol, or a small set of given protocols, for the sharing of application objects. This limitation prevents the applications from optimizing their communication behaviour and results in unnecessary overhead.A current general trend in software systems development is towards customizable systems, for example frameworks, reflection, and aspect‐oriented programming all aim to give the developer greater flexibility and control over the functionality and performance of their code. This paper describes a novel object‐oriented framework that defines a DSM system in terms of aconsistency modeland an underlyingcoherency protocol. Different consistency models and coherency protocols can be used within a single application because they can be customized, by the application programmer, on a per‐object basis. This allows application specific semantics to be exploited at a very fine level of granularity and with a resulting improvement in performance.The framework is implemented in JAVA and the speed‐up obtained by a number of applications that use the framework is reported. Copyright © 2002 John Wiley & Sons, Ltd.
An analysis of VI Architecture primitives in support of parallel and distributed communication
Authors: Begel Andrew , Buonadonna Philip , Culler David E. , Gay David 
Published: August 2002

AbstractWe present the results of a detailed study of the Virtual Interface (VI) paradigm as a communication foundation for a distributed computing environment. Using Active Messages and the Split‐C global memory model, we analyze the inherent costs of using VI primitives to implement these high‐level communication abstractions. We demonstrate a minimum mapping cost (i.e. the host processing required to map one abstraction to a lower abstraction) of 5.4 μs for both Active Messages and Split‐C using four‐way 550 MHz Pentium III SMPs and the Myrinet network. We break down this cost to the use of individual VI primitives in supporting flow control, buffer management and event processing and identify the completion queue as the source of the highest overhead. Bulk transfer performance plateaus at 44 Mbytes/s for both implementations are due to the addition of fragmentation requirements. Based on this analysis, we present the implications for the VI successor, Infiniband. Copyright © 2002 John Wiley & Sons, Ltd.
Synthesis of predistorted reflection‐mode hybrid prototype networks with symmetrical and asymmetrical characteristics
Authors: Fathelbab W. M. , Hunter I. C. , Rhodes J. D. 
Published: August 2002

AbstractA new technique for predistorting filter transfer functions to compensate for the dissipative losses present in the resonator elements is introduced. The method is based on the formation of two admittances from lossless transfer functions. Each admittance is then individually predistorted and connected to a 3‐dB hybrid coupler. A simulated numerical example demonstrates that the method is capable of designing network prototypes with a combined predistorted reflection and transmission functions. Tables of prototype element values for elliptic lowpass/highpass functions are also provided. Copyright © 2001 John Wiley & Sons, Ltd.
An approximation for the input conductivity function of the non‐linear resistive grid
Authors: Gluskin Emanuel 
Published: August 2002

AbstractThe 2‐term approximations for the input conductivity functions, iin=fin(vin), of a grid of similar weakly non‐linear (parabolic) conductors, and the grid's symmetric cuts, measured between two close nodes, are derived, using a semi‐empirical method; the results of a relevant PSpice simulation are presented. The functions fin(vin) of the grid's symmetric cuts possess a common analytical feature. Simulation results show that the error in the calculation of the non‐linear terms in the input functions is less than 1 per cent. Copyright © 2001 John Wiley & Sons, Ltd.
A study on WTA cellular neural networks
Authors: Forti Mauro 
Published: August 2002

AbstractThis paper addresses a number of basic issues concerning the dynamics of a class of winner‐take‐all cellular neural networks (WTA CNNs) proposed by Seiler and Nossek. The main result is an analytical estimate for the settling time, which shows from a theoretical point of view that such CNNs are well suited for on‐line applications requiring a large number of units, fast processing speed and a relatively high resolution. Other results are the determination of the largest parameter set that guarantee a correct WTA functionality for all initial conditions and the solution of a conjecture made by Seiler and Nossek. These results are proved by means of a new Lyapunov function to analyse the global dynamical behaviour of the WTA CNNs. Copyright © 2001 John Wiley & Sons, Ltd.
Improved design of FIR notch filter by using Bernstein polynomial
Authors: Tseng Chien‐Cheng 
Published: August 2002

AbstractBernstein polynomial has been used to design maximally flat FIR notch filters. However, the designed magnitude response is not exactly zero valued at notch frequency. In order to eliminate this undesired distortion, a novel method is presented to improve notch filter design in this paper. The designed notch filter is not only exactly zero valued at notch frequency but also has unity gain at ω=0 and π. Copyright © 2001 John Wiley & Sons, Ltd.
A behavioural modelling technique for visual microprocessor mixed‐signal VLSI chips
Authors: Földesy P. , Rodríguez‐Vázquez A. 
Published: August 2002

AbstractThis paper describes procedures to build custom‐tailored behavioural models of cellular neural networks (CNNs), and acompanion tool to run these models. The main property of the CNNs is the emerging behaviour, i.e. new phenomena arise from the interactions of thousands of identical cells. The existence of these phenomena need is to be checked during the design phase, which requires a full network simulation and therefore constitutes a very time‐consuming step of circuit verification. To solve this task as a modelling problem, we introduce a new behavioural model optimization technique. Starting from a user‐defined set of block models, the proposed framework produces an optimized selection which is used to build up a full‐chip model. The optimization goal is the minimization of the simulation CPU time and the maximization of the time domain precision. A dedicated environment has been developed for efficient numerical simulation; this environment is briefly described in the paper. Two case studies are also presented to demonstrate the effectivity of the technique. Copyright © 2002 John Wiley & Sons, Ltd.
Robustness oriented design tool for multilayer DTCNN applications
Authors: López P. , Vilariño D. L. , Brea V. M. , Cabello D. 
Published: August 2002

AbstractIn this work, we present a design automation tool for the synthesis of multilayer discrete time cellular neural network (DTCNN) structures that takes into account hardware implementation constraints. In so doing, the possible implementation on a VLSI CNN chip of the solutions found is guaranteed. The algorithm is based on stochastic optimization strategies, particularly genetic algorithms. In order to guarantee correct operation of analog VLSI chips the robustness of the templates and the network complexity have been considered during the optimization process by means of the introduction of penalty functions. This strategy has the side effect of reducing the computational cost of the optimization process since it focuses on those areas of the search space that meet the implementation requirements. As a difference from previous approaches to robust template design, the problem of robustness in greyscale input applications is also considered under the assumption of an appropriate selection of the training set, that must not only define the task but also contain relevant information about the images to be processed. Copyright © 2002 John Wiley & Sons, Ltd.
Telomere length measurement by fluorescence in situ hybridization and flow cytometry: Tips and pitfalls
Authors: Baerlocher Gabriela M. , Mak Jennifer , Tien Teri , Lansdorp Peter M. 
Published: August 2002

AbstractBackgroundTelomeres containing noncoding DNA repeats at the end of the chromosomes are essential for chromosomal stability and are implicated in regulating the replication and senescence of cells. The gradual loss of telomere repeats in cells has been linked to aging and tumor development and methods to measure telomere length are of increasing interest. At least three methods for measuring the length of telomere repeats have been described: Southern blot analysis and quantitative fluorescence in situ hybridization using either digital fluorescence microscopy (Q‐FISH) or flow cytometry (flow‐FISH). Both Southern blot analysis and Q‐FISH have specific limitations and are time‐consuming, whereas the flow‐FISH technique requires relatively few cells (105) and can be completed in a single day. A further advantage of the flow‐FISH method is that data on the telomere length from individual cells and subsets of cells (lymphocytes and granulocytes) can be acquired from the same sample. In order to obtain accurate and reproducible results using the flow‐FISH technique, we systematically explored the influence of various steps in the protocol on telomere length values and established an acceptable range for the most critical parameters.MethodsIsolated leukocytes from whole blood are denatured by heat and 70%/75% formamide, then hybridized with or without a telomere‐specific fluorescein isothiocyante (FITC)‐conjugated peptide nucleic acid probe (PNA). Unbound telomere PNA is washed away, the DNA is counterstained, and telomere fluorescence is measured on a flow cytometer using an argon ion laser (488 nm) to excite FITC. For each sample, duplicates of telomere PNA‐stained and unstained tubes are analyzed.ResultsCell counts and flow‐FISH telomere length measurements were performed on leukocytes and thymocytes of humans and other species. Leukocyte suspensions were prepared by two red blood cell lysis steps with ammonium chloride. Optimal denaturation of DNA was achieved by heating at 85–87°C for 15 min in a solution containing 70%/75% formamide. Hybridization was performed at room temperature with a 0.3 μg/ml telomere‐PNA probe for at least 60–90 min. Unbound telomere‐PNA probe was diluted at least 4,000–40,000 times with wash steps containing 70%/75% formamide at room temperature. LDS 751 and DAPI were suitable as DNA counterstains as they did not show significant interference with telomere length measurement.ConclusionsThe use of flow‐FISH for telomere length measurements in nucleated blood cells requires tight adherence to an optimized protocol. The method described here can be used to determine rapidly the telomere length in subsets of nucleated blood cells. Cytometry 47:89–99, 2002. © 2002 Wiley‐Liss, Inc.
Flow cytometric S‐phase fraction measurement in breast carcinoma: Influence of software and histogram resolution
Authors: Jourdan Marie‐Lise , Ferrero‐Poüs Magali , Spyratos Frédérique , Romain Sylvie , Martin Pierre‐Marie , Chassevent Agnès 
Published: August 2002

AbstractBackgroundS‐phase fraction (SPF) measurement by flow cytometry is a clinically useful prognostic factor in patients with breast carcinoma. Standardized SPF determination is essential. As part of a multicenter study, we evaluated the influence of the choice of software and histogram resolution (256, 512, or 1,024 channels) on SPF quantification.MethodsOne hundred thirty‐three DNA histograms were analyzed in three laboratories with Modfit 5.2, Modfit LT, and Multicycle AV software. Strict rules for histogram interpretation and software management were applied. The following five options were compared: MF 5.2 1024, MF 5.2 256, MF LT 256, MC AV 256, and MC AV 512.ResultsIn the DNA diploid and aneuploid groups, SPF distributions were not statistically different among the five options. Excellent quantitative correlations were obtained between pairs of options. When using tertiles as cutpoints for SPF classification, concordance rates ranged from 79.7% to 93.2% for DNA diploid samples and from 87.8% to 95.9% for DNA aneuploid samples, the best results being obtained with software working with a similar histogram resolution.ConclusionsStandardized use of commercially available software, including the choice of histogram resolution, provides comparable SPF results. Cytometry 48:66–70, 2002. © 2002 Wiley‐Liss, Inc.
Comparative genomic hybridization study of nasal‐type NK/T‐cell lymphoma
Authors: Ko Young H. , Choi Kyung E. , Han Jeong H. , Kim Jin M. , Ree Howe J. 
Published: August 2002

AbstractBACKGROUNDNasal‐type NK/T‐cell lymphoma is a rare type of non‐Hodgkin's lymphoma. The genetic changes associated with pathogenesis have not been well defined. This study investigates the nonrandom genetic alteration of nasal‐type NK/T‐cell lymphoma. Methods: Nine cases were studied. Comparative genomic hybridization (CGH) was carried out using fresh tumor tissues of seven nasal‐type NK/T‐cell lymphomas. To complement the data by CGH, loss of heterozygosity (LOH) of chromosomes 6q, 1p, and 17p using polymorphic markers and p53 gene mutation by polymerase chain reaction–single‐strand conformation polymorphism (PCR‐SSCP) were analyzed. Results: The DNA copy number changes of seven nasal‐type NK/T‐cell lymphomas were gains on chromosomes 2q(5), 13q(4), 10q(3), 21q(2), 3q(2), 5q(2), and 17q(2), and losses involving chromosomes 1p(4), 17p(4), 12q(3), 13q(2), and 6q(1). One of six cases informative for at least two markers for chromosome 6q showed LOH at D6S300, D6S1639, D6S261, D6S407, and D6S292. Two cases showing loss of 1p and 17q by CGH revealed LOH at D1S214, D1S503, and D17S559. P53 mutation was detected in exon 8 in one of nine cases. Conclusion: Frequent DNA losses at 1p, 17p, and 12q and gains at 2q, 13q, and 10q suggested that these regions could be targets for further molecular genetic analysis to investigate tumor suppressor genes or oncogenes associated with tumorigenesis of NK/T‐cell lymphoma. Infrequent alteration of 6q contrary to previous studies raises doubt about an implication of 6q loss in the pathogenesis of early‐stage NK/T‐cell lymphoma. Further studies on more defined cases are required to verify their association. Cytometry (Comm. Clin. Cytometry) 46:85–91, 2001. © 2001 Wiley‐Liss, Inc.
On the design of Robust‐WDM local area networks
Authors: El‐Bawab Tarek S. , Jayasumana Anura P. 
Published: August 2002

AbstractRobust wavelength division multiplexing (Robust‐WDM) is a proposal to realize cost‐effective WDM local area networks (LANs) which can get around the expensive need for laser wavelength stabilization. The type of these networks that relies on an access protocol with aperiodic reservations and lenient‐token‐passing based control channel (the AR/LTP protocol) is promising. We look at the deployment of the AR/LTP analytical model in designing this type of network. The model is used to predict the effect of component and network parameters on the waiting time characteristics of the network. An increase in node operation times (i.e. receiver response time, transmitter select time and reservation period) would result in increasing the average waiting time of a connection request, but the waiting time is more sensitive to the physical span of the network and its size. It is also observed that increasing the inter‐reservation threshold may result in little increase in waiting time up to some limit beyond which delay increases rapidly. Copyright © 2001 John Wiley & Sons, Ltd.
Dynamic bandwidth allocation and buffer dimensioning under equal segment scheme to support video‐on‐demand services
Authors: Zhang Liren , Fu Huirong , Ng Chee Hock 
Published: August 2002

AbstractThis paper focuses on the optimization of network bandwidth allocation and buffer dimensioning to transport pre‐stored MPEG video data from source to playback destination across ATM networks. This is one of the most important issues in the support of video‐on‐demand (VoD) service. This paper provides a novel scheme in the dynamic allocation of bandwidth to segments of video using ABR mode. The dynamic bandwidth allocation is based on a new concept, called playback tunnel which is obtained from the traffic characteristics of the pre‐stored MPEG video trace to determine the optimum of transmission bandwidth as well as the buffer capacity to ensure that the playback buffer neither underflows nor overflows. The proposed scheme is tested with real‐life MPEG video traces. The obtained results have shown its significant performance improvement in terms of the capacity of playback buffer, the start‐up playback delay, the size of video segment and the network multiplexing gain. Copyright © 2001 John Wiley & Sons, Ltd.
DRED: a random early detection algorithm for TCP/IP networks
Authors: Aweya James , Ouellette Michel , Montuno Delfin Y. 
Published: August 2002

AbstractIt is now widely accepted that a RED [2] controlled queue certainly performs better than a drop‐tail queue. But an inherent weakness of RED is that its equilibrium queue length cannot be maintained at a preset value independent of the number of TCP active connections. In addition, RED's optimal parameter setting is largely correlated with the number of connections, the round‐trip time, the buffer space, etc. In light of these observations, we propose DRED, a novel algorithm which uses the basic ideas of feedback control to randomly discard packets with a load‐dependent probability when a buffer in a router gets congested. Over a wide range of load levels, DRED is able to stabilize a router queue occupancy at a level independent of the number of active TCP connections. The benefits of stabilized queues in a network are high resources utilization, predictable maximum delays, more certain buffer provisioning, and traffic‐load‐independent network performance in terms of traffic intensity and number of connections. Copyright © 2002 John Wiley & Sons, Ltd.
Well‐differentiated villoglandular adenocarcinoma of the uterine cervix: Cytomorphologic observation of five cases
Authors: Khunamornpong Surapan , Siriaunkgul Sumalee , Suprasert Prapaporn 
Published: August 2002

AbstractWe retrospectively examined the cytologic findings of well‐differentiated villoglandular adenocarcinoma (VGA) treated in our hospital. Cervical smears of four cases and a touch preparation of another case of VGA formed the materials for the study. The cytologic features were correlated with the histomorphology of VGA. Architecturally, long slender papillae and cohesive branching epithelial sheets with smooth borders and a lack of feathery edge were observed. Crowding and overlapping of nuclei were noted. The nuclei were uniform, small, and round to oval‐shaped, with evenly distributed granular chromatin. Nucleoli were absent or inconspicuous. Mitoses were occasionally seen in all but one case. As the features of VGA are distinctive, the diagnosis could be possible on cytological grounds. Examination of cervical smears would be helpful for an early diagnosis of VGA or to suggest the coexistence of other neoplastic components. Diagn. Cytopathol. 2002;26:10–14. © 2002 Wiley‐Liss, Inc.
Limiting factors for cytopathological diagnosis of high‐grade squamous intraepithelial lesions: A cytohistological correlation between findings in cervical smears and loop electrical excision procedure
Authors: Pinto Álvaro P. , Tuon Felipe F.B. , Torres Luiz Fernando Bleggi , Collaço Luiz Martins 
Published: August 2002

AbstractThe present study sought possible factors leading to the cytological diagnosis of atypical squamous cells of uncertain significance (ASCUS) in cases of high‐grade squamous intraepithelial lesions (HSIL). Based on retrospective histopathological analysis of loop electrical excision procedure (LEEP) products that diagnosed HSIL, two study groups were randomly selected. The first was consisted of cases with two consecutive Papanicolaou (Pap) smears with the diagnosis of ASCUS. The second (control) group was represented by cases diagnosed as HSIL by cytology. From the Pap smears diagnosed as ASCUS, the sampling limitations was different from control group (P < 0.05). The median size of the largest lesion in each case with ASCUS was 2.66 mm (± 1.71 mm). In the control group, the median size of the largest lesion was 5.15 mm (±2.58 mm) (P < 0.05). The size of the lesion and sample limitations led patients with cervical intraepithelial neoplasms to be diagnosed as ASCUS for two consecutive times, after a 6‐mo period. Diagn. Cytopathol. 2002;26:15–18. © 2002 Wiley‐Liss, Inc.