Calf massager: Intervention for body muscle discomfort during prolonged standing

Many occupations require workers to stand for long periods of time without proper interventions, which causes discomfort in the back and lower limbs. Therefore, this study aims to assess the effectiveness in alleviating body muscle discomfort during prolonged standing through the use of a calf massager. This study was conducted among male workers at a manufacturer with production line workers and the list was obtained from the HR Department and simple random sampling was done by number categorization. A total of 100 respondents (50 respondents for both the control and the experimental groups) participated in this study. The experiment took place in a room with a similar setup for the production line. Each respondent was requested to perform the simulated task for 2 hr. For the experimental group, the calf massager was turned on every 15 min. At every 15‐min interval after turning on the calf massager, respondents from both groups were required to evaluate their discomfort level on a Borg's scale CR‐10 questionnaire. The results showed that the level of body discomfort among respondents in the experimental group reduced (20–30%) compared with that of the control group. Multivariate analysis results revealed that the discomfort rating for the lower back, knees, thighs, calves, and feet was significantly lower (p < .05) among the experimental group compared with the control group. For lower body parts, the lower back region was statistically significant (p < .05) at the 90th, 105th, and 120th min; the thigh region was statistically significant (p < .05) at the 120th min; the knee region was statistically significant (p < .05) at the 105th and 120th min; the calf region was statistically significant (p < .05) at all minute intervals except the 15th and 45th min, while the feet region, was statistically significant at the 105th and 120th min. Therefore, this study indicates that calf massage treatment is capable of reducing body muscle discomfort during prolonged standing and highlights the significance of calf massage.     

Characteristics of Milk Powders Produced by Spray Freeze Drying

Skim and whole milk powders were manufactured at lab scale by spray freeze drying (SFD), using liquid nitrogen as the cryogen. The polydispersity of droplet/particle sizes was limited using an encapsulator nozzle to atomize the feed. Particle morphology was examined using a scanning electron microscope. Samples were compared with equivalent spray-dried powders in tests of wettability and dissolution in water. The spray freeze-dried powders were found to be highly porous, with a uniform structure of pores throughout the entire particles. When tested in water, SFD skim milk powders wetted roughly three times as fast as industrially spray-dried agglomerated skim milk powders and were observed to dissolve rapidly by breaking down into smaller particles.     

Developing competency-based methods for near-real-time air combat problem solving assessment

Air combat scenarios present unique problems where the solution is not obvious. An advanced networked simulation environment can be used to train high-level cognitive air combat skills such as problem solving. A problem in the development of principled and construct oriented assessment is related to determining the level of specificity of the assessment. We present a detailed discussion of the definition of critical competencies associated with combat mission problem solving performance, and we describe our approach to develop and implement an embedded performance assessment system that maps outcomes to these competencies. Finally, we discuss the implications for our approach for comprehensive assessment and discuss our goals for an evaluation of the competency-based approach to assessment.     

圆环扫描速高比计研究

介绍了圆环扫描速高比计(V/H计)的工作原理。给出了理论分析和实验结果。讨论了影响精度的原因和今后改进的方法。     

Pseudorandomness of Basic Structures in the Block Cipher KASUMI

The notion of pseudorandomness is the theoretical foundation on which to consider the soundness of a basic structure used in some block ciphers. We examine the pseudorandomness of the block cipher KASUMI, which will be used in the next‐generation cellular phones. First, we prove that the four‐round unbalanced MISTY‐type transformation is pseudorandom in order to illustrate the pseudorandomness of the inside round function FI of KASUMI under an adaptive distinguisher model. Second, we show that the three‐round KASUMI‐like structure is not pseudorandom but the four‐round KASUMI‐like structure is pseudorandom under a non‐adaptive distinguisher model.     

"Learning myopia: An adaptive recency effect in category learning": Correction to Jones and Sieck (2003).

Reports an error in "Learning myopia: An adaptive recency effect in category learning" by Matt Jones and Winston R. Sieck (Journal of Experimental Psychology: Learning, Memory, and Cognition, 2003[Jul], Vol 29[4], 626-640). On page 633, Table 2, the values in columns (T, P) and (P, T) in the dual condition row incorrectly read .10 and .90, respectively. The correct values are .90 and .10, respectively. (The following abstract of the original article appeared in record 2003-06626-013.) Recency effects (REs) have been well established in memory and probability learning paradigms but have received little attention in category learning research. Extant categorization models predict REs to be unaffected by learning, whereas a functional interpretation of REs, suggested by results in other domains, predicts that people are able to learn sequential dependencies and incorporate this information into their responses. These contrasting predictions were tested in 2 experiments involving a classification task in which outcome sequences were autocorrelated. Experiment 1 showed that reliance on recent outcomes adapts to the structure of the task, in contrast to models' predictions. Experiment 2 provided constraints on how sequential information is learned and suggested possible extensions to current models to account for this learning. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

The PBD-Closure of Constant-Composition Codes

We show an interesting pairwise balanced design (PBD)-closure result for the set of lengths of constant-composition codes whose distance and size meet certain conditions. A consequence of this PBD-closure result is that the size of optimal constant-composition codes can be determined for infinite families of parameter sets from just a single example of an optimal code. As an application, the sizes of several infinite families of optimal constant-composition codes are derived. In particular, the problem of determining the size of optimal constant-composition codes having distance four and weight three is solved for all lengths sufficiently large. This problem was previously unresolved for odd lengths, except for lengths seven and eleven.     

An altruistic differentiated service protocol in dynamic cognitive radio networks against selfish behaviors

Cognitive Radio (CR), first proposed by Mitola, has the potential to improve spectrum utilization by allowing secondary transmission in licensed primary networks, as long as the secondary transmissions do not interfere with the operation of the primary users (PUs) in the primary network. Although it is fundamental to the viability of this burgeoning technology, security aspects of CR have so far received scant attention from researchers. Initial research on CR has largely focused on the issues of resource allocation, spectrum sensing and management while security considerations are often added as an afterthought. As a result, many proposed solutions for CR, have introduced significant security gaps, intensifying the effects of selfishness, inequity, unavailability, or even malicious behaviors. This has posed challenges to quality-of-service (QoS) provisioning in Cognitive Radio Network (CRN) in the face of various network attacks like node masquerading, packet mislabeling and deliberate packet dropping. Since existing routing protocols assume that nodes will forward packets in good faith, the presence of selfish nodes coupled with the dynamic behavior of PUs can lead to excessive packet losses, high delays or even the complete failure of routing protocols in secondary networks. In this paper, we propose a cross-layer Altruistic Differentiated Service Protocol (ADSP) for the dynamic CRNs to address the QoS provisioning issue in CRNs with selfish nodes coexistence. Simulation results demonstrate that the ADSP can achieve much better performance in terms of lower delay, higher throughput and better delivery ratio for the traffic originating from collaborative nodes compared to other cognitive routing protocols in the presence of selfish nodes.     

Parallel triangulation of a polygon in two calls to the trapezoidal map

We give a parallel method for triangulating a simple polygon by two (parallel) calls to the trapezoidal map computation. The method is simpler and more elegant than previous methods. Along the way we obtain an interesting partition of one-sided monotone polygons. Using the best-known trapezoidal map algorithm, ours run in timeO(logn) usingO(n) CREW PRAM processors.