Earticle

Purpose: The purpose of this study was to investigate the effects of the fascia distortion model (FDM), one of the fascia treatments, on unstable ankle subjects. This was done through the chronic ankle instability tool (CAIT) questionnaire on maximum isometric muscle strength, proprioception, dynamic balance, and maximum angle. Methods: An experiment was conducted using the chronic ankle instability tool questionnaire on males and females in their twenties who suffered from ankle instability. Before the experiment, maximum isometric strength, proprioceptive, dynamic balance, and maximum angle were measured. The fascia distortion model was applied and then measurements were taken again to compare and analyze the changes. Analysis was carried out using the paired t-test. Results: After applying the fascia distortion model, maximum isometric strength, proprioceptive, dynamic balance, and maximum angle significantly improved (p<0.05). Conclusion: This study found that the fascia distortion model method was effective in improving maximum isometric strength, proprioceptive, dynamic balance, and maximum angle. The results suggest that the fascia distortion model method is a new intervention that could be used for subjects with chronic ankle instability.

This paper proposes a method to find a tree with the maximum number of terminals that can be connected by a given length when numerous terminals distributed in a cluster form are given to the Euclidean plane R2 with several constraints. First constraint is that a given terminal is distributed in a cluster form, second is that a given length cannot connect all terminals in the tree, and third is that there is no curved connection between each terminal. This paper proposes a method to establish more efficient interconnections within terminals distributed in a cluster form by improving a randomly distributed memetic genetic algorithm. The construction of interconnections has been extensively used in design-related fields, from networking to architecture. Additionally, in real life, the construction of interconnections is mostly distributed in the form of clusters. Therefore, the heuristic algorithm proposed in this paper can be effectively utilized in real life and is expected to provide various cost savings.

This paper proposes a method to find an optimal T' with the most terminal of the subset of T' trees that can be connected by a given length by improving a memetic genetic algorithm within several constraints, when the set of terminal T is given to the Euclidean plane R². Constraint (1) is that a given length cannot connect all terminals of T, and (2) considers only the rectilinear layout of the edge connecting each terminal. The construction of interconnections has been used in various design-related areas, from network to architecture. Among these areas, there are cases where only the rectilinear layout is considered, such as wiring paths in the computer network and VLSI design, network design, and circuit connection length estimation in standard cell deployment. Therefore, the heuristics proposed in this paper are expected to provide various cost savings in the rectilinear layout.

This paper presents a new method for controlling the current of lighting LEDs without current sensors. This method can be used as backup against LED current sensor faults. LED lighting requires a circuit with a constant current in order to maintain the same brightness when the ambient temperature changes. Therefore, we propose a new current estimation method to provide backup in case of current sensor faults based on the calculation of the inductor current. In the fabricated circuit, the average current changes from 144.03 mA to 155.97 mA when the ambient temperature changes from 0℃ to 60℃. The application of this study can enable the fabrication of a driving IC for LEDs in the form of a single chip without sensing resistors. This is expected to reduce the complexity of the peripheral circuit and enable precise feedback control.

This paper proposes a solution to the problem of finding a subgraph for a given instance of many terminals on a Euclidean plane. The subgraph is a tree, whose nodes represent the chosen terminals from the problem instance, and whose edges are line segments that connect two corresponding terminals. The tree is required to have the maximum number of nodes while the length is limited and is not sufficient to interconnect all the given terminals. The problem is shown to be NP-hard, and therefore a genetic algorithm is designed as an efficient practical approach. The method is suitable to various probable applications in layout optimization in areas such as communication network construction, industrial construction, and a variety of machine and electronics design problems. The proposed heuristic can be used as a general-purpose practical solver to reduce industrial costs by determining feasible interconnections among many types of components over different types of physical planes.

