• The Journal of Society for e-Business Studies
• /
• v.4 no.3
• /
• pp.63-76
• /
• 1999

Internet-based electronic trade has been growing fast. But most users are not yet familiar with the system and find it very difficult to purchase and sell the products in the cyber market place. To handle these problems, agent-based virtual market place system has been proposed where agents instead of individuals participate in trading of goods. Most of the proposed models have been in the two general categories. The first is the direct transaction among sellers and buyers, and the second is the agent-based transaction. However, the transaction is not fair and the best deal can't be guaranteed for both models. In this paper, we propose a new broker based synchronous transaction algorithm which is fair to both parties and guarantees the best deal. Our algorithm is implemented using Visual C++ and the experimental results show that our method is better than the two traditional transaction models in every performance metrics, Number of transactions are increased up to 21% and price adjustment is up to 280% better for some transactions.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.37 no.1
• /
• pp.19-28
• /
• 2012

We consider a multi-agent scheduling problem such that each agent tries to maximize the weighted number of just-in-time jobs. Two objectives are considered : the first is to find the optimal solution for one agent with constraints on the other agents' weight functions, and the second is to find the largest set of efficient schedules of which corresponding objective vectors are different for the case with identical weights. We show that when the number of agents is fixed, the single machine case with the first objective is NP-hard in the ordinary sense, and present the polynomial- time algorithm for the two-machine flow shop case with the second objective and identical weights.

• Journal of Dental Anesthesia and Pain Medicine
• /
• v.21 no.6
• /
• pp.583-587
• /
• 2021

Lidocaine is the most commonly used local anesthetic (LA) agent in various dental as well as oral and maxillofacial procedures. Although rare, adverse effects and allergic reactions to lidocaine have been reported. In patients with suspected allergy to LA or a history of such reaction, careful history-taking and allergy testing should be performed to choose an alternative LA agent to avoid any adverse effects. Here, we present two cases of delayed hypersensitivity reaction to lidocaine, wherein the patients presented with erythema, edema, and itching. Intradermal testing confirmed allergic reaction to lidocaine, and the patients underwent successful dental treatment using an alternative LA agent. This report highlights the importance of allergy testing prior to LA use considering the serious consequences of allergy to these agents and describes the management of such patients using an alternative LA agent.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.1117-1123
• /
• 2005

This paper deals with a new automated guided vehicle (AGV) control system for distributed control. Proposed AGV control system adapts the multi-agent technology. The system is composed of two types of controller: routing and order. The order controller is in charge of assignment of orders to AGVs. Through the bidding-based negotiation with routing controllers, the order controller assigns a new order to the proper AGV. The order controller announces order information to the routing controllers. Then the routing controllers generate a routing schedule for the order and make a bid according to the routing schedule. If the routing schedule conflicts with other AGV's one, the routing controller makes an alternative through negotiation with other routing controllers. The order controller finally evaluates bids and selects one. Each controller consists of a set of agents: negotiation agent, decision making agent and communication agent. We focus on the agent architecture and negotiation-based AGV scheduling algorithm. Proposed system is validated through an exemplary scenario.

• Elastomers and Composites
• /
• v.58 no.2
• /
• pp.65-69
• /
• 2023

To reduce the weight of the engineering plastic Nylon 6 resin, two high-temperature foaming agents, p-toluenesulfonyl semicarbazide (PTSS) and 5-phenyltetrazole (5-PT) (0-10 phr), were added and foamed without other additives. We investigated the effects of the foaming agent type and content on the foam density (g/cm³) and percent weight reduction rate of the Nylon 6 foam, and 5-PT exhibited better foaming performance than PTSS. In the case of 5-PT, the weight reduction rate was above 36% when the blowing agent content was 1.5 phr or higher, indicating that 5-PT is an effective blowing agent for reducing the Nylon 6 foam weight. Additionally, we studied the effect of the nucleating agent Talc content (0-0.4 phr) on Nylon 6 foaming, and the nucleating agent Talc considerably reduced foaming.

• ETRI Journal
• /
• v.26 no.5
• /
• pp.493-496
• /
• 2004

An effective paging strategy is essential for improving the utility of radio channels. This paper proposes a two-step paging strategy which involves using base station paging agents to page a single cell at each paging. An analytical model is used to evaluate the performance of the proposed strategy. The proposed strategy is compared with the traditional simultaneous paging strategy and a recent proposal using the base station paging agents. The numerical results showed that the proposed strategy proficiently reduces paging cost on radio channels compared with other paging strategies.

