• Journal of the Korean Geographical Society
• /
• v.29 no.2
• /
• pp.117-136
• /
• 1994

Contemporary global space economy is so dynamic that any one specific structural force can not explain the whole dynamic processes or trajectories of spatial industrial development. The major purpose of this paper is extending the traditional notion of industrial districts to functioning and development of new industrial districts with relation to the development of high technology industries. Several dynamic forces, which are dominated in new industrial districts in the modern space economy, are incorporated in the formation and dynamic aspects of new industrial districts. Even though key forces governing Marshallian industrial district are localization of small firms, division of labor between firms, constructive cooperation, and industrial atmosphere, Marshall points out a possibility of growing importance of large firms and non-local networks in the districts with changes of external environments. Some of Italian industrial districts can be regarded as Marshallian industrial districts in broader context, but the role of local authorities or institutions and local embeddedness seem to be more important in the Italian industrial districts. More critical implication form the review of Marshallian industrial districts and Italian industrial districts is that the industrial districts are not a static concept but a dynamic one: small firm based industrial districts can be regarded as only a specific feature evolved over time. Dynamic aspects of new industrial districts are resulting from coexistence of contrasting forces governing the functioning and formation of the districts in contemporary global space economy. The contrasting forces governing new industrial districts are coexistence of flexible and mass production systems, local and global networks, local and non-local embeddedness, and small and large firms. Because of these coexistence of contrasting forces, there are various types of new industrial districts. Nine types of industrial districts are identified based on local/non-local networks and intensity of networks in both suppliers and customers linkages. The different types of new industrial districts are described by differences in production systems, embeddedness, governance, cooperation and competition, and institutional factors. Out of nine types of industrial districts, four types - Marshallian; suppliers hub and spoke; customers hub and spoke; and satellite - are regarded as distinctive new industrial districts and four additional types - advanced hub and spoke types (suppliers and customers) and mature satellites (suppliers and customers) - can be evolved from the distinctive types and may be regarded as hybrid types. The last one - pioneering high technology industrial district - can be developed from the advanced hub and spoke types and this type is a most advanced modern industrial district in the era of globalization and high technology. The dynamic aspects of the districts are related with the coexistence of the contrasting forces in the contemporary global space economy. However, the development trajectory is not a natural one and not all the industrial districts can develop to the other hybrid types. Traditionally, localization of industries was developed by historical chances. In the process of high technology industrial development in contemporary global space economy, however, policy and strategies are critical for the formation and evolution of new industrial districts. It needs formation of supportive tissues of institutions for evolution of dyamic pattern of high technology related new industrial districts. Some of the original distinctive types of new industrial districts can not follow the path or trajectory suggested in this paper and may be declined without advancing, if there is no formation of supportive social structure or policy. Provision of information infrastructure and diffusion of an entrepreneurship through the positive supports of local government, public institutions, universities, trade associations and industry associations are important for the evolution of the dynamic new industrial districts. Reduction of sunk costs through the supports for training and retraining of skilled labor, the formation of flexible labor markets, and the establishment of cheap and available telecommunication networks is also regarded as a significant strategies for dynamic progress of new industrial districts in the era of high technology industrial development. In addition, development of intensive international networks in production, technology and information is important policy issue for formation and evolution of the new industrial districts which are related with high technology industrial development.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.24 no.11
• /
• pp.1055-1063
• /
• 2013

Low noise amplifiers(LNAs) are an integral component of RF receivers and are frequently required to operate at wide frequency bands for various wireless systems. For wideband operation, important performance metrics such as voltage gain, return loss, noise figures and linearity have been carefully investigated and characterized for the proposed LNA. An inductive shunt feedback configuration is successfully employed in the input stage of the proposed LNA which incorporates cascaded networks with a peaking inductor in the buffer stage. Design equations for obtaining low and high input matching frequencies are easily derived, leading to a relatively simple method for circuit implementation. Careful theoretical analysis explains that poles and zeros are characterized and utilized for realizing the wideband response. Linearity is significantly improved because the inductor between gate and drain decreases the third-order harmonics at the output. Fabricated in $0.18{\mu}m$ CMOS process, the chip area of this LNA is $0.202mm^2$, including pads. Measurement results illustrate that input return loss shows less than -7 dB, voltage gain greater than 8 dB, and a little high noise figure around 7~8 dB over 1.5~13 GHz. In addition, good linearity(IIP3) of 2.5 dBm is achieved at 8 GHz and 14 mA of current is consumed from a 1.8 V supply.

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

