• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.3
• /
• pp.1035-1048
• /
• 2023

The IEEE 802.11 WLAN adopts a random backoff algorithm for its collision avoidance mechanism, and it is well known that the contention-based algorithm may suffer from performance degradation especially in congested networks. In this paper, we design an efficient backoff algorithm that utilizes a reinforcement learning method to determine optimal values of backoffs. The mobile nodes share a common contention window (CW) in our scheme, and using a Q-learning algorithm, they can avoid collisions by finding and implicitly reserving their optimal time slot(s). In addition, we introduce Frame Size Control (FSC) algorithm to minimize the possible degradation of aggregate throughput when the number of nodes exceeds the CW size. Our simulation shows that the proposed backoff algorithm with FSC method outperforms the 802.11 protocol regardless of the traffic conditions, and an analytical modeling proves that our mechanism has a unique operating point that is fair and stable.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.11
• /
• pp.2923-2930
• /
• 1997

This paper describes two algorithms for technology mapping of multiple output functions into interesting and popular FPGAs (Field Programmable Gate Arrays) that lise look-up table memories. For improvement of technology mapping for FPGA, we use the functional decomposition method for multiple output functions. Two algorithms are proposed. The one is the Roth-Karp algorithm extended for multiple output functions. The other is the novel and efficient algorithm which looks for common decomposition functions through the decomposition procedure. The cost function is used to minimize the number of CLBs and nets and to improve performance of the network. Finally we compare our new algorithm with previous logic design technique. Experimental results show significant reduction in the number of CLBs and nets.

• Korean Institute of Interior Design Journal
• /
• v.21 no.1
• /
• pp.228-239
• /
• 2012

This study aims to propose the improvement direction of spatial organization of orphanage facilities by reflecting the international trend of child welfare facilities including 'enhancement of habitability', 'opening to the local community' and 'multi-functionality' on the basis of ideas of 'right of housing' and 'normalization'. Orphanage facilities are evolving from 'facilities' to accommodate unfortunate children to the concept of the 'community-care', and the residential space is also rapidly shifting to 'cottage' type resembling a residential type of ordinary family so as to enhance the self-esteem and relationship. To suggest the future-oriented changeability of current orphanage facilities, the present study conducted a nationwide survey of child welfare facilities and four Visiting researches of cottage type orphanage with different locations to investigate the appropriateness of housing type, organization of common use space, mode of management and facilities criteria. The results of this study are following: 1) For enhancement of habitability it is suggested that cottage type with various plans in the form of ordinary housing is appropriate, that the number of children per cottage is six or so, and that the number of less than two or three children per room is recommended. At the same time the adjustment of facilities criteria, simplified or complex, is suggested to support a similar residence pattern to ordinary home. 2) Specialized programs must be introduced to establish a base of welfare-network for community children according to features of location and a complex management must be sought in the connection with neighboring public facilities. 3) To secure the residential environment and quality of life for children, the concept of a simple playground space by the current facilities criteria must be broken away to reinforce the network of various outdoor spaces closely connected with living space.

• The Journal of the Korea Contents Association
• /
• v.20 no.10
• /
• pp.544-553
• /
• 2020

This study was intended to examine the academic role of social welfare by analysis the trends of empathic research in the field of social welfare studies in Korea, and to explore the direction and tasks to move forward. For this purpose, technical analysis and language network analysis were performed based on the category system and the frequency of simultaneous language presentation by selecting academic papers related to empathy in the field of social welfare studies in Korea from 2000 to June 2020. According to the analysis, the number of empathic studies in the social welfare field has increased steadily since 2000, and the number of studies in the last three years has increased significantly, and the research field has been mainly in the "social welfare general" category. In terms of research, the most common research was related to empathy and the relationship between other variables, while quantitative research was the most important method used in the research. As empathic-related research increase in social welfare studies, such research results require efforts such as expansion of research field and research contents and attempts of various research methods.

• Journal of Korean Society of Transportation
• /
• v.21 no.1
• /
• pp.53-63
• /
• 2003

The Origin-Destination(OD) matrix is very important in describing transport movements in a region. The OD matrix can be estimated using traffic counts on links in the transport network and other available information. This information on the travel is often contained in a target OD matrix and traffic counts in links. To estimate an OD matrix from traffic counts, they are the major input data which obviously affects the accuracy of the OD matrix estimated, Generally, the quality of an estimated OD matrix depends much on the reliability of the input data, and the number and locations of traffic counting points in the network. Any Process regarding the traffic counts such as the amount and their location has to be carefully studied. The objective of this study is to select of the optimal location of traffic counting points for the OD matrix estimation. The model was tested in nationwide network. The network consists of 224 zones, 3,125 nodes and 6,725 links except to inner city road links. The OD matrix applied for selection of traffic counting points was estimated to 3-constrained entropy maximizing model. The results of this study follow that : the selected alternative to the best optimal counting points of six alternatives is the alternative using common links of OD matrix and vehicle-km and traffic density(13.0% of 6,725 links), however the worst alternative is alternative of all available traffic counting points(44.9% of 6,725 links) in the network. Finally, it should be concluded that the accuracy of reproduced OD matrix using traffic counts related much to the number of traffic counting points and locations.