We consider the problem of designing independently operating local quantizers at nodes in distributed estimation systems, where many spatially distributed sensor nodes measure a parameter of interest, quantize these measurements, and send the quantized data to a fusion node, which conducts the parameter estimation. Motivated by the discussion that the estimation accuracy can be improved by using the quantized data with a high probability of occurrence, we propose an iterative algorithm with a simple design rule that produces quantizers by searching boundary values with an increased likelihood. We prove that this design rule generates a considerably reduced interval for finding the next boundary values, yielding a low design complexity. We demonstrate through extensive simulations that the proposed algorithm achieves a significant performance gain with respect to traditional quantizer designs. A comparison with the recently published novel algorithms further illustrates the benefit of the proposed technique in terms of performance and design complexity.

Background: The objective of this study was to underline that litter size as a key trait of sows needs new parameters to be evaluated and to target an individual optimum. Large individual variation in litter size affects both production and piglet’s survival and health negatively. Therefore, two new traits were suggested and analyzed. Two data sets on 5509 purebred German Landrace sows and 3926 Large White and crossing sows including at least two parental generations and at least five parities were subjected to variance components analysis. Results: The new traits for evaluating litter size were derived from the individual numbers of total born piglets (TBP) per parity: In most cases, sows reach their maximum litter size in their fourth parity. Therefore, data from at least five parities were included. The first observable maximum and minimum of TBP, and the individual variation expressed by the range were targeted. Maximum of TBP being an observable trait in pig breeding and management yielded clearly higher heritability estimates (h2~ 0.3) than those estimates predominantly reported so far. Maximum TBP gets closer to the genetic capacity for litter size than other litter traits. Minimum of TBP is positively correlated with the range of TBP (rp = 0.48, rg > 0.6). The correlation between maximum of TBP and its individually reached frequency was negative in both data sets (rp = ? 0.28 and ? 0.22, respectively). Estimated heritability coefficients for the range of TBP comprised a span of h2 = 0.06 to 0.10. Conclusion: An optimum both for maximum and range of total born piglets in selecting sows is a way contributing to homogenous litters in order to improving the animal-related conditions both for piglets’ welfare and economic management in pig.

Maximum likelihood is a criterion often used to derive localization algorithms. In particular, in this paper we focus on a distance-based algorithm for the localization of nodes in static wireless networks. Assuming that Ultra Wide Band (UWB) signals are used for inter-node communications, we investigate the ill-conditioning of the Two-Stage Maximum-Likelihood (TSML) Time of Arrival (ToA) localization algorithm as the Anchor Nodes (ANs) positions change. We analytically derive novel lower and upper bounds for the localization error and we evaluate them in some localization scenarios as functions of the ANs’ positions. We show that particular ANs’ configurations intrinsically lead to ill-conditioning of the localization problem, making the TSML-ToA inapplicable. For comparison purposes, we also show, through some examples, that a Particle Swarm Optimization (PSO)-based algorithm guarantees accurate positioning also when the localization problem embedded in the TSML-ToA algorithm is ill-conditioned.

In this paper, we propose a maximum entropy-based model, which can mathematically explain the bio-molecular event extraction problem. The proposed model generates an event table, which can represent the relationship between an event trigger and its arguments. The complex sentences with distinctive event structures can be also represented by the event table. Previous approaches intuitively designed a pipeline system, which sequentially performs trigger detection and arguments recognition, and thus, did not clearly explain the relationship between identified triggers and arguments. On the other hand, the proposed model generates an event table that can represent triggers, their arguments, and their relationships. The desired events can be easily extracted from the event table. Experimental results show that the proposed model can cover 91.36% of events in the training dataset and that it can achieve a 50.44% recall in the test dataset by using the event table.

