• Journal of the Korean Regional Science Association
• /
• v.13 no.2
• /
• pp.55-74
• /
• 1997

This paper investigates the spatial characteristics of networks, which arise as a firm's strategy to enhance its competitiveness to cope with the changing economic environments characterized by technological changes and increasing competitiveness. The theoretical framework in this study proposes that networks emerge as a firm's strategies to promote its competitiveness through the vertical/horizontal disintegration of the production system. Futhermore, regional industries of networks. The study examines the types of cooperation and the spatial boundary of the computer industry networks in Korea. Questionnaire survey was conducted on 1, 128 computer companies which had more than 10 employees, with 126 questionnaires being used for analysis. In addition, newpaper articles were used to supplement the foregoing work on network characteristics. The review of these articles covers the period from Jan. 1994 to June 1996. Major findings of this study are as follows: The spatial range of cooperative networks varies according to the specific characters of cooperation(R & D, production, and seles). Intralocal networks are being developed in Kangnam and Youido area, the computer industry agglomeration clusres of Seoul. There are the regional differnces in the agents and contents of cooperation. In intra-national R & D and production networks, regional differnces in agglomeratins and non-agglomerations are not detercted. Most networks of this type are found between large firms and small firms. In contrast, foregn R & D and production networks, which are operated mostly by large firms, are found in Kangnam, Youido, and CBD. Intra-national and foreign productino networks are also focused in Kangnam, Youido, and CBD. Small firms are playing an active role in making this type of cooperation possible. In the perspective of localization-globalization, Korean computer industry can be analyzed in two respects: industrial and regional. The localization of small firms and the localization-globalization of large firms' networks are being developed in industrial contexts, while the localization-globalization of agglomerations and the localization of non-agglomerations networks are being developed in regional contexts. As networks for the localization-globalization of industry are growing in agglomerations, interfirm networks could be related to trends in the formation or intensification of industrial agglomerations. industrial agglomeration areas function as a facilitator of localization through subcontracts, intraregional network and interregional network. They also facilitate globalization via foregn networks. In non-agglomeratin areas, localization networks, which are connected with agglomeration areas via subcontracting, interregional R & D. or production cooperation.

• Journal of Information Processing Systems
• /
• v.14 no.2
• /
• pp.455-468
• /
• 2018

The concepts of graph theory are applied to model and analyze dynamics of computer networks, biochemical networks and, semantics of social networks. The analysis of dynamics of complex networks is important in order to determine the stability and performance of networked systems. The analysis of non-stationary and nonlinear complex networks requires the applications of ordinary differential equations (ODE). However, the process of resolving input excitation to the dynamic non-stationary networks is difficult without involving external functions. This paper proposes an analytical formulation for generating solutions of nonlinear network ODE systems with functional decomposition. Furthermore, the input excitations are analytically resolved in linearized dynamic networks. The stability condition of dynamic networks is determined. The proposed analytical framework is generalized in nature and does not require any domain or range constraints.

• Management & Information Systems Review
• /
• v.3
• /
• pp.287-316
• /
• 1999

Cyberspace permits us to more beyond traditional face-to-face, mail and telephone surveys, yet still to examine basic issues regarding the quality of data collection: sampling, questionnaire design, survey distribution, means of response, and database creation. This article address each of these issues by contrasting and comparing traditional survey methods(Paper-and-Pencil) with Internet or Personal Computer networks-mediated (Screen-and-Keyboard) survey methods also introduces researchers to this revolutionary and innovative tool and outlines a variety of practical methods for using the Internet or Personal Computer Networks. The revolution in telecommunications technology has fostered the rapid growth of the Internet all over the world. The Internet is a massive global network and comprising many national and international networks of interconnected computers. The Internet or Personal Computer Networks could be the comprehensive interactive tool that will facilitate the development of the skills. The Internet or Personal Computer Networks provides a virtual frontier to expand our access to information and to increase our knowledge and understanding of public opinion, political behavior, social trends and lifestyles through survey research. Comparable to other technological advancements, the Internet or Personal Computer Networks presents opportunities that will impact significantly on the process and quality of survey research now and in the twenty-first century. There are trade-offs between traditional and the Internet or Personal Computer Networks survey. The Internet or Personal Computer Networks is an important channel for obtaining information for target participants. The cost savings in time, efforts, and material were substantial. The use of the Internet or Personal Computer Networks survey tool will increase the quality of research environment. There are several limitations to the Internet or Personal Computer Network survey approach. It requires the researcher to be familiar with Internet navigation and E-mail, it is essential for this process. The use of Listserv and Newsgroup result in a biased sample of the population of corporate trainers. However, it is this group that participates in technology and is in the fore front of shaping the new organizations of interest, and therefore it consists of appropriate participants. If this survey method becomes popular and is too frequently used, potential respondents may become as annoyed with E-mail as the sometimes are with mail survey and junk mail. Being a member of the Listserv of Newsgroup may moderate that reaction. There is a need to determine efficient, effective ways for the researcher to strip identifiers from E-mail, so that respondents remain anonymous, while simultaneously blocking a respondent from responding to a particular survey instrument more than once. The optimum process would be on that is initiated by the researcher : simple, fast and inexpensive to administer and has credibility with respondents. This would protect the legitimacy of the sample and anonymity. Creating attractive Internet or Personal Computer Networks survey formats that build on the strengths of standardized structures but also capitalize on the dynamic and interactive capability of the medium. Without such innovations in survey design, it is difficult to imagine why potential survey respondents would use their time to answer questions. More must be done to create diverse and exciting ways of building an credibility between respondents and researchers on the Internet or Personal Computer Networks. We believe that the future of much exciting research is based in the Electronic survey research. The ability to communicate across distance, time, and national boundaries offers great possibilities for studying the ways in which technology and technological discourse are shaped. used, and disseminated ; the many recent doctoral dissertations that treat some aspect of electronic survey research testify to the increase focus on the Internet or Personal Computer Networks. Thus, scholars should begin a serious conversation about the methodological issues of conducting research In cyberspace. Of all the disciplines, Internet or Personal Computer Networks, emphasis on the relationship between technology and human communication, should take the lead in considering research in the cyberspace.

