• Title/Summary/Keyword: coding flow

Search Result 91, Processing Time 0.025 seconds

Developing of New a Tensorflow Tutorial Model on Machine Learning : Focusing on the Kaggle Titanic Dataset (텐서플로우 튜토리얼 방식의 머신러닝 신규 모델 개발 : 캐글 타이타닉 데이터 셋을 중심으로)

  • Kim, Dong Gil;Park, Yong-Soon;Park, Lae-Jeong;Chung, Tae-Yun
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.14 no.4
    • /
    • pp.207-218
    • /
    • 2019
  • The purpose of this study is to develop a model that can systematically study the whole learning process of machine learning. Since the existing model describes the learning process with minimum coding, it can learn the progress of machine learning sequentially through the new model, and can visualize each process using the tensor flow. The new model used all of the existing model algorithms and confirmed the importance of the variables that affect the target variable, survival. The used to classification training data into training and verification, and to evaluate the performance of the model with test data. As a result of the final analysis, the ensemble techniques is the all tutorial model showed high performance, and the maximum performance of the model was improved by maximum 5.2% when compared with the existing model using. In future research, it is necessary to construct an environment in which machine learning can be learned regardless of the data preprocessing method and OS that can learn a model that is better than the existing performance.

Two Flow Control Techniques for Teleconferencing over the Internet (인터넷상에서 원격회의를 위한 두 가지 흐름 제어 기법)

  • Na, Seung-Gu;Go, Min-Su;An, Jong-Seok
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.8
    • /
    • pp.975-983
    • /
    • 1999
  • 최근 네트워크의 속도가 빨라지고 멀티미디어 데이터를 다루기 위한 기술들이 개발됨에 따라 많은 멀티미디어 응용 프로그램들이 인터넷에 등장하고 있다. 그러나 이들 응용프로그램들은 수신자에게 전송되는 영상.음성의 품질이 낮기 때문에 기대만큼 빠르게 확산되지 못하고 있다. 영상.음성의 품질이 낮은 이유는 현재 인터넷이 실시간 응용프로그램이 요구하는 만큼 빠르고 신뢰성 있게 데이터를 전송할 수 없기 때문이다. 현재 인터넷의 내부구조를 바꾸지 않고 품질을 높이기 위해 많은 연구들이 진행되고 있는데 그 중 하나는 동적으로 변화하는 인터넷의 상태에 맞게 멀티캐스트 트래픽의 전송율을 조절하는 종단간의 흐름제어이다. 본 논문은 기존의 흐름제어 기법인 IVS와 RLM의 성능을 개선시키기 위한 두 가지 흐름제어 기법을 소개한다. IVS는 송신자가 주기적으로 측정된 네트워크 상태에 따라 전송율을 일정하게 조절한다. 송신자가 하나의 데이타 스트림을 생성하는 IVS와는 달리 RLM에서는 송신자가 계층적 코딩에 의하여 생성된 여러개의 데이타 스트림을 전송하고 각 수신자는 자신의 네트워크 상태에 맞게 데이타 스트림을 선택하는 기법이다. 그러나 IVS는 송신자가 전송율을 일정하게 증가시키고, RLM은 각자의 네트워크 상태를 고려하지 않고 임의의 시간에 하나 이상의 데이타 스트림을 받기 때문에 성능을 저하시킬 수 있다. 본 논문에서는 TCP-like IVS와 Adaptive RLM이라는 두 가지 새로운 기법을 소개한다. TCP-like IVS는 송신자가 전송율을 동적으로 결정하고, Adaptive RLM은 하나 이상의 데이타 스트림을 받기 위해 적당한 시간을 선택할 수 있다. 본 논문에서는 시뮬레이션을 통해 여러 가지 네트워크 구조에서 두 가지 방식이 기존의 방식에 비하여 더욱 높은 대역폭 이용율과 10~20% 정도 적은 패킷손실율을 이룬다는 것을 보여준다.Abstract Nowadays, many multimedia applications for the Internet are introduced as the network gets faster and many techniques manipulating multimedia data are developed. These multimedia applications, however, do not spread widely and are not fast as expected at their introduction time due to the poor quality of image and voice delivered at receivers. The poor quality is mainly attributed to that the current Internet can not carry data as fast and reliably as the real-time applications require. To improve the quality without modifying the internal structure of the current Internet, many researches are conducted. One of them is an end-to-end flow control of multicast traffic adapting the sending rate to the dynamically varying Internet state. This paper proposes two flow-control techniques which can improve the performance of the two conventional techniques; IVS and RLM. IVS statically adjusts the sending rate based on the network state periodically estimated. Differently from IVS in which a sender produces one single data stream, in RLM a sender transmits several data streams generated by the layered coding scheme and each receiver selects some data streams based on its own network state. The more data streams a receiver receives, the better quality of image or voice the receiver can produce. The two techniques, however, can degrade the performance since IVS increases its sending rate statically and RLM accepts one more data stream at arbitrary time regardless of the network state respectively. We introduce two new techniques called TCP-like IVS and Adaptive RLM; TCP-like IVS can determine the sending rate dynamically and Adaptive RLM can select the right time to add one more data stream. Our simulation experiments show that two techniques can achieve better utilization and less packet loss by 10-20% over various network topologies.

