• Title, Summary, Keyword: L-C Network

Search Result 192, Processing Time 0.047 seconds

The Construction of AHU Control Network by Power Line Communication (전력선 통신에 의한 공기조화설비 제어네트워크 구축)

  • Kim, Myungho;Ahn, Kyochol
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.1 no.2
    • /
    • pp.7-11
    • /
    • 2008
  • In order to enhance standardization and interoperability of local level systems, AHU control network was designed with basement(8 point) and basis story(15 point) and then the network was constructed by power line communication. Each devices of AHU system were programed with neuron C of $L_{ON}W_{ORKS}$ as an open protocol. As a result of a study, each devices of the network were controlled with self dispersion process by $L_{ON}W_{ORKS}$ protocol and wiring could be reduced by power line communication.

  • PDF

APPROXIMATION ORDER TO A FUNCTION IN $C^1$[0, 1] AND ITS DERIVATIVE BY A FEEDFOWARD NEURAL NETWORK

  • Hahm, Nahm-Woo;Hong, Bum-Il
    • Journal of applied mathematics & informatics
    • /
    • v.27 no.1_2
    • /
    • pp.139-147
    • /
    • 2009
  • We study the neural network approximation to a function in $C^1$[0, 1] and its derivative. In [3], we used even trigonometric polynomials in order to get an approximation order to a function in $L_p$ space. In this paper, we show the simultaneous approximation order to a function in $C^1$[0, 1] using a Bernstein polynomial and a feedforward neural network. Our proofs are constructive.

  • PDF

Optimization of Culture Conditions and Bench-Scale Production of $_L$-Asparaginase by Submerged Fermentation of Aspergillus terreus MTCC 1782

  • Gurunathan, Baskar;Sahadevan, Renganathan
    • Journal of Microbiology and Biotechnology
    • /
    • v.22 no.7
    • /
    • pp.923-929
    • /
    • 2012
  • Optimization of culture conditions for L-asparaginase production by submerged fermentation of Aspergillus terreus MTCC 1782 was studied using a 3-level central composite design of response surface methodology and artificial neural network linked genetic algorithm. The artificial neural network linked genetic algorithm was found to be more efficient than response surface methodology. The experimental $_L$-asparaginase activity of 43.29 IU/ml was obtained at the optimum culture conditions of temperature $35^{\circ}C$, initial pH 6.3, inoculum size 1% (v/v), agitation rate 140 rpm, and incubation time 58.5 h of the artificial neural network linked genetic algorithm, which was close to the predicted activity of 44.38 IU/ml. Characteristics of $_L$-asparaginase production by A. terreus MTCC 1782 were studied in a 3 L bench-scale bioreactor.

A Study on the Integrated Management of XML and EDI Electronic Letters of Credit (EDI 방식과 XML 방식간 통합관리를 통한 전자신용장의 활성화 방안에 관한 연구)

  • Jang, Sang Sik;Ahn, Byung Soo
    • The Korean Research Institute of International Commerce and Law
    • /
    • v.58
    • /
    • pp.237-263
    • /
    • 2013
  • Traditionally, a L/C (letter of credit) has been known as a relatively low risk method of payment. This is why L/C has been used in international trade. However, L/C has a number of weak points such as high cost, long processing time, and complicated documents. Using an electronic L/C is one way to solve those weak points. In Korea, there are two types of electronic L/C. One is the EDI (Electronic Data Interchange) based L/C and the other one is the XML (Extensible Markup Language) based L/C. The former, established in 1990's, is sent from banks to the beneficiary solely through VAN (Value Added Network, KTNET) operators. On the other hand the latter, started in 2005, is sent from banks to KFTC (Korea Financial Telecommunications & Clearings Institute) for management of the L/C balance, as well as to KTNET. So far, paper L/C and EDI based L/C have been used overwhelmingly instead of XML based L/C in spite of the aforesaid disadvantages. In this paper, the authors examined empirically why the users of electronic L/C were reluctant to use XML based L/C. The results are as follows. First, the users of paper L/C were more dissatisfied than the users of electronic L/C due to many factors such as cost, the time required, and information reuse. Second, the users who have more experience with XML based L/C wanted to adopt integrated management with EDI based L/C more than the users who had not experienced XML based L/C. Third, the users who had used more than one form of L/C wanted to adopt integrated management to EDI and XML based L/C more than the users who had only used one form of L/C. Therefore, the authority for electronic L/C should consider a change of the policy from the XML based electronic L/C oriented to integrated management of the various types of L/C.

  • PDF

