• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.2
• /
• pp.15-21
• /
• 2008

This paper discuss the sequential digital logic systems and arithmetic operation algorithms which is the important material in computer architecture using analysis and synthesis which is based on extension logic for binary logic over galois fields. In sequential digital logic systems, we construct the moore model without feedback sequential logic systems after we obtain the next state function and output function using building block T-gate. Also, we obtain each algorithms of the addition, subtraction, multiplication, division based on the finite fields mathematical properties. Especially, in case of P=2 over GF($P^m$), the proposed algorithm have a advantage which will be able to apply traditional binary logic directly.The proposed method can construct more efficiency digital logic systems because it can be extended traditional binary logic to extension logic.

• Journal of Internet Computing and Services
• /
• v.15 no.4
• /
• pp.119-124
• /
• 2014

Blind adaptive systems based on the Euclidean distance (ED) between the distribution function of the output samples and that of a set of random symbols generated at the receiver matching with the distribution function of the transmitted symbol points estimate the ED at each iteration time to examine its convergence state or its minimum ED value. The problem is that this ED estimation obtained by block?data processing requires a heavy calculation burden. In this paper, a recursive ED estimation method is proposed that reduces the computational complexity by way of utilizing the relationship between the current and previous states of the datablock. The relationship provides a ground that the currently estimated ED value can be used for the estimation of the next ED without the need for processing the whole new data block. From the simulation results the proposed recursive ED estimation shows the same estimation values as that of the conventional method, and in the aspect of computational burden, the proposed method requires only O(N) at each iteration time while the conventional block?processing method does $O(N^2)$.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.20 no.3
• /
• pp.21-32
• /
• 1992

This paper is studied on the concept of environmental cognition on accordance with the oriental(especially Buddhism) process of thinking. The Yeongiron(theroy : one of th most famous philosophy of Buddhism, the theory of cause and occasion) consists of the upgam-yeongi, the aroeyasik-yeongi, the chinyeo-yeongi and the pupkye-yeongi. And the concept of these theory are as follows: The conceptural elements of upgam-yeongi consist of sack(色), soo(受), sand(想), hand(行), sik(識). The elements connects with the western environmental psychology such as sack and objects, soo and stimuli, sand and perception, hand and cognition, sik and behavior. Similarly, aroeyasik-yeongi that consist of sangbun(相分), kyunbun(見分), chajungbun(自證分), chungjajungbun(證自證分) connects with objects, perception, cognition, behavior too. The chinyeo-yeongi divide into smase(三細) and yukchu(육추), the samse consist of mumyungupsang(無 明業相), nungyunsand(能見相), kyungyesand(境界相) and the yukchu consist of chisang(智相), sangsoksang(相續相), chipchisang(執取相), kyemyungjasang(計明字相), kiupsang(起業相), upgyegosang(業繫苦相). These elements are relates with the concept of western environmental psychology from objects to behavior too. Pupkye-yeongi represent a characteristic of objects itself rather than a process of environmental cognition. However this study has limitations that the religion and scientific methods should be compare. sack(色) : an elements of it's derivation, all kinds of material soo(受) : a function of reception, feeling sang(想) : a representation of a thought in the mind hang(行) : mental operation sik(識) : a function of judgement sangbun(相分) : the thing in itself kyunbun(見分) : a reflection in the mind chajungbun(自證分) : confirmation of kyunbun chungjajungbyn(證自證分) : self-consciousness through self-examination mumyungupsang(無明業相) : a state of mixture with the object and the subject nungyunsang(能見相) : an operation of the subject kyungyesang(境界相) : a formation of object chisang(智相) : the beginning of distinction sangsoksang(相續相) : a judgement chipchisang(執取相) : a rsponse kiupsang(起業相) : have a influence to the next behavior upgyegosang(業界苦相) : retribution

• Journal of Korean Academy of Nursing
• /
• v.10 no.1
• /
• pp.41-55
• /
• 1980

