• Computers and Concrete
• /
• v.32 no.2
• /
• pp.149-163
• /
• 2023

One of the main design parameters traditionally utilized in projects of geotechnical engineering is the uniaxial compressive strength. The present paper employed three artificial intelligence methods, i.e., the stochastic fractal search (SFS), the multi-verse optimization (MVO), and the vortex search algorithm (VSA), in order to determine the compressive strength of concrete (CSC). For the same reason, 1030 concrete specimens were subjected to compressive strength tests. According to the obtained laboratory results, the fly ash, cement, water, slag, coarse aggregates, fine aggregates, and SP were subjected to tests as the input parameters of the model in order to decide the optimum input configuration for the estimation of the compressive strength. The performance was evaluated by employing three criteria, i.e., the root mean square error (RMSE), mean absolute error (MAE), and the determination coefficient (R²). The evaluation of the error criteria and the determination coefficient obtained from the above three techniques indicates that the SFS-MLP technique outperformed the MVO-MLP and VSA-MLP methods. The developed artificial neural network models exhibit higher amounts of errors and lower correlation coefficients in comparison with other models. Nonetheless, the use of the stochastic fractal search algorithm has resulted in considerable enhancement in precision and accuracy of the evaluations conducted through the artificial neural network and has enhanced its performance. According to the results, the utilized SFS-MLP technique showed a better performance in the estimation of the compressive strength of concrete (R²=0.99932 and 0.99942, and RMSE=0.32611 and 0.24922). The novelty of our study is the use of a large dataset composed of 1030 entries and optimization of the learning scheme of the neural prediction model via a data distribution of a 20:80 testing-to-training ratio.

• Journal of Music and Human Behavior
• /
• v.4 no.1
• /
• pp.31-46
• /
• 2007

The purpose of the study was to improve the efficiency of Breath & Forced Vital Capacity(FVC) of Stroke Patients Using Record Playing Focused on Breath Training. The Training of Forced Vital Capacity(FVC) is focused on trunk muscles reinforce for Breathing. So the study tried to play Recorder for reinforcing FVC. The play included the two parts. One was for solo play, the other was play in concert base on solo play using Korea country song, Arirang. The Recorder play used abdominal breath, Pursed-lip & Paced methods. The course of play included Long Tone, Staccato, Crescendo, Decrescendo and throughout the course we tried to improve the efficiency & Quantity of breathe. Experiment performed at Social welfare institute for the old. They played & checked FVC, $FEV_1$, $FEV_1/FVC$ before & after breathe 19 times for 6 weeks using Spirovit SP-1, Schiller. After experiment we performed statical process(p<0.05) using statical Package software. The findings were as follows: Analysis for Experiment showed the numerical Value of increasing Of FVC, $FEV_1$, $FEV_1/FVC$. Increasing Percentage of Measured/Predicted FVC, $FEV_1$ (or calculated based on theory) ration was 25%, 13% and Quantity of FVC, $FEV_1$ 35%, 40%. Also $FEV_1/FVC$ Ratio(showed efficiency of breathe) raised 13%. And experiment data was confirmed by statical process. The experiment data was valuable under p<0.05. In Conclusion we think the results of experiment showed the efficiency of Music therapy for Breathe(FVC, $FEV_1$, $FEV_1/FVC$) reinforce.

• Journal of Acupuncture Research
• /
• v.25 no.3
• /
• pp.139-162
• /
• 2008

Objectives : Korean tradithional acupuncture Theory, Sa-am's 5 phases acupuncture method was originated in 1644-1742, in the middle of the Cho Sun dynasty. This study was to vertify the effect of Sa-am Acupuncture Treatment on Primary dysmenorrhea of Women. Methods : The subjects were 80 volunteers who was suffering for dysmenorrhea, employed using Measure of Menstrual Pain (MMP) questionnaire. Subjects were divided into two groups including Sa-am acupuncture treatment group(n=25), minimal acupuncture treatment group(n=22). They had agreed to take part in this experiment, with didn't take any anodyne drugs. In the acupuncture group, subjects were stimulated at G41, $SI_3$, B66, $SI_2$(Small intestine jung-guk), $SP_6$, $CV_6$ and one points were inserted additionally depending the symptoms among $ST_{36}$ or $LI_2$. In the control group, subjects were needled at 5 non-acupuncture points have any effect on Dysmenorrhea. A total of 8 acupuncture sessions were performed for each patient depending on the individual menstruation cycle The MMP score by using 7 questions and the Menstrual Symptom Severity List(MSSL-D) was measured before and after menstruation cycle. Collected data were analyzed as frequency, percentage, paired t-test, independent t-test using SPSS 10.0 WIN Program. Results : Acupuncture treatment produced a significant decreasing the symptom of Primary dysmenorrhea in two groups, but a statistically significant difference was not shown in the acupuncture group compare to control group. Conclusions : Based on the above results, it was verified that Acupuncture Treatment was effective in decreasing the symptom of Primary Dysmenorrhea.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.2
• /
• pp.117-128
• /
• 2001