In this paper, we propose a cooperative maximum-ratio transmission (C-MRT) technique with multi-antenna relay nodes for tactical mobile ad-hoc networks (MANETs) where both the location and the number of antennas of relay nodes are arbitrary. Each relay node is assumed to know both the wireless channel coefficient from the source node to itself and the wireless channel from itself to the destination node, which is known as local channel state information (CSI) assumption. Maximum-ratio combining (MRC) and MRT techniques are used for beamforming the transmit and receive signals of the relay node, respectively. In addition, we mathematically analyze the overall outage probability of the proposed technique with moment generating function (MGF). It is shown that the mathematical analysis on the overall outage probability of the proposed C-MRT technique is matched well with the simulation results especially in high transmit power regimes. It is also observed that the proposed technique outperforms other schemes such as phase steering (PS) and optimal relay selection (ORS) in terms of outage probability.

Owing to the influence of environmental changes, such as temperature and lighting, on the output power of photovoltaic cells, tracking the maximum power point of photovoltaic cells is of great interest. This paper provides a detailed introduction to the relevant theories of maximum power point tracking in photovoltaic cells. Subsequently, a simulation module is built using MATLAB Simulink to analyze the simulation results of tracking the maximum power point under sudden changes in temperature or lighting using disturbance observation, conductivity increment, and constant voltage methods. The advantages and disadvantages of these three methods were analyzed. The experimental results indicate that the constructed simulation algorithm module is correct, and the simulation results provide reference value for the selection and application range of maximum power point tracking algorithms in actual photovoltaic systems.

In the wireless network, TCP performs poorly because it was originally designed for wired networks and does not take into consideration wireless characteristics such as mobility, high-loss probability, and hidden-terminal problems. In particular, in the wireless multi-hop networks, a large congestion window increases the probability of contention and packet losses, and TCP performance is degraded severely as a result. So, it is necessary to limit the TCP congestion window size in order keep the probability of contention loss in the system to a minimum. In this paper, we propose a new scheme for determining the maximum congestion window size based on the measured bandwidth and Round-Trip-Time (RTT). Using ns-2 simulation, we show that the proposed scheme reduces the probability of packet contention and improves TCP performance.

The manufacture of gears by applying hot or cold bulk forming processes is a quite widespread production method due to its well-known basic advantages such as material and time cost reduction and the increased strength of the teeth. However, the associated process planning and tool design are more complicated. In the precision forging of gears, the workpiece volume, the die design, the power requirement and careful processing are more critical than traditional forging technology. For complete filling up, predicting the power requirement is an important feature of the near net-shape forging process. In this paper, a finite element analysis is utilized to investigate the material properties such as yielding stress, strength coefficient and strain hardening exponent effects on forming load and maximum effective stress. The adductive network was then applied to synthesize the data set obtained from the numerical simulation. The predicted results of the maximum forging load and maximum equivalent stress of bevel gear forging from the prediction model are consistent with the results obtained from FEM simulation quite well. After employing the prediction model one can provide valuable references in prediction of the maximum forging load and maximum equivalent stress of bevel gear forging under a suitable range of material parameters.

Maximum likelihood (ML) is the best estimator asymptotically as the number of training samples approaches infinity. This paper deduces an adaptive algorithm for blind signal processing problem based on gradient optimization criterion. A parametric density model is introduced through a parameterized generalized distribution family in ML framework. After specifying a limited number of parameters, the density of specific original signal can be approximated automatically by the constructed density function. Consequently, signal separation can be conducted without any prior information about the probability density of the desired original signal. Simulations on classical biomedical signals confirm the performance of the deduced technique.

The physical security layer of industrial wireless sensor networks in the event of an eavesdropping attack has been investigated in this paper. An optimal sensor selection scheme based on the maximum channel capacity is proposed for transmission environments that experience Nakagami fading. Comparing the intercept probabilities of the traditional round robin (TRR) and optimal sensor selection schemes, the system secure performance is analyzed. Simulation results show that the change in the number of sensors and the eavesdropping ratio affect the convergence rate of the intercept probability. Additionally, the proposed optimal selection scheme has a faster convergence rate compared to the TRR scheduling scheme for the same eavesdropping ratio and number of sensors. This observation is also valid when the Nakagami channel is simplified to a Rayleigh channel.