Diagonalized Approximate Factorization Method for 3D Incompressible Viscous Flows (대각행렬화된 근사 인수분해 기법을 이용한 3차원 비압축성 점성 흐름 해석)

  • Paik, Joongcheol
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.31 no.3B
    • /
    • pp.293-303
    • /
    • 2011
  • An efficient diagonalized approximate factorization algorithm (DAF) is developed for the solution of three-dimensional incompressible viscous flows. The pressure-based, artificial compressibility (AC) method is used for calculating steady incompressible Navier-Stokes equations. The AC form of the governing equations is discretized in space using a second-order-accurate finite volume method. The present DAF method is applied to derive a second-order accurate splitting of the discrete system of equations. The primary objective of this study is to investigate the computational efficiency of the present DAF method. The solutions of the DAF method are evaluated relative to those of well-known four-stage Runge-Kutta (RK4) method for fully developed and developing laminar flows in curved square ducts and a laminar flow in a cavity. While converged solutions obtained by DAF and RK4 methods on the same computational meshes are essentially identical because of employing the same discrete schemes in space, both algorithms shows significant discrepancy in the computing efficiency. The results reveal that the DAF method requires substantially at least two times less computational time than RK4 to solve all applied flow fields. The increase in computational efficiency of the DAF methods is achieved with no increase in computational resources and coding complexity.

Alfalfa xenomiR-162 targets G protein subunit gamma 11 to regulate milk protein synthesis in bovine mammary epithelial cells

  • Guizhi Meng;Hongjuan Duan;Jingying Jia;Baobao Liu;Yun Ma;Xiaoyan Cai
    • Animal Bioscience
    • /
    • v.37 no.3
    • /
    • pp.509-521
    • /
    • 2024
  • Objective: It was shown that microRNAs (miRNAs) play an important role in milk protein synthesis. However, the post-transcriptional regulation of casein expression by exogenous miRNA (xeno-miRNAs) in ruminants remains unclear. This study explores the regulatory roles of alfalfa xeno-miR162 on casein synthesis in bovine mammary epithelial cells (bMECs). Methods: The effects of alfalfa xenomiR-162 and G protein subunit gamma 11 (GNG11) on proliferation and milk protein metabolism of bMECs were detected by 5-Ethynyl-2'-Deoxyuridine (EdU) staining, flow cytometry, cell counting kit-8 (CCK-8), enzyme-linked immunosorbent assay, quantitative real-time polymerase chain reaction (qRT-PCR), and Western blot. Dual-luciferase reporter assay was used to verify the targeting relationship between GNG11 and xenomiR-162. Results: Results showed that over-expression of xenomiR-162 inhibited cell proliferation but promoted apoptosis, which also up-regulated the expression of several casein coding genes, including CSN1S1, CSN1S2, and CSN3, while decreasing the expression of CSN2. Furthermore, the targeting relationship between GNG11 and xenomiR-162 was determined, and it was confirmed that GNG11 silencing also inhibited cell proliferation but promoted apoptosis and reduced the expression of casein coding genes and genes related to the mammalian target of rapamycin (mTOR) pathway. Conclusion: Alfalfa xenomiR-162 appears to regulate bMECs proliferation and milk protein synthesis via GNG11 in the mTOR pathway, suggesting that this xeno-miRNA could be harnessed to modulate CSN3 expression in dairy cows, and increase κ-casein contents in milk.