• Journal of the Korea Society for Simulation
• /
• v.21 no.1
• /
• pp.27-34
• /
• 2012

Proposed in the paper is an agent based and object-oriented methodology to create a virtual logistics support system model. The proposed virtual logistics support system model consists of three types of objects: the logistics force agent model(static model), the military supplies transport manager model(function model), the military supplies state manager model(dynamic model). A logistic force agent model consists of two agent: main function agent and function agent. To improve the reusability and composability of a logistics force agent model, the function agent is designed to adapt to different logistics force agent configuration. A military supplies transport manager is agent that get information about supply route, make decisions based on decision variables, which are maintained by the military supplies state manager, and transport military supplies. A military supplies state manager is requested military supplies from logistics force agent, provide decision variables such as the capacity, order of priority. For the implementation of the proposed virtual logistics force agent model, this paper employs Discrete Event Systems Specification(DEVS) formalism.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.3
• /
• pp.169-180
• /
• 2015

Recently, scheduling problems with position-dependent processing times have received considerable attention in the literature, where the processing times of jobs are dependent on the processing sequences. However, they did not consider cases in which each processed job has different learning or aging ratios. This means that the actual processing time for a job can be determined not only by the processing sequence, but also by the learning/aging ratio, which can reflect the degree of processing difficulties in subsequent jobs. Motivated by these remarks, in this paper, we consider a two-agent single-machine scheduling problem with linear job-dependent position-based learning effects, where two agents compete to use a common single machine and each job has a different learning ratio. Specifically, we take into account two different objective functions for two agents: one agent minimizes the total weighted completion time, and the other restricts the makespan to less than an upper bound. After formally defining the problem by developing a mixed integer non-linear programming formulation, we devise a branch-and-bound (B&B) algorithm to give optimal solutions by developing four dominance properties based on a pairwise interchange comparison and four properties regarding the feasibility of a considered sequence. We suggest a lower bound to speed up the search procedure in the B&B algorithm by fathoming any non-prominent nodes. As this problem is at least NP-hard, we suggest efficient genetic algorithms using different methods to generate the initial population and two crossover operations. Computational results show that the proposed algorithms are efficient to obtain near-optimal solutions.

• Convergence Security Journal
• /
• v.2 no.2
• /
• pp.77-88
• /
• 2002

A mobile agent system is an infrastructure that supports the mobile agent paradigm. The main challenges encountered in designing this infrastructure are discussed in this paper. After introducing a generic mobile agent system, we discuss the design issues at two levels. System level issues like the provision of agent mobility and security, are mainly encountered in developing the runtime environments for agent execution. Language level issues, such as agent programming models and primitives, arise in providing support for mobile agent programming, mainly at the library level. This paper Identifies such system and language-level issues, and illustrates the different ways developers ate addressing them. We outline the specific challenges addressed by this dissertation, primarily in the area of mobile agent security.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.6
• /
• pp.2050-2077
• /
• 2015

One of the major issues in emerging cloud management system needs the efficient service level agreement negotiation framework, with an optimal negotiation strategy. Most researchers focus mainly on the atomic service negotiation model, with the assistance of the Agent Controller in the broker part to reduce the total negotiation time, and communication overhead to some extent. This research focuses mainly on composite service negotiation, to further minimize both the total negotiation time and communication overhead through the pre-request optimization of broker strategy. The main objective of this research work is to introduce an Automated Dynamic Service Level Agreement Negotiation Framework (ADSLANF), which consists of an Intelligent Third-party Broker for composite service negotiation between the consumer and the service provider. A broker consists of an Intelligent Third-party Broker Agent, Agent Controller and Additional Agent Controller for managing and controlling its negotiation strategy. The Intelligent third-party broker agent manages the composite service by assigning its atomic services to multiple Agent Controllers. Using the Additional Agent Controllers, the Agent Controllers manage the concurrent negotiation with multiple service providers. In this process, the total negotiation time value is reduced partially. Further, the negotiation strategy is optimized in two stages, viz., Classified Similarity Matching (CSM) approach, and the Truncated Negotiation Group Gale Shapely Stable Matching (TNGGSSM) approach, to minimize the communication overhead.