• Journal of the Korea Society of Computer and Information
• /
• v.24 no.4
• /
• pp.1-9
• /
• 2019

LRR(Loose Round Robin) warp scheduling policy for GPU architecture results in high warp-level parallelism and balanced loads across multiple warps. However, traditional LRR policy makes multiple warps execute long latency operations at the same time. In cases that no more warps to be issued under long latency, the throughput of GPUs may be degraded significantly. In this paper, we propose a new warp scheduling policy which utilizes latency hiding, leading to more utilized memory resources in high performance GPUs. The proposed warp scheduler prioritizes memory instruction based on GTO(Greedy Then Oldest) policy in order to provide reduced memory stalls. When no warps can execute memory instruction any more, the warp scheduler selects a warp for computation instruction by round robin manner. Furthermore, our proposed technique achieves high performance by using additional information about recently committed warps. According to our experimental results, our proposed technique improves GPU performance by 12.7% and 5.6% over LRR and GTO on average, respectively.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.1
• /
• pp.323-342
• /
• 2021

Personal health records (PHRs) is an electronic medical system that enables patients to acquire, manage and share their health data. Nevertheless, data confidentiality and user privacy in PHRs have not been handled completely. As a fine-grained access control over health data, ciphertext-policy attribute-based encryption (CP-ABE) has an ability to guarantee data confidentiality. However, existing CP-ABE solutions for PHRs are facing some new challenges in access control, such as policy privacy disclosure and dynamic policy update. In terms of addressing these problems, we propose a privacy protection and dynamic share system (PPADS) based on CP-ABE for PHRs, which supports full policy hiding and flexible access control. In the system, attribute information of access policy is fully hidden by attribute bloom filter. Moreover, data user produces a transforming key for the PHRs Cloud to change access policy dynamically. Furthermore, relied on security analysis, PPADS is selectively secure under standard model. Finally, the performance comparisons and simulation results demonstrate that PPADS is suitable for PHRs.

• Journal of Digital Convergence
• /
• v.20 no.5
• /
• pp.107-117
• /
• 2022

Due to the continuous spread of COVID-19 and the overall decline of the global economy, the business environment of Chinese SMEs is poor, the level of abusive supervision among managers of Chinese SMEs has generally risen state. First of all, the management' abusive supervision has a negative impact on the members' trust in leader. Secondly, the members' trust in leader has a negative impact on the members' knowledge hiding. However, the members' trust in leader has a positive impact on job engagement. Accordingly, this study puts forward some revelations on how to reduce the management' abusive supervision in Chinese small and medium-sized enterprises and the members' knowledge hiding, as well as how to improve the members' knowledge hiding and job engagement.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.5
• /
• pp.2768-2780
• /
• 2019

Ciphertext-policy attribute-based encryption (CP-ABE) is one of the practical technologies to share data over cloud since it can protect data confidentiality and support fine-grained access control on the encrypted data. However, most of the previous schemes only focus on data confidentiality without considering data receiver privacy preserving. Recently, Li et al.(in TIIS, 10(7), 2016.7) proposed a CP-ABE with hidden access policy and testing, where they declare their scheme achieves privacy preserving for the encryptor and decryptor, and also has high decryption efficiency. Unfortunately, in this paper, we show that their scheme fails to achieve hidden access policy at first. It means that any adversary can obtain access policy information by a simple decisional Diffie-Hellman test (DDH-test) attack. Then we give a method to overcome this shortcoming. Security and performance analyses show that the proposed scheme not only achieves the privacy protection for users, but also has higher efficiency than the original one.

• Journal of applied mathematics & informatics
• /
• v.6 no.3
• /
• pp.823-834
• /
• 1999

The present paper deals with the problem of nonselective harvesting in a partly infecte prey and predator system in which both the suseptible prey and the predator follow the law of logistic growth and some preys avoid predation by hiding. The dynamical behaviour of the system has been studied in both the local and global sense. The optimal policy of exploitation has been derived by using Pontraygin's maximal principle. Numerical analysis and computer simulation of the results have been performed to inverstigate the global properties of the system.

• Journal of Digital Convergence
• /
• v.9 no.1
• /
• pp.89-106
• /
• 2011

With the development of the Internet, the media market is experiencing rapid change. The traditional form of offline newspaper markets, which has created the mainstream news delivery market, have been losing large amounts of power due to the emergence of online media. On the other hand, online media armed with its ability to post breaking news almost as it occurs has increased its influence and popularity at a rapid speed. However, since the exposure time and readership of online newspapers are less than their offline counterparts online media has a high dependence on sensational titles and somewhat exaggerating headlines rather than the objective and recapitulative headlines which are preferred. This paper will examine the function and significance of headlines, and conduct a comparative analysis on contents and forms of the headlines in offline newspaper and online newspaper in order to identify the characteristics of each newspaper. Through comparisons, it examines the types of headlines and the transference of headlines. In addition, it examines the differences in recognition of copy editors according to media in determining the headline, and it illuminates which type of headlines is preferred in order to instigate readers to read online newspapers. The analysis results of title-transferring cases in offline newspaper and online newspapers are that offline newspapers try to convey the contents accurately by making use of an information-transferring headline, while attention-attracting headline or subject-hiding headlines tend to be used for attracting the eye of readers. In addition, analysis results of headlines that are put on the top with a click counts in online newspapers are that attention-attracting headlines are the majority, while subject-hiding headlines that are hardly used in offline newspapers, are well-used in online newspapers. In an interview with copy editors, they responded that offline editors focus on the fact-transference in determining the title, while online editors put the weight on immediacy in the delivery of news and the function of guiding readers.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.10
• /
• pp.5100-5119
• /
• 2018