Down-regulation of Long Non-coding RNA TUG1 Inhibits Osteosarcoma Cell Proliferation and Promotes Apoptosis

  • Zhang, Qiang;Geng, Pei-Liang;Yin, Pei;Wang, Xiao-Lin;Jia, Jin-Peng;Yao, Jie
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.14 no.4
    • /
    • pp.2311-2315
    • /
    • 2013
  • Objective: To investigate the expression level of TUG1 and one of its transcript variants (n377360) in osteosarcoma cells and assess the role of TUG1 in proliferation and apoptosis in the U2OS cell line. Methods: TUG1 and n377360 expression levels in patients with osteosarcomas and the U2OS human osteosarcoma cell line were evaluated using real-time quantitative PCR. U2OS cells were transected with TUG1 and n377360 siRNA or non-targeting siRNA. MTS was performed to assess the cell proliferation and flow cytometry was applied to analyze apoptosis. Results: We found significantly higher TUG1 and n377360 expression levels in osteosarcoma tissues compared with matched non-tumorous tissues. In line with this, suppression of TUG1 and n377360 expression by siRNA significantly impaired the cell proliferation potential of osteosarcoma cells. Furthermore, inhibition of TUG1 expression significantly promoted osteosarcoma cell apoptosis. Conclusions: The overexpression of TUG1 and n377360 in osteosarcoma specimens and the functional role of TUG1 and n377360 regarding cell proliferation and apoptosis in an osteosarcoma cell line provided evidence that the use of TUG1 or n377360 may be a viable but an as yet unexplored therapeutic strategy in tumors that over express these factors.

Reengineering of the Data Collection Process for Discharge Abstract Database (퇴원환자 진료정보 DB의 데이터 수집 과정 재설계)

  • Hong, Joon Hyun;Choi, Kwisook;Lee, Eun Mee
    • Quality Improvement in Health Care
    • /
    • v.7 no.1
    • /
    • pp.106-116
    • /
    • 2000
  • Background : Severance Hospital is an university hospital which has 1,580 beds. A LAN system was installed in the Medical Record Department in 1992 and discharge abstract data have been added to the discharge abstract database(DB) The previous work flow in the Medical Record Department had 5 levels: 1) chart collection from wards, 2) assembling, 3) abstracting data from medical record on worksheet by 2 RRAs, 4) checking deficiencies and coding diagnosis and procedures by 4 RRAs, 5) inputting the data into the discharge abstract data base by 1 RRA. The average processing time took 19.3 days from the patient discharge date. It had the production of monthly statistical report delayed. Besides, it caused the users in the hospital to complain. Methods : A CQI team was organized to find a way to shorten the processing time less than 10 days. The team identified the factors making the processing time long and integrated three levels from the 3rd level into one. Each of 7 RRAs performed the integrated level on her workstation instead of taking one of three separate levels. The comparison of processing time before and after the changes was made with 3'846 discharges of April, 1999 and 4,189 discharges of August, 1999. Results : The average processing time was shortened from 19.3 days to 8.7 days. Especially the integrated level took only 3.6 days, compared with 12.3 days before the change. The percentage of finishing up the whole processing within 10 days from discharge was increased up to 77.6%, which was 2.4% before the integration. The prevalence of error in data input was not increased in the new method. Conclusions : The integrated processing method has the following advantages: 1) the expedition of production of monthly statistical report, 2) the increase of utilizing rate of dischare abstract data by Billing Dept, Emergency Room, QI Dept., etc., 3) the improvement of intradepartmental work follow, 4) the enhancement of medical record quality by checking the deficiencies earlier than before.

  • PDF

