bluuebunny/crossref_metadata_2025_split huggingface dataset:
A multicenter study of supportive‐expressive group therapy for women with BRCA1/BRCA2 mutations
Authors: Esplen Mary Jane , Hunter Jon , Leszcz Molyn , Warner Ellen , Narod Steven , Metcalfe Kelly , Glendon Gord , Butler Kate , Liede Alexander , Young Mary Anne , Kieffer Stephanie , DiProspero Lisa , Irwin Ellen , Wong Jiahui 
Published: October 2004

AbstractBACKGROUNDWomen with a BRCA1/BRCA2 mutation experience significant challenges. These include decision‐making regarding surgical options and notification to offspring and family, along with a sense of isolation, which may lead to psychological and emotional distress. The current study developed, standardized, and conducted preliminary testing of a supportive‐expressive group therapy intervention designed to address these challenges.METHODSSeventy women with a BRCA1/BRCA2 mutation recruited from familial cancer risk clinics participated in 12 sessions of supportive‐expressive group therapy that lasted 6 months. Before and after measures of psychosocial functioning, knowledge, and surveillance/surgery activities were completed.RESULTSSixty‐seven women completed the intervention. Significant improvements were observed in psychosocial functioning: cancer worries (P = 0.005), anxiety (P = 0.033), and depression (P = 0.015). Knowledge level and surveillance levels were high at baseline and there were no significant changes postintervention. A significant number of women made decisions concerning prophylactic surgery (oophorectomy/mastectomy) during and after the intervention.CONCLUSIONSThe feasibility of a supportive‐expressive group for BRCA1/BRCA2 mutation carriers was demonstrated. Findings from the study are consistent with an effective intervention. However, further research is required using a randomized controlled study design. Cancer 2004. © 2004 American Cancer Society.
Are chroma tolerances dependent on hue‐angle?
Authors: Melgosa M. , Huertas R. , Yebra A. , Pérez M. M. 
Published: October 2004

AbstractRelationships between suprathreshold chroma tolerances and CIELAB hue‐angles have been analyzed through the results of a new pair‐comparison experiment and the experimental combined data set employed by CIE TC 1–47 for the development of the latest CIE color‐difference formula, CIEDE2000. Chroma tolerances have been measured by 12 normal observers at 21 CRT‐generated color centers L*10 = 40, C*ab,10 = 20 and 40, and hab,10 at 30° regular steps). The results of this experiment lead to a chroma‐difference weighting function with hue‐angle dependence WCH, which is in good agreement with the one proposed by the LCD color‐difference formula [Color Res Appl 2001;26:369–375]. This WCH function is also consistent with the experimental results provided by the combined data set employed by CIE TC 1–47. For the whole CIE TC 1–47 data set, as well as for each one of its four independent subsets, the PF/3 performance factor [Color Res Appl 1999;24:331–343] was improved by adding to CIEDE2000 the WCH function proposed by LCD, or the one derived by us using the results of our current experiment together with the combined data set employed by CIE TC 1–47. Nevertheless, unfortunately, from the current data, this PF/3 improvement is small (and statistically nonsignificant): 0.3 for the 3657 pairs provided by CIE TC 1–47 combined data set and 1.6 for a subset of 590 chromatic pairs (C*ab,10>5.0) with color differences lower than 5.0 CIELAB units and due mainly to chroma. © 2004 Wiley Periodicals, Inc. Col Res Appl, 29, 420–427, 2004; Published online in Wiley Interscience (www.interscience.wiley.com). DOI 10.1002/col.20057
Predicting changes in the color of powders: Does Melamed's model fit to real industrial powders?
Authors: Garay Hélène , Eterradossi Olivier , Benhassaine Ali 
Published: October 2004

AbstractIn 1963, Melamed proposed a model that expressed reflectance of a powder described as a population of spherical particles of unique diameter as a function of size, shape, and optical characteristics of the powder. This article shows how this model has been adapted to fit to industrial powders. An example of use for industrial quartz is given. © 2004 Wiley Periodicals, Inc. Col Res Appl, 29, 413–419, 2004; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/col.20058
Visually matching daylight fluorescent lamplight with two primary sets
Authors: Houser Kevin W. , Hu Xin 
Published: October 2004