In order to achieve optimal retrieval, i.e., to find the best match to a query according to a certain similarity measure, the exhaustive search should be performed literally for all the images in a database. However, the straightforward exhaustive search algorithm is computationally expensive in large image databases. To reduce its heavy computational cost, this paper presents a fast exhaustive multi-resolution search algorithm based on image database clustering. Firstly, the proposed algorithm partitions the whole image data set into a pre-defined number of clusters having similar feature contents. Next, for a given query, it checks the lower bound of distances in each cluster, eliminating disqualified clusters. Then, it only examines the candidates in the remaining clusters. To alleviate unnecessary feature matching operations in the search procedure, the distance inequality property is employed based on a multi-resolution data structure. The proposed algorithm realizes a fast exhaustive multi-resolution search for either the best match or multiple best matches to the query. Using luminance histograms as a feature, we prove that the proposed algorithm guarantees optimal retrieval with high searching speed.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.4
• /
• pp.9-21
• /
• 2004

In this paper, we proposed the image hiding method which decreases calculation amount by encrypt partial data using discrete wavelet transform and linear scale quantization which were adopted as the main technique for frequency transform in JPEG2000 standard. Also we used the chaotic system which has smaller calculation amount than other encryption algorithms and then dramatically decreased calculation amount. This method operates encryption process between quantization and entropy coding for preserving compression ratio of images and uses the subband selection method and the random changing method using the chaotic system. For ciphering the quantization index we use a novel image encryption algerian of cyclically shifted in the right or left direction and encrypts two quantization assignment method (Top-down/Reflection code), made change of data less. Also, suggested encryption method to JPEG2000 progressive transmission. The experiments have been performed with the proposed methods implemented in software for about 500 images. consequently, we are sure that the proposed are efficient image encryption methods to acquire the high encryption effect with small amount of encryption. It has been shown that there exits a relation of trade-off between the execution time and the effect of the encryption. It means that the proposed methods can be selectively used according to the application areas. Also, because the proposed methods are performed in the application layer, they are expected to be a good solution for the end-to-end security problem, which is appearing as one of the important problems in the networks with both wired and wireless sections.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.3 s.309
• /
• pp.9-16
• /
• 2006

Many image and video compression algorithms work by splitting the image into blocks and producing variable-length code bits for each block data. If variable-length code data are transmitted consecutively over error-prone channel without any error protection technique, the receiving decoder cannot decode the stream properly. So the standard image and video compression algorithms insert some redundant information into the stream to provide some protection against channel errors. One of redundancies is resynchronization marker, which enables the decoder to restart the decoding process from a known state in the event of transmission errors, but its usage should be restricted not to consume bandwidth too much. The Error Resilient Entropy Code(EREC) is well blown method which can regain synchronization without any redundant information. It can work with the overall prefix codes, which many image compression methods use. This paper proposes EREREC method to improve FEREC(Fast Error-Resilient Entropy Coding). It first calculates initial searching position according to bit lengths of consecutive blocks. Second, initial offset is decided using statistical distribution of long and short blocks, and initial offset can be adjusted to insure all offset sequence values can be used. The proposed EREREC algorithm can speed up the construction of FEREC slots, and can improve the compressed image quality in the event of transmission errors. The simulation result shows that the quality of transmitted image is enhanced about $0.3{\sim}3.5dB$ compared with the existing FEREC when random channel error happens.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.4
• /
• pp.116-128
• /
• 2011

