• IE interfaces
• /
• v.13 no.3
• /
• pp.444-454
• /
• 2000

Due to the improvement of modern information technologies, sharing stock information among the supply chain members is a common practice nowadays. Many companies are planning to adopt the information systems to possess the real-time shared stock information. Thus, it is needed to quantify the value of shared stock information. The purpose of this paper is to evaluate the value of the shared stock information for two-echelon distribution systems. Existing reorder policies can be classified into installation stock policies and echelon stock policies. Since installation stock policies do not utilize the shared stock information, and both classes of policies may show poor performances for distribution systems, we cannot evaluate the value of the shared stock information with the existing policies. Thus, we provide a new type of reorder policy, named order risk policy. We define the order risk using marginal analysis, and prove the optimality. Through computational experiment that compares the order risk policy with the existing policies, it is shown that a significant cost reduction is achieved with the effective utilization of the shared stock information. We also show the effect of the system characteristics on the value of the shared stock information.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.37 no.3
• /
• pp.95-116
• /
• 2012

The purpose of this paper is to show the effect of information sharing strategy on the supply chain performances. While traditional information sharing models assumed centralized stock information, recent supply chain practices often implement fully shared stock information, where real-time stock information is accessible on retailers. When retailers are competing with each other, this fully shared stock information may incur retailers' strategic order behaviors. Thus, this paper analyzes a simple two-level supply chain consisting of one warehouse and two identical competing retailers where the real time stock information is fully shared. The warehouse uses the traditional echelon stock policy. Under this environment the retailers' reorder decisions are derived using the order risk concept and the retailer competition mechanism is analyzed. Computational results show that the supply chain performace degradation in the fully shared stock information is quite significant, implying the importance of designing information sharing strategies in the supply chain design phase.

• Journal of Information Processing Systems
• /
• v.19 no.2
• /
• pp.219-231
• /
• 2023

Intelligent applications are crucial for increasing the popularity of shared urban electric bicycles (EBs). Building an application platform architectural system that can satisfy independent user operations is critical for increasing the intelligent usage of shared EBs. Consequently, we collected online reviews of shared EB applications, conducted semantic processing and sentiment analysis, and refined the positive and negative review data for each function. The positive and negative review indices of each function were calculated using the formulae for positive and negative review indices of product functions, thereby determining the functions that need to be improved. Each function of the Shared EB application was improved according to its business process. The main contributions of this study are to build a user requirement architecture system for the Shared EB application with five dimensions and 22 functions using the Delphi method to design the user interface (UI) of this application based on user satisfaction evaluation results; to create a high-fidelity dynamic interaction prototype and compare user satisfaction before and after improving the Shared EB application functions. The testing results indicate that the changes in the UI significantly improve the user experience satisfaction of the urban Shared EB application, with the positive experience index increasing by 69.21% and the negative experience index decreasing by 75.85% overall. This information can be directly used by relevant companies to improve the functions of the Shared EB application.

• Journal of KIISE:Databases
• /
• v.35 no.5
• /
• pp.411-420
• /
• 2008

The number of XML documents, which are widely used as a standard method for information expression and exchange in the web-based environment, increases rapidly along with the growing production of large XML documents. Many studies have been made to store and retrieve these XML documents on RDBMS, among which Shared Inlining storage method has a higher level of retrieval efficiency. The Shared Inlining method is the technique that analyzes the DTD information and stores the XML document in RDBMS by dividing for each node component. This study proposes the technique to resolve the overlapping problem that occurs in the element with several child nodes in the existing Shared Inlining method. The suggested method stores the XML document in the Shared Inlining structures appropriate to the DTD definition and enhances the accuracy of retrieval.

• Journal of Communications and Networks
• /
• v.10 no.3
• /
• pp.331-337
• /
• 2008

In this paper, we investigate survivability in wavelength division multiplexing (WDM) mesh networks and propose a new algorithm called improved shared-path protection (ISPP) to completely tolerate the double-link failures. Compared with previous algorithms for protecting double-link failures, i.e., shared-path protection (SPP) and shared-link protection (SLP), the advantage of ISPP is to allow primary paths and backup paths to share the mixed wavelength-links based on the proposed new rules in which some primary wavelength-links can be changed to mixed wavelength-links, which can be shared by primary paths and backup paths. In addition, some mixed wavelength-links also can be shared by different backup paths for saving resources. Simulation results show that ISPP algorithm performs better in resource utilization ratio and blocking probability than conventional SPP and SLP algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.3319-3338
• /
• 2016

