• Title/Summary/Keyword: local average

Search Result 1,902, Processing Time 0.024 seconds

Relationship between Strengths of the Lower Extremity's Joints and Their Local Dynamic Stability during Walking in Elderly Women (보행 시 여성 노인의 하지 관절 근력과 국부 동적 안정성과의 관계)

  • Ryu, Jiseon
    • Korean Journal of Applied Biomechanics
    • /
    • v.31 no.1
    • /
    • pp.30-36
    • /
    • 2021
  • Objective: The objective of the present study was to analyze the relationship between strength of the lower extremity's joints and their local dynamic stability (LDS) of gait in elderly women. Method: Forty-five elderly women participated in this study. Average age, height, mass, and preference walking speed were 73.5±3.7 years, 153.8±4.8 cm, 56.7±6.4 kg, and 1.2±0.1 m/s, respectively. They were tested torque peak of the knee and ankle joints with a Human Norm and while they were walking on a treadmill at their preference speed for a long while, kinematic data were obtained using six 3-D motion capture cameras. LDS of the lower extremity's joints were calculated in maximum Lyapunov Exponent (LyE). Correlation coefficients between torque of the joints and LyE were obtained using Spearman rank. Level of significance was set at p<.05. Results: Knee flexion torque and its LDS was negatively associated with adduction-abduction and flexion-extension movement (p<.05). In addition, ratio of the knee flexion torque to extension and LDS was negatively related to internal-external rotation. Conclusion: In conclusion, knee flexion strength should preferentially be strengthened to increase LDS of the lower extremity's joints for preventing from small perturbations during walking in elderly women.

The Lifespan of Social Hub In Social Networking Sites: The Role of Reciprocity, Local Dominance and Social Interaction

  • Han, Sangman;Magee, Christopher L.;Kim, Yunsik
    • Asia Marketing Journal
    • /
    • v.17 no.1
    • /
    • pp.69-95
    • /
    • 2015
  • This paper examines a highly used social networking site (SNS) by studying the behavior of more than 11 million members over a 20 month period. The importance of the most highly active members to the overall network is demonstrated by the significant fraction of total visits by extremely active members in a given period but such members have surprisingly short lifespans (an average of only 2.5 months) as social hubs. We form and test a number of hypotheses concerning these social hubs and the determinants of their lifespan. We find that the speed of achieving social hub status increases the lifespan of a social hub. The norm of reciprocity is strongly confirmed to be present in the social hub population as visits are reciprocated. We also find that increasing local dominance in terms of activities over neighboring agents leads to a longer lifespan of a social hub. Contrary to expectations, local clustering in the vicinity of social hubs is smaller (rather than larger) than overall clustering. We discuss managerial implications in the paper.

Experimental study of noise level optimization in brain single-photon emission computed tomography images using non-local means approach with various reconstruction methods

  • Seong-Hyeon Kang;Seungwan Lee;Youngjin Lee
    • Nuclear Engineering and Technology
    • /
    • v.55 no.5
    • /
    • pp.1527-1532
    • /
    • 2023
  • The noise reduction algorithm using the non-local means (NLM) approach is very efficient in nuclear medicine imaging. In this study, the applicability of the NLM noise reduction algorithm in single-photon emission computed tomography (SPECT) images with a brain phantom and the optimization of the NLM algorithm by changing the smoothing factors according to various reconstruction methods are investigated. Brain phantom images were reconstructed using filtered back projection (FBP) and ordered subset expectation maximization (OSEM). The smoothing factor of the NLM noise reduction algorithm determined the optimal coefficient of variation (COV) and contrast-to-noise ratio (CNR) results at a value of 0.020 in the FBP and OSEM reconstruction methods. We confirmed that the FBP- and OSEM-based SPECT images using the algorithm applied with the optimal smoothing factor improved the COV and CNR by 66.94% and 8.00% on average, respectively, compared to those of the original image. In conclusion, an optimized smoothing factor was derived from the NLM approach-based algorithm in brain SPECT images and may be applicable to various nuclear medicine imaging techniques in the future.

Treatment of Superficial Peroneal Nerve Entrapment Syndrome under Local Anesthesia using Ultrasonogram (초음파를 이용한 국소마취하 표재비골신경 포착증후군의 치료)

  • Lee, Kyung-Chan;Kwak, Ji-Hoon;Hwang, Chul-Ho;Park, Hong-Gi
    • Journal of Korean Foot and Ankle Society
    • /
    • v.17 no.3
    • /
    • pp.215-219
    • /
    • 2013
  • Purpose: To review the outcomes of surgical treatment for superficial peroneal nerve entrapment. Materials and Methods: Ultrasonogram was used for diagnosis and surgical treatment. Seven superficial peroneal nerve entrapment were surgically treated with follow up of average 16 months (range, 6~29 months). Three patients were male and four patients were female with mean age 36.7 years (range, 19~51 years). Four cases developed after repetitive ankle sprain and three cases had no etiology. Results: Operation was performed mini-open and subcutaneous fasciotomy under local anesthesia. The results were excellent in two cases, good in four cases, fair in one case. Conclusion: Ultrasonogram was useful for diagnosis and surgical treatment of superficial peroneal nerve entrapment syndrome.