Architectures for Arbitrarily Connected Synchronization Networks

  • William C. Lindsey;Chen, Jeng-Hong
    • Journal of Communications and Networks
    • /
    • v.1 no.2
    • /
    • pp.89-98
    • /
    • 1999
  • In a synchronization (sync) $network^1$containing N nodes, it is shown (Theorem 1c) that an arbitrarily connected sync network & is the union of a countable set of isolated connecting sync networks${&_i,i= 1,2,.., L}, I.E., & = \bigcup_{I=1}^L&_i$ It is shown(Theorem 2e) that aconnecting sync network is the union of a set of disjoint irreducible subnetworks having one or more nodes. It is further shown(Theorem 3a) that there exists at least one closed irreducible subnetwork in $&_i$. It is further demonstrated that a con-necting sync network is the union of both a master group and a slave group of nodes. The master group is the union of closed irreducible subnetworks in $&_i$. The slave group is the union of non-colsed irre-ducible subnetworks in $&_i$. The relationships between master-slave(MS), mutual synchronous (MUS) and hierarchical MS/MUS ent-works are clearly manifested [1]. Additionally, Theorem 5 shows that each node in the slave group is accessible by at least on node in the master group. This allows one to conclude that the synchro-nization information avilable in the master group can be reliably transported to each node in the slave group. Counting and combinatorial arguments are used to develop a recursive algorithm which counts the number $A_N$ of arbitrarily connected sync network architectures in an N-nodal sync network and the number $C_N$ of isolated connecting sync network in &. EXamples for N=2,3,4,5 and 6 are provided. Finally, network examples are presented which illustrate the results offered by the theorems. The notation used and symbol definitions are listed in Appendix A.

  • PDF

Optimization of supercritical extraction of galegine from Galega officinalis L.: Neural network modeling and experimental optimization via response surface methodology

  • Davoodi, Pooya;Ghoreishi, Seyyed Mohammad;Hedayati, Ali
    • The Korean Journal of Chemical Engineering
    • /
    • v.34 no.3
    • /
    • pp.854-865
    • /
    • 2017
  • Supercritical $CO_2$ extraction of galegine from Galega officinalis L. was carried out under different operating conditions of temperature ($35-55^{\circ}C$), pressure (10-30 MPa), dynamic extraction time (30-150 min), $CO_2$ flow rate (0.5-2.5 mL/min) and constant static extraction time of 20 min. Design of experiment was by response surface methodology (RSM) using Minitab software 17. The response surface analysis accuracy was verified by the coefficient of determination ($R^2=93.4%$) along with modified coefficient of determination ($mod-R^2=87.7%$). The optimum operating conditions were found by using RSM modeling to be $42.8^{\circ}C$, 22.7 MPa, 141.5 min and 2.15 mL/min, in which the maximum galegine extraction yield of 3.3932 mg/g was obtained. Artificial neural network (ANN) using Levenberg-Marquardt backpropagation training function with six neurons in the hidden layer was implemented for the modeling of galegine extraction such that the coefficient of determination ($R^2$) was 96.6%.

Study of Parallel Network Processor using Global Cache (글로벌 캐시를 이용한 네트워크 병렬 프로세서 구조 연구)

  • Park, Jae-Won;Chung, Won-Young;Kim, Hyun-Pil;Lee, Jung-Hee;Lee, Yong-Surk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.1B
    • /
    • pp.80-85
    • /
    • 2011
  • The mount of network traffic from the Internet is increasing because of the use of Broadband Convergence Networks(BcN). Network traffic is also increasing because of the development of application, especially multimedia traffic from IPTV, VOD, and online games. This multimedia traffic not only has a huge payload but also should be considered a threat in real time. For this reason, this study examines the ways that routers distribute the bandwidth in accordance to traffic properties. To classify the property of the traffic, it is essential to analyze the application layer. However, the general network processor architecture serially processes the L2-4 and L7 layer. We propose a novel parallel network processor architecture with a global cache that processes L2-4 and L7 in parallel. To verify the proposed architecture, we simulated both of the architecture with SystemC. EEMBC and SNORT was used to measure L2-4 and L7 processing time. When multimedia traffic was entered into the network processor in the same flow, the proposed architecture showed about 85% higher performance than general architecture.

A Low-latency L2 Handoff Scheme between WiBro and cdma2000 Mobile Networks (WiBro와 cdma2000 이동통신망간 적은 지연을 위한 L2 핸드오프 방안)

  • Lee, Geon-Baik;Cho, Jin-Sung
    • The KIPS Transactions:PartC
    • /
    • v.13C no.7
    • /
    • pp.873-880
    • /
    • 2006
  • Since various networks are deployed and the most of users request higher mobility, there are many researches about the interworking between widely deployed 3G network and rapidly boarded WLAN. On the other side, WiBro is focused on as a next generation network, because many people expect that WiBro gives satisfaction about the enough mobility and mass data transmission. So the study of the integration between WiBro and cdma2000 will show better effects than the present study of the integration between WLAN and cdma2000. The L2 handoff proposed in this paper takes advantages over the existing L3 handoff scheme because it does not require the L3 procedure for the mobility unlike the L3 handoff. Through extensive computer simulations, the efficiency of the proposed scheme has been validated.

Network Reduction Method for Power System Transient Analysis ; Time-Domain Formulation Based On The Network Function (과도 상태 해석을 위한 계통 축약법 ; 계통 함수를 이용한 시간 영역 해석법)

  • Hong, J.H.;Kang, Y.C.;Cho, K.R.;Park, J.K.
    • Proceedings of the KIEE Conference
    • /
    • /
    • pp.417-421
    • /
    • 1991
  • In electromagnetic transient analysis, complex transmission system should be modelled in detail. But in large system, this full representation of power transmission system has a big burden in many sides such as computation time, modelling efforts, etc. It is very required, therefore, in electromagnetic transients studies to represent parts of a complete system in a reduced or an equivalent form. This paper develops the method from which system equivalents may be derived. The suggested method is of an essentially transient form, and allows travelling wave interaction between the equivalent and explicit transmission network to be modelled.

  • PDF