bluuebunny/crossref_metadata_2025_split huggingface dataset:
Evaluation of Manometric Measures During Tongue-Hold Swallows
Authors: Doeltgen Sebastian H. , Witte Ulrike , Gumbley Freya , Huckabee Maggie-Lee 
Published: January 2009

Purpose
Based on visual inspection, prior research documented increased movement of the posterior pharyngeal wall in healthy volunteers during tongue-hold swallows. This manometric study investigated the immediate effects of the tongue-hold maneuver on pharyngeal peak pressure generation, duration of pressure generation, and pressure slope measurements in healthy volunteers.

Method
Pharyngeal pressures from 40 young, healthy individuals (mean age = 25.8 years, gender equally distributed) were recorded at 3 locations: oropharynx, hypopharynx, and upper esophageal sphincter (UES), during normal control and tongue-hold swallows. Measures of peak amplitude, duration, and slope of pressure generation were subjected to statistical analysis.

Results
Tongue-hold swallows produced lower pharyngeal peak pressure and shorter pharyngeal pressure durations compared to control swallows. Further, tongue-hold swallows produced lower UES relaxation pressures. Between sensors, peak pressure was lower and pressure slopes were steeper in the hypopharynx compared to the oropharynx. Several gender-specific differences were found for pharyngeal peak pressure, pressure duration, and pressure slopes.

Conclusions
Reduced amplitude and duration of pharyngeal peak pressure is likely a result of decreased base of tongue retraction during tongue-hold swallows. Central clinical considerations and future research directions are discussed in this article.
The Effect of Aided Language Stimulation on Vocabulary Acquisition in Children With Little or No Functional Speech
Authors: Dada Shakila , Alant Erna 
Published: January 2009

PurposeTo describe the nature and frequency of the aided language stimulation program and determine the effects of a 3-week-long aided language stimulation program on the vocabulary acquisition skills of children with little or no functional speech (LNFS).MethodFour children participated in this single-subject, multiple-probe study across activities. The aided language stimulation program comprised 3 activities: arts and crafts, food preparation, and story time activity. Each activity was repeated over the duration of 5 subsequent sessions. Eight target vocabulary items were taught within each activity. The acquisition of all 24 target items was probed throughout the duration of the 3-week intervention period.ResultsThe frequency and nature of the aided language stimulation provided met the criterion of being used 70% of the time and providing aided language stimulation with an 80:20 ratio of statements to questions. The results indicated that all 4 participants acquired the target vocabulary items. There were, however, variations in the rate of acquisition.ConclusionsThis study explores the impact of aided language stimulation on vocabulary acquisition in children. The most important clinical implication of this study is that a 3-week intervention program in aided language stimulation was sufficient to facilitate the comprehension of at least 24 vocabulary items in 4 children with LNFS.
Defining and Measuring Dysphagia Following Stroke
Authors: Daniels Stephanie K. , Schroeder Mae Fern , DeGeorge Pamela C. , Corey David M. , Foundas Anne L. , Rosenbek John C. 
Published: January 2009

Purpose
To continue the development of a quantified, standard method to differentiate individuals with stroke and dysphagia from individuals without dysphagia.

Method

Videofluoroscopic swallowing studies (VFSS) were completed on a group of participants with acute stroke (
n
= 42) and healthy age-matched individuals (
n
= 25). Calibrated liquid volumes of 3, 5, 10, and 20 ml were administered during the VFSS. Six measures in 3 domains of bolus flow (timing, direction, and clearance) were measured. Values of these measures obtained from the control group were used to classify dysphagia within the participants.

Results
The use of a single measure or single liquid volumes to classify dysphagia did not distinguish between healthy adults and individuals following stroke with and without dysphagia. Abnormality on more than 1 measure across multiple volumes appears to be a more robust method in defining dysphagia for liquids.

Conclusions
Our findings indicate that the definition of dysphagia is critical in determining whether persons are classified with disordered swallowing. The definition is dependent on materials and measures evaluated. Each measure provides independent aspects to the evaluation. Determining the level of importance of each depends on the purpose of the evaluation.
Broadening the “Ports of Entry” for Speech-Language Pathologists: A Relational and Reflective Model for Clinical Supervision
Authors: Geller Elaine , Foley Gilbert M. 
Published: January 2009

Purpose
To offer a framework for clinical supervision in speech-language pathology that embeds a mental health perspective within the study of communication sciences and disorders.

