Deep learning model is a kind of neural networks that allows multiple hidden layers. There are various deep learning architectures such as convolutional neural networks, deep belief networks and recurrent neural networks. Those have been applied to fields like computer vision, automatic speech recognition, natural language processing, audio recognition and bioinformatics where they have been shown to produce state-of-the-art results on various tasks. Among those architectures, convolutional neural networks and recurrent neural networks are classified as the supervised learning model. And in recent years, those supervised learning models have gained more popularity than unsupervised learning models such as deep belief networks, because supervised learning models have shown fashionable applications in such fields mentioned above. Deep learning models can be trained with backpropagation algorithm. Backpropagation is an abbreviation for "backward propagation of errors" and a common method of training artificial neural networks used in conjunction with an optimization method such as gradient descent. The method calculates the gradient of an error function with respect to all the weights in the network. The gradient is fed to the optimization method which in turn uses it to update the weights, in an attempt to minimize the error function. Convolutional neural networks use a special architecture which is particularly well-adapted to classify images. Using this architecture makes convolutional networks fast to train. This, in turn, helps us train deep, muti-layer networks, which are very good at classifying images. These days, deep convolutional networks are used in most neural networks for image recognition. Convolutional neural networks use three basic ideas: local receptive fields, shared weights, and pooling. By local receptive fields, we mean that each neuron in the first(or any) hidden layer will be connected to a small region of the input(or previous layer's) neurons. Shared weights mean that we're going to use the same weights and bias for each of the local receptive field. This means that all the neurons in the hidden layer detect exactly the same feature, just at different locations in the input image. In addition to the convolutional layers just described, convolutional neural networks also contain pooling layers. Pooling layers are usually used immediately after convolutional layers. What the pooling layers do is to simplify the information in the output from the convolutional layer. Recent convolutional network architectures have 10 to 20 hidden layers and billions of connections between units. Training deep learning networks has taken weeks several years ago, but thanks to progress in GPU and algorithm enhancement, training time has reduced to several hours. Neural networks with time-varying behavior are known as recurrent neural networks or RNNs. A recurrent neural network is a class of artificial neural network where connections between units form a directed cycle. This creates an internal state of the network which allows it to exhibit dynamic temporal behavior. Unlike feedforward neural networks, RNNs can use their internal memory to process arbitrary sequences of inputs. Early RNN models turned out to be very difficult to train, harder even than deep feedforward networks. The reason is the unstable gradient problem such as vanishing gradient and exploding gradient. The gradient can get smaller and smaller as it is propagated back through layers. This makes learning in early layers extremely slow. The problem actually gets worse in RNNs, since gradients aren't just propagated backward through layers, they're propagated backward through time. If the network runs for a long time, that can make the gradient extremely unstable and hard to learn from. It has been possible to incorporate an idea known as long short-term memory units (LSTMs) into RNNs. LSTMs make it much easier to get good results when training RNNs, and many recent papers make use of LSTMs or related ideas.
The objective of this study is to develop the accurate, robust and high resolution two-dimensional numerical model that solves the computationally difficult hydraulic problems, including the wave front propagation over dry bed and abrupt change in bathymetry. The developed model in this study solves the conservative form of the two-dimensional shallow water equations using an unsplit finite volume scheme and HLLC approximate Riemann solvers to compute the interface fluxes. Bed-slope term is discretized by the divergence theorem in the framework of FVM for application of unsplit scheme. Accurate and stable SGM, in conjunction with the MUSCL which is second-order-accurate both in space and time, is adopted to balance with fluxes and source terms. The exact C-property is shown to be satisfied for balancing the fluxes and the source terms. Since the spurious oscillations in second-order schemes are inherent, an efficient slope limiting technique is used to supply TVD property. The accuracy, conservation property and application of developed model are verified by comparing numerical solution with analytical solution and experimental data through the simulations of one-dimensional dam break flow without bed slope, steady transcritical flow over a hump and two-dimensional dam break flow with a constriction.
The Transactions of the Korea Information Processing Society
/
v.5
no.4
/
pp.1033-1043
/
1998
In this paper, we present an improved multicasting path assignment algorithm based on the minimum cost spanning tree. In the method presented in this paper, a multicasting path is assigned preferentially when a node to be received is found among the next degree nodes of the searching node in the multicasting path assignment of the constrained steiner tree (CST). If nodes of the legacy group exist between nodes of the new group, a new path among the nodes of new group is assigned as long as the nodes may be excluded from the new multicasting path assignment taking into consideration characteristics of nodes in the legacy group. In assigning the multicasting path additionally, where the source and destination nodes which can be set for the new multicasting path exist in the domain of identical network (local area network) and conditions for degree constraint are satisfied, a method of producing and assigning a new multicasting path is used. The results of comparison of CST with MCSTOP, MCSTOp algorithm enhanced performance capabilities about the communication cost, the propagation delay, and the computation time for the multicasting assignment paths more than CST algorithm. Further to this, research activities need study for the application of the international standard protocol(multicasting path assignment technology in the multipoint communication service (MCS) of the ITU-T T.120).
The location awareness is an important part of many ubiquitous computing systems, but a perfect location system does not exist yet in spite of many researches. Among various location tracking systems, we choose the RFID system due to its wide applications. However, the sensed RSSI signal is too sensitive to the direction of a RFID reader antenna, the orientation of a RFID tag, the human interference, and the propagation media situation. So, the existing location tracking method in spite of using the particle filter is not working well. To overcome this shortcoming, we suggest a robust location tracking method with a double layered structure, where the first layer coarsely estimates a tag's location in the block level using a regression technique or the SVM classifier and the second layer precisely computes the tag's location, velocity and direction using the particle filter technique. Its layered structure improves the location tracking performance by restricting the moving degree of hidden variables. Many extensive experiments show that the proposed location tracking method is so precise and robust to be a good choice for implementing the location estimation of a person or an object in the ubiquitous computing. We also validate the usefulness of the proposed location tracking method by implementing it for a real-time people monitoring system in a noisy and complicate workplace.
Journal of the Institute of Electronics and Information Engineers
/
v.53
no.7
/
pp.17-26
/
2016
This work proposes a 12b 60MS/s 0.18um CMOS Flash-SAR ADC for various systems such as wireless communications and portable video processing systems. The proposed Flash-SAR ADC alleviates the weakness of a conventional SAR ADC that the operation speed proportionally increases with a resolution by deciding upper 4bits first with a high-speed flash ADC before deciding lower 9bits with a low-power SAR ADC. The proposed ADC removes a sampling-time mismatch by using the C-R DAC in the SAR ADC as the combined sampling network instead of a T/H circuit which restricts a high speed operation. An interpolation technique implemented in the flash ADC halves the required number of pre-amplifiers, while a switched-bias power reduction scheme minimizes the power consumption of the flash ADC during the SAR operation. The TSPC based D-flip flop in the SAR logic for high-speed operation reduces the propagation delay by 55% and the required number of transistors by half compared to the conventional static D-flip flop. The prototype ADC in a 0.18um CMOS demonstrates a measured DNL and INL within 1.33LSB and 1.90LSB, with a maximum SNDR and SFDR of 58.27dB and 69.29dB at 60MS/s, respectively. The ADC occupies an active die area of $0.54mm^2$ and consumes 5.4mW at a 1.8V supply.
An attenuated Japanese encephalitis virus (JEV) clone SA-14-14-2(Vero) was obtained through successive adaptation of a primary cell adapted strain, SA-14-14-2(PDK) to Vero cell, a continuous line of monkey kidney cells. The virus titer reached above the 107 plaque forming unit (pfu) per mL of culture supernatant with 3 passages in Vero cells and was maintained close to this level in the further passages. The optimum temperature for the virus growth was $35^{\circ}C$. Growth pattern of the virus indicated that optimum time for the virus harvest is 4 days post infection and the virus accomplished rapid initial propagation even in medium containing no serum supplement. The roller bottle (RB) system and the spinner flask (SF) system using micro-carrier (Cytodex-1) for the JEV cultivation were explored. When RB, SF, and T-flask culture system were compared, there was no significant difference in virus yield. Furthermore, the results indicated that virus could be harvested multiple times from 3 days to 9 days post infection; neither severe cytopathic effect (CPE) in the infected cells nor the decrease in the titer was observed on duration of 9 days.
Journal of the Institute of Electronics Engineers of Korea SC
/
v.43
no.5
s.311
/
pp.36-43
/
2006
In this paper we present a new high-speed parallel multiplier for Performing the bit-parallel multiplication of two polynomials in the finite fields $GF(2^m)$. Prior to construct the multiplier circuits, we consist of the MOD operation part to generate the result of bit-parallel multiplication with one coefficient of a multiplicative polynomial after performing the parallel multiplication of a multiplicand polynomial with a irreducible polynomial. The basic cells of MOD operation part have two AND gates and two XOR gates. Using these MOD operation parts, we can obtain the multiplication results performing the bit-parallel multiplication of two polynomials. Extending this process, we show the design of the generalized circuits for degree m and a simple example of constructing the multiplier circuit over finite fields $GF(2^4)$. Also, the presented multiplier is simulated by PSpice. The multiplier presented in this paper use the MOD operation parts with the basic cells repeatedly, and is easy to extend the multiplication of two polynomials in the finite fields with very large degree m, and is suitable to VLSI. Also, since this circuit has a low propagation delay time generated by the gates during operating process because of not use the memory elements in the inside of multiplier circuit, this multiplier circuit realizes a high-speed operation.
Park, Seung-Hee;Kim, Dong-Jin;Hong, Seok-Inn;Lee, Chang-Gil
Journal of the Korea Concrete Institute
/
v.23
no.2
/
pp.219-224
/
2011
In this study, a piezoelectric smart sensor that can be embedded inside of concrete structures is developed to investigate the early stage of concrete curing. A waterproof coating is used to protect the piezoelectric sensor from moistures of concrete mixture. Also, a mortar case is utilized to encapsulate the sensor to protect it from impact loads. To estimate the strength of concrete, a self-sense guided-wave actuated sensing technique is applied. In the guided wave, its velocity is varied according to the mechanical properties of concrete such as modulus of elasticity. Because modulus of elasticity directly affects the strength of concrete, the guidedwave's velocity also affects the concrete strength development. To verify the feasibility of using the proposed approach, the smart sensor was embedded into a 100MPa concrete cylinder and the self-sense guided wave is continuously measured throughout the curing process. The measurements showed that the propagation time (TOF) of the measured guided waves gradually decreased as the curing age increased. Especially, at the early age of the curing process, the variation of the TOF was very significant. Furthermore, the results showed that there is a linear relationship between the TOF of the self-sense guided waves and the strength of concrete existed. It is safe to conclude that the proposed approach can be used very effectively in monitoring of the strength development of high strength concrete structures.
Dental ceramics have good aesthetics, biocompatibility, low thermal conductivity, abrasion resistance, and color stability. However poor resistance to fracture and shrinkage during firing process have been limiting factors in their use, particularly in multiunit ceramic restorations. A new method for making all-ceramic crowns that have high strength and low processing shrinkage has been developed and is referred to as the Vita In-Ceram method. This study was performed to investigate the effect of $CeO_2$ addition in borosilicate glasses on the strength of alumina-glass composites. Porous alumina compacts were prepared by slip casting and sintered at $1,100^{\circ}C$ for 2 hours. Dense composites were made by infiltration of molten glass into partially sintered alumina at $1,140^{\circ}C$ for 4 hours. Specimens were polished sequentially from #800 to #2000 diamond disk. and the final surface finishing on the tensile side was received an additional polishing sequence through $1{\mu}m$ diamond paste. Biaxial flexure test was conducted by using ball-on-three-ball method at a crosshead speed of 0.5mm/min. To examine the microstructural aspect of crack propagation in the alumina-glass composites, Vickers-produced indentation crack was made on the tensile surface at a load of 98.0 N and dwell time of 15 sec, and the radial crack patterns were examined by an optical microscope and a scanning electron microscope. The results obtained were summarized as follows; 1. The porosity rates of partially sintered alumina decreased with the rising of firing temperature. 2. The maximum biaxial flexure strength of 423.5MPa in alumina-glass composites was obtained with an addition of 3 mol% $CeO_2$ in glass composition and strength values showed the aspect of decrease with the increase of $CeO_2$ content. 3 The biaxial flexure strength values of alumina-glass composites were decreased with rising the firing temperature. 4. Observation of the fracture surfaces of alumina-glass composites indicated that the enhancement of strength in alumina-glass composites was due to the frictional or geometrical inter-locking of rough fracture surfaces and ligamentary bridging by intact islands of materials left behind the fracture front.
Journal of the Korean Society for Nondestructive Testing
/
v.20
no.4
/
pp.276-284
/
2000
The acoustic emission (AE) behavior of reinforced concrete beams tested under flexural loading was investigated to characterize and identify the source of damage. This research was aimed at identifying the characteristic AE response associated with micro-crack development, localized crack propagation, corrosion, and debonding of the reinforcing steel. Concrete beams were prepared to isolate the damage mechanisms by using plain, notched-plain, reinforced, and corroded-reinforced specimens. The beams were tested using four-point cyclic step-loading. The AE response was analyzed to obtain key parameters such as the time history of AE events, the total number and rate of AE events, and the characteristic features of the waveform. Initial analysis of the AE signal has shown that a clear difference in the AE response is observed depending on the source of the damage. The Felicity ratio exhibited a correlation with the overall damage level, while the number of AE events during unloading can be an effective criterion to estimate the level of corrosion distress in reinforced concrete structures. Consequently, AE measurement characterization appears to provide a promising approach for estimating the level of deterioration in reinforced concrete structure.
본 웹사이트에 게시된 이메일 주소가 전자우편 수집 프로그램이나
그 밖의 기술적 장치를 이용하여 무단으로 수집되는 것을 거부하며,
이를 위반시 정보통신망법에 의해 형사 처벌됨을 유념하시기 바랍니다.
[게시일 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일부터 적용되며, 종전 약관은 본 약관으로 대체되며, 개정된 약관의 적용일 이전 가입자도 개정된 약관의 적용을 받습니다.