This paper presents an algorithm for multichannel slotted-ring topology medium access protocol (MAC) using in wavelength division multiplexing (WDM) networks. In multichannel ring, there are two main previously proposed architectures: Tunable Transmitter - Fixed Receiver (TTFR) and Fixed Transmitter - Tunable Receivers (FTTR). With TTFR, nodes can only receive packets on a fixed wavelength and can send packets on any wavelengths related to destination of packets. Disadvantage of this architecture is required as many wavelengths as there are nodes in the network. This is clearly a scalability limitation. In contrast, FTTR architecture has advantage that the number of nodes can be much larger than the number of wavelength. Source nodes send packet on a fixed channel (or wavelength) and destination nodes can received packets on any wavelength. If there are fewer wavelengths than there are nodes in the network, the nodes will also have to share all the wavelengths available for transmission. However the fixed wavelength approach of TTFR and FTTR bring low network utilization. Because source node with waiting data have to wait for an incoming empty slot on corresponding wavelength. Therefore this paper presents Tunable Transmitter - Tunable Receiver (TTTR) approach, in which the transmitting node can send a packet over any wavelengths and the receiving node can receive a packet from any wavelengths. Moreover, the self-similar distributed input traffic is used for evaluation of the performance of the proposed algorithm. The self-similar traffic performs better performance over long duration than short duration of the Poison distribution. In order to increase bandwidth efficiency, the Destination Stripping approach is used to mark the slot which has already reached the desired destination as an empty slot immediately at the destination node, so the slot does not need to go back to the source node to be marked as an empty slot as in the Source Stripping approach. MATLAB simulator is used to evaluate performance of FTTR, TTFR, and TTTR over 4 and 16 nodes ring network. From the simulation result, it is clear that the proposed algorithm overcomes higher network utilization and average throughput per node, and reduces the average queuing delay. With future works, mathematical analysis of those algorithms will be the main research topic.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.10
• /
• pp.169-177
• /
• 2007

Existing wireless access (mobile) routers are based commonly on the network address and port translation (NAPT) technique which permits simultaneously sharing a subscriber's connection to the network with multiple users. However, the NAPT architecturally makes the users invisible on the network side, thus becoming a user-oriented connection technique. In this paper, we propose a novel service provider-oriented unlicensed nomadic access relay station (WiNNERS) for helping wireless broadband network service providers to make their business more lucrative by accommdating unlicensed band users as subscribers into their network. The WiNNERS offers service providers the capability to directly manage each of the unlicensed band users at the network side. This direct management allows the service providers to flexibly and simply handle QoS, access control, and billing for each user. In order to distinguish each of the unlicensed band users the WiNNERS constructs a virtual tunnel from each user's terminal to the network access router using connection identifiers which is defined for service flow management within the WiBro system, Consequently, our proposed service provider-oriented relay station can be included into the WiBro network system with minimum modifications.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.11
• /
• pp.1-11
• /
• 2009

A content based pub/sub (Publish/subscribe) services at the peer-to-peer network has the requirements about how to distribute contents information of subscriber and to delivery the events efficiently. For satisfying the requirements, a DHT(Distributed Hash Table) based pub/sub overlay networking and tree type topology based network construction using filter technique have been proposed. The DHT based technique is suitable for topic based pub/sub service but it's not good contents based service that has the variable requirements. And also filter based tree topology networking is not efficient at the environment where the user requirements are distributed. In this paper we propose the R-Tree algorithm based pub/sub overlay network construction method. The proposed scheme provides cost effective event delivery method by mapping user requirement to multi-dimension and hierarchical grouping of the requirements. It is verified by simulation at the variable environment of user requirements and events.

• The KIPS Transactions:PartC
• /
• v.12C no.6 s.102
• /
• pp.773-780
• /
• 2005

Recently, the telecommunication network is in a transition toward the BcN (Broadband convergence Networks) that integrates the Internet, the telecommunication and the broadcasting. The BcN makes it possible to provide of 4he third-party application by using the Open API The Parlay X API is an example of the Open API and the Parlay X API is grafted in the Web Service and is abstracted from the Parlay API. So, the Parlay X API does not only have advantages of a Web Service, but also disadvantages of the Web Service. The main disadvantage of the Web Service is that it does not support the any QoS mechanism. In this paper, we propose the architecture that solves the reliability among the QoS issues for the Web Service. The proposed mechanism adopts the Asynchronous architecture for the reliable Web Service and improves the performance of the retransmission between the client and the server using the expected response time. We perform the performance evaluation through the simulation in older to compare with the existing mechanism. Consequently, we can confirm that the performance of the proposed mechanism performs better than the existing mechanism.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.8 no.8
• /
• pp.825-834
• /
• 2018