AbstractThornton reported discrepancies in chromaticity and power content in Maxwell‐method visual matches when using different primary sets. He found particularly large chromaticity differences when a broadband white light was matched with what he refers to as an antiprime (AP) primary set [blue‐green, yellow, deep red, as, for example 497–579‐653 nm, mean full‐width half‐maximum (FWHM) = 15.6 nm] and comparatively smaller chromaticity differences with a prime‐color (PC) primary set (blue‐violet, green, orange‐red, as, for example, 452–533‐607 nm, mean FWHM = 15.6 nm). In related work, Ábrahámet al.found similar chromaticity discrepancies when subjects reported a visual match, partially attributing the errors to age‐related changes in the specular transmittance of the lens. This present study was carried out to explore these findings and to investigate individual differences in color matching. Thirty‐nine subjects made two matches in a horizontally bisected 10° field. The bottom field was illuminated with daylight fluorescent lamplight and the top field was illuminated with one of two primary sets that were selected to be similar to those used by Thornton and Ábrahámet al.: (1) PC = 453–533‐619 nm with a mean FWHM of 18.3 nm and (2) AP = 493–581‐657 nm with a mean FWHM of 23.7 nm. Statistical data screening revealed two outliers that were removed from further analysis. The PC primary set required 5% less radiant power per unit area to match the daylight fluorescent reference and the AP set required 117% more. Thirty‐six of the 37 matches with the PC primary set were within a 10‐step MacAdam ellipse that was centered at the daylight fluorescent reference. In contrast, just 2 of the matches with the AP set were within a 10‐step ellipse, and 24 of the matches were outside of a 20‐step ellipse. These trends are similar to those reported by Thornton and later by Ábrahámet al.The primary set and the interaction between primary set and age were statistically significant factors. Gender and subject knowledge were not significant. © 2004 Wiley Periodicals, Inc. Col Res Appl, 29, 428–437, 2004; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/col.20059
Accurate estimation of the nonlinearity of input/output response for color cameras
Authors: Cheung Vien , Westland Stephen , Thomson Mitch 
Published: October 2004

AbstractThis study investigates techniques for accounting for the nonlinearity of the input/output response of a camera system. A simple power‐law form of the nonlinearity was assumed and estimates of the value for the exponent for each of the color channels were made using three different methods. The responses from an Agfa StudioCam camera were linearized and then device characterization was attempted. Characterization errors were up to 10% better using the spectral‐sensitivities‐based method for estimating the nature of the nonlinearity than using the other two methods. We therefore suggest that the spectral‐sensitivities‐based method should be preferred for characterization or any other computational process that requires linearization of the camera responses. We expect greater benefits using this method for “low‐end” camera systems and/or for cameras where the spectral sensitivities are known or more precisely estimated. We also expect the smoothness of the illumination to influence the error in the estimates of the nonlinearity using the luminance‐ and mean‐reflectance‐based methods. © 2004 Wiley Periodicals, Inc. Col Res Appl, 29, 406–412, 2004; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/col.20061
Cross‐regional comparison of colour emotions Part I: Quantitative analysis
Authors: Xin J. H. , Cheng K. M. , Taylor G. , Sato T. , Hansuebsai A. 
Published: October 2004

AbstractColour emotion is a feeling or emotion induced in our brains when we look at a colour. In this article, the colour emotional responses obtained by conducting visual experiments in different regions, namely Hong Kong, Japan and Thailand, using a set of 218 colour samples are compared using a quantitative approach in an attempt to study the influence of different cultural and geographical locations. Twelve pairs of colour emotions described in opponent words were used. These word pairs are warm–cool, light–dark, deep–pale, heavy–light, vivid–sombre, gaudy–plain, striking–subdued, dynamic–passive, distinct–vague, transparent–turbid, soft–hard, and strong–weak. These word pairs represent the fundamental emotional response of human beings toward colour. The influences of lightness and chroma were found to be much more important than that of the hue on the colour emotions studied. Good correlations of colour emotions among these three regions in East Asia were found, with the best ones for colour emotion pairs being light–dark and heavy–light. © 2004 Wiley Periodicals, Inc. Col Res Appl, 29, 451–457, 2004; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/col.20062
Cross‐regional comparison of colour emotions Part II: Qualitative analysis
Authors: Xin J. H. , Cheng K. M. , Taylor G. , Sato T. , Hansuebsai A. 
Published: October 2004