Method
Key mental health constructs are examined as to how they are applied in traditional versus relational and reflective supervision models. Comparisons between traditional and relational and reflective approaches are outlined, with reference to each mental health construct and the developmental level of the supervisee. Three stages of supervisee development are proposed based on research from various disciplines, including nursing, psychology, speech-language pathology, social work, and education. Each developmental stage is characterized by shifts or changes in the supervisee’s underlying assumptions, beliefs, and patterns of behavior.

Conclusion
This article makes the case that both the cognitive and affective dimensions of the supervisor–supervisee relationship need to be addressed without minimizing the necessary development of discipline-specific expertise. The developmental stages outlined in this paradigm can be used to understand supervisees' patterns of change and growth over time, as well as to create optimal learning environments that match their developmental level and knowledge base.
Comprehension of Expository Text: Insights Gained From Think-Aloud Data
Authors: Laing Gillam Sandra , Fargo Jamison D. , St. Clair Robertson Kelli 
Published: January 2009

PurposeTo examine the kinds of explicit and implicit statements generated by school-age children with and without language impairments during comprehension of expository texts and to determine the relationship of these statements to comprehension performance.MethodForty 4th-grade children with and without language impairments participated in individual think-aloud sessions (verbalizing thoughts aloud). During the sessions, children were asked to listen to expository passages 1 sentence at a time, make comments after each sentence, and then answer questions and recall the passages. The comments or verbal protocols that children generated during the think-aloud sessions were transcribed and analyzed. The relationship of verbal protocols to comprehension performance was evaluated.ResultsFindings suggested that the ability to paraphrase passages was closely related to measures of expository text comprehension.ConclusionsThe use of data obtained during think-aloud sessions may be useful to supplement information gained from traditional measures of comprehension for children with and without language impairments.
UltraScience Net: High-Performance Network Research Test-Bed
Authors: Rao Nageswara S. V. , Wing William R. , Hicks Susan E. , Poole Stephen W. , Denap Frank A. , Carter Steven M. , Wu Qishi 
Published: January 2009

The high-performance networking requirements for next generation large-scale applications belong to two broad classes: a) high bandwidths, typically multiples of 10Gbps, to support bulk data transfers, and b) stable bandwidths, typically at much lower bandwidths, to support computational steering, remote visualization, and remote control of instrumentation. Current Internet technologies, however, are severely limited in meeting these demands because such bulk bandwidths are available only in the backbone, and stable control channels are hard to realize over shared connections. The UltraScience Net (USN) facilitates the development of such technologies by providing dynamic, cross-country dedicated 10Gbps channels for large data transfers, and 150 Mbps channels for interactive and control operations. Contributions of the USN project are two-fold: Infrastructure Technologies for Network Experimental Facility: USN developed and/or demonstrated a number of infrastructure technologies needed for a national-scale network experimental facility. Compared to Internet, USN's data-plane is different in that it can be partitioned into isolated layer-1 or layer-2 connections, and its control-plane is different in the ability of users and applications to setup and tear down channels as needed. Its design required several new components including a Virtual Private Network infrastructure, a bandwidth and channel scheduler, and a dynamic signaling daemon. The control-plane employs a centralized scheduler to compute the channel allocations and a signaling daemon to generate configuration signals to switches. In a nutshell, USN demonstrated the ability to build and operate a stable national-scale switched network. Structured Network Research Experiments: A number of network research experiments have been conducted on USN that cannot be easily supported over existing network facilities, including test-beds and production networks. It settled an open matter by demonstrating that the performance of switched connections and Multiple Protocol Label Switching tunnels over routed networks are comparable. Furthermore, such connections can be easily peered, and the performance of the resultant hybrid connections is still comparable to the constituent pure connections. USN experiments demonstrated that Infiniband transport can be effectively extended to wide-area connections of thousands of miles, which opens up new opportunities for efficient bulk data transport. USN provided dedicated connections to Cray X1 supercomputer and helped diagnose TCP performance problems which might have been otherwise incorrectly attributed to traffic on shared connections. USN contributed to the development of transport methods for dedicated connections to other traffic. Recently, experiments were conducted to assess the performance of application acceleration devices that employ flow optimization and data compression methods to improve TCP performance.
A Mobile-Based Face Verification System
Authors: Ou Zongying , Su Tieming , Ou Fan , Zhang Jianxin , Liu Dianting 
Published: January 2009

