This paper describes the design, features and advantages of a drawing application -the L.E.C.G.O-Paint application- that is part of a constructivist multi-representational computer environment designed for beginners&#...
详细信息
This paper describes the design and features of a computer interactive game for the learning of basic aspects of the binary system by primary level education pupils. The design of this game was based on modern social ...
详细信息
The wireless sensor network is an emerging technology that may greatly facilitate human life by providing ubiquitous sensing, computing, and communication capability. To be context-aware, one of the central issues in ...
详细信息
With the increasing use of multimedia technologies, image compression requires higher performance as well as new features. Despite of the good points of the JPEG2000, however, what has not been widely deployed is a pr...
详细信息
ISBN:
(纸本)9788955191356
With the increasing use of multimedia technologies, image compression requires higher performance as well as new features. Despite of the good points of the JPEG2000, however, what has not been widely deployed is a problem of high complexity. Comparison with the JPEG is sure that the JPEG2000 has excellent compression efficiency, but this became difficult technology for even practical use at PC because of high complexity. After minimizing all high complexity that can be minimized, it is the first prerequisite for applied product development. In this paper, we propose an optimization technique of the JPEG2000 to reduce high complexity. Using proposed method we will materialize the JPEG2000 decoder on PDA.
In 2005, Lee et al.(S.W. Lee, H.S. Kim, K.Y. Yoo, Efficient verifier-based key agreement protocol for three parties without server's public key. Applied Mathematics and Computation 167) proposed a efficient verifi...
详细信息
ISBN:
(纸本)9780769533520
In 2005, Lee et al.(S.W. Lee, H.S. Kim, K.Y. Yoo, Efficient verifier-based key agreement protocol for three parties without server's public key. Applied Mathematics and Computation 167) proposed a efficient verifier-based key agreement protocol for three parties which does not require server's public key. However, we find that the protocol is susceptible to an impersonation-of-initiator attack and an impersonation-of-responder attack. Further, we recommend a small change to the protocol that fixes the security problems.
Scheduling, in many application domains, involves the optimization of multiple performance metrics. For example, application workflows with real-time constraints have strict throughput requirements and also desire a l...
详细信息
A fuzzy accident detector has been proposed in this paper. The implemented controller ensures a reliable margin for the speed of a car. This is done by carefully observing the skills of the driver in controlling the a...
详细信息
In this paper, we propose a system that adopts the independent MCS (modulation and coding scheme) level for each layer in the AMC (adaptive modulation and coding) scheme combined with the V-BLAST (vertical Bell lab la...
详细信息
The purpose of this paper is the recognition of geometrical shapes: rectangle and ellipse by using the "one-step-secant" algorithm of neural network. The first step is to build up a neural network with two l...
详细信息
The purpose of this paper is the recognition of geometrical shapes: rectangle and ellipse by using the "one-step-secant" algorithm of neural network. The first step is to build up a neural network with two layers and two input vectors. The first layer has twenty neurons, while the second one includes only two neurons. The second step is to create a training base and a test base through generating "rand" function. Each base contains one hundred shapes: fifty rectangles and fifty ellipses. The third step is testing the network by using a performance function (MSE=Mean Squared Error) and "one-step-secant" algorithm.
In this work we study the distributed implementation of multicost routing in mobile ad hoc networks. In contrast to single-cost routing, where each path is characterized by a scalar, in multicost routing a vector of c...
详细信息
ISBN:
(纸本)9781605580555
In this work we study the distributed implementation of multicost routing in mobile ad hoc networks. In contrast to single-cost routing, where each path is characterized by a scalar, in multicost routing a vector of cost parameters is as- signed to each link, from which the cost vectors of the paths are calculated. These parameters are combined according to an optimization function for selecting the optimal path. Up until now the performance of multicost routing in ad hoc networks has been evaluated either at a theoretical level or by assuming that nodes are static and have full knowledge of the network topology and nodes' state. In the present paper we assess the performance of multicost routing, based on energy-related parameters, in mobile ad hoc networks by embedding its logic in the Dynamic Source Routing (DSR) algorithm, which is a well-known distributed routing algo- rithm. We compare the performance of the multicost-DSR algorithm to that of the original DSR algorithm under var- ious node mobility scenarios. The results confirm that the multicost-DSR algorithm improves the performance of the network in comparison to the original DSR, by reducing en- ergy consumption overall in the network, spreading energy consumption more uniformly across the network, and reduc- ing the packet drop probability and delivery delay. Copyright 2008 ACM.
暂无评论