• Educational Technology International
• /
• v.12 no.2
• /
• pp.19-46
• /
• 2011

The purpose of the study was to identify the characteristics of classroom inquiry features exhibited on a web-based discussion board, which is called the Message Board. Approximately 4,000 students from 80 schools with 60 on-line scientists were participated in the study. During the study, a total of 639 messages in the selected cluster and several patterns were identified and analyzed. Three main features of the classroom inquiry were analyzed in terms of: 1) learner gives priority to evidence in responding to questions; 2) learner formulates explanations from evidence; 3) learner communicates and justifies explanations. The results are as follow. First, once learners identified and understood the questions posed by the curriculum, they needed to collect evidence or information in responding to the questions. Depending on the question that students were given, types of evidence/data students needed to collect and how to collect the data could vary. Second, students' formulated descriptions, explanations, and predictions after summarizing evidence were observed on the Message Board. However, the extent to which students summarized evidence for descriptions, explanations, and predictions varied. In addition, students were able to make a better use of evidence over time when they formulate descriptions and explanations. Third, the Message Board was designed to allow the great amount of learner self-direction. Classroom teachers and on-line scientists played an important role in providing guidance in developing inquiry. At the same time, development of content understanding also contributed to inquiry development.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.2A
• /
• pp.203-212
• /
• 2007

An advanced vehicle safety system can be constructed by exchanging danger-related information ,such as urgency stop, traffic accident, obstacle, and car trouble, among the vehicles. However, because network topology changes rapidly and frequently due to the mobility of vehicles, it is impossible to configure the network for information forwarding in this environment. In the most of vehicle safety communication applications, an emergency message is propagated in a form of broadcasting. The simple broadcasting causes a lot of problems in terms of efficiency due to multi-hop area and radio collision problem. This paper proposes a method of selective message forwarding with stem and branch structure for propagating the emergency messages. However, the proposed method raise the efficiency of message transmission with the selective forwarding based on the priority assignment as its location. We analyze and evaluate the performance by comparing the proposed scheme with other schemes that are presented in the paper.

• Communications for Statistical Applications and Methods
• /
• v.5 no.3
• /
• pp.809-817
• /
• 1998

In this paper we consider a polling system where the token is passed according to a general service order table. We derive an exact and explicit formula to compute the mean waiting time for a message when the arrivals of messages are modeled by batch Poisson processes.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.6 no.4
• /
• pp.369-375
• /
• 2001

This paper proposes a dual real-time scheduling design under real-time constraints kernel environments. In this paper, we have designed both the real-time kernel and the general kernel that have their different properties to satisfy these properties, that is, interrupt latency, scheduling precision, and message passing. In real-time tasks, interrupt processing should be run. In general kernel, non real-time tasks or general tasks are run. Also, when tasks conflict, it executed the mixed priority scheduling that non real-time kernel executed static scheduling and real-time kernel executed dynamic priority transformation scheduling, that is, least-laxity-first/minimization preemption scheduling. We have compared the results of this study for performance of the proposal real-time kernel with both RT Linux 0.5a and QNX 4.23A, that is, of interrupt latency scheduling precision and message passing.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.9 no.1
• /
• pp.91-100
• /
• 2010

According to the recent increase in air traffic a more efficient air traffic flow control is required. This paper proposes the algorithm for efficient air traffic flow control. Aeronautical communication environment is different from the common communication environment since it needs a direct communication between stations (or airplanes) and requires a strict priority for safety message. Moreover, the wide area for basic service causes high propagation delay. In this paper, by using existing CSMA/CA Media Access Control (MAC) protocol, we set the message priorities according to air traffic condition (congestion airport area, approach control area, En route area, and ocean area). This prioritization scheme enables the data transmission with higher access probability. Simulation results confirm that our protocol shows better performance in terms of channel efficiency and success probability compared to exisiting CSMA/CA protocol.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.794-797
• /
• 2015

As the interest in VANET is increased, a study on the beacon message transmission between vehicles is actively being made. IEEE 802.11p/1609.4 standard is based on a multichannel system consisting of multiple service channels (SCH) and a control channel (CCH). Multiple SCHs are defined for nonsafety data transfer, while the CCH is used to broadcast safety messages called beacons and control messages (i.e., service advertisement messages). However, most messages broadcast in the only one CCH belong to safety application that must be contested in dense vehicular network. This paper suggests safety message transfer algorithm in dense vehicular congestion. The proposed algorithm is that the priority of safety messages is decided by decision tree and messages are stored in proper queues according to their priorities. Then, safety messages with higher priorities are sent in turn by CCH in the assigned time. The proposed algorithm decreases the beacon transmission delay and increase on the probability of a successful beacon reception in an IEEE 802.11p/1609.4-based network.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1994.10a
• /
• pp.32-32
• /
• 1994