Objective To identify the relationship between maximum phonation time (MPT) and swallowing function, as well as the elements of swallowing, in order to provide a rationale for speech therapy in patients with Parkinsonism manifesting dysphagia.Methods Thirty patients with Parkinsonism who underwent speech evaluation and videofluoroscopic swallowing study (VFSS) were recruited. The MPT, the longest periods of sustained pronunciation of /aa/, was evaluated. The VFSS was evaluated using Penetration Aspiration Scale (PAS), National Institutes of Health-Swallowing Safety Scale (NIH-SSS), and Videofluoroscopic Dysphagia Scale (VDS). The relationship between dysphagia scales and MPT was analyzed using Pearson correlation. The difference in VDS variables between subgroups (Parkinson disease or Parkinsonian syndrome, independent or dependent ambulation, and normal or abnormal MPT) and the difference in MPT between subgroups based on the VDS variables were analyzed using the independent t-test.Results Bolus formation and laryngeal elevation functions were significantly higher in the normal MPT group compared with the impaired group. In the VDS variables, patients with intact bolus formation, oral transit time, pharyngeal swallow triggering, and laryngeal elevation showed significantly longer MPTs compared with the impaired groups. In addition, MPT was significantly correlated with the VDS and modestly correlated with the NIH-SSS, but not the PAS, suggesting that phonatory function is related to the oropharyngeal swallowing function, but not directly to the aspiration itself.Conclusion The correlation between MPT and several swallowing-related elements was identified, indicating an interactive correlation between swallowing and phonation. This result justifies voice therapy as a treatment for dysphagia in patients with Parkinsonism.

In this paper, we propose a new three-dimensional (3D) photon-counting integral imaging reconstruction method using a merging reconstruction process and maximum likelihood estimation (MLE). The conventional 3D photon-counting reconstruction method extracts photons from elemental images using a Poisson random process and estimates the scene using statistical methods such as MLE. However, it can reduce the photon levels because of an average overlapping calculation. Thus, it may not visualize 3D objects in severely low light environments. In addition, it may not generate high-quality reconstructed 3D images when the number of elemental images is insufficient. To solve these problems, we propose a new 3D photon-counting merging reconstruction method using MLE. It can visualize 3D objects without photon-level loss through a proposed overlapping calculation during the reconstruction process. We confirmed the image quality of our proposed method by performing optical experiments.

PURPOSE: The purpose of this study was to investigate the effect of the elastic band and stretching exercise program on ankle joint maximal voluntary isometric contraction (MVIC) and plantar pressure in high-heel wearing women in their 20s. METHODS: Twenty women in their twenties were randomly assigned to the experimental group (n=10) and the control group (n=10). The experimental group (n=10) performed the elastic band exercise program, while the control group (n=10) performed the stretching exercise program. Both exercise programs were performed three times a week for a total of four weeks. The BTE Primus RS was used in order to measure the ankle joint MVIC during dorsiflexion, plantar flexion, inversion, and eversion. Maximum pressure ($N/cm^2$), average pressure ($N/cm^2$) were measured using the Pedoscan. SPSS v. 21.0 software was used for all statistical analyses in this study. RESULTS: The measurement of the ankle joint's MVIC revealed that in inversion, a significant change in both feet was seen in both the experimental and control groups. In eversion, there was a significant change in both feet only in the experimental group. In terms of the rest of the results, no significant changes were visible. With regard to the plantar pressure, no significant results were seen for either foot in the comparison between or within the groups. CONCLUSION: Exercise program using elastic band and exercise program using stretching were effective on MVIC of ankle joint muscles, although it had no effect on changes of plantar pressure.

