• The KIPS Transactions:PartD
• /
• v.17D no.1
• /
• pp.9-16
• /
• 2010

Web service mashup bacomes one of the important web application development methods. This paper considers a client based mashup, where a page interfaces many service methods asynchronously. Browser systems execute callbacks when the corresponding reply arrives, possibly concurrent to user interface actions. In this case, callbacks and user interface actions share data memory and screen. Moreover, when the user is able to send another request before the previous ones have replied, the shared resource problem becomes more complicated. In order to solve the multiple requests problem, our contributions are as follows. First, we modeled a mashup page with user actions and callbacks, and we presented several types of callbacks. Secondly, concurrency condition is defined between callbacks and user actions in terms of shared resources, and the test method is presented. Also, we proposed the serialization approach to guarantee the safe execution of callbacks. Finally, we applied the proposed concurrency condition on XForms language and extended the XForms browser to implement the proposed approach. The prototype implementation showed that the proposed approach helps enhancing user experience on mashup pages.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.3
• /
• pp.367-373
• /
• 2022

As deep learning-based autonomous driving technology develops, artificial intelligence models for various purposes have been studied. Based on these studies, several models were used simultaneously to develop autonomous driving systems. It can occur by increasing hardware resource consumption. We propose a multi-tasks model using a shared backbone to solve this problem. This can solve the increase in the number of backbones for using AI models. As a result, in the proposed lightweight model, the model parameters could be reduced by more than 50% compared to the existing model, and the speed could be improved. In addition, each lane can be classified through lane detection using the instance segmentation method. However, further research is needed on the decrease in accuracy compared to the existing model.

• Environmental and Resource Economics Review
• /
• v.24 no.2
• /
• pp.283-309
• /
• 2015

Nagoya Protocol came into effect October of 2014. For Korean companies to follow Nagoya Protocol with ease, this research conducts the survey to figure out consumers' additional willingness to pay for bio-diversity. The hypothesis that the bio-diversity label will make an impact on willingness to pay through emotional value, conditional value, and epistemic value is based on consumption value theory. The survey is conducted for two product categories; first one is utilitarian product (milk) and the other one is hedonic product (cosmetics). The analysis result shows the bio-diversity label on both product categories incur additional willingness to pay. Especially, expectation on effectiveness of bio-diversity label increases the additional willingness to pay on biodiversity label. This implies for easy following on Nagoya Protocol, the education and promotion of bio-diversity is need to increase consumers' additional willingness to pay, which can be the attraction for companies to obey the Nagoya Protocol.

• Journal of Korea Multimedia Society
• /
• v.11 no.10
• /
• pp.1409-1419
• /
• 2008

Inauthentic resources can be easily spread by P2P (Peer-to-Peer) participants due to the openness and anonymity of P2P networks. A possible way to restrict the distribution of inauthentic resources and prevent malicious peers from joining P2P networks is to exploit peers' reputation which reflect their past behaviors and are also helpful to predict peers' future behaviors. There is a possibility that some peers intentionally plays along with other peers in order to increase/decrease its reputation through false feedback exchanges. Therefore, we propose a new reputation management scheme, called TrustRRep (Trustable Resource sharing service using Reputation) scheme, which improves the trustworthiness and efficiency of P2P networks by identifying peers who give false feedback. The TrustRRep scheme is also capable of providing peers with the trustworthiness of shared resources by discriminating resources distributed by malicious peers. We implement the proposed TrustRRep scheme on the NS-2 simulator for evaluating its performance compared to the recent reputation management work available in literature. A case study on simulations shows that the proposed reputation management scheme yields efficient performance in terms of the minimal download ratio and dissemination of inauthentic resources, the efficient identification of peers who give false feedback, and the provisioning of the trustworthiness of peers' reputation. It also shows that the proposed TrustRRep scheme imposes the restrictions of participating P2P networks on a malicious peers by diminishing its trust value.

• The KIPS Transactions:PartC
• /
• v.11C no.1
• /
• pp.47-54
• /
• 2004

The growth of computer resource and network speed has increased requests for the use of remotely located computer systems by connecting through computer networks. This phenomenon has hoisted research activities for application service provision that uses server-based remote computing paradigm. The server-based remote computing paradigm has been developed as the ASP (Application Service Provision) model, which provides remote users through application sharing protocol to application programs. Security requirement such as confidentiality, availability, integrity should be satisfied to provide ASP service using centralized computing system. Existing Telnet or FTP service for a remote computing systems have satisfied security requirement by a simple access control to files and/or data. But windows-based centralized computing system is vulnerable to confidentiality, availability, integrity where many users use the same application program installed in the same computer. In other words, the computing system needs detailed security level for each user different from others, such that only authorized user or group of users can run some specific functional commands for the program. In this paper, we propose windows based centralized computing system that sets security policies for each user for the use of instructions of the application programs, and performs access control to the instructions based on the security policies. The system monitors all user messages which are executed through graphical user interface by the users connecting to the system. Ail Instructions, i.e. messages, for the application program are now passed to authorization process that decides if an Instruction is delivered to the application program based on the pre-defined security polices. This system can be used as security clearance for each user for the shared computing resource as well as shared application programs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.3
• /
• pp.554-561
• /
• 2017