• International Journal of Computer Science & Network Security
• /
• v.22 no.6
• /
• pp.127-130
• /
• 2022

The number of published journals, conferences, and research papers in computer science is increasing rapidly, which has led to a challenge in coming up with new and unique ideas for research. To alleviate the issue, this paper uses artificial neural networks (ANNs) to generate new computer science research ideas. It does so by using a dataset collected from IEEE published journals and conferences to train an ANN model. The results reveal that the model has a 14% success rate in generating usable ideas. The outcome of this paper has implications for helping both new and experienced researchers come up with novel research topics.

• Convergence Security Journal
• /
• v.8 no.1
• /
• pp.91-100
• /
• 2008

The previous works in sensor networks security have focused on the aspect of confidentiality, authentication and integrity based on cryptographic primitives. There has been no prior work to assess the survivability in systematic way. Accordingly, this paper presents a survivability model of wireless sensor networks using software rejuvenation for dual adaptive cluster head. The survivability model has state transition to reflect status of real wireless sensor networks. In this paper, we only focus on a survivability model which is capable of describing cluster head compromise in the networks and able to switch over the redundant cluster head in order to increase the survivability of that cluster. Second, this paper presents how to enhance the survivability of sensor networks using software rejuvenation methodology for dual cluster head in wireless sensor network. We model and analyze each cluster as a stochastic process based on Semi Markov Process (SMP) and Discrete Time Markov Chain (DTMC). The proof of example scenarios and numerical analysis shows the feasibility of our approach.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.1
• /
• pp.147-169
• /
• 2024

In pace with the development of network technology at lightning speed, social networks have been extensively applied in our lives. However, as social networks retain a large number of users' sensitive information, the openness of this information makes social networks vulnerable to attacks by malicious attackers. To preserve the link privacy of individuals in social networks, an uncertain graph method based on node random response is devised, which satisfies differential privacy while maintaining expected data utility. In this method, to achieve privacy preserving, the random response is applied on nodes to achieve edge modification on an original graph and node differential privacy is introduced to inject uncertainty on the edges. Simultaneously, to keep data utility, a divide and conquer strategy is adopted to decompose the original graph into many sub-graphs and each sub-graph is dealt with separately. In particular, only some larger sub-graphs selected by the exponent mechanism are modified, which further reduces the perturbation to the original graph. The presented method is proven to satisfy differential privacy. The performances of experiments demonstrate that this uncertain graph method can effectively provide a strict privacy guarantee and maintain data utility.

• Journal of applied mathematics & informatics
• /
• v.42 no.2
• /
• pp.291-303
• /
• 2024

In this paper, we consider a feedforward network of overloaded multiclass processor sharing queues and we give a fluid model solution under the condition that the system is initially empty. The main theorem of the paper provides sufficient conditions for a fluid model solution to be linear with time. The results are illustrated through examples.

• Journal of Communications and Networks
• /
• v.14 no.2
• /
• pp.169-178
• /
• 2012

In this paper, we study the advantages of using range extension cooperative transmission (CT) in multi-hop energy harvesting wireless sensor networks (EH-WSNs) from the network layer perspective. EH-WSNs rely on harvested energy, and therefore, if a required service is energy-intensive, the network may not be able to support the service successfully. We show that CT networks that utilize both range extension CT and non-CT routing can successfully support services that cannot be supported by non-CT networks. For a two-hop toy network, we show that range extension CT can provide better services than non-CT. Then, we provide a method of determining the supportable services that can be achieved by using optimal non-CT and CT routing protocols for EH-WSNs. Using our method and network simulations, we justify our claim that CT networks can provide better services than nonCT networks in EH-WSNs.

• ETRI Journal
• /
• v.33 no.6
• /
• pp.924-934
• /
• 2011

Sensor networks play an important role in making the dream of ubiquitous computing a reality. With a variety of applications, sensor networks have the potential to influence everyone's life in the near future. However, there are a number of issues in deployment and exploitation of these networks that must be dealt with for sensor network applications to realize such potential. Localization of the sensor nodes, which is the subject of this paper, is one of the basic problems that must be solved for sensor networks to be effectively used. This paper proposes a probabilistic support vector machine (SVM)-based method to gain a fairly accurate localization of sensor nodes. As opposed to many existing methods, our method assumes almost no extra equipment on the sensor nodes. Our experiments demonstrate that the probabilistic SVM method (PSVM) provides a significant improvement over existing localization methods, particularly in sparse networks and rough environments. In addition, a post processing step for PSVM, called attractive/repulsive potential field localization, is proposed, which provides even more improvement on the accuracy of the sensor node locations.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.749-750
• /
• 2006

TFRC is an equation-based rate control scheme originally developed for video transmission over wired networks. When applied to the wireless networks, it suffers from performance degradation. In this thesis, we propose an end-to-end loss discrimination algorithm to improve the performance of TFRC over wireless networks. The proposed WLD-TFRC scheme combines Spike and WLD(Wireless Loss Discount) algorithms to discriminate wireless loss from congestion loss, and to discount feedback loss event rate. Experimental results show that WLD-TFRC outperforms the original TFRC and effectively reduce the degradation of the video quality caused by the wireless link status.