AbstractDuring the colour perception process, an associated feeling or emotion is induced in our brains, and this kind of emotion is known as colour emotion. In Part I of this study, a quantitative analysis of the cross‐regional differences and similarities of colour emotions as well as the influence of hue, lightness, and chroma on the colour emotions of the subjects from Hong Kong, Japan, and Thailand, was carried out. In Part II, colour emotions of the subjects in any two regions were compared directly using colour planners showing the effect of the lightness and the chroma of colours. The colour planners can help the designers to understand the taste and feelings of the target customers and facilitate them to select suitable colours for the products that are intended to be supplied in different regions. © 2004 Wiley Periodicals, Inc. Col Res Appl, 29, 458–466, 2004; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/col.20063
The properties of multiple CMF determinations using alternative primary sets Part II: A data unification methodology
Authors: Oulton D. P. 
Published: October 2004

AbstractThe spectral power values representing Thornton's “alternative primary” PC, NP, and AP colour matching functions (CMF) are compared with the power values representing the 49‐observer Stiles–Burch average definition. The Thornton measurements are first converted by matrix transformation into a data set expressed in terms of spectral power at the Stiles–Burch primary wavelengths. Graphs and power ratios are used to compare the definitions for two alternative matches to the same visual stimulus. A triplet of n:n spectral‐power ratios (one in each dimension, R, G, and B) is used to quantify the differences between the alternative matches. The relationship between the Thornton PC and Stiles–Burch match‐definitions is then found to deviate from the expected power‐ratio of 1:1 after matrix transformation. The revealed relationship is an internally consistent and smooth function of matched wavelength, which has a different nonlinear characteristic in each R, G, and B dimension relative to the Stiles–Burch reference model. The “Thornton bow‐tie” phenomenon is also demonstrated between a pair of maximum saturation CMF definitions made with alternative primaries. The implicit differences in neutral axis definition represented by the bow‐tie diagram are linked to differences in trichromatic unit (T‐unit) definition. In this case, the conventional CMF normalization process is postulated to be inaccurate at the wavelengths concerned, resulting in incompatibility between the T‐unit definitions of the two primary sets being compared. The conventional N→3 T‐unit definition of visual neutrality equating Illuminant SE to a single R:G:B power ratio is extended, by adding an extra N→N mapping to the definition. The resulting N→N→3 mapping is in principle a fully determined redefinition of three‐dimensional T‐unit equivalence, in which many R:G:B ratios for a comprehensive set of visually neutral metamers can be mapped by N→N transformation onto the conventional single ratio. The effect of N→N mapping is to transform spectral power distributions (SPDs) into spectral effect distributions (SEDs) expressed in T‐units. The SPD/SED transform, thus defined, is proposed as a method for unifying CMF determinations made with alternative primaries. The expected outcome is that after transforming SPDs by N→N mapping into SEDs the definitions for all visually matching metamers will be demonstrably interconvertible by matrix product. © 2004 Wiley Periodicals, Inc. Col Res Appl, 29, 438–450, 2004; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/col.20069
A performance study of job management systems
Authors: El‐Ghazawi Tarek , Gaj Kris , Alexandridis Nikitas , Vroman Frederic , Nguyen Nguyen , Radzikowski Jacek R. , Samipagdi Preeyapong , Suboh Suboh A. 
Published: October 2004

