• Information Systems Review
• /
• v.18 no.2
• /
• pp.199-223
• /
• 2016

As social networking services (SNS) become widely used tools for maintaining social relationships, people use SNS to express themselves online. Users are free to form multiple characters in SNS because of online anonymity. This phenomenon causes SNS users to easily demonstrate multiple personas that are different from their identities in the real world. Therefore, this study focuses on online multi-personas that establish multiple fake identities in the SNS environment. The main objective of this study is to investigate factors that affect online multi-personas. Fake online identities can have various negative consequences such as cyber bullying, cyber vandalism, or antisocial behavior. Since the boundary between the online and offline worlds is fading fast, these negative aspects of online behavior may influence offline behaviors as well. This study focuses on teenagers who often create multi-personas online. According to previous studies, personal identities are usually established during a person's youth. Based on data on 664 teenage users, this study identifies four emotional factors, namely, closeness with others, relative deprivation, peer pressure and social norms. According to data analysis results, three factors (except closeness with others) have positive correlations with users' multi-personas. This study contributes to the literature by identifying the factors that cause young people to form online multi-personas, an issue that has not been fully discussed in previous studies. From a practical perspective, this study provides a basis for a safe online environment by explaining the reasons for creating fake SNS identities.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.6
• /
• pp.1379-1397
• /
• 2013

We consider a system where a licensed radio spectrum is shared by multiple primary users(PUs) and secondary users(SUs). As the spectrum of interest is licensed to primary network, power and channel allocation must be carried out within the cognitive radio network so that no excessive interference is caused to PUs. For this system, we study the joint beamforming and power allocation problem via game theory in this paper. The problem is formulated as a non-cooperative beamforming and power allocation game, subject to the interference constraints of PUs as well as the peak transmission power constraints of SUs. We design a joint beamforming and power allocation algorithm for maximizing the total throughput of SUs, which is implemented by alternating iteration of minimum mean square error based decision feedback beamforming and a best response based iterative power allocation algorithm. Simulation results show that the algorithm has better performance than an existing algorithm and can converge to a locally optimal sum utility.

• Journal of Information Processing Systems
• /
• v.13 no.3
• /
• pp.546-558
• /
• 2017

The amount of multimedia traffic over the Internet has been increasing because of the development of networks and mobile devices. Accordingly, studies on multicast, which is used to provide efficient multimedia and video services, have been conducted. In particular, studies on centralized multicast tree construction have attracted attention with the advent of software-defined networking. Among the centralized multicast tree construction algorithms, the group Takahashi and Matsuyama (GTM) algorithm is the most commonly used in multiple multicast tree construction. However, the GTM algorithm considers only the network-cost overhead when constructing multicast trees; it does not consider the temporary service disruption that arises from a link change for users receiving an existing service. Therefore, in this study, we propose a multiple multicast tree construction algorithm that can reduce network cost while avoiding considerable degradation of service quality to users. This is accomplished by considering both network-cost and link-change overhead of users. Experimental results reveal that, compared to the GTM algorithm, the proposed algorithm significantly improves the user-experienced quality of service by substantially reducing the number of linkchanged users while only slightly adding to the network-cost overhead.

• Journal of Communications and Networks
• /
• v.12 no.3
• /
• pp.222-230
• /
• 2010

In this paper, we present a closed-form approximation of the average sum rate of zero-forcing (ZF) beamforming (BF) with semi-orthogonal user selection (SUS). We first derive the survival probability associated with the SUS that absolute square of the channel correlation between two users is less than the orthogonalization level threshold (OLT).With this result, each distribution for the number of surviving users at each iteration of the SUS and the number of streams for transmission is calculated. Secondly, the received signal power of ZF-BF is represented as a function of the elements of the upper triangular matrix from QR decomposition of the channel matrix. Thirdly, we approximate the received signal power of ZF-BF with the SUS as the maximum of scaled chisquare random variables where the scaling factor is approximated as a function of both OLT and the number of users in the system. Putting all the above derivations and order statistics together, the approximated ergodic sum rate of ZF-BF with the SUS is shown in a closed form. The simulation results verify that the approximation tightly matches with the sample average for any OLT and even for a small number of users.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.6
• /
• pp.2240-2254
• /
• 2021

We investigate the channel allocation problem in an ultra-dense device-to-device (D2D) enabled cellular network in underlaying mode where multiple D2D users are forced to share the same channel. Two kinds of low complexity solutions, which just require partial channel state information (CSI) exchange, are devised to resolve the combinatorial optimization problem with the quality of service (QoS) guaranteeing. We begin by sorting the cellular users equipment (CUEs) links in sequence in a matric of interference tolerance for ensuring the SINR requirement. Moreover, the interference quota of CUEs is regarded as one kind of communication resource. Multiple D2D candidates compete for the interference quota to establish spectrum sharing links. Then base station calculates the occupation of interference quota by D2D users with partial CSI such as the interference channel gain of D2D users and the channel gain of D2D themselves, and carries out the channel allocation by setting different access priorities distribution. In this paper, we proposed two novel fast matching algorithms utilize partial information rather than global CSI exchanging, which reduce the computation complexity. Numerical results reveal that, our proposed algorithms achieve outstanding performance than the contrast algorithms including Hungarian algorithm in terms of throughput, fairness and access rate. Specifically, the performance of our proposed channel allocation algorithm is more superior in ultra-dense D2D scenarios.