Analysis of Information Education Related Theses Using R Program (R을 활용한 정보교육관련 논문 분석)

  • Park, SunJu
    • Journal of The Korean Association of Information Education
    • /
    • v.21 no.1
    • /
    • pp.57-66
    • /
    • 2017
  • Lately, academic interests in big data analysis and social network has been prominently raised. Various academic fields are involved in this social network based research trend, which is, social network has been actively used as the research topic in social science field as well as in natural science field. Accordingly, this paper focuses on the text analysis and the following social network analysis with the Master's and Doctor's dissertations. The result indicates that certain words had a high frequency throughout the entire period and some words had fluctuating frequencies in different period. In detail, the words with a high frequency had a higher betweenness centrality and each period seems to have a distinctive research flow. Therefore, it was found that the subjects of the Master's and Doctor's dissertations were changed sensitively to the development of IT technology and changes in information curriculum of elementary, middle and high school. It is predicted that researches related to smart, mobile, smartphone, SNS, application, storytelling, multicultural, and STEAM, which had an increased frequency in period 4, would be continuously conducted. Moreover, the topics of robots, programming, coding, algorithms, creativity, interaction, and privacy will also be studied steadily.

Dynamic Analysis based on AOP for Checking Security Vulnerability (보안 취약점 검사를 위한 AOP 기반의 동적 분석)

  • Seo, Kwang-Ik;Choi, Eun-Man
    • Journal of KIISE:Software and Applications
    • /
    • v.37 no.10
    • /
    • pp.773-778
    • /
    • 2010
  • OWASP announced most of vulnerabilities result from the data injection by user in 2010 after 2007. Because the contaminated input data is determined at runtime, those data should be checked dynamically. To analyze data and its flow at runtime, dynamic analysis method usually inserts instrument into source code. Intermediate code insertion makes it difficult to manage and extend the code so that the instrument code would be spreaded out according to increase of analysis coverage and volume of code under analysis. In addition, the coupling gets strong between instrument modules and target modules. Therefore developers will struggle against modify or extend the analysis code as instrument. To solve these problem, this paper defines vulnerabilities as a concern using AOP, and suggest the flexible and extensible analysis method to insertion and deletion without increase of coupling.

A Study on Optimal Operation Method of Multiple Microgrid System Considering Line Flow Limits (선로제약을 고려한 복수개의 마이크로그리드 최적운영 기법에 관한 연구)

  • Park, Si-Na;An, Jeong-Yeol
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.19 no.7
    • /
    • pp.258-264
    • /
    • 2018
  • This paper presents application of a differential search (DS) meta-heuristic optimization algorithm for optimal operation of a micro grid system. The DS algorithm simulates the Brownian-like random-walk movement used by an organism to migrate. The micro grid system consists of a wind turbine, a diesel generator, a fuel cell, and a photovoltaic system. The wind turbine generator is modeled by considering the characteristics of variable output. Optimization is aimed at minimizing the cost function of the system, including fuel costs and maximizing fuel efficiency to generate electric power. The simulation was applied to a micro grid system only. This study applies the DS algorithm with excellence and efficiency in terms of coding simplicity, fast convergence speed, and accuracy in the optimal operation of micro grids based on renewable energy resources, and we compared its optimum value to other algorithms to prove its superiority.

A Study of Web Forensics Algorithm that used Log History Analysis (로그 히스토리 분석을 사용한 웹 포렌식 알고리즘 연구)

  • Jeung, Jeung-Ki;Park, Dea-Woo
    • KSCI Review
    • /
    • v.14 no.2
    • /
    • pp.245-254
    • /
    • 2006
  • Web Forensics algorithm used to an extraction of technical Web Forensics data to be adopted to proof data regarding a crime cyber a computer at data of a great number of log History is an essential element. Propose Web Forensics algorithm, and design at these papers, and try to implement in a Web server system of an actual company. And make the Web dispatch Loging system configuration experiment that applied integrity regarding Web log History information or authentication regarding an information source. Design Web Forensics algorithm and the Flow which used for Web log History analyses at server of e-mail, webmail, HTTP (Web BBS, Blog etc.), FTP, Telnet and messengers (MSN, NateOn, Yahoo, DaumTouch. BuddyBuddy, MsLee, AOL, SoftMe) of a company, and implement through coding. Therefore have a purpose of these paper to will contribute in scientific technical development regarding a crime cyber a computer through Web Forensics.

  • PDF