• Journal of the Korea Society of Computer and Information
• /
• v.14 no.7
• /
• pp.73-80
• /
• 2009

Internet accidents have skyrocketed every year. It always has been threatened by the methods such as hacking and Spyware. The majority of security accident is formed of the loss of authentication information, and the internal user who is not authorized. The importance of security is also emphasized when someone tries to do something accessing to the main information system. Accordingly, Biometrics has been used in many ways. OTP, however, must have a few devices accessing to several systems, and Biometrics involve some risk of mis-recognition rate and mis-denial rate. It also has the risk possible to access to the main information system when losing OTP. This research reduced risks about the loss as separating RFID leader for mobile, Tag and the accessor's cellular phone, and is about pseudo random validation key generated from the administration system through contact with RFID leader for mobile and Tag. As sending the key to user's cell phone which is already registered, security is strengthened more than existing connection methods through the ID and password. RFID for mobile not generalized to the present has been studied as a tool accessing to the main information system.

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

This paper proposes an interference avoidance approach for Constraint-Based Routing (CBR) algorithm in the Multi-Protocol Label Switching (MPLS) network. The MPLS network itself has a capability of integrating among any layer-3 protocols and any layer-2 protocols of the OSI model. It is based on the label switching technology, which is fast and flexible switching technique using pre-defined Label Switching Paths (LSPs). The MPLS network is a solution for the Traffic Engineering(TE), Quality of Service (QoS), Virtual Private Network (VPN), and Constraint-Based Routing (CBR) issues. According to the MPLS CBR, routing performance requirements are capability for on-line routing, high network throughput, high network utilization, high network scalability, fast rerouting performance, low percentage of call-setup request blocking, and low calculation complexity. There are many previously proposed algorithms such as minimum hop (MH) algorithm, widest shortest path (WSP) algorithm, and minimum interference routing algorithm (MIRA). The MIRA algorithm is currently seemed to be the best solution for the MPLS routing problem in case of selecting a path with minimum interference level. It achieves lower call-setup request blocking, lower interference level, higher network utilization and higher network throughput. However, it suffers from routing calculation complexity which makes it difficult to real task implementation. In this paper, there are three objectives for routing algorithm design, which are minimizing interference levels with other source-destination node pairs, minimizing resource usage by selecting a minimum hop path first, and reducing calculation complexity. The proposed CBR algorithm is based on power factor calculation of total amount of possible path per link and the residual bandwidth in the network. A path with high power factor should be considered as minimum interference path and should be selected for path setup. With the proposed algorithm, all of the three objectives are attained and the approach of selection of a high power factor path could minimize interference level among all source-destination node pairs. The approach of selection of a shortest path from many equal power factor paths approach could minimize the usage of network resource. Then the network has higher resource reservation for future call-setup request. Moreover, the calculation of possible path per link (or interference level indicator) is run only whenever the network topology has been changed. Hence, this approach could reduce routing calculation complexity. The simulation results show that the proposed algorithm has good performance over high network utilization, low call-setup blocking percentage and low routing computation complexity.

• The Journal of Society for e-Business Studies
• /
• v.20 no.4
• /
• pp.1-17
• /
• 2015

A river water level monitoring system which prevents salt water damages and effectively excludes floods has been developed to contribute efficient operation of Nakdong river estuary barrage. The system can be used for monitoring upstream conditions more quickly and do appropriate responses over changes. Telemetry and telecontrols using PLCs have been built at the three sites that directly influence on the operation of barrage gates, and are linked to Nakdong river estuary barrage's IOS (Integrated Operation System) through public communication networks. By using PLC, the system can achieve even higher reliability and versatility than before as well as easy management. By power control devices, we can remotely control the power of PLCs to treat the minor troubles instantly without going on-sites. The power control devices also save data in preparation for the cases of communication failures. The system uses ADSL (FTTH) as a main network between SCADA server and PLCs, and CDMA (M2M) as a secondary network. In order to compensate security vulnerabilities of public communication network, we have installed the VPNs for secure communication between center and the observation stations, just like a dedicated network. Generally, river water level observations have been used custom-manufactured remote terminals to suit their special goals. However, in this case, we have established a system with open architecture considering the interface between different systems, the ease of use and maintenance, security, price, etc.

• The KIPS Transactions:PartC
• /
• v.9C no.1
• /
• pp.123-134
• /
• 2002

