• Journal of KIISE:Information Networking
• /
• v.30 no.1
• /
• pp.24-29
• /
• 2003

In this paper, a new method for the mixed image separation is presented using the independent component analysis, the innovation process, and the expectation-maximization. In general, the independent component analysis (ICA) is one of the widely used statistical signal processing schemes, which represents the information from observations as a set of random variables in the from of linear combinations of another statistically independent component variables. In various useful applications, ICA provides a more meaningful representation of the data than the principal component analysis through the transformation of the data to be quasi-orthogonal to each other. which can be utilized in linear projection.. However, it has been known that ICA does not establish good performance in source separation by itself. Thus, in order to overcome this limitation, there have been many techniques that are designed to reinforce the good properties of ICA, which improves the mixed image separation. Unfortunately, the innovation process still needs to be studied since it yields inconsistent innovation process that is attached to the ICA, the expectation and maximization process is added. The results presented in this paper show that the proposed improves the image separation as presented in experiments.

• Journal of KIISE:Information Networking
• /
• v.30 no.1
• /
• pp.134-142
• /
• 2003

We present an ATM switch architectures based on the multistage interconnection network(MIN) for the efficient multicast traffic control. Many of these applications require multicast connections as well as point-to-point connections. Muiticast connection in which the same message is delivered from a source to arbitrary number of destinations is fundamental in the areas such as teleconferencing, VOD(video on demand), distributed data processing, etc. In designing the multicast ATM switches to support those services, we should consider the fairness(impartiality) and priority control, in addition to the overflow problem, cell processing with large number of copies, and the blocking problem. In particular, the fairness problem which is to distribute the incoming cells to input ports smoothly is occurred when a cell with the large copy number enters upper input port. In this case, the upper input port sends before the lower input port because of the calculating method of running sum, and therefore cell arrived into lower input port Is delayed to next cycle to be sent and transmission delay time becomes longer. In this paper, we propose the cell splitting and group splitting algorithm, and also the fairness scheme on the basis of the nonblocking characteristics for issuing appropriate copy number depending on the number of Input cell in demand. We evaluate the performance of the proposed schemes in terms of the throughput, cell loss rate and cell delay.

• Journal of KIISE:Information Networking
• /
• v.30 no.6
• /
• pp.729-742
• /
• 2003

Mobile Communication has a possibility of eavesdropping by nature of wireless channel. It is known that eavesdropping of CDMA system is impossible because the voice data spreads with the PN. First of all, we show that it is possible to eavesdrop the CDMA channel by analysis of the forward channel in case that we know the ESN and the MIN. We can monitor the forward traffic channel with easy since ESN and MIN are exposed during the call processing in CDMA service in Korea. In this paper, we will show security weakness and propose an enhanced mechanism for CDMA service. We consider the problem of security in the CDMA service. CDMA system has wireless channels to transmit voice or data. By this reason, CDMA communication has a possibility of being eavesdropped by someone. It is known that eavesdropping in CDMA system is impossible because the voice data spreads with the PN. However, we can eavesdrop the CDMA data in FCM protocol in case that we know the ESN and the MIN. In CDMA system, ESN and MIN are exposed to the wireless channel. In this paper, we analyze the flow of the voice and signal in the CDMA system and monitor the forward traffic channel by the FCM protocol. The FCM protocol is proposed to monitor the forward channel in CDMA system. We can show the possibility of monitoring in one-way channel of CDMA system by the FCM protocol. The test instrument based on the FCM protocol is proposed to monitor the CDMA forward channel. We will show the system architecture of the test instrument to monitor the forward channel in CDMA.

• Journal of KIISE:Information Networking
• /
• v.29 no.1
• /
• pp.1-14
• /
• 2002