• Journal of Intelligence and Information Systems
• /
• v.20 no.4
• /
• pp.107-120
• /
• 2014

This study proposes a novel recommender system using the structural hole analysis to reflect qualitative and emotional information in recommendation process. Although collaborative filtering (CF) is known as the most popular recommendation algorithm, it has some limitations including scalability and sparsity problems. The scalability problem arises when the volume of users and items become quite large. It means that CF cannot scale up due to large computation time for finding neighbors from the user-item matrix as the number of users and items increases in real-world e-commerce sites. Sparsity is a common problem of most recommender systems due to the fact that users generally evaluate only a small portion of the whole items. In addition, the cold-start problem is the special case of the sparsity problem when users or items newly added to the system with no ratings at all. When the user's preference evaluation data is sparse, two users or items are unlikely to have common ratings, and finally, CF will predict ratings using a very limited number of similar users. Moreover, it may produces biased recommendations because similarity weights may be estimated using only a small portion of rating data. In this study, we suggest a novel limitation of the conventional CF. The limitation is that CF does not consider qualitative and emotional information about users in the recommendation process because it only utilizes user's preference scores of the user-item matrix. To address this novel limitation, this study proposes cluster-indexing CF model with the structural hole analysis for recommendations. In general, the structural hole means a location which connects two separate actors without any redundant connections in the network. The actor who occupies the structural hole can easily access to non-redundant, various and fresh information. Therefore, the actor who occupies the structural hole may be a important person in the focal network and he or she may be the representative person in the focal subgroup in the network. Thus, his or her characteristics may represent the general characteristics of the users in the focal subgroup. In this sense, we can distinguish friends and strangers of the focal user utilizing the structural hole analysis. This study uses the structural hole analysis to select structural holes in subgroups as an initial seeds for a cluster analysis. First, we gather data about users' preference ratings for items and their social network information. For gathering research data, we develop a data collection system. Then, we perform structural hole analysis and find structural holes of social network. Next, we use these structural holes as cluster centroids for the clustering algorithm. Finally, this study makes recommendations using CF within user's cluster, and compare the recommendation performances of comparative models. For implementing experiments of the proposed model, we composite the experimental results from two experiments. The first experiment is the structural hole analysis. For the first one, this study employs a software package for the analysis of social network data - UCINET version 6. The second one is for performing modified clustering, and CF using the result of the cluster analysis. We develop an experimental system using VBA (Visual Basic for Application) of Microsoft Excel 2007 for the second one. This study designs to analyzing clustering based on a novel similarity measure - Pearson correlation between user preference rating vectors for the modified clustering experiment. In addition, this study uses 'all-but-one' approach for the CF experiment. In order to validate the effectiveness of our proposed model, we apply three comparative types of CF models to the same dataset. The experimental results show that the proposed model outperforms the other comparative models. In especial, the proposed model significantly performs better than two comparative modes with the cluster analysis from the statistical significance test. However, the difference between the proposed model and the naive model does not have statistical significance.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.2 s.34
• /
• pp.49-57
• /
• 2005

In this paper. a CLB-based CPLD low power technology mapping algorithm for trade-off is proposed. To perform low power technology mapping for CPLD, a given Boolean network has to be represented to DAG. The proposed algorithm consists of three step. In the first step, TD(Transition Density) calculation have to be Performed. Total power consumption is obtained by calculating switching activity of each nodes in a DAG. In the second step, the feasible clusters are generated by considering the following conditions : the number of output. the number of input and the number of OR-terms for CLB within a CPLD. The common node cluster merging method, the node separation method, and the node duplication method are used to produce the feasible clusters. The proposed algorithm is examined by using benchmarks in SIS. In the case that the number of OR-terms is 5, the experiments results show reduction in the power consumption by 30.73$\%$ comparing with that of TEMPLA, and 17.11$\%$ comparing with that of PLAmap respectively

• Journal of KIISE:Information Networking
• /
• v.34 no.6
• /
• pp.493-504
• /
• 2007