본 연구는 사고처리 지연으로 인한 피해를 최소화할 수 있는 고속도로 순찰대의 최적입지를 결정하는 것을 목적으로 한다. 이를 위하여 우리는 최단거리를 기준으로 서비스 관할구간을 할당하는 maximum covering 문제와 사고 빈도 가중 p-center 문제를 각각 구성하고, 두 문제를 해결하기 위하여 라그랑지안 완화 알고리즘과 Daskin의 휴리스틱 알고리즘을 적용한다. 제안된 모형들의 결과는 한국 고속도로의 사고자료를 기반으로 최대사고가중거리, 평균사고가중거리, 평균처리거리 등의 사고처리 서비스 수준 지표를 이용하여 현재의 순찰대 입지와 비교된다. 비교 결과를 통해 제안된 모형들은 10km 평균 접근거리와 약 10분의 평균 접근시간을 개선할 수 있음이 확인된다. 또한 현재의 입지를 고정시키고 서비스 관할구간만을 변경할 경우에도 서비스 수준이 개선될 수 있다. 본 연구에서 제시된 모형과 결과는 고속도로 사고처리 서비스 수준을 개선하는 데에 활용될 수 있으며, 또한 다양한 유형의 긴급시설 입지 결정이나 시간대별 사고자료에 기초한 유동적 관할구역 설정 등의 이론적 기반을 제공할 수 있을 것으로 사료된다.

This paper aims to determine the optimal location of expressway patrol vehicle stations that minimizes additional troubles caused by the delay of crash treatments. To do this, we formulate a maximum covering problem and a p-center problem weighted by crash frequency, using the shortest distance as the criteria for allocating service district, and we employ the Lagrangian relaxation algorithm to solve the former and Daskin’s heuristic algorithm to solve the latter, respectively. Based on crash data of Korean expressways, the results from the proposed models are compared with the current location of patrol vehicle stations by using several indices as the level of service for crash treatment, such as maximum crash-weighted distance, average crash-weighted distance, and average access distance. The results show that the proposed models improve average access distance and time by about 10km and 10min, respectively. When allocation for service district is changed only with the fixed current location, the level of service can be also improved. The models and results proposed in this paper can contribute to improving the level of service for crash treatment on expressways. They can also provide the theoretical basis on the location decision for other various emergency facilities, and the allocation decision for floating service districts according to time-period crash data.

k -club은 소셜 네트워크 분석에서 다양한 형태의 소셜 그룹을 설명하기 위해 제안된 그래프 모델 중 하나로, 단순 그래프에서 부분 정점 집합 S 에 의한 유도 부분그래프(Induced subgraph)의 지름이 k보다 작거나 같은 경우 S 를 k -club이라 한다. 본 논문에서는 유전알고리즘을 이용하여 그래프에서 크기가 최대인 k -club을 찾는 문제인 Mk CP(Maximum k -Club Problem)을 계산하는 HGA+DROP 알고리즘을 제안한다. 본 알고리즘은 k -club을 위한 휴리스틱 알고리즘 k -CLIQUE & DROP을 변형하고 휴리스틱 유전 알고리즘(HGA)을 사용해 한 번의 수행으로 복수 개의 k -club을 구하였다. 기존 알고리즘의 결과와 비교하기 위해 DIMACS 그래프들에 대하여 k 가 2, 3, 4 그리고 5일 때 MkCP를 계산하였다.

Given an undirected simple graph, k -club is one of the proposed structures to model social groups that exist in various types in Social Network Analysis (SNA). Maximum k -Club Problem (Mk CP) is to find a k -club of maximum cardinality in a graph. This paper introduces a Genetic Algorithm called HGA+DROP which can be used to approximate maximum k -club in graphs. Our algorithm modifies the existing k -CLIQUE & DROP algorithm and utilizes Heuristic Genetic Algorithms (HGA) to obtain multiple k-clubs. We experiment on DIMACS graphs for k = 2, 3, 4 and 5 to compare the performance of the proposed algorithm with existing algorithms.