In this example, a message passing based multicomputer system with general interdonnedtion network is considered. After multicomputer systems are developed with morm-hole routing network, topologies of interconecting network are not major considertion for process management and resource sharing. Tehre is an independeent operating system kernel oneach node. It communicates with other kernels using message passingmechanism. Based on this architecture, the problem is how mech does performance degradation will occur in the case of processor sharing on multicomputer systems. Processor sharing between application programs is veryimprotant decision on system performance. In almost cases, application programs running on massively parallel computer systems are not so much user-interactive. Thus, the main performance index is system throughput. Each application program has various communication patterns. and the sharing of processors causes serious performance degradation in hte worst case such that one processor is shared by two processes and another processes are waiting the messages from those processes. As a result, considering this problem is improtant since it gives the reason whether the system allows processor sharingor not. Input data has many parameters in this simulation . It contains the number of threads per task , communication patterns between threads, data generation and also defects in random inupt data. Many parallel aplication programs has its specific communication patterns, and there are computation and communication phases. Therefore, this phase informatin cannot be obtained random input data. If we get trace data from some real applications. we can simulate the problem more realistic . On the other hand, simualtion results will be waseteful unless sufficient trace data with varisous communication patterns is gathered. In this project , random input data are used for simulation . Only controllable data are the number of threads of each task and mapping strategy. First, each task runs independently. After that , each task shres one and more processors with other tasks. As more processors are shared , there will be performance degradation . Form this degradation rate , we can know the overhead of processor sharing . Process scheduling policy can affects the results of simulation . For process scheduling, priority queue and FIFO queue are implemented to support round-robin scheduling and priority scheduling.

• Journal of Korea Multimedia Society
• /
• v.9 no.7
• /
• pp.827-834
• /
• 2006

In distributed virtual environment, system response time to users' interactions is an importance factor to determine the degree of contentment with the system. Generally, response time is affected by the efficiency of event message processing algorithm, and most of previous systems use FCFS algorithm, which processes message traffic sequentially based only on the event occurrence time. Since this method totally depends on the order of occurrence without considering the priorities of events, it has a problem that might drop the degree of system response time by causing to delay processing message traffic when a bottleneck phenomenon happens in the server side. To overcome this limitation of FCFS algorithm, this paper proposes a concurrent event scheduling algorithm, which is able to process event messages concurrently by assigning the priorities to the events. It is also able to satisfy the two goals of system together, consistency and responsiveness through the combination of occurrence time with priority concept of events.

• Journal of Advanced Navigation Technology
• /
• v.13 no.2
• /
• pp.224-230
• /
• 2009

In the latest date, medical body area networks (MBANs) are emerging as a new technology for diagnosis the human body. MBANs in the health care fields are based on short-range and low-power (e.g. ubiquitous computing) among small-sized devices, and have been used by means of medical services. In this paper, we proposed an emergency message transmission protocol using carrier sense multiple access/time division multiple access in MBANs. This scheme focuses on dependability and power-efficiency. In order to increase the reliability of the transmission, this scheme modified a MCTA slot of IEEE 802.15.3 standard to a SR-MCTA slot. SR-MCTA slot is assigned by MBAN coordinator according to requesting terminal nodes. The method, having the priority of transmission, occurs a collision packet randomly. Results from this proposed solution revel that reservation-based TDMA medical body area network(MBAN) protocol for transmitting emergency message was improved in terms of transmission delay.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.3
• /
• pp.55-62
• /
• 2014

This paper has proposed Hybrid QoS Routing Link State Update(LSU) Algorithm that has had a both advantage of LSU message control in periodic QoS routing LSU algorithm and QoS routing performance in adaptive LSU algorithm. Hybrid LSU algorithm can adapt the threshold based network traffic information and has the mechanism that calculate LSU message transmission priority using the flow of statistical request bandwidth and available bandwidth and determine the transmission of the message according to update rate per a unit of time. We have evaluated the performance of the proposed algorithm and the existing algorithms on MCI simulation network using the performance metric as the QoS routing blocking rate and the mean update rate per link, it thus appears that we have verified the performance of this algorithm that it can diminish to 10% of the LSU message count.