The most important issue in providing multimedia traffic on a mobile computing environments is to guarantee the mobile host(client) with consistent QoS(Quality of Service). However, the QoS negotiated between the client and network in one cell may not be honored due to client mobility, causing hand-offs between cells. In this paper, a call admission control mechanism is proposed to provide consistent QoS guarantees for multimedia traffics in a mobile computing environment. Each cell can reserve fractional bandwidths for hand-off calls to its adjacent cells. It is important to determine the right amount of reserved bandwidth for hand-off calls because the blocking probability of new calls may increase if the amount of reserved bandwidth is more than necessary. An adaptive bandwidth reservation based on an MPP(Mobility Pattern Profile) and a 2-tier cell structure has been proposed to determine the amount of bandwidth to be reserved in the cell and to control dynamically its amount based on its network condition. We also propose a call admission control based on this bandwidth reservation and "next-cell prediction" scheme using an MPP. In order to evaluate the performance of our call admission control mechanism, we measure the metrics such as the blocking probability of our call admission control mechanism, we measure the metrics such as the blocking probability of new calls, dropping probability of hand-off calls, and bandwidth utilization. The simulation results show that the performance of our mechanism is superior to that of the existing mechanisms such as NR-CAT1, FR-CAT1, and AR-CAT1.

• Journal of KIISE:Information Networking
• /
• v.30 no.1
• /
• pp.75-81
• /
• 2003

User authentication, including confidentiality, integrity over untrusted networks, is an important part of security for systems that allow remote access. Using human-memorable Password for remote user authentication is not easy due to the low entropy of the password, which constrained by the memory of the user. This paper presents a new password authentication and key agreement protocol suitable for authenticating users and exchanging keys over an insecure channel. The new protocol resists the dictionary attack and offers perfect forward secrecy, which means that revealing the password to an attacher does not help him obtain the session keys of past sessions against future compromises. Additionally user passwords are stored in a form that is not plaintext-equivalent to the password itself, so an attacker who captures the password database cannot use it directly to compromise security and gain immediate access to the server. It does not have to resort to a PKI or trusted third party such as a key server or arbitrator So no keys and certificates stored on the users computer. Further desirable properties are to minimize setup time by keeping the number of flows and the computation time. This is very useful in application which secure password authentication is required such as home banking through web, SSL, SET, IPSEC, telnet, ftp, and user mobile situation.

• Journal of KIISE:Information Networking
• /
• v.30 no.1
• /
• pp.126-133
• /
• 2003

The existing active routing Protocols assume that the active network topology is static or pre-configured. However a dynamic mechanism to route an active Packet according to the network condition is required due to the dynamic characteristic of the active network. As active routing protocols, SLRP and TCOM500 PLAN project have been proposed, but since both of them are based on the assumption of the static topology we can not say that they are dynamic routing protocols in their entirety. Therefore, in this paper, we propose a new active network routing protocol, called AOSPF (Active Open Shortest Path First), which is compatible with the existing IP routing protocol. AOSPF is an extension of OSPF by adding a new LSA (Link State Advertisement) to allow the active network routing. The newly introduced LSA is used to specify whether the corresponding router is an active router or not. and one bit in the OPTION field of an LSA packet is used as the active router indication bit. This way of extending OSPF is similar to the scheme used in the extension of OSPF for multicast, i.e., MOSPF. In this paper, we will present the operation of AOSPF and the way how an active packet is forwarded based on the active network topology information constructed by AOSPF.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.2
• /
• pp.718-727
• /
• 2011

This research aims to empirically investigate into the relationship between venture entrepreneurs' social network and their social competence to utilize the network, which is known to help overcome the weaknesses of small-and-medium-sized ventures. An analysis was made of SEM set up with 211 entrepreneurs' responses, and the following are the findings from the analysis. First, venture entrepreneurs' networking ability has a significant, strong and positive effect on weak tie of their social network(${\beta}$=.527, C.R.=3.626), strong tie(${\beta}$=.594, C.R.=3.969), and the network centrality(${\beta}$=.418, C.R.=4.884). Second, their social astuteness also has a significant and positive effect on weak tie(${\beta}$=.192, C.R.=1.701), strong tie(${\beta}$=.269, C.R.=2.509) and the network centrality(${\beta}$=.228, p=2.283). Third, their interpersonal influence has a significant but negative effect only on strong tie(${\beta}$=-.264, C.R.=-1.862) and the network centrality(${\beta}$=-.394, C.R.=-2.914). Lastly, their apparent sincerity has no significant effect on the subordinate factors of social network. This research has not just empirically analyzed the relationship between the entrepreneurs' social network and their social competence. But also, results of the research provide practical and detailed information to entrepreneurs of small and medium ventures. Moreover, the research is significant in that it has suggested and empirically analyzed the concept of political competence, which is a concrete substance of social competence, and that it has offered theoretical foundations for future researches, which will tackle the issue of the entrepreneurs' competence in the sphere of entrepreneurship.