With the advance and proliferation of computer and wireless network technology, it is common to access to network through the wireless network using mobile device. The ratio of using the streaming media out of many applications through the network is increasing not only in the wired network but also in the wireless network. The streaming media is much bigger than other contents and requires more network bandwidth to communicate and more computing resources to process. However the mobile devices have relatively poor computing resource and low network bandwidth. If the streaming media service is provided for mobile devices without any consideration about the network bandwidth and computing power, it is difficult for the client to get the service of high quality. Since especially mobile devices are supported with very limited energy capacity from the battery, the streaming media service should be adjusted to the varying energy state of mobile devices to ensure the complete playback of streaming media. In this paper, we propose a new method to guarantee the complete playback time of the streaming media for the mobile clients by dynamically controlling transmitted frame rate to the client according to the estimated available time of mobile device using battery model reflecting the characteristic of the battery. Since the proposed method controls the number of frames transmitting to the client according to the energy state of the mobile device, the complete playback time is guaranteed to mobile clients.

• Journal of Intelligence and Information Systems
• /
• v.24 no.1
• /
• pp.25-52
• /
• 2018

This study performs social network analysis based on consumer sentiment related to a location in Seoul using data reflecting consumers' web search activities and emotional evaluations associated with commerce. The study focuses on large commercial districts in Seoul. In addition, to consider their various aspects, social network indexes were combined with the trading area's public data to verify factors affecting the area's sales. According to R square's change, We can see that the model has a little high R square value even though it includes only the district's public data represented by static data. However, the present study confirmed that the R square of the model combined with the network index derived from the social network analysis was even improved much more. A regression analysis of the trading area's public data showed that the five factors of 'number of market district,' 'residential area per person,' 'satisfaction of residential environment,' 'rate of change of trade,' and 'survival rate over 3 years' among twenty two variables. The study confirmed a significant influence on the sales of the trading area. According to the results, 'residential area per person' has the highest standardized beta value. Therefore, 'residential area per person' has the strongest influence on commercial sales. In addition, 'residential area per person,' 'number of market district,' and 'survival rate over 3 years' were found to have positive effects on the sales of all trading area. Thus, as the number of market districts in the trading area increases, residential area per person increases, and as the survival rate over 3 years of each store in the trading area increases, sales increase. On the other hand, 'satisfaction of residential environment' and 'rate of change of trade' were found to have a negative effect on sales. In the case of 'satisfaction of residential environment,' sales increase when the satisfaction level is low. Therefore, as consumer dissatisfaction with the residential environment increases, sales increase. The 'rate of change of trade' shows that sales increase with the decreasing acceleration of transaction frequency. According to the social network analysis, of the 25 regional trading areas in Seoul, Yangcheon-gu has the highest degree of connection. In other words, it has common sentiments with many other trading areas. On the other hand, Nowon-gu and Jungrang-gu have the lowest degree of connection. In other words, they have relatively distinct sentiments from other trading areas. The social network indexes used in the combination model are 'density of ego network,' 'degree centrality,' 'closeness centrality,' 'betweenness centrality,' and 'eigenvector centrality.' The combined model analysis confirmed that the degree centrality and eigenvector centrality of the social network index have a significant influence on sales and the highest influence in the model. 'Degree centrality' has a negative effect on the sales of the districts. This implies that sales decrease when holding various sentiments of other trading area, which conflicts with general social myths. However, this result can be interpreted to mean that if a trading area has low 'degree centrality,' it delivers unique and special sentiments to consumers. The findings of this study can also be interpreted to mean that sales can be increased if the trading area increases consumer recognition by forming a unique sentiment and city atmosphere that distinguish it from other trading areas. On the other hand, 'eigenvector centrality' has the greatest effect on sales in the combined model. In addition, the results confirmed a positive effect on sales. This finding shows that sales increase when a trading area is connected to others with stronger centrality than when it has common sentiments with others. This study can be used as an empirical basis for establishing and implementing a city and trading area strategy plan considering consumers' desired sentiments. In addition, we expect to provide entrepreneurs and potential entrepreneurs entering the trading area with sentiments possessed by those in the trading area and directions into the trading area considering the district-sentiment structure.

• Journal of Internet Computing and Services
• /
• v.11 no.3
• /
• pp.139-148
• /
• 2010

In the sensor network security area, previous works were mainly concentrated on achieving authentication, confidentiality, integrity and availability. But the ID exposure issue is recently an increasing concern in research community. To protect the ID exposure from various attacks, the most common approach is to make use of a dynamic pseudonym rather than the real ID. However, if a node's secret key (or hash key) and the current pseudonym (such as a random number) are exposed, the attacker can easily generate the previous/next pseudonyms. In this paper, we propose a security infra-structure scheme for enabling strong anonymity of sensor nodes. Our scheme ensures that the probability being able to generate a pseudonym is very low even if a sensor node has been compromised with an attacker. Security analyses have proven that our scheme is suitable for sensor network environments in terms of preserving of forward anonymity as well as backward anonymity.