|
| ||
|
|
||
Categories
Kinds of Categories Terms modified by Categories Selected AbstractsEFFECTIVENESS OF CATEGORY AND LINE SCALES TO CHARACTERIZE CONSUMER PERCEPTION OF FRUITY FERMENTED FLAVOR IN PEANUTSJOURNAL OF SENSORY STUDIES, Issue 2 2006J.L. GREENE ABSTRACT Fruity fermented (FF) flavor is a common off-flavor in peanuts resulting from high-temperature curing. The 9-point hedonic scale is the most widely used scale to determine consumer acceptance; however, research has indicated that line scales may provide equal reliability and greater sensitivity. The objectives of this study were to characterize consumer perception of FF flavor in peanuts and to compare the effectiveness of the two scale types. Consumers (n = 208) evaluated control (no FF), low-intensity (1.0) FF and high-intensity (3.0) FF peanut pastes for the strength/intensity of roasted peanut flavor (RPF), sweet taste (ST), fresh peanut flavor (FPF) and overall liking (OV) using randomly assigned ballots. Sensitivity in defining consumer perception of off-flavor in peanuts was greater with use of line scales than with the hedonic scale. The line scale indicated that FF flavor in peanuts, even at low intensity, negatively impacted OV and further identified significantly lower RPF and FPF perception by consumers. The hedonic scale identified only a difference in FPF and was not sensitive enough to show a difference in OV. [source] Multiresolution Random Accessible Mesh CompressionCOMPUTER GRAPHICS FORUM, Issue 3 2006Junho Kim This paper presents a novel approach for mesh compression, which we call multiresolution random accessible mesh compression. In contrast to previous mesh compression techniques, the approach enables us to progressively decompress an arbitrary portion of a mesh without decoding other non-interesting parts. This simultaneous support of random accessibility and progressiveness is accomplished by adapting selective refinement of a multiresolution mesh to the mesh compression domain. We present a theoretical analysis of our connectivity coding scheme and provide several experimental results. The performance of our coder is about 11 bits for connectivity and 21 bits for geometry with 12-bit quantization, which can be considered reasonably good under the constraint that no fixed neighborhood information can be used for coding to support decompression in a random order. Categories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling [source] Wrinkling Coarse Meshes on the GPUCOMPUTER GRAPHICS FORUM, Issue 3 2006J. Loviscach The simulation of complex layers of folds of cloth can be handled through algorithms which take the physical dynamics into account. In many cases, however, it is sufficient to generate wrinkles on a piece of garment which mostly appears spread out. This paper presents a corresponding fully GPU-based, easy-to-control, and robust method to generate and render plausible and detailed folds. This simulation is generated from an animated mesh. A relaxation step ensures that the behavior remains globally consistent. The resulting wrinkle field controls the lighting and distorts the texture in a way which closely simulates an actually deformed surface. No highly tessellated mesh is required to compute the position of the folds or to render them. Furthermore, the solution provides a 3D paint interface through which the user may bias the computation in such a way that folds already appear in the rest pose. Categories and Subject Descriptors (according to ACM CCS): I.3.7 [Computer Graphics]: Animation, I.3.7 [Computer Graphics]: Color, shading, shadowing, and texture [source] Sweep-based Freeform DeformationsCOMPUTER GRAPHICS FORUM, Issue 3 2006Seung-Hyun Yoon We propose a sweep-based approach to the freeform deformation of three-dimensional objects. Instead of using a volume enclosing the whole object, we approximate only its deformable parts using sweep surfaces. The vertices on the object boundary are bound to the sweep surfaces and follow their deformation. Several sweep surfaces can be organized into a hierarchy so that they interact with each other in a controlled manner. Thus we can support intuitively plausible shape deformation of objects of arbitrary topology with multiple control handles. A sweep-based approach also provides important advantages such as volume preservation. We demonstrate the effectiveness of our technique in several examples. Categories and Subject Descriptors (according to ACM CCS): I.3.5 [Computational Geometry and Object Modeling]: Curve, surface, solid, and object representations [source] Implicit Surface Modelling with a Globally Regularised Basis of Compact SupportCOMPUTER GRAPHICS FORUM, Issue 3 2006C. Walder We consider the problem of constructing a globally smooth analytic function that represents a surface implicitly by way of its zero set, given sample points with surface normal vectors. The contributions of the paper include a novel means of regularising multi-scale compactly supported basis functions that leads to the desirable interpolation properties previously only associated with fully supported bases. We also provide a regularisation framework for simpler and more direct treatment of surface normals, along with a corresponding generalisation of the representer theorem lying at the core of kernel-based machine learning methods. We demonstrate the techniques on 3D problems of up to 14 million data points, as well as 4D time series data and four-dimensional interpolation between three-dimensional shapes. Categories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: Curve, surface, solid, and object representations [source] A System for View-Dependent AnimationCOMPUTER GRAPHICS FORUM, Issue 3 2004Parag Chaudhuri In this paper, we present a novel system for facilitating the creation of stylized view-dependent 3D animation. Our system harnesses the skill and intuition of a traditionally trained animator by providing a convivial sketch based 2D to 3D interface. A base mesh model of the character can be modified to match closely to an input sketch, with minimal user interaction. To do this, we recover the best camera from the intended view direction in the sketch using robust computer vision techniques. This aligns the mesh model with the sketch. We then deform the 3D character in two stages - first we reconstruct the best matching skeletal pose from the sketch and then we deform the mesh geometry. We introduce techniques to incorporate deformations in the view-dependent setting. This allows us to set up view-dependent models for animation. Categories and Subject Descriptors (according to ACM CCS): I.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism - Animation 7 Figure 7. Our system takes as input a sketch (a), and a base mesh model (b), then recovers a camera to orient the base mesh (c), then reconstructs the skeleton pose (d), and finally deforms the mesh to find the best possible match with the sketch (e). [source] Dye Advection Without the Blur: A Level-Set Approach for Texture-Based Visualization of Unsteady FlowCOMPUTER GRAPHICS FORUM, Issue 3 2004D. Weiskopf Dye advection is an intuitive and versatile technique to visualize both steady and unsteady flow. Dye can be easily combined with noise-based dense vector field representations and is an important element in user-centric visual exploration processes. However, fast texture-based implementations of dye advection rely on linear interpolation operations that lead to severe diffusion artifacts. In this paper, a novel approach for dye advection is proposed to avoid this blurring and to achieve long and clearly defined streaklines or extended streak-like patterns. The interface between dye and background is modeled as a level-set within a signed distance field. The level-set evolution is governed by the underlying flow field and is computed by a semi-Lagrangian method. A reinitialization technique is used to counteract the distortions introduced by the level-set evolution and to maintain a level-set function that represents a local distance field. This approach works for 2D and 3D flow fields alike. It is demonstrated how the texture-based level-set representation lends itself to an efficient GPU implementation and therefore facilitates interactive visualization. Categories and Subject Descriptors (according to ACM CCS): I.3.3 [Computer Graphics]: Picture/Image Generation I.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism [source] Instant Volumetric Understanding with Order-Independent Volume RenderingCOMPUTER GRAPHICS FORUM, Issue 3 2004Benjamin Mora Rapid, visual understanding of volumetric datasets is a crucial outcome of a good volume rendering application, but few current volume rendering systems deliver this result. Our goal is to reduce the volumetric surfing that is required to understand volumetric features by conveying more information in fewer images. In order to achieve this goal, and in contrast with most current methods which still use optical models and alpha blending, our approach reintroduces the order-independent contribution of every sample along the ray in order to have an equiprobable visualization of all the volume samples. Therefore, we demonstrate how order independent sampling can be suitable for fast volume understanding, show useful extensions to MIP and X-ray like renderings, and, finally, point out the special advantage of using stereo visualization in these models to circumvent the lack of depth cues. Categories and Subject Descriptors: I.3.3 [Computer Graphics]: Picture/Image, Generation, I.3.7 [Computer Graphics]: Three-Dimensional graphics and realism. [source] DiFi: Fast 3D Distance Field Computation Using Graphics HardwareCOMPUTER GRAPHICS FORUM, Issue 3 2004Avneesh Sud We present an algorithm for fast computation of discretized 3D distance fields using graphics hardware. Given a set of primitives and a distance metric, our algorithm computes the distance field for each slice of a uniform spatial grid baly rasterizing the distance functions of the primitives. We compute bounds on the spatial extent of the Voronoi region of each primitive. These bounds are used to cull and clamp the distance functions rendered for each slice. Our algorithm is applicable to all geometric models and does not make any assumptions about connectivity or a manifold representation. We have used our algorithm to compute distance fields of large models composed of tens of thousands of primitives on high resolution grids. Moreover, we demonstrate its application to medial axis evaluation and proximity computations. As compared to earlier approaches, we are able to achieve an order of magnitude improvement in the running time. Categories and Subject Descriptors (according to ACM CCS): I.3.3 [Computer Graphics]: Distance fields, Voronoi regions, graphics hardware, proximity computations [source] GPU-Based Nonlinear Ray TracingCOMPUTER GRAPHICS FORUM, Issue 3 2004Daniel Weiskopf In this paper, we present a mapping of nonlinear ray tracing to the GPU which avoids any data transfer back to main memory. The rendering process consists of the following parts: ray setup according to the camera parameters, ray integration, ray-object intersection, and local illumination. Bent rays are approximated by polygonal lines that are represented by textures. Ray integration is based on an iterative numerical solution of ordinary differential equations whose initial values are determined during ray setup. To improve the rendering performance, we propose acceleration techniques such as early ray termination and adaptive ray integration. Finally, we discuss a variety of applications that range from the visualization of dynamical systems to the general relativistic visualization in astrophysics and the rendering of the continuous refraction in media with varying density. Categories and Subject Descriptors (according to ACM CCS): I.3.3 [Computer Graphics]: Picture/Image Generation I.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism [source] Hardware-Accelerated Rendering of Photo HullsCOMPUTER GRAPHICS FORUM, Issue 3 2004Ming Li This paper presents an efficient hardware-accelerated method for novel view synthesis from a set of images or videos. Our method is based on the photo hull representation, which is the maximal photo-consistent shape. We avoid the explicit reconstruction of photo hulls by adopting a view-dependent plane-sweeping strategy. From the target viewpoint slicing planes are rendered with reference views projected onto them. Graphics hardware is exploited to verify the photo-consistency of each rasterized fragment. Visibilities with respect to reference views are properly modeled, and only photo-consistent fragments are kept and colored in the target view. We present experiments with real images and animation sequences. Thanks to the more accurate shape of the photo hull representation, our method generates more realistic rendering results than methods based on visual hulls. Currently, we achieve rendering frame rates of 2,3 fps. Compared to a pure software implementation, the performance of our hardware-accelerated method is approximately 7 times faster. Categories and Subject Descriptors (according to ACM CCS): CR Categories: I.3.3 [Computer Graphics]: Picture/Image Generation; I.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism. [source] Out-of-core compression and decompression of large n -dimensional scalar fieldsCOMPUTER GRAPHICS FORUM, Issue 3 2003Lawrence Ibarria We present a simple method for compressing very large and regularly sampled scalar fields. Our method is particularlyattractive when the entire data set does not fit in memory and when the sampling rate is high relative to thefeature size of the scalar field in all dimensions. Although we report results foranddata sets, the proposedapproach may be applied to higher dimensions. The method is based on the new Lorenzo predictor, introducedhere, which estimates the value of the scalar field at each sample from the values at processed neighbors. The predictedvalues are exact when the n-dimensional scalar field is an implicit polynomial of degreen, 1. Surprisingly,when the residuals (differences between the actual and predicted values) are encoded using arithmetic coding,the proposed method often outperforms wavelet compression in anL,sense. The proposed approach may beused both for lossy and lossless compression and is well suited for out-of-core compression and decompression,because a trivial implementation, which sweeps through the data set reading it once, requires maintaining only asmall buffer in core memory, whose size barely exceeds a single (n,1)- dimensional slice of the data. Categories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: Compression, scalar fields,out-of-core. [source] Hierarchical Context-based Pixel OrderingCOMPUTER GRAPHICS FORUM, Issue 3 2003Ziv Bar-Joseph Abstract We present a context-based scanning algorithm which reorders the input image using a hierarchical representationof the image. Our algorithm optimally orders (permutes) the leaves corresponding to the pixels, by minimizing thesum of distances between neighboring pixels. The reordering results in an improved autocorrelation betweennearby pixels which leads to a smoother image. This allows us, for the first time, to improve image compressionrates using context-based scans. The results presented in this paper greatly improve upon previous work in bothcompression rate and running time. Categories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: Computational Geometryand Object Modeling I.3.6 [Computer Graphics]: Methodology and Techniques [source] Adaptive Logarithmic Mapping For Displaying High Contrast ScenesCOMPUTER GRAPHICS FORUM, Issue 3 2003F. Drago We propose a fast, high quality tone mapping technique to display high contrast images on devices with limited dynamicrange of luminance values. The method is based on logarithmic compression of luminance values, imitatingthe human response to light. A bias power function is introduced to adaptively vary logarithmic bases, resultingin good preservation of details and contrast. To improve contrast in dark areas, changes to the gamma correctionprocedure are proposed. Our adaptive logarithmic mapping technique is capable of producing perceptually tunedimages with high dynamic content and works at interactive speed. We demonstrate a successful application of ourtone mapping technique with a high dynamic range video player enabling to adjust optimal viewing conditions forany kind of display while taking into account user preference concerning brightness, contrast compression, anddetail reproduction. Categories and Subject Descriptors (according to ACM CCS): I.3.3 [Image Processing and Computer Vision]: Image Representation [source] Hierarchical Higher Order Face Cluster Radiosity for Global Illumination Walkthroughs of Complex Non-Diffuse EnvironmentsCOMPUTER GRAPHICS FORUM, Issue 3 2003Enrico Gobbetti We present an algorithm for simulating global illumination in scenes composed of highly tessellated objects withdiffuse or moderately glossy reflectance. The solution method is a higher order extension of the face cluster radiositytechnique. It combines face clustering, multiresolution visibility, vector radiosity, and higher order baseswith a modified progressive shooting iteration to rapidly produce visually continuous solutions with limited memoryrequirements. The output of the method is a vector irradiance map that partitions input models into areaswhere global illumination is well approximated using the selected basis. The programming capabilities of moderncommodity graphics architectures are exploited to render illuminated models directly from the vector irradiancemap, exploiting hardware acceleration for approximating view dependent illumination during interactive walkthroughs.Using this algorithm, visually compelling global illumination solutions for scenes of over one millioninput polygons can be computed in minutes and examined interactively on common graphics personal computers. Categories and Subject Descriptors (according to ACM CCS): I.3.3 [Computer Graphics]: Picture and Image Generation; I.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism. [source] Visyllable Based Speech AnimationCOMPUTER GRAPHICS FORUM, Issue 3 2003Sumedha Kshirsagar Visemes are visual counterpart of phonemes. Traditionally, the speech animation of 3D synthetic faces involvesextraction of visemes from input speech followed by the application of co-articulation rules to generate realisticanimation. In this paper, we take a novel approach for speech animation , using visyllables, the visual counterpartof syllables. The approach results into a concatenative visyllable based speech animation system. The key contributionof this paper lies in two main areas. Firstly, we define a set of visyllable units for spoken English along withthe associated phonological rules for valid syllables. Based on these rules, we have implemented a syllabificationalgorithm that allows segmentation of a given phoneme stream into syllables and subsequently visyllables. Secondly,we have recorded the database of visyllables using a facial motion capture system. The recorded visyllableunits are post-processed semi-automatically to ensure continuity at the vowel boundaries of the visyllables. We defineeach visyllable in terms of the Facial Movement Parameters (FMP). The FMPs are obtained as a result of thestatistical analysis of the facial motion capture data. The FMPs allow a compact representation of the visyllables.Further, the FMPs also facilitate the formulation of rules for boundary matching and smoothing after concatenatingthe visyllables units. Ours is the first visyllable based speech animation system. The proposed technique iseasy to implement, effective for real-time as well as non real-time applications and results into realistic speechanimation. Categories and Subject Descriptors (according to ACM CCS): 1.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism [source] Reanimating Faces in Images and VideoCOMPUTER GRAPHICS FORUM, Issue 3 2003V. Blanz This paper presents a method for photo-realistic animation that can be applied to any face shown in a single imageor a video. The technique does not require example data of the person's mouth movements, and the image to beanimated is not restricted in pose or illumination. Video reanimation allows for head rotations and speech in theoriginal sequence, but neither of these motions is required. In order to animate novel faces, the system transfers mouth movements and expressions across individuals, basedon a common representation of different faces and facial expressions in a vector space of 3D shapes and textures. This space is computed from 3D scans of neutral faces, and scans of facial expressions. The 3D model's versatility with respect to pose and illumination is conveyed to photo-realistic image and videoprocessing by a framework of analysis and synthesis algorithms: The system automatically estimates 3D shape andall relevant rendering parameters, such as pose, from single images. In video, head pose and mouth movements aretracked automatically. Reanimated with new mouth movements, the 3D face is rendered into the original images. Categories and Subject Descriptors (according to ACM CCS): I.3.7 [Computer Graphics]: Animation [source] Deferred, Self-Organizing BSP TreesCOMPUTER GRAPHICS FORUM, Issue 3 2002Sigal Ar Abstract bsptrees and KD trees are fundamental data structures for collision detection in walkthrough environments. A basic issue in the construction of these hierarchical data structures is the choice of cutting planes. Rather than base these choices solely on the properties of the scene, we propose using information about how the tree is used in order to determine its structure. We demonstrate how this leads to the creation ofbsptrees that are small, do not require much preprocessing time, and respond very efficiently to sequences of collision queries. Categories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling I.3.6 [Computer Graphics]: Graphics data structures and data types, Interaction techniques I.3.7 [Computer Graphics]: Virtual reality [source] Local Physical Models for Interactive Character AnimationCOMPUTER GRAPHICS FORUM, Issue 3 2002Sageev Oore Our goal is to design and build a tool for the creation of expressive character animation. Virtual puppetry, also known as performance animation, is a technique in which the user interactively controls a character's motion. In this paper we introduce local physical models for performance animation and describe how they can augment an existing kinematic method to achieve very effective animation control. These models approximate specific physically-generated aspects of a character's motion. They automate certain behaviours, while still letting the user override such motion via a PD-controller if he so desires. Furthermore, they can be tuned to ignore certain undesirable effects, such as the risk of having a character fall over, by ignoring corresponding components of the force. Although local physical models are a quite simple approximation to real physical behaviour, we show that they are extremely useful for interactive character control, and contribute positively to the expressiveness of the character's motion. In this paper, we develop such models at the knees and ankles of an interactively-animated 3D anthropomorphic character, and demonstrate a resulting animation. This approach can be applied in a straight-forward way to other joints. Categories and Subject Descriptors (according to ACM CCS): I.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism, Interaction Techniques [source] Projective Texture Mapping with Full PanoramaCOMPUTER GRAPHICS FORUM, Issue 3 2002Dongho Kim Projective texture mapping is used to project a texture map onto scene geometry. It has been used in many applications, since it eliminates the assignment of fixed texture coordinates and provides a good method of representing synthetic images or photographs in image-based rendering. But conventional projective texture mapping has limitations in the field of view and the degree of navigation because only simple rectangular texture maps can be used. In this work, we propose the concept of panoramic projective texture mapping (PPTM). It projects cubic or cylindrical panorama onto the scene geometry. With this scheme, any polygonal geometry can receive the projection of a panoramic texture map, without using fixed texture coordinates or modeling many projective texture mapping. For fast real-time rendering, a hardware-based rendering method is also presented. Applications of PPTM include panorama viewer similar to QuicktimeVR and navigation in the panoramic scene, which can be created by image-based modeling techniques. Categories and Subject Descriptors (according to ACM CCS): I.3.3 [Computer Graphics]: Viewing Algorithms; I.3.7 [Computer Graphics]: Color, Shading, Shadowing, and Texture [source] Dynamic Textures for Image-based Rendering of Fine-Scale 3D Structure and Animation of Non-rigid MotionCOMPUTER GRAPHICS FORUM, Issue 3 2002Dana Cobza The problem of capturing real world scenes and then accurately rendering them is particularly difficult for fine-scale 3D structure. Similarly, it is difficult to capture, model and animate non-rigid motion. We present a method where small image changes are captured as a time varying (dynamic) texture. In particular, a coarse geometry is obtained from a sample set of images using structure from motion. This geometry is then used to subdivide the scene and to extract approximately stabilized texture patches. The residual statistical variability in the texture patches is captured using a PCA basis of spatial filters. The filters coefficients are parameterized in camera pose and object motion. To render new poses and motions, new texture patches are synthesized by modulating the texture basis. The texture is then warped back onto the coarse geometry. We demonstrate how the texture modulation and projective homography-based warps can be achieved in real-time using hardware accelerated OpenGL. Experiments comparing dynamic texture modulation to standard texturing are presented for objects with complex geometry (a flower) and non-rigid motion (human arm motion capturing the non-rigidities in the joints, and creasing of the shirt). Categories and Subject Descriptors (according to ACM CCS): I.3.3 [Computer Graphics]: Image Based Rendering [source] Hardware-Based Volumetric Knit-WearCOMPUTER GRAPHICS FORUM, Issue 3 2002Katja Daubert We present a hardware-based, volumetric approach for rendering knit wear at very interactive rates. A single stitch is represented by a volumetric texture with each voxel storing the main direction of the strands of yarn inside it. We render the knit wear in layers using an approximation of the Banks model. Our hardware implementation allows specular and diffuse material properties to change from one voxel to the next. This enables us to represent yarn made up of different components or render garments with complicated color patterns. Furthermore, our approach can handle self-shadowing of the stitches, and can easily be adapted to also include view-independent scattering. The resulting shader lends itself naturally to mip-mapping, and requires no reordering of the base geometry, making it versatile and easy to use. Categories and Subject Descriptors (according to ACM CCS): I.3.3 [Computer Graphics]: Hardware Applications Volumetric Textures [source] Free-form sketching with variational implicit surfacesCOMPUTER GRAPHICS FORUM, Issue 3 2002Olga Karpenko With the advent of sketch-based methods for shape construction, there's a new degree of power available in the rapid creation of approximate shapes. Sketch [Zeleznik, 1996] showed how a gesture-based modeler could be used to simplify conventional CSG-like shape creation. Teddy [Igarashi, 1999] extended this to more free-form models, getting much of its power from its "inflation" operation (which converted a simple closed curve in the plane into a 3D shape whose silhouette, from the current point of view, was that curve on the view plane) and from an elegant collection of gestures for attaching additional parts to a shape, cutting a shape, and deforming it. But despite the powerful collection of tools in Teddy, the underlying polygonal representation of shapes intrudes on the results in many places. In this paper, we discuss our preliminary efforts at using variational implicit surfaces [Turk, 2000] as a representation in a free-form modeler. We also discuss the implementation of several operations within this context, and a collection of user-interaction elements that work well together to make modeling interesting hierarchies simple. These include "stroke inflation" via implicit functions, blob-merging, automatic hierarchy construction, and local surface modification via silhouette oversketching. We demonstrate our results by creating several models. Categories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: Modeling packages I.3.6 [Computer Graphics]: Interaction techniques [source] Early response and 8-week treatment outcome in GAD ,DEPRESSION AND ANXIETY, Issue 8 2006Moira Rynn M.D. Abstract Our objective was to compare the predictive value of early response to treatment outcome in patients with generalized anxiety disorder (GAD) treated with benzodiazepines, serotonin receptor (5HT-1A) partial agonists, or placebo. Data from two double-blind GAD studies were combined. Subjects were evaluated with the Hamilton Anxiety Scale (HAM-A) and the Clinical Global Impression of Improvement (CGI-I) scale over 8 weeks. Categories of response at weeks 1 and 2 were defined by the HAM-A total score. Analyses of covariance and Kaplan,Meier survival analyses were the primary analyses used to assess 8-week end point treatment outcomes as a function of early improvement. HAM-A change from baseline to weeks 1 and 2 significantly predicted last observation carried forward (LOCF) response at week 8 for both medications and for placebo (P<.001). Early improvement was a strong predictor for treatment outcome irrespective of whether active medication or placebo was the treatment agent. Depression and Anxiety 23:461,465, 2006. Published 2006 Wiley-Liss, Inc. [source] What are the Categories in Sein und Zeit?EUROPEAN JOURNAL OF PHILOSOPHY, Issue 2 2007Brandom on Heidegger on Zuhandenheit In his essay, ,Heidegger's Categories in Sein und Zeit', Robert Brandom argues that Heidegger, particularly in the notion of Zuhandenheit, anticipates his own normatively pragmatist conception of intentionality. He attempts to demonstrate this by marshalling short passages from right across the relevant sections of Sein und Zeit in such a way that they do seem to say what Brandom claims. But does one reach the same conclusion when one examines, more or less in sentence-by-sentence fashion, the large slab of text in which Heidegger introduces the notion of Zuhandenheit? I believe not. First, however, let us look at how Brandom reads Heidegger, in particular, how he interprets the notion of Zuhandenheit, which, in contrast both to Macquarrie and Robinson and to Brandom, I shall translate as ready-to-handedness.1 [source] Out-of-hospital Cardiac Arrest in Denver, Colorado: Epidemiology and OutcomesACADEMIC EMERGENCY MEDICINE, Issue 4 2010Jason S. Haukoos MD Abstract Objectives:, The annual incidence of out-of-hospital cardiac arrest (OOHCA) in the United States is approximately 6 per 10,000 population and survival remains low. Relatively little is known about the performance characteristics of a two-tiered emergency medical services (EMS) system split between fire-based basic life support (BLS) dispersed from fixed locations and hospital-based advanced life support (ALS) dispersed from nonfixed locations. The objectives of this study were to describe the incidence of OOHCA in Denver, Colorado, and to define the prevalence of survival with good neurologic function in the context of this particular EMS system. Methods:, This was a retrospective cohort study using standardized abstraction methodology. A two-tiered hospital-based EMS system for the County of Denver and 10 receiving hospitals were studied. Consecutive adult patients who experienced nontraumatic OOHCA from January 1, 2003, through December 31, 2004, were enrolled. Demographic, prehospital arrest characteristics, treatment data, and survival data using the Utstein template were collected. Good neurologic survival was defined by a Cerebral Performance Categories (CPC) score of 1 or 2. Results:, During the study period, 1,985 arrests occurred. Of these, 715 (36%) had attempted resuscitation by paramedics and constitute our study sample. The median age was 65 years (interquartile range = 52,78 years), 69% were male, 41% had witnessed arrest, 25% had bystander cardiopulmonary resuscitation (CPR) performed, and 30% had ventricular fibrillation (VF) or pulseless ventricular tachycardia (VT) as their initial rhythm. Of the 715 patients, 545 (76%) were transported to a hospital, 223 (31%) had return of spontaneous circulation (ROSC), 175 (25%) survived to hospital admission, 58 (8%) survived to hospital discharge, and 42 (6%, 95% confidence interval [CI] = 4% to 8%) had a good neurologic outcome. Conclusions:, Out-of-hospital cardiac arrest survival in Denver, Colorado, is similar to that of other United States communities. This finding provides the basis for future epidemiologic and health services research in the out-of-hospital and ED settings in our community. ACADEMIC EMERGENCY MEDICINE,2010; 17:391,398 © 2010 by the Society for Academic Emergency Medicine [source] Methodologic Implications of Allocating Multiple-Race Data to Single-Race CategoriesHEALTH SERVICES RESEARCH, Issue 1 2002Article first published online: 18 MAR 200 Objective. To illustrate methods for comparing race data collected under the 1977 Federal Office of Management and Budget (OMB) directive, known as OMB-15, with race data collected under the revised 1997 OMB standard. Data Sources/Study Setting.,Secondary data from the 1993,95 National Health Interview Surveys. Multiple-race responses, available on in-house files, were analyzed. Study Design.,Race-specific estimates of employer-sponsored health insurance were calculated using proposed allocation methods from the OMB. Estimates were calculated overall and for three population subgroups: children, those in households below poverty, and Hispanics. Principal Findings.,Although race distributions varied between the different methods, estimates of employer-sponsored health insurance were similar. Health insurance estimates for the American Indian/Alaska Native group varied the most. Conclusions.,Employer-sponsored health insurance estimates for American Indian/Alaska Natives from data collected under the 1977 OMB directive will not be comparable with estimates from data collected under the 1997 standard. The selection of a method to distribute to the race categories used prior to the 1997 revision will likely have little impact on estimates of employer-sponsored health insurance for other groups. Additional research is needed to determine the effects of these methods for other health service measures. [source] The Relationship between Categories of Non-Audit Services and Audit Fees: Evidence from UK CompaniesINTERNATIONAL JOURNAL OF AUDITING, Issue 1 2002M. Ezzamel Using survey data we examine the relationship between various categories of non-audit services and audit fees. Compared to previous research, we use a more refined classification of non-audit services both for incumbent and non-incumbent auditors, and control for the existence of an internal audit function and basis of disclosure. Our results suggest that the relationship between levels of audit fees and non-audit services varies by category of non-audit service. These results support explanations of the positive association between fees paid for non-audit services and audit fees in terms either of client specific differences, e.g. organisational complexity, or of events giving rise to the purchase of more audit and non-audit services rather than in terms of direct economic linkages between the cost functions for audit and non-audit services. We speculate that the presence of another auditing firm at the client in a consulting capacity may exert competitive pressure on the fee for external audit. [source] Chiral Amine Synthesis , Recent Developments and Trends for Enamide Reduction, Reductive Amination, and Imine ReductionADVANCED SYNTHESIS & CATALYSIS (PREVIOUSLY: JOURNAL FUER PRAKTISCHE CHEMIE), Issue 5 2010Thomas Abstract The review examines the chiral amine literature from 2000,2009 (May) concerning enantioselective and diastereoselective methods for N -acylenamide and enamine reduction, reductive amination, and imine reduction. The reaction steps for each strategy, from ketone to primary chiral amine, are clearly defined, with best methods and yields for starting material preparation and final deprotection noted. Categories of chiral amines have been defined in Section 1 to allow the reader to quickly understand whether their specific target amine falls within a difficult to synthesize, or not, structural class. Amino acids are not considered in this work. [source] Predictors of disability among Filipinos with knee osteoarthritisINTERNATIONAL JOURNAL OF RHEUMATIC DISEASES, Issue 3 2008Ester G. Penserga Abstract Aims: This study aims to describe the level of disability of Filipino patients with knee osteoarthritis (OA) in relation to common risk factors. Methodology: This is a cross-sectional analytic study. Patients with knee osteoarthritis diagnosed using the American College of Rheumatology criteria for the classification of knee OA, seen at East Avenue Medical Center, using the Quezon City, Philippines, were entered by convenient sampling. The Western Ontario and McMaster Universities (WOMAC (va) 3.1 Tagalog Version) osteoarthritis index was used. Self-reported disability was measured by the function subscale of the WOMAC OA index and used as the dependent variable. Independent variables assessed as possible risk factors affecting disability were age, sex, weight, height, body mass index (BMI), education (in years), number of comorbidities present, smoking status (pack years), duration of knee OA, pain and stiffness. Categories of disability were identified as high, moderate and low. Analyses of the data were performed using Statistical Package for the Social Sciences (SPSS) version 13. Results: Eighty-five subjects were included in the study. The mean disability score was 674.1 ± 318.81 (moderate disability). Chi-square tests showed that the categories or levels of disability are not significantly dependent on the categorical variables. Significant direct correlations were seen between mean disability and weight (r = 0.260, P = 0.016), pain (r = 0.574, P = 0.000), and stiffness (r = 0.616, P = 0.000). Conclusion: This is the first study analysing the relationship between disability and specific risk factors among Filipino patients with knee OA. Self-reported disability of knee OA in the population studied was strongly related to pain scores, weight and joint stiffness scores. [source] | ||||||||||||||||||||||||||||||||||||||||||||||||||||