• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.9
• /
• pp.1115-1124
• /
• 1988

A two-dimensional systolic array for fast Fourier transform, which has a regular and recursive VLSI architecture is presented. The array is constructed with identical processing elements (PE) in mesh type, and due to its modularity, it can be expanded to an arbitrary size. A processing element consists of two data routing units, a butterfly arithmetic unit and a simple control unit. The array computes FFT through three procedures` I/O pipelining, data shuffling and butterfly arithmetic. By utilizing parallelism, pipelining and local communication geometry during data movement, the two-dimensional systolic array eliminates global and irregular commutation problems, which have been a limiting factor in VLSI implementation of FFT processor. The systolic array executes a half butterfly arithmetic based on a distributed arithmetic that can carry out multiplication with only adders. Also, the systolic array provides 100% PE activity, i.e., none of the PEs are idle at any time. A chip for half butterfly arithmetic, which consists of two BLC adders and registers, has been fabricated using a 3-um single metal P-well CMOS technology. With the half butterfly arithmetic execution time of about 500 ns which has been obtained b critical path delay simulation, totla FFT execution time for 1024 points is estimated about 16.6 us at clock frequency of 20MHz. A one-PE chip expnsible to anly size of array is being fabricated using a 2-um, double metal, P-well CMOS process. The chip was layouted using standard cell library and macrocell of BLC adder with the aid of auto-routing software. It consists of around 6000 transistors and 68 I/O pads on 3.4x2.8mm\ulcornerarea. A built-i self-testing circuit, BILBO (Built-In Logic Block Observation), was employed at the expense of 3% hardware overhead.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.19 no.2
• /
• pp.4377-4384
• /
• 1977

The curvilinear hydrograph can be replaced by an equivalent triangular hydrograph which is more easily constructed and, for routing through reservoirs or stream channels, gives results about as accurate as those obtained using the curvilinear hydrograph. A synthetic hydrograph is prepared using the data from a number of watersheds to develop a dimensionless unit hydrograph applicable to ungauged watersheds. The dimensionless unit hydrograph for the NakDong River Basin was prepared from the unit hydrographs of a variety of nine subwatersheds. The equation for the peak rate of flow (unit volume of runoff in 1.0mm) was derived as {{{{ { q}_{p } = { 0.21AR} over { {T }_{p } } }}}} The results summarized in this study are as follows: 1) It found that the watershed lag time (Lg, hrs) could be expressed by Lg=0.253(L.Lca)0.4171 The product L.Lca is a measure of the size and shape of the watershed. Correlation coefficient for Lg was 0.97 which defined with high significance. 2) The base length of the unitgraph, in hours, was adopted as Tb=17.51+2.073Lg with high significant correlation coefficient, 0.92. 3) Time in hour from start of rise to peak rate (TP) generally occured at the position of 0.289 Tb with some indication of higher values for larger watershed. 4) Triangular hydrograph is a dimensionless unitgraph prepared from the 40 unitgraphs. The equation is shown as {{{{ { q}_{p } = { K.A.R} over { { T}_{p } } }}}}. The constant K=0.21 is defined to NakDong River basin. 5) In the light of the results analyzed in this study, average errors in the peak discharge of the Trjangular unitgraph was estimated as 5.34 percent to the peak of observed average unitgraph. Each ordinate of the Triangular unitgraph was approached closely to the observed one.

• Journal of the Korean Society of Industry Convergence
• /
• v.11 no.1
• /
• pp.11-18
• /
• 2008

After execute quantitative analysis that choose station and compose floodgate quality of water net and use floodgate data and quality of water data analysis target Sign of the cock as 1 dimension access for Non-point pollution source pollution and estimate of Gaeuncheon's at Kyongsangbukdo report to the Throne in this research, presented parameter conclusion notation model (AGNPS) in real condition of our agricultural area through comparison with spot value and result is as following in reply. With result observation and analysis result of the AGNPS model the comparison which it will pay from the hazard which it analyzes 2005, the rainfall thought which is used in the analysis to select 8 heavy rain thoughts 2005 July - is data until of September. Actual amount of rainfall 6.0~195.0 mm one time the antecedent precipitation showed API5 case 0.0~507.0mm and were observed peak flows (Qpeak) each from the P-1 $0.026m^3/sec{\sim}9.265m^3/sec$, from the P-2 $0.010m^3/sec-2.747m^3/sec$ and from the P-3c $0.064m^3/sec-13.482m^3/sec$ to show. Also amendment AMC condition it will be cool and it uses and the AGNPS model conference the result which it occurs, analysis and regression analysis of actual flow for as 0.992 very the possibility of getting the result which is good there was a decisive coefficient which is cool. But the gun is (T-P) with the total nitrogen (T-N) decisive coefficient each as 0.794 and 0.849 the presumption which is reliability generally will pay and with the fact that it will be the possibility of getting it is judged.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.9
• /
• pp.79-84
• /
• 2016

In this paper we consider the problem of finding the triplet (S,${\pi}$,f), where $S{\subseteq}V$, ${\pi}$ is a sequence of nodes in S and $f:V{\backslash}S{\rightarrow}S$ for a given complete graph G=(V,E). In particular, there exist two costs, $c^V_{uv}$ and $c^D_{uv}$ for $(u,v){\in}E$, and the cost of triplet (S,${\pi}$,f) is defined as $\sum_{i=1}^{{\mid}S{\mid}}c^V_{{\pi}(i){\pi}(i+1)}+2$ ${\sum_{u{\in}V{\backslash}S}c^D_{uf(u)}$. This problem is motivated by the integrated routing of the vehicle and drone for urban delivery services. Since a well-known NP-complete TSP (Traveling Salesman Problem) is a special case of our problem, we cannot expect to have any polynomial-time algorithm unless P=NP. Furthermore, for practical purposes, we may not rely on time-exhaustive enumeration method such as branch-and-bound and branch-and-cut. This paper suggests the simple heuristic which is motivated by the MST (minimum spanning tree)-based approximation algorithm and neighborhood search heuristic for TSP.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.2
• /
• pp.77-83
• /
• 2010

Vehicular Ad Hoc Networks are self-organizing Peer-to-Peer networks that typically have highly mobile vehicle nodes, moving at high speeds, very short-lasting and unstable communication links. VANETs are formed without fixed infrastructure, central administration, and dedicated routing equipment, and network nodes are mobile, joining and leaving the network over time. So, VANET-security is very vulnerable for the intrusion of malicious and misbehaving nodes in the network, since VANETs are mostly open networks, allowing everyone connect, without centralized control. In this paper, we propose a rough set based anomaly detection method that efficiently identify malicious behavior of vehicle node activities in these VANETs, and the performance of a proposed scheme is evaluated by a simulation in terms of anomaly detection rate and false alarm rate for the threshold ${\epsilon}$.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.12
• /
• pp.1878-1888
• /
• 1990

In this paper, the input-output interconnection method of the multi-valued signal processing circuit using perfect Shuffle technique and Kronecker product is discussed. Using this method, the design method of circuit of the multi-valued Reed-Muller expansions(MRME) to be used the multi-valued signal processing on finite field GF(p**m) is presented. The proposed input-output interconnection method is shown that the matrix transform is efficient and that the module structure is easy. The circuit design of MRME on FG(p**m) is realized following as` 1) contructing the baisc gates on GF(3) by CMOS T gate, 2) designing the basic cells to be implemented the transform and inverse transform matrix of MRME using these basic gates, 3) interconnecting these cells by the input-output interconnecting method of the multivalued signal processing circuits. Also, the circuit design of the multi-valued signal processing function on GF(3\ulcorner similar to Winograd algorithm of 3x3 array of DFT (discrete fourier transform) is realized by interconnection of Perfect Shuffle technique and Kronecker product. The presented multi-valued signal processing circuits that are simple and regular for wire routing and posses the properties of concurrency and modularity are suitable for VLSI.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.8 no.2
• /
• pp.41-47
• /
• 2012

MANET has vulnerable structure on security owing to structural characteristics as follows. MANET consisted of moving nodes is that every nodes have to perform function of router. Every node has to provide reliable routing service in cooperation each other. These properties are caused by expose to various attacks. But, it is difficult that position of environment intrusion detection system is established, information is collected, and particularly attack is detected because of moving of nodes in MANET environment. It is not easy that important profile is constructed also. In this paper, conformal predictor - support vector machine(CP-SVM) based intrusion detection technique was proposed in order to do more accurate and efficient intrusion detection. In this study, IDS-agents calculate p value from collected packet and transmit to cluster head, and then other all cluster head have same value and detect abnormal behavior using the value. Cluster form of hierarchical structure was used to reduce consumption of nodes also. Effectiveness of proposed method was confirmed through experiment.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.56 no.1
• /
• pp.28-36
• /
• 2007

Sensor networks are usually composed of tens or thousands of tiny devices with limited resources. Because of their limited resources, many researchers have studied on the energy management in the WSNs(Wireless Sensor Networks), especially taking into account communications efficiency. For effective data transmission and sensor fault detection in sensor network environment, a new remote monitoring system based on PCA(Principle Component Analysis) and AANN(Auto Associative Neural Network) is proposed. PCA and AANN have emerged as a useful tool for data compression and identification of abnormal data. Proposed system can be effectively applied to sensor network working in LEA2C(Low Energy Adaptive Connectionist Clustering) routing algorithms. To verify its applicability, some simulation studies on the data obtained from real WSNs are executed.

• Information Systems Review
• /
• v.13 no.2
• /
• pp.1-16
• /
• 2011

Recently, many companies have started to manage and support CoPs formally at the organizational level because of strategic usability of CoP. These companies are also seeking ways to motivate CoP members to actively participate in their groups. Accordingly, this paper proposes one way of increasing CoP activities by rearranging CoP members. In practice, active CoP members often lead their groups. Therefore, rearranging members can, eventually, be one method to motivate more individuals to participate in CoP activities. This paper first suggests a new approach in order to improve knowledge sharing activities at the organizational level based on rearranging members of current CoPs. Second, a mathematical model is presented which maximizes total BLS (Balanced Level Score) of company A with several constraints. Then a real world problem is changed to a popular problem, VRP to solve this problem. Third, the solution program was developed to find a meaningful solution.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.41 no.2
• /
• pp.53-65
• /
• 2016

Static wireless multi-hop networks, such as wireless mesh networks and wireless sensor networks have proliferated in recent years because of they are easy to deploy and have low installation cost. Two key measures are used to evaluate the performance of a multicast tree algorithm or protocol : end-to-end delay and the number of transmissions. End-to-end delay is the most important measure in terms of QoS because it affects the total throughput in wireless networks. Delay is similar to the hop count or path length from the source to each destination and is directly related to packet success ratio. In wireless networks, each node uses the air medium to transmit data, and thus, bandwidth consumption is related to the number of transmission nodes. A network has many transmitting nodes, which will cause many collisions and queues because of congestion. In this paper, we optimize two metrics through a guaranteed delay scheme. We provide an integer linear programming formulation to minimize the number of transmissions with a guaranteed hop count and preprocessing to solve the aforementioned problem. We extend this scheme not only with the guaranteed minimum hop count, but also with one or more guaranteed delay bounds to compromise two key metrics. We also provide an explanation of the proposed heuristic algorithm and show its performance and results.