Mini-Slot-Based Transmission Scheme for Local Customer Internetworking in PONs

  • Kim, Jae-Gwan;Chae, Chang-Joon;Kang, Min-Ho
    • ETRI Journal
    • /
    • v.30 no.2
    • /
    • pp.282-289
    • /
    • 2008
  • We propose a new mini-slot transmission scheme for a passive optical network (PON) in which each customer can be switched either to access mode or to internetworking mode dynamically. In this paper, we present the system implementation (called LAN-PON) as well as the performance of the proposed transmission scheme to illustrate its feasibility and benefits. A mini-slot scheme can rapidly reduce the queuing delay, which increases due to the flooding of the deflected packets in a deflection scheme. We evaluate the impact of mode switching time on the bandwidth gain (throughput) and delay of local area network (LAN) traffic in the LAN-PON with a mini-slot scheme. We also analyze a theoretical delay model of the proposed scheme. The simulation results demonstrate that switching time has an impact on LAN performance, and the average packet delay of the proposed scheme is significantly improved compared to that of the deflection scheme.

  • PDF

Vector space based augmented structural kinematic feature descriptor for human activity recognition in videos

  • Dharmalingam, Sowmiya;Palanisamy, Anandhakumar
    • ETRI Journal
    • /
    • v.40 no.4
    • /
    • pp.499-510
    • /
    • 2018
  • A vector space based augmented structural kinematic (VSASK) feature descriptor is proposed for human activity recognition. An action descriptor is built by integrating the structural and kinematic properties of the actor using vector space based augmented matrix representation. Using the local or global information separately may not provide sufficient action characteristics. The proposed action descriptor combines both the local (pose) and global (position and velocity) features using augmented matrix schema and thereby increases the robustness of the descriptor. A multiclass support vector machine (SVM) is used to learn each action descriptor for the corresponding activity classification and understanding. The performance of the proposed descriptor is experimentally analyzed using the Weizmann and KTH datasets. The average recognition rate for the Weizmann and KTH datasets is 100% and 99.89%, respectively. The computational time for the proposed descriptor learning is 0.003 seconds, which is an improvement of approximately 1.4% over the existing methods.

Robust Nonparametric Regression Method using Rank Transformation

    • Communications for Statistical Applications and Methods
    • /
    • v.7 no.2
    • /
    • pp.574-574
    • /
    • 2000
  • Consider the problem of estimating regression function from a set of data which is contaminated by a long-tailed error distribution. The linear smoother is a kind of a local weighted average of response, so it is not robust against outliers. The kernel M-smoother and the lowess attain robustness against outliers by down-weighting outliers. However, the kernel M-smoother and the lowess requires the iteration for computing the robustness weights, and as Wang and Scott(1994) pointed out, the requirement of iteration is not a desirable property. In this article, we propose the robust nonparametic regression method which does not require the iteration. Robustness can be achieved not only by down-weighting outliers but also by transforming outliers. The rank transformation is a simple procedure where the data are replaced by their corresponding ranks. Iman and Conover(1979) showed the fact that the rank transformation is a robust and powerful procedure in the linear regression. In this paper, we show that we can also use the rank transformation to nonparametric regression to achieve the robustness.

Robust Nonparametric Regression Method using Rank Transformation

  • Park, Dongryeon
    • Communications for Statistical Applications and Methods
    • /
    • v.7 no.2
    • /
    • pp.575-583
    • /
    • 2000
  • Consider the problem of estimating regression function from a set of data which is contaminated by a long-tailed error distribution. The linear smoother is a kind of a local weighted average of response, so it is not robust against outliers. The kernel M-smoother and the lowess attain robustness against outliers by down-weighting outliers. However, the kernel M-smoother and the lowess requires the iteration for computing the robustness weights, and as Wang and Scott(1994) pointed out, the requirement of iteration is not a desirable property. In this article, we propose the robust nonparametic regression method which does not require the iteration. Robustness can be achieved not only by down-weighting outliers but also by transforming outliers. The rank transformation is a simple procedure where the data are replaced by their corresponding ranks. Iman and Conover(1979) showed the fact that the rank transformation is a robust and powerful procedure in the linear regression. In this paper, we show that we can also use the rank transformation to nonparametric regression to achieve the robustness.

  • PDF

TESTS FOR VARYING-COEFFICIENT PARTS ON VARYING-COEFFICIENT SINGLE-INDEX MODEL

  • Huang, Zhensheng;Zhang, Riquan
    • Journal of the Korean Mathematical Society
    • /
    • v.47 no.2
    • /
    • pp.385-407
    • /
    • 2010
  • To study the relationship between the levels of chemical pollutants and the number of daily total hospital admissions for respiratory diseases and to find the effect of temperature/relative humidity on the admission number, Wong et al. [17] introduced the varying-coefficient single-index model (VCSIM). As pointed out, it is a popular multivariate nonparametric fitting technique. However, the tests of the model have not been very well developed. In this paper, based on the estimators obtained by the local linear technique, the average method and the one-step back-fitting technique in the VCSIM, the generalized likelihood ratio (GLR) tests for varying-coefficient parts on the VCSIM are established. Under the null hypotheses the new proposed GLR tests follow the $\chi^2$-distribution asymptotically with scale constant and degree of freedom independent of the nuisance parameters, known as Wilks phenomenon. Simulations are conducted to evaluate the test procedure empirically. A real example is used to illustrate the performance of the testing approach.

On Solving the Tree-Topology Design Problem for Wireless Cellular Networks

  • Pomerleau Yanick;Chamberland Steven;Pesant Gilles
    • Journal of Communications and Networks
    • /
    • v.8 no.1
    • /
    • pp.85-92
    • /
    • 2006
  • In this paper, we study a wireless cellular network design problem. It consists of selecting the location of the base station controllers and mobile service switching centres, selecting their types, designing the network into a tree-topology, and selecting the link types, while considering the location and the demand of base transceiver stations. We propose a constraint programming model and develop a heuristic combining local search and constraint programming techniques to find very good solutions in a reasonable amount of time for this category of problem. Numerical results show that our approach, on average, improves the results from the literature.