• 한국정보통신설비학회:학술대회논문집
• /
• 2002.08a
• /
• pp.199-207
• /
• 2002

A virtual laboratory for measurement and instrumentation must aim to realize an integrated environment. To achieve this goal, we designed and implemented a client/server distributed environment and developed a web-based virtual laboratory system for electronic circuits. Since our virtual laboratory system is implemented to describe the on-campus laboratory, the learners can obtain similar experimental data through it. The proposed virtual laboratory system is composed of four important components Principle Classroom, Virtual Experiment Classroom, Evaluation Classroom and Overall Management System. Through our virtual laboratory, the learners will be capable of teaming the concepts and theories related to electronic circuit experiments and how to operate the experimental equipments such as multimeters, function generators, digital oscilloscopes and DC power supplies. Also, every activity occurred in our virtual laboratory is recorded on database and Printed out on the preliminary report form. All of these can be achieved by the aid of the Management System. The database connectivity is made by PHP and the virtual laboratory environment is set up slightly differently for each learner. Finally, we have obtained several affirmative effects such as reducing the total experimental hours and the damage rate for experimental equipments and increasing Loaming efficiencies as well as faculty productivity.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.4
• /
• pp.133-140
• /
• 2002

Distributed-queue Dual-Bus (DQDB) shows an unfair behavior in bandwidth allocation due to the nature of unidirectional bus architecture. The study on fairness control method for DQDB has been performed under specific load types such as equal Probability load. symmetric load and asymmetric load type. A client-server load type is more practical traffic pattern than specific load type in Web environments. In this paper, we propose an effective fairness control method to distribute DQDB network bandwidth fairly to all stations under Web environments. The proposed method directly calculates an access limit from the bandwidth demand pattern. Based on an access limit, it controls the allocation of bandwidth by yielding empty slots in clients to servers. And we were certain that it outperforms other mechanisms from simulation results.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.1 no.1
• /
• pp.3-12
• /
• 1997

In this study, in Tongyeong area the distribution of marine products that were produced and treated through fishing and cultivating industry and the trend of main fisheries were investigated for fisheries distribution system and fisheries official circles, and then a structural model of fisheries distribution system for direct transaction was suggested under internet environment, which is an important scheme offering a necessary information rapidly and practically to both producers and consumers. Database system was structured according to distributed process. An op-elative scheme were suggested for sewers of local area information center, complementing functions to exceed each server's ability.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.4
• /
• pp.117-125
• /
• 2003

The proposed mechanism has an group management server, which manages the information about both the receivers and the senders. Any receiver can dynamically join/leave the multicast VC. The signaling overload due to group membership changes is not concentrated on the sender, but it is distributed to many receivers for the scalability improvement. The associated signaling messages propagates from the receivers to the ATM switch dedicated to the multicast VC, and hence no signaling overload exists in the shared links there is no latency for the receiver to wait. Our proposed scheme is superior in the view of scalability, the efficiency and the latency to other schemes.

• Journal of Korean Society for Geospatial Information Science
• /
• v.5 no.2 s.10
• /
• pp.193-205
• /
• 1997

It is required for multi-users to share massive mapping data effectively that distributed data model in the Client-Server environment is developed for the replication consistency. The existing model is not effective to the long transaction just like a mapping system, since it does not account lot consistency between GUI screen and database replications even though it emphasizes on the replication consistency. The performance of concurrency control is very important for those long transactions, especially the mapping systems. This model is to support consistency between GUI screen and replicas using display locks. It suggests consistency model improving process performance by modifying memory consistency model and optimistic concurrency control for mapping data's characteristics.

• Journal of Korea Multimedia Society
• /
• v.3 no.6
• /
• pp.661-673
• /
• 2000

In this paper, we propose a Web-based HW/SW Codesign Environment with Distributed Architecture (WebCEDA), then design and implement SpecCharts Specification Environment(ScSE) for specifying systems in WebCEDA. WebCEDA has 3-tier client/server architecture than can remedy disadvantages of existing codesign tools, such as platform dependency, difficulty of extension, absence of collaboraton environment. ScSE includes web interface, SpecCharts editor, HW/SW codesin application sever and SpecCharts translator. To verify the operation of ScSE, we specify several example system using SpecCharts editor, then translate it to VHDL using SpecCharts translator and simulate the translated VHDL codes on synopsys. As the results, we know that ScSE has correct operations, also obtain the following advantages, the reduction in system complexity and the natural abstract design.

• Journal of Korea Multimedia Society
• /
• v.7 no.7
• /
• pp.922-933
• /
• 2004

In recent years, peer-to-peer network have a greate deal of attention for distributed computing or collaborative application, and work of ID-based public key systems have been focusing on the area of cryptography. In this paper, we propose ID-based group key management protocols for secure communication in autonomous peer group. Each member obtains his public/private key pair derived from his identification string from Private Key Generator. No central server participates in group key management protocol instead, all group members share the burden of group key management by the collaboration of themselves, so that our scheme avoids the single point of failure problem. In addition, our scheme considers the nature of dynamic peer group such as frequent joining and leaving of a member.

• Korean Journal of Computational Design and Engineering
• /
• v.10 no.2
• /
• pp.143-150
• /
• 2005

A design framework to employ the multidisciplinary design optimization technologies on a computer system has been developed and is named as the Extensible Multidisciplinary Design Integration and Optimization System (EMDIOS). The framework can not only effectively solve complex system design problems but also conveniently handle MDO problems. Since the EMDIOS exploits both state-of-the-art of computing capabilities and sophisticated optimization techniques, it can overcome many scalability and complexity problems. It can make users who are not even familiar with the optimization technology use EMDIOS easily to solve their design problems. The client of EMDIOS provides a front end for engineers to communicate the EMDIOS engine and the server controls and manages various resources luck as scheduler, analysis codes, and user interfaces. EMDIOS client supports data monitoring, design problem definition, request for analyses and other user tasks. Three main components of the EMDIOS are the Engineering Design Object Model which is a basic idea to construct EMDIOS, EMDIOS Language (EMDIO-L) which is a script language representing design problems, and visual modeling tools which can help engineers define design problems using graphical user interface. Several example problems are solved and EMDIOS has shown various capabilities such as ease of use, process integration, and optimization monitoring.

• Journal of Korea Multimedia Society
• /
• v.4 no.6
• /
• pp.534-542
• /
• 2001

Recent content-based image retrieval systems make use of a local single server contained a limited number of images. So these systems are not satisfactory for the Web user's needs that make request for various images on the Web. A content-based image retrieval system that has regard for a great number of Web images has to stand on the basis of real-time first of all. Therefore, to implement the above system we have to resolve a problem of large waste time to take for an image collection and feature extractions. In recent, PC clusters with a load distribution are implemented for the purpose of high-performance data processing. In this paper, we decreased the whole retrieval time by distributing the tasks of image collection and feature extraction to take much time among the slave computers of the PC cluster, and so we found the possibility of the real-time processing in the retrieval of Web images.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.5
• /
• pp.1142-1148
• /
• 2005

We proposes an algorithm of measuring computation loads to distribute workload of clients. The key of the algorithm is to transfer a suitable amount of processing demand from senders to receivers in relocating intrinsically. This amount is determined dynamically during sender-receiver negotiations. Factors considered when this amount is determined include processing speeds of different nodes, the current load state of both sender and receiver, and the processing demands of tasks eligible for relocation. We also propose a load state measurement scheme which is designed particularly for heterogeneous systems. Based on this analysis, we design new algorithm for supporting heterogeneous distributed web server system, and compare their performance against other existing algorithms. We show that the new algorithm improve the performance of CPU utilization and response time.