IoT (Internet of Things) devices are often located in environments where indoor or underground, signals are difficult to reach. In addition, the transmission power is low, the base station should be designed to be able to receive signals even at low reception sensitivity. For this reason, a device having a poor channel condition can be transmitted at a low data rate using a low coding rate or repetition. When the coverage class is divided according to the channel condition and the data rate, the packet length may vary from one coverage class to another, and the performance of the slotted aloha random access may be degraded. We will focus on two methods of using shared-resource and seperate resources among multiple slotted aloha methods. In particular, when devices with different coverage classes use shared resources, performance of a device with a bad channel condition may deteriorate. Conversely, when using separate resources for each coverage class, there is a problem that congestion may occur which increases the number of devices that perform random access to one resource area. In this paper, we propose some methods to overcome this problem. This study is mainly focused on MTC devices, and is considered to be a high possibility of future development.

• International Journal of Control, Automation, and Systems
• /
• v.1 no.3
• /
• pp.339-350
• /
• 2003

In this paper, we propose a simultaneous multithreading (SMT) architecture that improves instruction throughput by exploiting instruction level parallelism (ILP) and thread level parallelism (TLP). The proposed architecture issues and completes instructions belonging to the same thread in exact program order. The issue and completion policy greatly reduces the design complexity and hardware cost of our architecture, compared with others that employ out-of-order issue and completion. On the other hand, when the instructions belong to different threads, the issue and completion orders for those instructions may not necessarily be identical to the fetch order. The processor issues instructions simultaneously from multiple threads to functional units by exploiting ILP and TLP, and by dynamic resource sharing. That parallel execution notably improves performance and resource utilization with minimal additional hardware cost over the conventional superscalar processors. This paper proposes an SMT architecture with grouping as well as one without grouping. Without grouping, all threads dynamically and flexibly share most resources. On the other hand, in the SMT architecture with grouping, in which resources and threads are divided into several groups for design simplification, resources are shared only among threads belonging to the same group as those resources. Simulation results show that our processors with four and eight threads improve performance by three or more times over the conventional superscalar processor with comparable execution resources and policies, and that reasonable grouping reduces the design complexity of SMT processors with little negative effect on performance.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.39 no.4
• /
• pp.137-146
• /
• 2016

In recent years, business environment is faced with multi uncertainty that have not been suffered in the past. As supply chain is getting expanded and longer, the flow of information, material and production is also being complicated. It is well known that development service industry using application software has various uncertainty in random events such as supply and demand fluctuation of developer's capcity, project effective date after winning a contract, manpower cost (or revenue), subcontract cost (or purchase), and overrun due to developer's skill-level. This study intends to social contribution through attempts to optimize enterprise's goal by supply chain management platform to balance demand and supply and stochastic programming which is basically applied in order to solve uncertainty considering economical and operational risk at solution supplier. In Particular, this study emphasizes to determine allocation of internal and external manpower of developers using S&OP (Sales & Operations Planning) as monthly resource input has constraint on resource's capability that shared in industry or task. This study is to verify how Stochastic Programming such as Markowitz's MV (Mean Variance) model or 2-Stage Recourse Model is flexible and efficient than Deterministic Programming in software enterprise field by experiment with process and data from service industry which is manufacturing software and performing projects. In addition, this study is also to analysis how profit and labor input plan according to scope of uncertainty is changed based on Pareto Optimal, then lastly it is to enumerate limitation of the study extracted drawback which can be happened in real business environment and to contribute direction in future research considering another applicable methodology.

• Journal of Korea Society of Industrial Information Systems
• /
• v.10 no.3
• /
• pp.15-20
• /
• 2005

Since the invention of Web, it became part of our daily life replacing the routine information search and effecting many activities which otherwise could have been done off-line without it. It was a natural evolution of the web technology, which had started out as a simple test based pattern matching, to be based on the optimized match process for its multi-media Web environment, like still images, music and movies that we are to face today. In this paper, we proposed and implemented the model which the multimedia resources can be efficiently shared in semantic web. After converting multimedia resource information(metadata) into RDF, for efficient management, the model separate and allotment actual multimedia resource and corresponding metadata changed to RDF to each server. The proposed model could be applied in all multimedia resources. For easy explanation and implementation, however, we applied it to the digital photograph in example.

• Journal of Korea Multimedia Society
• /
• v.20 no.3
• /
• pp.562-570
• /
• 2017

One shot tasks like a MERSC handling policy, a cinema poster, and so on are too small, diverse, and sporadic to make them as apps or web applications. They are usually shared as the form of notes attached in the field or messages in smart phones. In order to support inter-operability with internet web sites, QR/NFC tags are attached to them. What matters in the web technology is that HTML5 standard does not supply the accessability of smart phones' resources like a camera, an audio, magnetic sensors, and etc. In this paper, we propose a universal smart phone application for handling various one-shot tasks in the same UI/UX. One-shot tasks are described with HTML5 web documents, and the URL for the web documents are stored in QR/NFC tags. A smart phone scans a tag, and then the web document is retrieved and presented finally. QR tags can be delivered to other smart phones through messages or SNS. We solve the problem of HTML5 standard supplying a resource access library with javascrippts. We suggested the whole architecture and the internal structure of QR/NFC tags. We show that our scheme is applicable to make variable one-shot tasks.