In this paper, we propose the structure of a high-performance face-detection engine that responds well to facial rotating changes using rotation transformation which minimize the required memory usage compared to the previous face-detection engine. The validity of the proposed structure has been verified through the implementation of FPGA. For high performance face detection, the MCT (Modified Census Transform) method, which is robust against lighting change, was used. The Adaboost learning algorithm was used for creating optimized learning data. And the rotation transformation method was added to maintain effectiveness against face rotating changes. The proposed hardware structure was composed of Color Space Converter, Noise Filter, Memory Controller Interface, Image Rotator, Image Scaler, MCT(Modified Census Transform), Candidate Detector / Confidence Mapper, Position Resizer, Data Grouper, Overlay Processor / Color Overlay Processor. The face detection engine was tested using a Virtex5 LX330 FPGA board, a QVGA grade CMOS camera, and an LCD Display. It was verified that the engine demonstrated excellent performance in diverse real life environments and in a face detection standard database. As a result, a high performance real time face detection engine that can conduct real time processing at speeds of at least 60 frames per second, which is effective against lighting changes and face rotating changes and can detect 32 faces in diverse sizes simultaneously, was developed.

• The Journal of Korean Academy of Sensory Integration
• /
• v.7 no.1
• /
• pp.13-25
• /
• 2009

Objective : The purpose of the study is to find out how group sensory integrative (SI) intervention enhances play skill and social interaction of the children with sensory integration disorders. Method : Three children who were showing problems related in sensory integration received 12 SI intervention sessions. The Sensory Profile (SP) and The Social Maturity Scale (SMS) were accomplished by the subject's primary caregiver. Test of Playfulness (ToP) and Peer Social Interactions Rating Scale (PSIRS) were utilized to investigate the children's play skills and social interactions with their friends. Goal Attainment Scale (GAS) is applied to assess the children's play skill, social interactions with peer, and sensory processing at each session. Data was collected before- and after the intervention and analyzed by the Wilcoxon matched-pair signed rank test with SPSS/WIN version 10.0 and Microsoft Excel. Results : The average scores of ToP, PSIRS, and SMS were increased after the sensory integrative intervention. However, there is no significant difference in the play skills and social interactions between data of pre-intervention and the one of post-intervention. The score of the GAS was frequently increased in terms of the play skills and sensory processing throughout the whole sessions. Conclusions : This study reveals a possibility of that the group sensory integrative intervention may affect not only sensory processing ability, but also play skills and social interactions of children experiencing difficulties of sensory processing. Future research should supplement limitations of this study regarding insufficient number of the subject and the short period of the experiment.

• Journal of KIISE:Databases
• /
• v.34 no.5
• /
• pp.448-464
• /
• 2007

Location-Based Services (LBSs) provide results to queries according to the location of the client issuing the query. In LBS, techniques such as caching and prefetching are effective approaches to reducing the data transmission from a server and query response time. However, they can lead to cache inefficiency and network overload due to the client's mobility and query pattern. To solve these drawbacks, we propose a semantic prefetching (SP) scheme using prefetching segment concept and improved cache replacement policies. When a mobile client enters a new service area, called semantic prefetching area, proposed scheme fetches the necessary semantic information from the server in advance. The mobile client maintains the information in its own cache for query processing of location-dependent data (LDD) in mobile computing environment. The performance of the proposed scheme is investigated in relation to various environmental variables, such as the mobility and query pattern of user, the distributions of LDDs and applied cache replacement strategies. Simulation results show that the proposed scheme is more efficient than the well-known existing scheme for range query and nearest neighbor query. In addition, applying the two queries dynamically to query processing improves the performance of the proposed scheme.

• Journal of dental hygiene science
• /
• v.13 no.4
• /
• pp.434-439
• /
• 2013

This study was conducted to compare the dental plaque reduction using various mouthwashes with Quantitative Light induced Fluorescence-Digital (QLF-D). A survey on 20 students was carried out. The students who were at Shingu College. Experimental group was gargled 20 ml of Listerine during 30 seconds and 15 ml of Hexamedine during 60 seconds. Control group was gargled distilled water during 30 second. The data were analyzed with t-test using SPSS 20.0 program. The ratios of control group and experimental group were reduced. Degree of ${\Delta}R30$ and ${\Delta}R70$ Listerine group was a significant difference (p>0.05). Degree of Simple Plaque Score and ${\Delta}R30$ Hexamedine group was a significant difference (p>0.05). There was no significant difference in the distilled water gargle group (p<0.05). The result of this study has the effect of two mouthwashes reduced dental plaque. The evaluation data of this study will be used in clinical application and research about QLF-D.