• Journal of the Institute of Convergence Signal Processing
• /
• v.15 no.1
• /
• pp.15-22
• /
• 2014

This paper presents the implementation of a control system of pellet boiler using wood pellet as carbon neutral material. The system also has the additional features to provide remote controlling and monitoring based on home networking technology through either public switched telephone networks or mobile communication networks. It consists of three kinds of sub-modules; a main controller provides basic and additional features such as a setting of temperature, a supplying of wood pellet, a controlling of ignition and fire-power, and a removing of soot. The second is temperature controller of individual rooms which is connected to the main controller through RS-485 links. And interface modules with PSTN and mobile networks can support remote controlling and monitoring the functions. The test results under the heating area of $172m^2$ show a thermal efficiency of 93.6%, a heating power of 20,640kcal/hr, and a fuel consumption of 5.54kg/hr. These results are superior to those of the conventional pellet boilers. In order to obtain the such high performance, we newly applied a 3-step ignition flow, a flame detection by $C_dS$ sensor, and a fire-power control by fine controlling of shutter to our pellet boiler.

• Journal of KIISE:Information Networking
• /
• v.37 no.6
• /
• pp.420-430
• /
• 2010

Due to increasing demand for improving road safety and optimizing road traffic, Vehicular Ad-Hoc Networks (VANET) have been subject to extensive attentions from all aspects of commercial industry and academic community. Security and user privacy are fundamental issues for all possible promising applications in VANET. Most of the existing security proposals for secure VANET concentrate authentication with privacy preservation in vehicle-to-vehicle (V2V) and vehicle-to-roadside infrastructure (V2I) communications and require huge storage and network capacity for management of revocation list. Motivated by the fact, we propose a new scheme with security and privacy preservation which combines V2V and V2I communication. With our proposed scheme, the communication and computational delay for authentication and overhead for management of revocation list can be significantly reduced due to mutual authentication between a vehicle and a Roadside Unit (RSU) requires only two messages, and the RSU issues the anonymous certificate for the vehicle on behalf of the Trust Authority (TA). We demonstrate that the proposed protocol cannot only guarantee the requirements of security and privacy but can also provide efficiency of authentication and management of revocation list.

• Journal of KIISE:Information Networking
• /
• v.30 no.5
• /
• pp.581-594
• /
• 2003

Recently, a location management is being more important in mobile communication systems due to an explosive increase of mobile users. Current systems have used a concept of location area. Based on this concept, a mobile user performs a location update whenever it moves into a new location area. However, this scheme can not avoid unnecessary location updates when a mobile user moves around with high movement rate as compared to call arrival rate. That results in tremendous location management cost. To overcome this drawback, our proposal divides service areas into two sets: One is a set of areas that mobile users move with high speed and another is a set of areas that they move with low speed. After establishing these two sets, this paper employs different location tracking schemes for each sets. Generally, most mobile users with high speed have a low CMR and a regular direction until they arrive at their destination. Using such the moving behavior, systems can predict a mobile user's next location area in advance. When the mobile user moves into the predicted location, our proposal does not perform a location update. Thus, it can reduce overall location management cost. The Markov model is used to analyze the performance of our proposal. Using the model, this paper compares our proposal with IS-41 and TLA. The analytic results show that as CMR grows lower, an overall cost of our proposal becomes less, particularly if a mobile user frequently moves into the specific location are predicted by mobile systems. Also, our proposal has a better performance than other two schemes when the communication cost between HLR and VLR is high.