• Journal of Korean Library and Information Science Society
• /
• v.24
• /
• pp.163-187
• /
• 1996

The library catalog is considered an important tool to provide library users with conveniences making a search for necessary information. Accordingly, the purpose of this study is to investigate "behaviors and attitudes" of library users in a university library using online and card catalogs together, to compare their distinctions between online and card catalogs and then to bring about reforms for the development of future cataloging, thereby improving the utilization of online catalog and its service expansion. For this, this paper carried out a survey research which was randomly questionaired 280 library users of four universities in Seoul from March 28th to April 16th 1996. Major findings are as follow : 1. Library users tended to use more online catalog(50.0%) than card catalog (21.9%). 2. The main reasons the library users us online catalog were time saving(24.0%), convenience of use(21.3%), multiple searching possibility (16.2%), and the preferences of card catalog were location of library materials(34.6%), time saving(17.5%), Bibliographic information(14.9%). 3. The major access points which library users utilized mostly in their online catalog are title(30.3%), author(29.2%) and subject heading (17.6%), and for card catalog, title(40.5%), author(34.6%) and call no.(11.1%). 4. The methods library users learned to use online catalog are terminal screen(44.7%), online manual(26.1%), and for card catalog, library orientation(42.6%), librarian's help(18.5%). 5. It was shown that library users were not mostly satisfied about their searching results: the users satisfied with online catalog in the order of partly(46.2%), as expected(42.3%), more than expected(10.4%), and with the card catalog in the order of partly(54.6%), as expected(27.3%), more than expected(10.4%). It was found that although library users preferred online catalog more than card catalog, 54.8% of the total catalog users were not satisfied about the search results they have had. 6. The items which library users want to add to online catalog are catalogs of materials other libraries have(41.6%), catalogs of the materials the library has(29.3%), titles of serial articles(17.7%). And the additional services library users want are checking function of loan materials and reservation of materials(15.5%), subject headings(14.5%), more terminals(13.4%), catalog use explanations(12.9%), multiple access points(11.0%), searching function of contents, abstracts, and indexes(9.6%). Considering the fact that library users tend to use more favorably online catalog than card catalog and the trend that library change from card catalog to online catalog, it is strongly recommended to su n.0, pply students with formal and informal training programs for online catalog use.talog use.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1995.10a
• /
• pp.284-289
• /
• 1995

This paper presents a haptic display of a cooperative work between the networked multiple users. Excluding the possibility of large timedelay among the users, it is presented the way of configuring individual haptic display systems including the computation of interaction forces, joint driving forces of haptic devices and simulation of the virtual objects. A haptic display system is developed consisting of two haptic display devices operated by two remote users and experimental results to show the validity of the proposed method are also presented.

• International journal of advanced smart convergence
• /
• v.9 no.3
• /
• pp.49-58
• /
• 2020

Non-orthogonal multiple access (NOMA) has been recognized as a significant technology in the fifth generation (5G) and beyond mobile communication, which encompasses the advanced smart convergence of the artificial intelligence (AI) and the internet of things (IoT). In NOMA, since the channel resources are shared by many users, it is essential to establish the user fairness. Such fairness is achieved by the power allocation among the users, and in turn, the less power is allocated to the stronger channel users. Especially, the first and second strong channel users have to share the extremely small amount of power. In this paper, we consider the power optimization for the two users with the small power. First, the closed-form expression for the power allocation is derived and then the results are validated by the numerical results. Furthermore, with the derived analytical expression, for the various channel environments, the optimal power allocation is investigated and the impact of the channel gain difference on the power allocation is analyzed.

• ETRI Journal
• /
• v.40 no.6
• /
• pp.813-823
• /
• 2018

In existing mobile computing environments, users need to choose between their privacy and the services that they can receive from an application. However, existing mobile platforms do not allow users to perform such trade-offs in a fine-grained manner. In this study, we investigate whether users can effectively make utility-privacy trade-offs when they are provided with a multilevel privacy control method that allows them to recognize the different quality of service that they will receive from an application by limiting the disclosure of their private information in multiple levels. We designed a research model to observe users' utility-privacy trade-offs in accordance with the privacy control methods and other factors such as the trustworthiness of an application, quality level of private information, and users' privacy preferences. We conducted a user survey with 516 participants and found that, compared with the existing binary privacy controls, both the service utility and the privacy protection levels were significantly increased when the users used the multilevel privacy control method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.5039-5061
• /
• 2017

Cloud storage becomes a new trend that more and more users move their data to cloud storage servers (CSSs). To ensure the security of cloud storage, many cloud auditing schemes are proposed to check the integrity of users' cloud data. However, most of them are based on public key infrastructure, which leads to complex certificates management and verification. Besides, most existing auditing schemes are inefficient when user uploads a large amount of data or a third party auditor (TPA) performs auditing for multiple users' data on different CSSs. To overcome these problems, in this paper, we propose an efficient and secure auditing scheme based on identity-based cryptography. To relieve user's computation burden, we introduce a proxy, which is delegated to generate and upload homomorphic verifiable tags for user. We extend our auditing scheme to support auditing for dynamic data operations. We further extend it to support batch auditing in multiple users and multiple CSSs setting, which is practical and efficient in large scale cloud storage system. Extensive security analysis shows that our scheme is provably secure in random oracle model. Performance analysis demonstrates that our scheme is highly efficient, especially reducing the computation cost of proxy and TPA.