Although functional gastrointestinal disorders (FGIDs) are very common in pediatric patients, there is a scarcity of published epidemiologic data, characteristics, and management patterns from Saudi Arabia, which is the 2nd largest Arabic country in terms of area and the 6th largest Arabic country in terms of population, with 10% of its population aged <5 years. Functional constipation (FC) is an FGID that has shown a rising prevalence among Saudi infants and children in the last few years, which urges us to update our clinical practices. Nine pediatric consultants attended two advisory board meetings to discuss and address current challenges, provide solutions, and reach a Saudi national consensus for the management of pediatric constipation. The pediatric consultants agreed that pediatricians should pay attention to any alarming signs (red flags) found during history taking or physical examinations. They also agreed that the Rome IV criteria are the gold standard for the diagnosis of pediatric FC. Different therapeutic options are available for pediatric patients with FC. Dietary treatment is recommended for infants with constipation for up to six months of age. When non-pharmacological interventions fail to improve FC symptoms, pharmacological treatment with laxatives is indicated. First, the treatment is aimed at disimpaction to remove fecal masses. This is achieved by administering a high dose of oral polyethylene glycol (PEG) or lactulose for a few days. Subsequently, maintenance therapy with PEG should be initiated to prevent the re-accumulation of feces. In addition to PEG, several other options may be used, such as Mg-rich formulas or stimulant laxatives. However, rectal enemas and suppositories are usually reserved for cases that require acute pain relief. In contrast, infant formulas that contain prebiotics or probiotics have not been shown to be effective in infant constipation, while the use of partially hydrolyzed formula is inconclusive. These clinical practice recommendations are intended to be adopted by pediatricians and primary care physicians across Saudi Arabia.
Hee-ju Chae;Kyeong-heon Kwak;Da-yeon Lee;Eunkyung Kim
Journal of the Korea Society for Simulation
/
v.32
no.3
/
pp.43-53
/
2023
In this detailed and comprehensive study, our primary focus has been placed on accurately gauging the number of visitors and their real-time locations in commercial spaces. Particularly, in a real cafe, using security cameras, we have developed a system that can offer live updates on available seating and predict future congestion levels. By employing YOLO, a real-time object detection and tracking algorithm, the number of visitors and their respective locations in real-time are also monitored. This information is then used to update a cafe's indoor map, thereby enabling users to easily identify available seating. Moreover, we developed a model that predicts the congestion of a cafe in real time. The sophisticated model, designed to learn visitor count and movement patterns over diverse time intervals, is based on Long Short Term Memory (LSTM) to address the vanishing gradient problem and Sequence-to-Sequence (Seq2Seq) for processing data with temporal relationships. This innovative system has the potential to significantly improve cafe management efficiency and customer satisfaction by delivering reliable predictions of cafe congestion to all users. Our groundbreaking research not only demonstrates the effectiveness and utility of indoor location tracking technology implemented through security cameras but also proposes potential applications in other commercial spaces.
Park, Jae-Hyun;Kim, Dong-Wook;Kwak, Ki-Seok;Chung, Moon-Kyung;Kim, Jun-Young;Chung, Choong-Ki
Journal of the Korean Geotechnical Society
/
v.26
no.7
/
pp.161-170
/
2010
For the development of load and resistance factor design, reliability analysis is required to calibrate resistance factors in the framework of reliability theory. The distribution of measured-to-predicted pile resistance ratio was obrained based on only the results of load tests conducted to failure for the assessment of uncertainty regarding pile resistance and used in the conventional reliability analysis. In other words, successful pile load test (piles resisted twice their design loads without failure) results were discarded, and therefore, were not reflected in the reliability analysis. In this paper, a new systematic method based on Bayesian theory is used to update reliability indices of driven steel pipe piles by adding more proof pile load test results, even not conducted to failure, to the prior distribution of pile resistance ratio. Fifty seven static pile load tests performed to failure in Korea were compiled for the construction of prior distribution of pile resistance ratio. The empirical method proposed by Meyerhof is used to calculate the predicted pile resistance. Reliability analyses were performed using the updated distribution of pile resistance ratio. The challenge of this study is that the distribution updates of pile resistance ratio are possible using the load test results even not conducted to failure, and that Bayesian updates are most effective when limited data are available for reliability analysis.
Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
/
v.7
no.2
/
pp.267-277
/
2017
One of fundamental problems in developing robust distributed services is how to achieve distributed consensus agreeing some data values that should be shared among participants in a distributed service. As one of algorithms for distributed consensus, Raft is known as a simple and understandable algorithm by decomposing the distributed consensus problem into three subproblems(leader election, log replication and safety). But, the algorithm dose not mention any types of dynamic configuration of participant peers such as adding new peers to a consensus group or deleting peers from the group. In this paper, we present a new consensus algorithm named Raft-D, which supports the dynamic configuration of participant peers by extending the Raft algorithm. For this, Raft-D manages the additional information maintained by participant nodes, and provides a technique to check the connection status of the nodes belonging to the consensus group. Based on the technique, Raft-D defines conditions and states to deal with adding new peers to the consensus group or deleting peers from the group. Based on those conditions and states, Raft-D performs the dynamic configuration process for a consensus group through the log update mechanism of the Raft algorithm.
KSCE Journal of Civil and Environmental Engineering Research
/
v.26
no.3D
/
pp.409-416
/
2006
Real-time traveler information disseminated through Variable Message Signs (VMS) is known to have effects on driver route choice decisions. In the past, many studies have attempted to optimize the system performance using VMS message content as the primary control variable of driver route choice. This research proposes a VMS information provision optimization model which searches the best combination of VMS message contents and display sequence to minimize the total travel time on a highway network considered. The driver route choice models under VMS information provision are developed using a stated preference (SP) survey data in order to realistically capture driver response behavior. The genetic algorithm (GA) is used to find the optimal VMS information provision strategies which consists of the VMS message contents and the sequence of message display. In the process of the GA module, the system performance is measured using micro traffic simulation. The experiment results highlight the capability of the proposed model to search the optimal solution in an efficient way. The results show that the traveler information conveyed via VMS can reduce the total travel time on a highway network. They also suggest that as the frequency of VMS message update gets shorter, a smaller number of VMS message contents performs better to reduce the total travel time, all other things being equal.
Fourth Industrial Revolution and COVID-19 pandemic have boosted the use of Government 24 app for public service complaints in the era of non-face-to-face interactions. there has been a growing influx of complaints and improvement demands from users of public apps. Furthermore, systematic management of public apps is deemed necessary. The aim of this study is to analyze the grievances of Government 24 app users, understand the current dissatisfaction among citizens, and propose potential improvements. Data were collected from the Google Play Store from May 2, 2013, to June 30, 2023, comprising a total of 6,344 records. Among these, 1,199 records with a rating of 1 and at least one 'thumbs-up' were used for topic modeling analysis. The analysis revealed seven topics: 'Issues with certificate issuance,' 'Website functionality and UI problems,' 'User ID-related issues,' 'Update problems,' 'Government employee app management issues,' 'Budget wastage concerns ((It's not worth even a single star) or (It's a waste of taxpayers' money)),' and 'Password-related problems.' Furthermore, the overall trend of these topics showed an increase until 2021, a slight decrease in 2022, but a resurgence in 2023, underscoring the urgency of updates and management. We hope that the results of this study will contribute to the development and management of public apps that satisfy citizens in the future.
Journal of the Institute of Electronics Engineers of Korea SD
/
v.42
no.4
s.334
/
pp.19-28
/
2005
In this paper, we proposed a parallel fast 2-D discrete wavelet transform hardware architecture based on lifting scheme. The proposed architecture improved the 2-D processing speed, and reduced internal memory buffer size. The previous lifting scheme based parallel 2-D wavelet transform architectures were consisted with row direction and column direction modules, which were pair of prediction and update filter module. In 2-D wavelet transform, column direction processing used the row direction results, which were not generated in column direction order but in row direction order, so most hardware architecture need internal buffer memory. The proposed architecture focused on the reducing of the internal memory buffer size and the total calculation time. Reducing the total calculation time, we proposed a 4-way data flow scheduling and memory based parallel hardware architecture. The 4-way data flow scheduling can increase the row direction parallel performance, and reduced the initial latency of starting of the row direction calculation. In this hardware architecture, the internal buffer memory didn't used to store the results of the row direction calculation, while it contained intermediate values of column direction calculation. This method is very effective in column direction processing, because the input data of column direction were not generated in column direction order The proposed architecture was implemented with VHDL and Altera Stratix device. The implementation results showed overall calculation time reduced from $N^2/2+\alpha$ to $N^2/4+\beta$, and internal buffer memory size reduced by around $50\%$ of previous works.
Kim, Jae-Il;Im, Jeong-Jin;Kim, Jin-Eui;Kim, Hyun-Joo
The Korean Journal of Nuclear Medicine Technology
/
v.15
no.1
/
pp.29-33
/
2011
Background and Purpose: Uniformity is the one of the important quality control features with respect to gamma cameras. To maintain adequate uniformity, we must acquire suitable flood table (=flood map) data because the flood table effects energy, and the type or dose of input radiation. Therefore, in this study we evaluated the difference in uniformity when uniformity does not match between the type of input radiation and the flood table data or collimator type. Subjects and Methods: For input radiation, we prepared 370 MBq of $^{57}Co$, $^{99m}Tc$, and $^{201}Tl$. Using SKYLight (Philips) and Infinia gamma cameras (GE), we acquired nine uniformity data that were corrected by technetium, cobalt flood table and did not corrected image for the three sources. Additionally, we acquired two uniformity images with a collimator that were corrected by intrinsic and extrinsic flood tables. Using this data, we evaluated and compared the uniformity values. Results: In the case of the SKYLight gamma camera, the uniformities of the images that matched between the input radiation and flood table with respect to $^{99m}Tc$ and $^{57}Co$ were better than the unmatched uniformity (3.96% vs. 5.69% ; 4.9% vs. 5.91%). However, because there was no thallium flood table, the uniformities of images at Tl were significantly incorrect (7.49%, 7.03%). The uniformities of the Infinia gamma camera had the same pattern as the SKYLight gamma camera (3.7% vs. 4.5%). Moreover, the uniformity of the $^{99m}Tc$ image acquired with a collimator and corrected by an extrinsic flood table was better than the intrinsic flood table (3.96% vs. 6.28%). Conclusion: Correcting an image by a suitable flood table can help achieve better uniformity for a gamma camera. Therefore, we have to acquire images with suitable uniformity correction, and update the flood table periodically. Whenever we acquire a nuclear medicine image, we always have to check the appropriate flood table according to the acquired condition.
Purpose: The purpose of this review Is to provide an update on novel radiation treatments for head and neck cancer Recent Findings: Despite the remarkable advances In chemotherapy and radiotherapy techniques, the management of advanced head and neck cancer remains challenging. Epidermal growth factor receptor (EGFR) Is an appealing target for novel therapies In head and neck cancer because not only EGFR activation stimulates many important signaling pathways associated with cancer development and progression, and importantly, resistance to radiation. Furthermore, EGFR overexpression Is known to be portended for a worse outcome in patients with advanced head and neck cancer. Two categories of compounds designed to abrogate EGFR signaling, such as monoclonal antibodies (Cetuxlmab) and tyrosine kinase inhibitors (ZD1839 and 051-774) have been assessed and have been most extensively studied In preclinical models and clinical trials. Additional TKIs In clinical trials include a reversible agent, Cl-1033, which blocks activation of all erbB receptors. Encouraging preclinical data for head and neck cancers resulted In rapid translation Into the clinic. Results from Initial clinical trials show rather surprisingly that only minority of patients benefited from EGFR inhibition as monotherapy or In combination with chemotherapy. In this review, we begin with a brief summary of erbB- mediated signal transduction. Subsequently, we present data on prognostic-predictive value of erbB receptor expression in HNC followed by preclinlcal and clinical data on the role of EGFR antagonists alone or in combination with radiation In the treatment of HNC. Finally, we discuss the emerging thoughts on resistance to EGFR biockade and efforts In the development of multiple-targeted therapy for combination with chemotherapy or radiation. Current challenges for investigators are to determine (1 ) who will benefit from targeted agents and which agents are most appropriate to combine with radiation and/or chemotherapy, (2) how to sequence these agents with radiation and/or cytotoxlc compounds, (3) reliable markers for patient selection and verification of effective blockade of signaling in vivo, and (4) mechanisms behind intrinsic or acquired resistance to targeted agents to facilitate rational development of multi-targeted therapy, Other molecuiar-targeted approaches In head and neck cancer were briefly described, Including angloenesis Inhibitors, farnesyl transferase inhibitors, cell cycle regulators, and gene therapy Summary: Novel targeted theraples are highly appealing in advanced head and neck cancer, and the most premising strategy to use them Is a matter of intense Investigation.
We propose a single Index approach for subsequence matching that supports moving average transform of arbitrary order in time-series databases. Using the single index approach, we can reduce both storage space overhead and index maintenance overhead. Moving average transform is known to reduce the effect of noise and has been used in many areas such as econometrics since it is useful in finding overall trends. However, the previous research results have a problem of occurring index overhead both in storage space and in update maintenance since tile methods build several indexes to support arbitrary orders. In this paper, we first propose the concept of poly-order moving average transform, which uses a set of order values rather than one order value, by extending the original definition of moving average transform. That is, the poly-order transform makes a set of transformed windows from each original window since it transforms each window not for just one order value but for a set of order values. We then present theorems to formally prove the correctness of the poly-order transform based subsequence matching methods. Moreover, we propose two different subsequence matching methods supporting moving average transform of arbitrary order by applying the poly-order transform to the previous subsequence matching methods. Experimental results show that, for all the cases, the proposed methods improve performance significantly over the sequential scan. For real stock data, the proposed methods improve average performance by 22.4${\~}$33.8 times over the sequential scan. And, when comparing with the cases of building each index for all moving average orders, the proposed methods reduce the storage space required for indexes significantly by sacrificing only a little performance degradation(when we use 7 orders, the methods reduce the space by up to 1/7.0 while the performance degradation is only $9\%{\~}42\%$ on the average). In addition to the superiority in performance, index space, and index maintenance, the proposed methods have an advantage of being generalized to many sorts of other transforms including moving average transform. Therefore, we believe that our work can be widely and practically used in many sort of transform based subsequence matching methods.
본 웹사이트에 게시된 이메일 주소가 전자우편 수집 프로그램이나
그 밖의 기술적 장치를 이용하여 무단으로 수집되는 것을 거부하며,
이를 위반시 정보통신망법에 의해 형사 처벌됨을 유념하시기 바랍니다.
[게시일 2004년 10월 1일]
이용약관
제 1 장 총칙
제 1 조 (목적)
이 이용약관은 KoreaScience 홈페이지(이하 “당 사이트”)에서 제공하는 인터넷 서비스(이하 '서비스')의 가입조건 및 이용에 관한 제반 사항과 기타 필요한 사항을 구체적으로 규정함을 목적으로 합니다.
제 2 조 (용어의 정의)
① "이용자"라 함은 당 사이트에 접속하여 이 약관에 따라 당 사이트가 제공하는 서비스를 받는 회원 및 비회원을
말합니다.
② "회원"이라 함은 서비스를 이용하기 위하여 당 사이트에 개인정보를 제공하여 아이디(ID)와 비밀번호를 부여
받은 자를 말합니다.
③ "회원 아이디(ID)"라 함은 회원의 식별 및 서비스 이용을 위하여 자신이 선정한 문자 및 숫자의 조합을
말합니다.
④ "비밀번호(패스워드)"라 함은 회원이 자신의 비밀보호를 위하여 선정한 문자 및 숫자의 조합을 말합니다.
제 3 조 (이용약관의 효력 및 변경)
① 이 약관은 당 사이트에 게시하거나 기타의 방법으로 회원에게 공지함으로써 효력이 발생합니다.
② 당 사이트는 이 약관을 개정할 경우에 적용일자 및 개정사유를 명시하여 현행 약관과 함께 당 사이트의
초기화면에 그 적용일자 7일 이전부터 적용일자 전일까지 공지합니다. 다만, 회원에게 불리하게 약관내용을
변경하는 경우에는 최소한 30일 이상의 사전 유예기간을 두고 공지합니다. 이 경우 당 사이트는 개정 전
내용과 개정 후 내용을 명확하게 비교하여 이용자가 알기 쉽도록 표시합니다.
제 4 조(약관 외 준칙)
① 이 약관은 당 사이트가 제공하는 서비스에 관한 이용안내와 함께 적용됩니다.
② 이 약관에 명시되지 아니한 사항은 관계법령의 규정이 적용됩니다.
제 2 장 이용계약의 체결
제 5 조 (이용계약의 성립 등)
① 이용계약은 이용고객이 당 사이트가 정한 약관에 「동의합니다」를 선택하고, 당 사이트가 정한
온라인신청양식을 작성하여 서비스 이용을 신청한 후, 당 사이트가 이를 승낙함으로써 성립합니다.
② 제1항의 승낙은 당 사이트가 제공하는 과학기술정보검색, 맞춤정보, 서지정보 등 다른 서비스의 이용승낙을
포함합니다.
제 6 조 (회원가입)
서비스를 이용하고자 하는 고객은 당 사이트에서 정한 회원가입양식에 개인정보를 기재하여 가입을 하여야 합니다.
제 7 조 (개인정보의 보호 및 사용)
당 사이트는 관계법령이 정하는 바에 따라 회원 등록정보를 포함한 회원의 개인정보를 보호하기 위해 노력합니다. 회원 개인정보의 보호 및 사용에 대해서는 관련법령 및 당 사이트의 개인정보 보호정책이 적용됩니다.
제 8 조 (이용 신청의 승낙과 제한)
① 당 사이트는 제6조의 규정에 의한 이용신청고객에 대하여 서비스 이용을 승낙합니다.
② 당 사이트는 아래사항에 해당하는 경우에 대해서 승낙하지 아니 합니다.
- 이용계약 신청서의 내용을 허위로 기재한 경우
- 기타 규정한 제반사항을 위반하며 신청하는 경우
제 9 조 (회원 ID 부여 및 변경 등)
① 당 사이트는 이용고객에 대하여 약관에 정하는 바에 따라 자신이 선정한 회원 ID를 부여합니다.
② 회원 ID는 원칙적으로 변경이 불가하며 부득이한 사유로 인하여 변경 하고자 하는 경우에는 해당 ID를
해지하고 재가입해야 합니다.
③ 기타 회원 개인정보 관리 및 변경 등에 관한 사항은 서비스별 안내에 정하는 바에 의합니다.
제 3 장 계약 당사자의 의무
제 10 조 (KISTI의 의무)
① 당 사이트는 이용고객이 희망한 서비스 제공 개시일에 특별한 사정이 없는 한 서비스를 이용할 수 있도록
하여야 합니다.
② 당 사이트는 개인정보 보호를 위해 보안시스템을 구축하며 개인정보 보호정책을 공시하고 준수합니다.
③ 당 사이트는 회원으로부터 제기되는 의견이나 불만이 정당하다고 객관적으로 인정될 경우에는 적절한 절차를
거쳐 즉시 처리하여야 합니다. 다만, 즉시 처리가 곤란한 경우는 회원에게 그 사유와 처리일정을 통보하여야
합니다.
제 11 조 (회원의 의무)
① 이용자는 회원가입 신청 또는 회원정보 변경 시 실명으로 모든 사항을 사실에 근거하여 작성하여야 하며,
허위 또는 타인의 정보를 등록할 경우 일체의 권리를 주장할 수 없습니다.
② 당 사이트가 관계법령 및 개인정보 보호정책에 의거하여 그 책임을 지는 경우를 제외하고 회원에게 부여된
ID의 비밀번호 관리소홀, 부정사용에 의하여 발생하는 모든 결과에 대한 책임은 회원에게 있습니다.
③ 회원은 당 사이트 및 제 3자의 지적 재산권을 침해해서는 안 됩니다.
제 4 장 서비스의 이용
제 12 조 (서비스 이용 시간)
① 서비스 이용은 당 사이트의 업무상 또는 기술상 특별한 지장이 없는 한 연중무휴, 1일 24시간 운영을
원칙으로 합니다. 단, 당 사이트는 시스템 정기점검, 증설 및 교체를 위해 당 사이트가 정한 날이나 시간에
서비스를 일시 중단할 수 있으며, 예정되어 있는 작업으로 인한 서비스 일시중단은 당 사이트 홈페이지를
통해 사전에 공지합니다.
② 당 사이트는 서비스를 특정범위로 분할하여 각 범위별로 이용가능시간을 별도로 지정할 수 있습니다. 다만
이 경우 그 내용을 공지합니다.
제 13 조 (홈페이지 저작권)
① NDSL에서 제공하는 모든 저작물의 저작권은 원저작자에게 있으며, KISTI는 복제/배포/전송권을 확보하고
있습니다.
② NDSL에서 제공하는 콘텐츠를 상업적 및 기타 영리목적으로 복제/배포/전송할 경우 사전에 KISTI의 허락을
받아야 합니다.
③ NDSL에서 제공하는 콘텐츠를 보도, 비평, 교육, 연구 등을 위하여 정당한 범위 안에서 공정한 관행에
합치되게 인용할 수 있습니다.
④ NDSL에서 제공하는 콘텐츠를 무단 복제, 전송, 배포 기타 저작권법에 위반되는 방법으로 이용할 경우
저작권법 제136조에 따라 5년 이하의 징역 또는 5천만 원 이하의 벌금에 처해질 수 있습니다.
제 14 조 (유료서비스)
① 당 사이트 및 협력기관이 정한 유료서비스(원문복사 등)는 별도로 정해진 바에 따르며, 변경사항은 시행 전에
당 사이트 홈페이지를 통하여 회원에게 공지합니다.
② 유료서비스를 이용하려는 회원은 정해진 요금체계에 따라 요금을 납부해야 합니다.
제 5 장 계약 해지 및 이용 제한
제 15 조 (계약 해지)
회원이 이용계약을 해지하고자 하는 때에는 [가입해지] 메뉴를 이용해 직접 해지해야 합니다.
제 16 조 (서비스 이용제한)
① 당 사이트는 회원이 서비스 이용내용에 있어서 본 약관 제 11조 내용을 위반하거나, 다음 각 호에 해당하는
경우 서비스 이용을 제한할 수 있습니다.
- 2년 이상 서비스를 이용한 적이 없는 경우
- 기타 정상적인 서비스 운영에 방해가 될 경우
② 상기 이용제한 규정에 따라 서비스를 이용하는 회원에게 서비스 이용에 대하여 별도 공지 없이 서비스 이용의
일시정지, 이용계약 해지 할 수 있습니다.
제 17 조 (전자우편주소 수집 금지)
회원은 전자우편주소 추출기 등을 이용하여 전자우편주소를 수집 또는 제3자에게 제공할 수 없습니다.
제 6 장 손해배상 및 기타사항
제 18 조 (손해배상)
당 사이트는 무료로 제공되는 서비스와 관련하여 회원에게 어떠한 손해가 발생하더라도 당 사이트가 고의 또는 과실로 인한 손해발생을 제외하고는 이에 대하여 책임을 부담하지 아니합니다.
제 19 조 (관할 법원)
서비스 이용으로 발생한 분쟁에 대해 소송이 제기되는 경우 민사 소송법상의 관할 법원에 제기합니다.
[부 칙]
1. (시행일) 이 약관은 2016년 9월 5일부터 적용되며, 종전 약관은 본 약관으로 대체되며, 개정된 약관의 적용일 이전 가입자도 개정된 약관의 적용을 받습니다.