The medical care insurance system, being put into practice nearly for three years, seem to have brought about some considerable problems as serious for the government as to consider a revision of that system. As one of the most serious problems of present system, the treatment cost of insurance patients is so remarkably low in comparison with than of non-insurance cases that normal operation of hospitals is threatened and care services of low quality are induced. The researcher carried out this survey to analyze and bring to light several aspects of treatment cost of non-insurance patients as a material for a re-assessment of the cost of insurance cases which shows a a considerable difference in amount at the standpoint of hospitals with than of non-insurance cases and further, hoping the significant blind spot of present insurance system(that is, the absence of regulations' for cost assessment by patterns or types of health care treatment) will be mended in near future. The survey was carried out with the treatment invoice sheets of total 902 in-hospital Patients of a general hospital in Seoul during the period of the 2 nd quarter of the year(1979). Among total 902 patients, 694 cases were used for analysis, because those disease or syndromes shared by less than 10% of the patients were put aside before procession. The data were analyzed by kinds or types of diseases, demographic characteristics of patients, hospitalization patterns, types of nursing treatment, etc. The result of analysis was as follows 1. Among all the non-insurance cases, those who received one or more kinds of nursing treatment mounted up to 96. 7 ％. The invoice issue frequency per person was 7.2 times, while that frequency per day for a person was 0.8, : the treatment cosr per person was ￦22,650 while its daily average was ￦2,430, due to the average 9.3 in-hospital days per person. 2. As to the nursing treatment types by the demographic characteristics of patients and hospitalization patterns. a. The unit cost female patients was generally more expensive them that of males, and independent nursing service was more given than other types of treatment. As to age, higher age groups received independent nursing service most, while the youngest group received instrumental and integrated nursing services. b. As to room grade, the unit cost of I.C.U. cases was the highest : and the cast of private room patients was higher than that of public room patients. By in-hospital days, the curve of function showed L. type : that is, the longer stay, the lower function. 3. State of treatment types by kinds of disease were ; a. Dependent nursing service showed comparatively high availability in surgical and neurologic disease and independent nursing service was most received by medical, obstetrical and urological patients, while instrumental and integrated services were most available for respiratory disease and obstetrical and neurologic diseases next. b. The invoice issue frequency per day for a patient was highest in obstetrical disease 3.8 times, and the unit cost(per one invoice sheet) was also highest in obstertrical disease(￦10,880) and next in neurologic cases(￦ 4,690 ). 4. As to the pertained departments. a. Cost amount per person was highest in department of Psychiatries daily cost was highest in obstetrical cases : while the invoice issue frequency was highest in obstetrics and next in pediatrics. b. In departments in need of surgical operation, dependent nursing care was highly availabl : while in internal medicine and obstetrics, independent service was higher. Psychiatrics showed the highest the of integrate nursing while pediatrics and obstetrics higher of instrumental services. The variation co-efficien of treatment cost came out to be relatively in high in special surgery, opthalmology and internal medicine. 5. State of treatment cost by types of nursing behavior was. a. The average frequency of invoice issue was 3.5 (times). Among the type four types of treatment, instrumetal service (4.3) and independent nursing behavior(3.9) showed higher frequency than average respectively. But as to unit cost (per invoice). dependent (￦5,200) and integrated (￦5,340) nursing care services were higher than average and considerably higher than the other two types. b. In repect patient distribution. independent nursing behavior(80.3% ) was the highest and depend ent nursing (31.7% ) the lowest. The variation co-efficient of treatment cost appeared highest in dependent nursing be havior as a whole, and among that, doctor's diagnosis showed the highest coefficient value (100.7). In conclusion, the variaty of treatment cost(treatment itself ) by various characteristics and treatment types pro- that treatment various sort of patients and treatment cost of various types of nursing behavior cannot be uniform. Therefore, to attain the equalization of health care service and its cost both for insurant and non-insurant patients, a more specific provision for assessment of cost should be added to the present medical care insurance system and, in addition, the cost of nursing treatment is desired to be inserted into the treatment invoice.

• The KIPS Transactions:PartC
• /
• v.16C no.6
• /
• pp.783-790
• /
• 2009

The necessity of wireless sensor networks is increasing in the recent years. So many researches are studied in wireless sensor networks. The clustering algorithm provides an effective way to prolong the lifetime of the wireless sensor networks. The one-hop routing of LEACH algorithm is an inefficient way in the energy consumption of cluster-head, because it transmits a data to the BS(Base Station) with one-hop. On the other hand, other clustering algorithms transmit data to the BS with multi-hop, because the multi-hop transmission is an effective way. But the multi-hop routing of other clustering algorithms which transmits data to BS with multi-hop have a data bottleneck state problem. The unequal clustering algorithm solved a data bottleneck state problem by increasing the routing path. Most of the unequal clustering algorithms partition the nodes into clusters of unequal size, and clusters closer to the BS have small-size the those farther away from the BS. However, the energy consumption of cluster-head in unequal clustering algorithm is more increased than other clustering algorithms. In the thesis, I propose an energy efficient unequal clustering algorithm which decreases the energy consumption of cluster-head and solves the data bottleneck state problem. The basic idea is divided a three part. First of all I provide that the election of appropriate cluster-head. Next, I offer that the decision of cluster-size which consider the distance from the BS, the energy state of node and the number of neighborhood node. Finally, I provide that the election of assistant node which the transmit function substituted for cluster-head. As a result, the energy consumption of cluster-head is minimized, and the energy consumption of total network is minimized.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.3
• /
• pp.421-432
• /
• 2020

This paper proposes a 2-kW solid-state power amplifier (SSPA) developed by employing power amplifier pallets designed using gallium-nitride high electron mobility transistors, which is used in S-band military radars and to replace existing traveling-wave tube amplifier (TWTA). The SSPA consists of a high-power amplifier module, which combines eight power amplifier pallets, a drive amplifier module, a digital control module, and a power supply unit. First, the amplifier module and component were integrated into a small package to account for space limitations; next, an on-board harmonic filter was fabricated to reject spurious components; and finally, an auto gain control system was designed for various duty ratios because recent military radar systems are all active phase radars using the pulse operation mode. The developed SSPA exhibited a max gain of 48 dB and an output power ranging between 63-63.6 dBm at a frequency band of 3.1 to 3.5 GHz. The auto gain control function showed that the output power is regulated around 63 dBm despite the fluctuation of the input power from 15-20 dBm. Finally, reliability of the developed system was verified through a temperature environment test for nine hours at high (55 ℃) / low (-40℃) temperature profile in accordance with military standard 810. The developed SSPA show better performance such as light weight, high output, high gain, various safety function, low repair cost and short repair time than existing TWTA.

• Journal of Intelligence and Information Systems
• /
• v.17 no.3
• /
• pp.187-201
• /
• 2011

KOSPI200 index is the Korean stock price index consisting of actively traded 200 stocks in the Korean stock market. Its base value of 100 was set on January 3, 1990. The Korea Exchange (KRX) developed derivatives markets on the KOSPI200 index. KOSPI200 index futures market, introduced in 1996, has become one of the most actively traded indexes markets in the world. Traders can make profit by entering a long position on the KOSPI200 index futures contract if the KOSPI200 index will rise in the future. Likewise, they can make profit by entering a short position if the KOSPI200 index will decline in the future. Basically, KOSPI200 index futures trading is a short-term zero-sum game and therefore most futures traders are using technical indicators. Advanced traders make stable profits by using system trading technique, also known as algorithm trading. Algorithm trading uses computer programs for receiving real-time stock market data, analyzing stock price movements with various technical indicators and automatically entering trading orders such as timing, price or quantity of the order without any human intervention. Recent studies have shown the usefulness of artificial intelligent systems in forecasting stock prices or investment risk. KOSPI200 index data is numerical time-series data which is a sequence of data points measured at successive uniform time intervals such as minute, day, week or month. KOSPI200 index futures traders use technical analysis to find out some patterns on the time-series chart. Although there are many technical indicators, their results indicate the market states among bull, bear and flat. Most strategies based on technical analysis are divided into trend following strategy and non-trend following strategy. Both strategies decide the market states based on the patterns of the KOSPI200 index time-series data. This goes well with Markov model (MM). Everybody knows that the next price is upper or lower than the last price or similar to the last price, and knows that the next price is influenced by the last price. However, nobody knows the exact status of the next price whether it goes up or down or flat. So, hidden Markov model (HMM) is better fitted than MM. HMM is divided into discrete HMM (DHMM) and continuous HMM (CHMM). The only difference between DHMM and CHMM is in their representation of state probabilities. DHMM uses discrete probability density function and CHMM uses continuous probability density function such as Gaussian Mixture Model. KOSPI200 index values are real number and these follow a continuous probability density function, so CHMM is proper than DHMM for the KOSPI200 index. In this paper, we present an artificial intelligent trading system based on CHMM for the KOSPI200 index futures system traders. Traders have experienced on technical trading for the KOSPI200 index futures market ever since the introduction of the KOSPI200 index futures market. They have applied many strategies to make profit in trading the KOSPI200 index futures. Some strategies are based on technical indicators such as moving averages or stochastics, and others are based on candlestick patterns such as three outside up, three outside down, harami or doji star. We show a trading system of moving average cross strategy based on CHMM, and we compare it to a traditional algorithmic trading system. We set the parameter values of moving averages at common values used by market practitioners. Empirical results are presented to compare the simulation performance with the traditional algorithmic trading system using long-term daily KOSPI200 index data of more than 20 years. Our suggested trading system shows higher trading performance than naive system trading.

• Geomechanics and Engineering
• /
• v.8 no.6
• /
• pp.757-767
• /
• 2015

Rock mass is an important engineering material. In hydropower engineering, rock mass of bank slope controlled the stability of an arch dam. However, mechanical characteristics of the rock mass are not only affected by lithology, but also joints. On the basis of field geological survey, this paper built rock mass material containing parallel concentrated joints with different dip angle, different number under different stress conditions by PFC (Particle Flow Code) numerical simulation. Next, we analyzed mechanical property and fracture features of this rock mass. The following achievements have been obtained through this research. (1) When dip angle of joints is $15^{\circ}$ and $30^{\circ}$, with the increase of joints number, peak strength of rock mass has not changed much. But when dip angle increase to $45^{\circ}$, especially increase to $60^{\circ}$ and $75^{\circ}$, peak strength of rock mass decreased obviously with the increase of joints number. (2) With the increase of confining stress, peak strengths of all rock mass have different degree of improvement, especially the rock mass with dip angle of $75^{\circ}$. (3) Under the condition of no confining stress, dip angle of joints is low and joint number is small, existence of joints has little influence on fracture mode of rock mass, but when joints number increase to 5, tensile deformation firstly happened at joints zone and further resulted in tension fracture of the whole rock mass. When dip angle of joints increases to $45^{\circ}$, fracture presented as shear along joints, and with increase of joints number, strength of rock mass is weakened caused by shear-tension fracture zone along joints. When dip angle of joints increases to $60^{\circ}$ and $75^{\circ}$, deformation and fracture model presented as tension fracture zone along concentrated joints. (4) Influence of increase of confining stress on fracture modes is to weaken joints' control function and to reduce the width of fracture zone. Furthermore, increase of confining stress translated deformation mode from tension to shear.

• Journal of IKEEE
• /
• v.5 no.2 s.9
• /
• pp.136-145
• /
• 2001

As with appearing new applications that requires QoS guarantee such as VoIP, VPN in Internet, problems of IP QoS has been one of most important issues in next-generation Internet. IETF has proposed integrated services model(Int-Serv) and differentiated service(Diff-Serv) to supply IP QoS in Internet. Int-Serv model uses the state information of each IP flow, so satisfies QoS according to traffic characteristics, but increases the amount of flow state information with increasing flow number. Diff-Serv model uses PHP(Per Hop Behavior), and there are well-defined classes to provide differentiated traffics with different services according to delay and loss sensitivity. Diff-Serv model can provide diverse services in Internet because of having no the state and signal information of each flow. As MPLS uses the packet forwarding technique based-on label, it implements the traffic engineering in the networks easily. The MPLS can set up the path with different traffic parameters, and assign each path to particular Class of Services. Therefore it is possible to support the Diff-Serv model with well-defined classes. In this paper we investigate the performance improvement of Diff-Serv function in the MPLS network to guarantee class of services in Internet.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.620-626
• /
• 2004

For general nonlinear processes, it is difficult to control with a linear model-based control method and nonlinear controls are considered. Among the numerous approaches suggested, the most rigorous approach is to use dynamic optimization. Many general engineering problems like control, scheduling, planning etc. are expressed by functional optimization problem and most of them can be changed into dynamic programming (DP) problems. However the DP problems are used in just few cases because as the size of the problem grows, the dynamic programming approach is suffered from the burden of calculation which is called as 'curse of dimensionality'. In order to avoid this problem, the Neuro-Dynamic Programming (NDP) approach is proposed by Bertsekas and Tsitsiklis (1996). To get the solution of seriously nonlinear process control, the interest in NDP approach is enlarged and NDP algorithm is applied to diverse areas such as retailing, finance, inventory management, communication networks, etc. and it has been extended to chemical engineering parts. In the NDP approach, we select the optimal control input policy to minimize the value of cost which is calculated by the sum of current stage cost and future stages cost starting from the next state. The cost value is related with a weight square sum of error and input movement. During the calculation of optimal input policy, if the approximate cost function by using simulation data is utilized with Bellman iteration, the burden of calculation can be relieved and the curse of dimensionality problem of DP can be overcome. It is very important issue how to construct the cost-to-go function which has a good approximate performance. The neural network is one of the eager learning methods and it works as a global approximator to cost-to-go function. In this algorithm, the training of neural network is important and difficult part, and it gives significant effect on the performance of control. To avoid the difficulty in neural network training, the lazy learning method like k-nearest neighbor method can be exploited. The training is unnecessary for this method but requires more computation time and greater data storage. The pH neutralization process has long been taken as a representative benchmark problem of nonlin ar chemical process control due to its nonlinearity and time-varying nature. In this study, the NDP algorithm was applied to pH neutralization process. At first, the pH neutralization process control to use NDP algorithm was performed through simulations with various approximators. The global and local approximators are used for NDP calculation. After that, the verification of NDP in real system was made by pH neutralization experiment. The control results by NDP algorithm was compared with those by the PI controller which is traditionally used, in both simulations and experiments. From the comparison of results, the control by NDP algorithm showed faster and better control performance than PI controller. In addition to that, the control by NDP algorithm showed the good results when it applied to the cases with disturbances and multiple set point changes.