Intelligent mobile phones equipped with a camera are very popular in our daily lives now. Face verification running on mobile phone provides not only a tool for the protection of the owner's authority but also an approach for verification from a distance. The combination of biometrics and telecommunication technologies possesses broad application potentials in information exchanges. However, there are also some critical issues needing solving. Usually the processing power and memory size of a mobile phone system are limited, and the acquisition images are suffered from the illumination changes. An acquisition image I(x,y) can be modeled as a product of the reflectance R and Illuminant effect L shown as I(x,y) = R(x,y)∗L(x,y). The reflectance attribution R(x,y) is the inherent feature of a human face for verification. Compared with the reflectance changes rapidly across the contour of a face, usually the illumination changes smoothly and slowly. If two pixels are located nearby, the ratio of the reflectance between these two pixels can be calculated via the ratio of their illuminations, which is approximately independent from illumination changes. Based on this invariant property of the ratio of illumination at a pixel to its surrounding neighbor illuminations, an illumination normalization technique was developed and adapted to the mobile system. A dedicated scheme composed of special wavelets called Gab features was proposed for representation of human faces. Gabor features reveal more structure information of images; however, the data dimensionality is becoming very high. An optimization processing was designed for searching the optimal Gabor node configuration and reducing the number of Gabor nodes effectively. To fit the limitation of the phone processor, all the floating point calculations were implemented with integer calculations, the feature extraction and discriminating verification algorithms were carefully designed to accelerate implementation and control the heap and stack sizes. A mobile based face verification system was developed and embedded in the Lenovo ET980 mobile phone, which is equipped with CPU Intel XScale PX270, memory 128MB Flash/64 MB SDRAM, and a 4 million pixel camera. The experiments testing on FERET fafb dataset show that the system Equal False Accept Rate and False Reject Rate achieved 1.51%; and the False Accept Rates achieved 2.12% and 6.81%, while the False Reject Rate at 1% and 0.1% respectively. The processing time is about 1 second. The performance of this system is quite well.
An Efficient Framework for Configurable Video Encoder
Authors: Li Wei , Zhou Bing 
Published: January 2009

The implementation of real-time video coding systems with limited resources such as memory volume and CPU speed is a challenging task. In this paper, an efficient embedded multi-modal MPEG-4 video encoder (EMVC) is proposed and implemented to meet the requirement of encoding different modals (colors, resolutions, and bandwidths) video in size and power-restricted scenario. The hardware framework of EMVC is based on FPGA and DSP, which takes full advantage of the strongpoint of DSP and FPGA—powerful digital signal processing ability of DSP is utilized to complete most of the complex video coding, and flexible configuration, the parallelism and high speed of FPGA cooperates to accomplish logical control and auxiliary functions in video coding. The hardware framework is designed with strong processing ability, flexible configuration, and extensive coverage. In software design, we first improve some key algorithms in MPEG-4 standard that have great impact on coding efficiency, a fast motion estimation algorithm—smooth motion vector field adaptive search technique (SMVFAST) and a DSP-based efficient quantization computation method—EQ4DSP are put forward respectively; second, according to the characters of DSP's hardware resource, the encoder software is optimized at system and code levels. At the system level, EDMA (Enhanced Direct Memory Access) channels in DSP are used to parallel the data transfer, and the software structure of the video encoders is changed from frame-based to GMB-based (Group of Macro-Block) to make use of the parallel processing capacity of DSP. At code level, the codes of the frequently called modules in the encoder are the critical optimized part, and the main code optimization methods used in EMVC include: using an intrinsic function to replace the complicated C/C++ code, using packed data processing to maximize the data throughput, unrolling the loop to increase software pipelines, translating C code to Linear Assembly, and so on. By making use of the reserved user-data field in the MPEG-4 standard syntax, a multi-modal function of EMVC is realized, namely, the system can switch among 720 × 576 and 352 × 288 resolutions, grey and color video, 2 M and 256 K bandwidth. Moreover, the mode switch can be achieved in real time according to the input control command. Experimental results show that EMVC not only runs efficiently but also has good flexibility and generality. Furthermore, by realizing diverse video or image coding algorithms, it can also satisfy the requirements of various embedded video applications, especially those with strict restriction in size, power consumption, and control flexibility.
Trust Architecture in Dynamic Systems
Authors: Yajun Guo , Zhongqiang Yu , Hao Chen , Huihui Dong 
Published: January 2009