Most of existing privacy-preserving multi-authorities attribute-based encryption schemes (PP-MA-ABE) only considers the privacy of the user identity (ID). However, in many occasions information leakage is caused by the disclosing of his/her some sensitive attributes. In this paper, we propose a collusion-resisting ciphertext-policy PP-MA-ABE (CRPP-MACP-ABE) scheme with hiding both user's ID and attributes in the cloud storage system. We present a method to depict anonymous users and introduce a managerial role denoted by IDM for the management of user's anonymous identity certificate ($AID_{Cred}$). The scheme uses $AID_{Cred}$ to realize privacy-preserving of the user, namely, by verifying which attribute authorities (AAs) obtain the blinded public attribute keys, pseudonyms involved in the $AID_{Cred}$ and then distributes corresponding private keys for the user. We use different pseudonyms of the user to resist the collusion attack launched by viciousAAs. In addition, we utilize IDM to cooperate with multiple authorities in producing consistent private key for the user to avoid the collusion attack launched by vicious users. The proposed CRPP-MACP-ABE scheme is proved secure. Some computation and communication costs in our scheme are finished in preparation phase (i.e. user registration). Compared with the existing schemes, our scheme is more efficient.

• Journal of applied mathematics & informatics
• /
• v.6 no.3
• /
• pp.835-850
• /
• 1999

The present paper deals with the problem of nonselective harvesting in a partly infected prey and predator system in which both the susceptible prey and the predator follow the law of logistic growth and some preys avoid predation by hiding. The dynamical behaviour of the system has been studied in both the local and global sense. The optimal policy of exploitation has been derived by using Pontraygin's maximal principle. Numerical analysis and computer simulation of the results have been performed to investigate the golbal properties of the system.

• KDI Journal of Economic Policy
• /
• v.25 no.1
• /
• pp.99-145
• /
• 2003

Quasi-fiscal activities (QFAs) refer to those activities that public corporations carry out to achieve policy objectives of the government. QFAs often lead to the understatement of the government involvement in the economy and the overstatement of its financial balance, thereby lowering fiscal transparency and hiding fiscal risks. Central banks, as public corporations, perform various QFAs in many countries. I define QFAs in this case as those activities that are not directly related to the intrinsic function of central banks, whose responsibility lies in the administration of monetary policy and the provision of banking services for the government and commercial banks. In Korea, the Bank of Korea (BOK) has been an active source of QFAs. Of particular importance are the policy loans to commercial banks to promote their lending to small- and medium-sized enterprises and others. The outstanding stock of policy loans increased rapidly in the aftermath of the recent economic crisis, and stood at 7.6 trillion won (20 percent of the reserve money) at the end of 2002. Another important QFA by BOK stems from the transfer of part of its profits to the central government. The accumulated transfer during 1998-2002 amounted to 9.9 trillion won. My calculation shows that if these and other QFAs had been carried out by the government as explicit fiscal activities, the consolidated central government financial balance would have been below the actual balance by about 0.5 percent of GDP in each year since the economic crisis. It is suggested that the QFAs by BOK be reduced in coming years not only to enhance fiscal transparency but also to expand the flexibility of BOK's reserve management. Abolishing policy loans and minimizing transfers to the government would be the first step in this direction. BOK should also consider paying interest on the government deposit held in BOK.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.5
• /
• pp.219-230
• /
• 2017

General-Purpose Graphics Processing Units (GPGPUs) build massively parallel architecture and apply multithreading technology to explore parallelism. By using programming models like CUDA, and OpenCL, GPGPUs are becoming the best in exploiting plentiful thread-level parallelism caused by parallel applications. Unfortunately, modern GPGPU cannot efficiently utilize its available hardware resources for numerous general-purpose applications. One of the primary reasons is the inefficiency of existing warp/thread block schedulers in hiding long latency instructions, resulting in lost opportunity to improve the performance. This paper studies the effects of hardware thread scheduling policy on GPGPU performance. We propose a novel warp scheduling policy that can alleviate the drawbacks of the traditional round-robin policy. The proposed warp scheduler first classifies the warps of a thread block into two groups, warps with long latency and warps with short latency and then schedules the warps with long latency before the warps with short latency. Furthermore, to support the proposed warp scheduler, we also propose a supplemental technique that can dynamically reduce the number of streaming multiprocessors to which will be assigned thread blocks when encountering a high contention degree at the memory and interconnection network. Based on our experiments on a 15-streaming multiprocessor GPGPU platform, the proposed warp scheduling policy provides an average IPC improvement of 7.5% over the baseline round-robin warp scheduling policy. This paper also shows that the GPGPU performance can be improved by approximately 8.9% on average when the two proposed techniques are combined.