AbstractJob Management Systems (JMSs) efficiently schedule and monitor jobs in parallel and distributed computing environments. Therefore, they are critical for improving the utilization of expensive resources in high‐performance computing systems and centers, and an important component of Grid software infrastructure. With many JMSs available commercially and in the public domain, it is difficult to choose an optimum JMS for a given computing environment. In this paper, we present the results of the first empirical study of JMSs reported in the literature. Four commonly used systems, LSF, PBS Pro, Sun Grid Engine/CODINE, and Condor were considered. The study has revealed important strengths and weaknesses of these JMSs under different operational conditions. For example, LSF was shown to exhibit excellent throughput for a wide range of job types and submission rates. Alternatively, CODINE appeared to outperform other systems in terms of the average turn‐around time for small jobs, and PBS appeared to excel in terms of turn‐around time for relatively larger jobs. Copyright © 2004 John Wiley & Sons, Ltd.
Supporting Bulk Synchronous Parallelism with a high‐bandwidth optical interconnect
Authors: Gourlay I. , Dew P. M. , Djemame K. , Snowdon J. F. , Russell G. 
Published: October 2004

AbstractThe list of applications requiring high‐performance computing resources is constantly growing. The cost of inter‐processor communication is critical in determining the performance of massively parallel computing systems for many of these applications. This paper considers the feasibility of a commodity processor‐based system which uses a free‐space optical interconnect. A novel architecture, based on this technology, is presented. Analytical and simulation results based on an implementation of BSP (Bulk Synchronous Parallelism) are presented, indicating that a significant performance enhancement, over architectures using conventional interconnect technology, is possible. Copyright © 2004 John Wiley & Sons, Ltd.
Towards a more realistic comparative analysis of multicomputer networks
Authors: Sarbazi‐Azad H. , Ould‐Khaoua M. , Mackenzie L. M. 
Published: October 2004

AbstractSeveral studies have examined the relative performance merits of the torus and hypercube taking into account the channel bandwidth constraints imposed by implementation technology. While the torus has been shown to outperform the hypercube under the constant wiring density constraint, the opposite conclusion has been reached when the constant pin‐out constraint is considered. However, these studies have assumed a pure uniform traffic pattern and deterministic routing. The ‘uniform traffic’ assumption is not always justifiable in practice as there are many real‐world parallel applications that exhibit non‐uniform traffic patterns, which can create unbalanced traffic such as hotspots in the network. This paper re‐examines the performance merits of the torus and hypercube in the presence of hotspot traffic. The comparative analysis is based on fully adaptive routing as this has been gaining popularity in recent practical multicomputers. Moreover, it uses a new cost model that takes into account the implementation cost of the network and its routers. The results reveal that for moderate and large system sizes, lower dimensionalk‐aryn‐cubes (e.g. 2D torus) always outperform their higher dimensional counterparts even under the pin‐out constraint. Copyright © 2004 John Wiley & Sons, Ltd.
RF‐MVTC: an efficient risk‐free multiversion concurrency control algorithm
Authors: Boukerche Azzedine , Tuck Terry 
Published: October 2004

AbstractIn this paper, we focus on the temporary return of data values that are incorrect for given transactional semantics that could have catastrophic effects similar to those in parallel and discrete event simulation systems. In many applications using online transactions processing environments, for instance, it is best to delay the response to a transaction's read request until it is either known or unlikely that a write message from an older update transaction will not make the response incorrect. Examples of such applications are those where aberrant behavior is too costly, and those in which precommitted data is visible to some reactive entity. In light of the avoidance of risk in this approach, we propose a risk‐free multiversion temporally correct concurrency‐control algorithm. We discuss the algorithm, its implementation and report on the performance results of simulation models using a cluster of workstations. Copyright © 2004 John Wiley & Sons, Ltd.
On the performance of circuit‐switched networks in the presence of correlated traffic
Authors: Min Geyong , Ould‐Khaoua Mohamed 
Published: October 2004

AbstractMany studies have revealed that the traffic generated by multimedia applications exhibits a high degree of burstiness and possesses strong correlation in the number of message arrivals between adjacent time intervals, which can significantly affect network performance. This paper proposes a new analytical performance model for circuit‐switched k‐ary n‐cubes with correlated traffic pattern. Compared to the models presented in the previous studies, this model is more realistic due to its ability to capture the effects of using virtual channels at a source node by taking into account the splitting of correlated traffic. Moreover, a closed‐form expression for computing the probability of virtual channel occupancy is given. The validity of the present model is demonstrated by comparing analytical results against those obtained through simulation experiments of the actual system. Copyright © 2004 John Wiley & Sons, Ltd.
Performance evaluation of a random‐walk‐based algorithm for embedding dynamically evolving trees in hypercubic networks
Authors: Li Keqin 
Published: October 2004