Trust is the key for an information system to make security decisions. There does not exist in an aforehand trust relationship among principals in dynamic systems. To secure transaction, trust relationship must be established in principals. However, the existing trust architectures are flat, so they cannot embody well the dynamic characteristic of trust and do not take on well operability. In this paper, a two-layer trust architecture for dynamic systems is presented. Trust in this model is composed of a basic trust layer and a dynamic trust layer. Basic trust depends on the attributes of a principal, recommendation, or experience, while dynamic trust relies on the application context. This trust structure can reduce the complexity of making a decision in dynamic system. In dynamic systems, there are many factors to form trust, such as principal experience, attribute, recommendation, and context. In these trust factors, the context trust factor is different from the others, which it changes when close with the current context. We classify these trust factors into two groups. The first group includes experience, attribute, and recommendation to form this basic trust, while the second group involves current context to form dynamic trust. The trust value in this two-layer trust architecture was expressed as T = (Ta, Tc). Where Ta is the combination trust value of the attribute trust, experience, and recommendation trust, and Tc is the context trust value. Obviously, the relationship among trust values is a partial ordering. Experience usually associates with events. Positive trust events can increase the experience value, and negative trust events will reduce the experience. Because the importance of events is different, each event is assigned a weight. The larger the weight is, the more important the event is. Experience evaluation strategy provides the evaluation method for the occurred event. The attribute trust is the evaluation of the credibility, reliability, and security ability of the trusted principal according to the attributes of the trusted principal. The context trust is the trust evaluation of principals in a special context. Trust strategy is different in the different application context. For example, the trust strategy of a printer may be “medium” when the printer is free and the principal is in the offices, and may be “low” when the principal is not in the office, or when the printer is busy. The context trust value is the function of the context information: Tc = h(C), C is the context information.
A Novel Identity-Based Multi-Signcryption Scheme
Authors: Zhang Jianhong , Yang Yixian , Niu Xinxin 
Published: January 2009

Message security and the sender's identity authentication for communication in the open channel is a basic and important technology of the internet. For keeping the message confidential and unforgeable, the sender can use a digital signature algorithm with his private key to sign the message, and then encrypts the signature on the message. Signcryption which was proposed by Zheng et. al in 1997 is a novel cryptographic primitive that simultaneously provides the authentication and encryption in a single logic step and at lower computational costs and communication overheads than the above sign-then-encrypt way. Since then, there are many signcryption schemes proposed. Only recently, a formal security proof model is formalized providing security proof for Zheng's signcryption in the random oracle model. In the ID-based cryptography, the complexity of the managing certificate is reduced. In this work, by combining a multisignature with an ID-based signcryption scheme, we build a security model of multi-signcryption to define confidentiality and unforgeability of the ID-based signcryption scheme and have proposed an ID-based multi-signcryption scheme based on the bilinear pairings to adapt to a multi-user setting. Given a message m, a receiver's identity IDB, and n sender's identities IDA1, IDA2, …, IDAn, for each sender Ai, it executes the followings steps: randomly pick xi ε Zq to compute Ri = xiP and ω = xiQIDB; send (Ri, ωi) to the other senders by a secure channel; (3)after receiving the other senders (Ri, ωi), Ai computes ω = e(Ppub, Σωj) to set c = H2(ω)⊕m and R = ΣRj; compute Si = xiH4(m) + H3(R,ω)SIDAi, where SIDAi is the private key of sender Ai. Then the resulting ciphertext is (c,S,R). To unsigcrypt the ciphertext (c,S,R) in the sender list L = (IDA1, IDA2, …, IDAn), the receiver with identity IDB can compute the following steps to recover and verify the message validity. compute ω = e(R,SIDB) and m = H2(ω)⊕c, where SIDB is private key of the receiver; accept the message if and only if the following equation holds [Formula: see text] By security analysis, we show that our scheme satisfies the two important properties of signcryption: confidentiality and unforgeability, and is proven to have been secure in the random oracle model. The security of the scheme is closely related to the Decisional Bilinear Diffie-Hellman assumption and the computational Diffie-Hellman assumption. Finally, by analyzing the efficiency of the scheme, we show that our scheme is very efficient, and only one pairing computation is needed in the signcryption phase, three pairing operators are needed in the unsigncrytion phase, and the ciphertext size is about 420 bits.