Broadcasting is a basic data communication method for interconnection networks. There are two types of broadcasting. One-to-all broadcasting is to transmit a message from one node to all other nodes and all-to-all broadcasting is to transmit a message from all the nodes that have messages to other nodes. And by the using way of the transmission port per unit time, there are two schemes of broadcasting. Single port telecommunication(SLA) is to transmit messages from one node that contains the messages to one adjacent node only and all port telecommunication(MLA) is to transmit messages from one node to all adjacent nodes within a time of unit. Matrix hypercube is that an interconnection network has improved network cost than that of hypercube with the same number of nodes. In this paper, we analyze broadcasting scheme of matirx hypercube. First, we propose one-to-all and all-to-all broadcasting algorithms of matrix hypercube. And we prove that one-to-all broadcasting times are 2n+1 and $2{\lceil}{\frac{n}{2}}{\rceil}+1$ based on the SLA and MLA models, respectively. Also, we show all-to-all broadcasting time using SLA model is $5{\times}2^{\frac{n}{2}}-2$ when n=even, and is $5{\times}2^{\frac{n-1}{2}}+2$ when n=odd.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.5
• /
• pp.165-172
• /
• 2013

Convergence is increasingly prevalent in the IT world which generally refers to the combination of two or more different technologies in a single device. Especially, the spectrum scarcity is becoming a big issue because there are exponential growth of broadcasting and communication systems in the spectrum demand. Cognitive radio (CR) is a convergence technology that is envisaged to solve the problems in wireless networks resulting from the limited available spectrum and the inefficiency in the spectrum usage by exploiting the existing wireless spectrum opportunistically. However, the very process of convergence is likely to expose significant security issues due to the merging of what have been separate services and technologies and also as a result of the introduction of new technologies. The main purpose of this research is focused on devising an adaptive security framework based on carousel for CR networks as a distinct telecommunication convergence application, which are still at the stage of being developed and standardized with the lack of security concerns. The framework uses a secure credential, named as carousel, initialized with the location related information from objects position, which is used to design security mechanisms for supporting privacy and various securities based on it. The proposed adaptive security framework could be used as a security building block for the CR network standards and various convergence applications.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11A
• /
• pp.882-890
• /
• 2009

In this paper, we describe a compensation method that can be used for the situation where Loran receivers lose their phase lock to the received Loran signals when Loran signals are employed for the synchronization of national infrastructures such as telecommunication networks, electric power distribution and so on. In losing the phase lock to the received signals in a Loran receiver, the inner oscillator of the receiver starts free-running and the performance of the timing synchronization signals which are locked to the oscillator's phase is very severly degraded, so the timing accuracy under 1 us for a Primary Reference Clock (PRC) required in the International Telecommunications Union (ITU) G.811 standard can not be satisfied in the situation. Therefore, in this paper, we propose a method which can compensate the phase jump by using a compensation algorithm when a Loran receiver loses its phase lock and the performance evaluation of the proposed algorithm is achieved by the Maximum Time Interval Error (MTIE) of the measured data. From the performance evaluation results, it is observed that the requirement under 1 us for a PRC can be easily achieved by using the proposed algorithm showing about 0.6 us with under 30 minutes mean interval of smoothing with 1 hour period when the loss of phase lock occurs.

• Journal of Navigation and Port Research
• /
• v.27 no.3
• /
• pp.283-288
• /
• 2003

Recently, the growth of applications and services over high-speed Internet increases, ATM networks as wide area back-bone has been a major solution. As the conventional TCP/IP suite is still the standard protocol used to support upper application on current. Internet, the issues regarding whether TCP/IP will operate efficiently on top of an ATM infrastructure and how to control its QoS still remain for studies. TCP uses a window-based protocol for flow control in the transport layer. When TCP uses the UBR service in ATM layer, the control method is only buffer management. If a cell is discarded in ATM layer, one whole packet of TCP will be lost; this fact occur the most TCP performance degradation. Several dropping strategies, such as Tail Drop, EPD, PPD, SPD, FBA, have been proposed to improve the TCP performance over ATM. In this paper, to improve the TCP performance, we propose a packet dropping scheme that is based on comparison with EPD, SPD and FBA. Our proposed scheme is applied to schemes discussed in the previous technology. Our proposed scheme does not need to know each connection's mean packet size. When the buffer exceeds the given threshold, it is based on comparison between the number of dropped packet and the approved packet. Our results are reported and discussed for comparing these discarding schemes under similar conditions. Although the number of virtual channel (VC) is increased, the simulation results showed that the proposed scheme can allocate more fairly each VC than other scheme.