• Journal of the Korea Society of Computer and Information
• /
• v.26 no.2
• /
• pp.1-9
• /
• 2021

In this paper, we extend a generic library framework based on the state monad to exploit deterministic parallelism in a purely functional language Haskell and provide benchmarks for the extended features on a multicore machine. Although purely functional programs are known to be well-suited to exploit parallelism, unintended squential data dependencies could prohibit effective parallelism. Symbolic execution programs usually implement fresh name generation in order to prevent confusion between variables in different scope with the same name. Such implementations are often based on squential state management, working against parallelism. We provide reusable primitives to help developing parallel symbolic execution programs with unbound-genercis, a generic name-binding library for Haskell, avoiding sequential dependencies in fresh name generation. Our parallel extension does not modify the internal implementation of the unbound-generics library, having zero possibility of degrading existing serial implementations of symbolic execution based on unbound-genecrics. Therefore, our extension can be applied only to the parts of source code that need parallel speedup.

• Journal of Arbitration Studies
• /
• v.13 no.2
• /
• pp.519-546
• /
• 2004

On June 27, 2002 Canadian Internet Registration Authority (CIRA) launched dot-ca domain name dispute resolution service through BCICAC and Resolution Canada, Inc. The Domain name Dispute Resolution Policy (CDRP) of CIRA is basically modelled after Uniform Domain Name Dispute Resolution Policy(UDRP), while the substance of CDRP is slightly modified to meet the need of Canadian domain name regime and its legal system. Firstly, this article examined CIRA's domain name dispute resolution policy in general. It is obvious that the domain name dispute resolution proceeding is non-binding arbitration to which arbitration law does not apply. However it still belongs to the arbitration and far from the usual mediation process. Domain name arbitrators render decision rather than assist disputing parties themselves reach to agreement. In this respect the domain name arbitration is similar to arbitration or litigation rather than mediation. Secondly it explored how the panels applied the substantive standards in domain name arbitration. There is some criticism that panelists interprets the test of "confusingly similar" in conflicting manner. As a result critics assert that courts' judicial review is necessary to reduce the conflicting interpretation on the test of substantive standards stipulated in paragraph 3 of CDRP. Finally, it analysed the court's position on domain name arbitral award. Canadian courts do not seem to establish a explicit standard for judicial review over it yet. However, in Black v. Molson case Ontario Superior Court applied the UDRP rules in examining the WIPO panel's decision, while US courts often apply domestic patent law and ACPA(Anticyber -squatting Consumer's Protection Act) to review domain name arbitration decision rather than UDRP rules. In conclusion this article suggests that courts should restrict their judicial review on domain name administrative panel's decision at best. This will lead to facilitating the use of ADR in domain name dispute resolution and reducing the burden of courts' dockets.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.5
• /
• pp.468-476
• /
• 2000

Binding the object-oriented programming language C++ with a database management system provides a persistency to C++ programming objects so that objects can persist after program termina~,on. In such a binding system, we can manage a persistent object same as that we use a transient object and also use database management facilities such as transaction management and concurrency control. This paper presents a method providing the persistency to C++ programming objects in the binding system. We propose an improved interface based on C++ binding of ODMG-97 and present the design and implementation technique of it. The proposed interface provides a seamless interface for creating objects of the persistent capable class. We can create a persistent object without its class name as we do not give a class name when creating a transient object. Also, we guarantee the type compatibilty between the obiect created in database and the obiect created in main memory.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.10
• /
• pp.746-758
• /
• 2006

Many objects existing on wide area environments have the replication characteristics according to how to categorize using their own names or properties. From the clients' requests, the existing naming and trading services have not supported with the binding service for replicated solver object with the same service type. For this reason, we present an integrated model that can support the selection of replicated object and dynamic binding services on wide-area computing environments. This model suggests provides not only location management of replicated objects but also active binding service which enables to select a least-loaded object on the system to keep the balance of load between systems. In this purpose, constructing both the service plan and model for support solver object's binding with replication property on wide area computing environments has been researched. In this paper, we showed the test environment and analyzed the performance evaluation of client/server binding procedures via integrated binding service in federation model and verified our model under the condition to see whether load balance can be applied to our model. For the performance evaluation of suggested wide area integrated binding service federation model, evaluated the integrated binding service of each domain and analyzed the performance evaluation of process for non-replication object's under federation model environment. Also, we analyzed the performance evaluation of the federation model between domains for wide area environment. From the execution results, we showed the federation model provides lowers search-cost on the physical tree structure of network.

• Journal of Conservation Science
• /
• v.31 no.3
• /
• pp.215-225
• /
• 2015

"Jocheonillgi", one of the articles left by Jo Heon(1544~1592) whose pen name was Jung-bong, is a travelogue which was written in around 1574~1575 when he was dispatched to Ming as a formal envoy(Giljungkwan). The diary-style manuscript was designated as one of the pieces of the National Treasure 1007. Due to the damage of its binding strings, abrasion, fold, stain, insect and damage on the surface, conservation and restoration was needed. In the process of separation, three more binding strings were found, confirming that the travelogue was rebound at least twice in the past. In addition, the page of 'Yeondoillgi', the original title, was bound inside, confirming that the current cover was revised in the past. As the result of the investigation of base fabric, paper mulberry was found to be the cover, inside paper, lining paper, paper strings. The three kinds of binding string including the current ones was defined to be silk.

• Journal of the Korean Society for Library and Information Science
• /
• v.49 no.3
• /
• pp.333-349
• /
• 2015

This study examined the application of the FRBR model to newspapers and news articles. In order to meet the purpose that was mentioned above, we analyzed data items based on the level of newspapers and articles and discussed how the FRBR model may be applied. In terms of the level of a newspaper, each of newspapers, morning/evening paper, issue and edition are regarded as an individual work, and the relationship among them are considered to be the 'whole-part relationship'. Each article on the level of article basis was considered to be a work and was in a relationship of 'whole-part relationship' with the edition of each level of newspapers. Newspaper articles can be represented as texts, photographs, graphics, and tables, etc., and regarded as an individual work. Each work can be a part of the article on a newspaper or can be an independent article itself. Moreover, a uniform heading of each boxed article and running story is included in the work of each article and is forming a 'whole-part relationship'. Because of the changes of the newspaper name, the uniform title of each name regarded as a single binding. It is called the superwork and it is forming 'whole-part relationship' with each name.

• Molecules and Cells
• /
• v.42 no.2
• /
• pp.123-134
• /
• 2019

Lysophosphatidic acid (LPA) is an endogenous lysophospholipid with signaling properties outside of the cell and it signals through specific G protein-coupled receptors, known as $LPA_{1-6}$. For one of its receptors, $LPA_1$ (gene name Lpar1), details on the cis-acting elements for transcriptional control have not been defined. Using 5'RACE analysis, we report the identification of an alternative transcription start site of mouse Lpar1 and characterize approximately 3,500 bp of non-coding flanking sequence 5' of mouse Lpar1 gene for promoter activity. Transient transfection of cells derived from mouse neocortical neuroblasts with constructs from the 5' regions of mouse Lpar1 gene revealed the region between -248 to +225 serving as the basal promoter for Lpar1. This region also lacks a TATA box. For the region between -761 to -248, a negative regulatory element affected the basal expression of Lpar1. This region has three E-box sequences and mutagenesis of these E-boxes, followed by transient expression, demonstrated that two of the E-boxes act as negative modulators of Lpar1. One of these E-box sequences bound the HeLa E-box binding protein (HEB), and modulation of HEB levels in the transfected cells regulated the transcription of the reporter gene. Based on our data, we propose that HEB may be required for a proper regulation of Lpar1 expression in the embryonic neocortical neuroblast cells and to affect its function in both normal brain development and disease settings.

• The KIPS Transactions:PartA
• /
• v.9A no.2
• /
• pp.241-248
• /
• 2002

With the structure of tilde-area computing system which Is specified by a researching team in Vrije University, Netherlands, lots of researchers and developers have been progressing the studies of global location and interconnection services of distributed objects existing in global sites. Most of them halve focused on binding services of only non-duplicated computational objects existing wide-area computing sites without any consideration of duplication problems. But all of objects existing on the earth rave the duplicated characteristics according to how to categorize their own names or properties. These objects with the same property can define as duplicated computational objects. Up to now, the existing naming or trading mechanism has not supported the binding services of duplicated objects, because of deficiency of independent location service. For this reason, we suggest a new model that can not only manages locations of duplicated objects In wide-area computing environments, but also provide minimum binding time by considering both the optimal selection of one of duplicated objects and load balance among distributed systems. Our model is functionally divided into 2 parts, one part to obtain an unique object handle of duplicated objects with same property as a naming and trading service, and the other to search one or more contact addresses by a node manager using a liven object handle, as a location service For location transparency, these services are independently executing each other. Based on our model, we described structure of wide-area integrated tree and algorithms for searching and updating contact address of distributed object on this tree. finally, we showed a federation structure that can globally bind distributed objects located on different regions from an arbitrary client object.

• Journal of Communications and Networks
• /
• v.8 no.4
• /
• pp.378-390
• /
• 2006

Many distributed applications build overlays on top of the Internet. Several unsolved issues at the network layer can explain this trend to implement network services such as multicast, mobility, and security at the application layer. On one hand, overlays creating basic topologies are usually limited in flexibility and scalability. On the other hand, overlays creating complex topologies require some form of application level addressing, routing, and naming mechanisms. Our aim is to design an efficient and robust addressing, routing, and naming infrastructure for these complex overlays. Our only assumption is that they are deployed over the Internet topology. Applications that use our middleware will be relieved from managing their own overlay topologies. Our infrastructure is based on the separation of the naming and the addressing planes and provides a convergence plane for the current heterogeneous Internet environment. To implement this property, we have designed a scalable distributed k-resilient name to address binding system. This paper describes the design of our overlay infrastructure and presents performance results concerning its routing scalability, its path inflation efficiency and its resilience to network dynamics.

• Journal of Arbitration Studies
• /
• v.29 no.1
• /
• pp.3-29
• /
• 2019

A franchise business is a business in which the owners, or "franchisors," sell the rights to their business logo, name, and model to third party retail outlets, owned by independent, third party operators, called "franchisees." There are a number of features in franchising or terms in franchise agreements that may lead to disputes between franchisors and franchisees. These disputes may arise because of underlying risks in the franchise relationship, franchise agreement, or conduct of the parties. In this case, ADR is an effective way to resolve disputes in a quicker and often less costly way than having to go to court. If an agreement cannot be reached through mediation, then arbitration becomes the next step to resolving the differences. Whereas mediation is non-binding and focused on facilitating the parties to find a resolution that is acceptable to both, arbitration is binding and may result in a decision that is not acceptable to one of the parties. These situations can be resolved through experienced arbitration as arbitration allows franchisees to settle matters promptly and outside of the public eye. In addition, franchise dispute arbitration is usually less costly than going to traditional court. Considering all of these, reaching an agreement will also have typical clauses that address the issue of dispute resolution. It is again a more efficient process than going through the legal process and courts and is often less costly. By going through arbitration, the parties agree to give up their rights to pursue the dispute in the courts. However, there is a problem that the arbitration prior to the agreement and under the terms would be contrary to the restriction of jurisdiction under the "ACT ON THE REGULATION OF TERMS AND CONDITIONS" in Korea.