AbstractIn many tree‐structured parallel computations, the size and structure of a tree that represents a parallel computation is unpredictable at compile‐time; the tree evolves gradually during the course of the computation. When such a computation is performed on a static network, the dynamic tree embedding problem is to distribute the tree nodes to the processors of the network such that all the processors receive roughly the same amount of load and that communicating nodes are assigned to neighboring processors. Furthermore, when a new tree node is generated, it should be immediately assigned to a processor for execution without any information on the further evolving of the tree; and load distribution is performed by all processors in a totally distributed fashion.We study the problem of embedding dynamically evolving trees in hypercubic networks, including shuffle‐exchange, de Bruijn, cube‐connected cycles, wrapped butterfly, and hypercube networks. The performance of a random‐walk‐based randomized tree embedding algorithm is evaluated. Several random tree models are considered. We develop recurrence relations for analyzing the performance of embedding of complete‐tree‐based random trees and randomized complete trees, and linear systems of equations for reproduction trees. We present more efficient recurrence relations and linear systems of equations for symmetric networks. We also demonstrate extensive numerical data of the performance ratio and make a number of interesting observations of randomized tree embedding in the five hypercubic networks. Copyright © 2004 John Wiley & Sons, Ltd.
On the scalability of many‐to‐many reliable multicast sessions
Authors: Yoon W. Y. , Lee D. , Youn H. Y. 
Published: October 2004

AbstractEven though tree‐based reliable multicast protocols are known to be most scalable for one‐to‐many sessions, there is still an open question as to whether these protocols are also scalable for many‐to‐many sessions. In this paper, we analyze and compare two promising multicast protocols—the receiver‐initiated protocol with NACK suppression and the tree‐based protocol—using a new spatial loss model. The proposed model considers the correlation of packet loss events for more realistic analysis unlike the previous work. The analysis results show that the tree‐based protocol achieves much higher throughput than the receiver‐initiated protocol for a many‐to‐many session as the number of participants in the session becomes larger. Copyright © 2004 John Wiley & Sons, Ltd.
One‐to‐all broadcasting scheme for arbitrary static interconnection networks with bursty background traffic
Authors: Kouvatsos D. D. , Mkwawa I. M. , Awan I. 
Published: October 2004

AbstractA novel one‐to‐all broadcasting scheme is proposed for arbitrary static interconnection networks with bursty background traffic having head‐of‐line priorities, complete buffer sharing and repetitive service blocking with random destination. The scheme facilitates inter‐process communication amongst parallel computers and grid computing networks as well as asynchronous transfer mode space division architectures and it is applicable to a single‐port mode of message passing communication. The scheme utilizes a queue‐by‐queue decomposition algorithm for arbitrary open queueing network models, based on the principle of maximum entropy, in conjunction with an information theoretic decomposition criterion and graph theoretic concepts. Evidence based on empirical studies indicates the suitability of the scheme for achieving an optimal one‐to‐all broadcasting cost. Copyright © 2004 John Wiley & Sons, Ltd.
Molecule‐to‐Metal Bonds: Electrografting Polymers on Conducting Surfaces
Authors: Palacin Serge , Bureau Christophe , Charlier Julienne , Deniau Guy , Mouanda Brigitte , Viel Pascal 
Published: October 2004

AbstractElectrografting is a powerful and versatile technique for modifying and decorating conducting surfaces with organic matter. Mainly based on the electro‐induced polymerization of dissolved electro‐active monomers on metallic or semiconducting surfaces, it finds applications in various fields including biocompatibility, protection against corrosion, lubrication, soldering, functionalization, adhesion, and template chemistry. Starting from experimental observations, this Review highlights the mechanism of the formation of covalent metal–carbon bonds by electro‐induced processes, together with major applications such as derivatization of conducting surfaces with biomolecules that can be used in biosensing, lubrication of low‐level electrical contacts, reversible trapping of ionic waste on reactive electrografted surfaces as an alternative to ion‐exchange resins, and localized modification of conducting surfaces, a one‐step process providing submicrometer grafted areas and which is used in microelectronics.