Cloud storage is becoming more and more popular because of its elasticity and pay-as-you-go storage service manner. In some cloud storage scenarios, the data that are stored in the cloud may be shared by a group of users. To verify the integrity of cloud data in this kind of applications, many auditing schemes for shared cloud data have been proposed. However, all of these schemes do not consider the access authorization problem for users, which makes the revoked users still able to access the shared cloud data belonging to the group. In order to deal with this problem, we propose a novel public auditing scheme for shared cloud data in this paper. Different from previous work, in our scheme, the user in a group cannot any longer access the shared cloud data belonging to this group once this user is revoked. In addition, we propose a new random masking technique to make our scheme preserve both data privacy and identity privacy. Furthermore, our scheme supports to enroll a new user in a group and revoke an old user from a group. We analyze the security of the proposed scheme and justify its performance by concrete implementations.

• KIPS Transactions on Computer and Communication Systems
• /
• v.12 no.7
• /
• pp.217-226
• /
• 2023

As the use of shared electric kickboards is rapidly increasing, there are many cases of illegal parking of shared mobility. In order to solve this problem, local governments are taking measures such as towing illegally parked shared electric kickboards, but user management is not considered and the methods are inefficient. Accordingly, in this paper, we propose a blockchain-based shared electric kickboard user management model. The shared electric kickboard is equipped with a camera sensor and GPS that can check the parking status, and when the user ends the use of the shared electric kickboard, information on the parking status is collected through the installed sensors and the shared electric kickboard company You can check if the user has parked correctly. In addition, trust points are given according to the user's parking history and incentives are provided according to the trust points, inducing users to return the shared evangelism kickboard correctly. The information is shared through the consortium blockchain in which shared electric kickboard companies participate, enabling integrated user management of shared electric kickboard companies.

• Asia pacific journal of information systems
• /
• v.13 no.1
• /
• pp.197-211
• /
• 2003

Intensified competition, splintered mass market, shortened product life cycles, and advanced technology and automation let companies to crease the IT investment to meet the changes, Although IT investment increased, IS didn't show the visible outcome. One of the major interest of IS managers is how to demonstrate the business value of the firm's investment in information technology. This paper proposes the revised model of Nelson & Cooprider(1990) regarding shared knowledge between IS and line groups. Knowledge can be shared through mutual trust, mutual influence and communication between these two groups. The revised model including communication is tested empirically using LISREL. The results show that shared knowledge mediated the relationship between IS performance and mutual trust, mutual influence and communication. And shared knowledge between IS and line groups increase IS performance. IS managers should develop mutual trust, mutual influence and communication between these groups to achieve more shared knowledge and higher IS performance.

• Journal of the Korean Society for information Management
• /
• v.14 no.1
• /
• pp.183-206
• /
• 1997

The information Retrieval Protocol, Z39.50 is applied to the shared cataloging gateway. The history and functions of the Z39.50 are reviewed and the characteristics and the database update service of Z39.50 are taken into account in the notion of the shared cataloging. And for the test, one of the domestic on-line shared cataloging systems is adopted and newly remodelled using Z39.50 protocol. Two kinds of Z39.50 shared cataloging gateway models (th centralized shared cataloging gateway model and the distributed shared cataloging gateway model) are operated in Web server.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.8
• /
• pp.1448-1455
• /
• 2008

This paper designs Shared Memory on the Dual Core system so that it operates a general System V IPC on the Linux O.S. Shared Memory is the technique that many processes can access to identical memory area. We treat Shared Memory in this paper among big two branches of Shared Memory which are SVR in a kernel step format. We design a share memory facility of Linux operating system on the Dual Core System. In this paper the suggesting design plan of share memory facility in Dual Core system is enhancing the performance in existing unity processor system as a dual core practical use. We attempt a performance enhance in each CPU for each process which uses a share memory.