The requirement for QoS (Quality of Service) has become an important Issue as real-time or high bandwidth services are increasing, such as Internet Telephony, Internet broadcasting, and multimedia service etc. In order to guarantee the QoS of Internet application services, several approaches are being sought including IntServ (Integrated Service) DiffServ(Differentiated Srvices), and MPLS(Multi-Protocol Label Switching). In this paper, we describe the performance analysis of QoS guarantee mechanism using the DiffServ. To analyze how the DiffServ performance was affected by diverse input traffic models and the weight value in WFQ(Weighted Fair Queueing), we simulated and performed performance evaluation under a random, bursty, and self-similar input traffic models and for diverse input parameters. leased on the results of performance analysis, it was confirmed that significant difference exist in packet delay and loss depending on the input traffic models used. However, it was revealed that QoS guarantee is possible to the EF (expedited Forwarding) class and the service separation between RF and BE (Best Effort) classes may also be achieved. Next, we discussed the performance synthesis problem. (i. e. derived the conservation laws for a DiffServ networks, and analysed the performance variation and dynamic behavior based on the resource allocation (i.e., weight value) in WFQ.

• Koreanishche Zeitschrift fur Deutsche Sprachwissenschaft
• /
• v.5
• /
• pp.143-166
• /
• 2002

Das Ziel dieses Aufsatzes liegt darin, auf Grund der Theorien von einigen Grammatikern die Korrelation zwischen der Dependenzgrammatik (=DG) und GB­Theorie(=GB) zu beschreiben. Nach Eroms(2000) sind VPn in eine engere Phrase, die die $Erg\"{a}nzungen$ in obliquen Kasus bindet, und eine $\"{a}u{\ss}ere$, die Subjektsvalenz abbindet, zu trennen. Dem INFL-Phrasenkopf der GB entspricht das Finitheitsmorphem in der DG. In der $herk\"{o}mmlichen$ DG steht das Verb an der Spitze des Satzes, aber Eroms(2000) stellt S an die Satzspitze. Die S(mit S., S?, S!) sind $n\"{a}mlich$ oberstes Element des Satzes, von dem alle anderen $W\"{o}rter\;abh\"{a}ngig$ sind. Die Konjunktionen regieren ihren Satz, bzw. der Satz wird durch sie gesteuert. Damit ist die Analogie zur X-bar-Syntax $vollst\"{a}ndig$. Nach Vater(l996) lasst sich die Struktur der deutschen VP systernatisch nach dem X-bar-Schema darstellen, wobei die Zuordnung der Objekte mehrere $M\"{o}glichkeiten\;zul\"{a}sst$. X-bar-Regeln allein $k\"{o}nnen$ nicht die Vielfalt $m\"{o}glicher$ VP-Strukturen erzeugen. Hier greifen V-bar-Regeln und Valenz ineinander. Vater(l996) $schl\"{a}gt$ vor, den von $\'{A}gel(1993)$ vorgeschlagenen Unterschied zwischen Valenzpotenz und Valenzrealisierung zu $ber\"{u}cksichtigen$, um die verschiedenen syntaktischen und morphologischen Realisierungen zwischen verschiedenen Sprachen in den Griff zu bekommen. $\'{A}gel(1993, 2000)$ nimmt in Anlehnung an $L\'{a}szlo(l988)$ zwei Realisierungsebenen der Valenz, die Mikroebene(=die der morphologischen Aktanten) und die Makroebene(=die der syntaktischen Aktanten) an. Der $Tr\"{a}ger$ auf Mikroebene ist der Mikroaktant, also der Teil des Verbflexivs, der $Tr\"{a}ger$ auf Makroebene ist der Makroaktant, also das syntaktische Subjekt. Die Begriffe 'Mikroebene' und 'Makroebene' werden sowohl statisch und als auch dynamisch interpretiert. Auf Grund dieser Begriffe versucht $\'{A}gel(1993, 2000)$, nach Parallelen der Valenzrealisierung in S und NP zu suchen. Aber die Untersuchung der $Valenzrealisierungsverh\"{a}ltnisse$ in der NP wird zu einem scheinbaren typologischen Gegensatz zwischen S und NP $f\"{u}hren$. Um diesen Gegensatz $aufzul\"{o}sen$, wird das Konzept 'finites Substantiv' $eingef\"{u}hrt$, das analog zum Konzept 'finites Verb' ist. Dabei wird die sog. starke Adjektivflexion in einen Teil der Substantivflexion uminterpretiert. Die GB-Theorie definiert sich als eine Theorie der sog. mentalen Grammatik, des $Sprachverm\"{o}gens$. Da als der Gegenstand der DG die sog. objektive Grammatik angesehen werden kann, scheint der grundlegende Unterschied zwischen den $Gegenst\"{a}nden$ beider Theorien in der Opposition 'intem(=mental vs. extern (=objektiv)' zu liegen. Da die GB eine 'naturwissenschaftlicher' organisierte Theorie ist als die empirische Richtung der DG, ware eine Vergleichsgrundlage in der Tat nicht einfach zu etablieren. Obwohl die beiden Theorien von $v\"{o}llig$ anderen Voraussetzungen und Zielsetzungen ausgehen, gibt es zwischen der DG und der GB $\"{U}berlappungen$ und zunehmende $Ann\"{a}herungen$. Generell ist es notwendig, dass Teileinsichten aus einer Theorie in eine andere Theorie $\"{u}bernommen$ werden. In diesem Aufsatz konnten wir durch die Untersuchung der Korrelation von beiden Theorien partielle Konvergenzen erkennen. Nach Engel(l994) gibt es keine Grammatik 'an sich', sie wird von Grammatikern gemacht. Grammatiken sind Menschenwerk und Linguistenwerk. Wir sind auf der Suche nach 'einer besseren Grammatik.'