A wide variety of media can be used in learning, including distance learning, such as print, lectures, conference sections, tutors, pictures, video, sound, and computers. Any one instance of distance learning will make choices among these media, perhaps using several.

Multimedia in Learning

The objective of this paper is to give a comprehensive introduction to applied cryptography with an engineer or computer scientist in mind. The emphasis is on the knowledge needed to create practical systems which supports integrity, confidentiality, or authenticity. Topics covered includes an introduction to the concepts in cryptography, attacks against cryptographic systems, key use and handling, random bit generation, encryption modes, and message authentication codes. Recommendations on algorithms and further reading is given in the end of the paper. This paper should make the reader able to build, understand and evaluate system descriptions and designs based on the cryptographic components described in the paper.

[서평]「Applied Cryptography」

Practice is a necessary but not sufficient condition to reach high levels of competence. Deliberate practice, which includes five basic elements, is needed to build expertise. Those elements include: 1. Effortful exertion to improve performance 2. Intrinsic motivation to engage in the task 3. Carefully tailored practice tasks that focus on areas of weakness 4. Feedback that provides knowledge of results, and 5. Continued repetition over a number of years (p. 256)

e‐Learning and the Science of Instruction

This book makes a clear presentation of the traditional topics included in a course of undergraduate parallel programming. As explained by the authors, it was developed from their own experience in classrooms, introducing their students to parallel programming. It can be used almost directly to teach basic parallel programming.

/pdf/parallel-programming-techniques-and-applications-using-1g2pyrr6g4.pdf

Parallel programming: techniques and applications using networked workstations and parallel computers. Barry Wilkinson, C. Michael Allen

Book review: Applied cryptography: Protocols, algorithms, and source code in C

Uncontrollable development of wireless and mobile communication technology aims to provide the seamless continuous connection to access various wireless technologies and to have connection with the best network which provides the best quality of service (QoS). Each application requires different QoS, so the network selection may vary accordingly. To achieve this goal and to select the best network for a mobile terminal when moving from one network to another, it is necessary to have a good decision making algorithm which decides the best network for a specific application that the user needs based on QoS parameter. This paper presents an overview of handoff types, handoff process, and classification of vertical handoff, parameters required, existing work and the comparison table.

/pdf/an-overview-of-vertical-handoff-decision-making-algorithms-48pwxkjccy.pdf

An Overview of Vertical Handoff Decision Making Algorithms

The routing problems can be divided into two major classes. They are 1) Unicast routing and 2) Multicast routing. The Unicast routing problem is as follows. Given a source node sr, a destination node dn, a set of QoS constraints qc and an optimization goal (optional), find the best feasible path from sr to dn, which satisfies qc. The Multicast routing problem is as follows. Given a source node sr, a set st of destination nodes, a set of constraints cts and an optimization goal (optional), find the best feasible path covering sr and all nodes in st, which satisfies cts. This article presents two such Unicast QoS based algorithms called as Source Routing and the proposed Heuristic Routing. A Client Server based model has been generated to study the performance of the two algorithms with respect to the message overhead, response time and path delay. The Experiments and the results are analyzed.

Analysis of Quality of Service Routing Algorithms

The wireless medium plays a vital role in communication era in sharing information from one mobile device to another. These wireless devices (nodes) can form a temporary network called Ad-hoc network or they can use existing cellular network. Vehicular Ad-hoc Networks (VANETs) is a type of Ad-hoc network in which vehicles acts as nodes and communicates with the roadside units. VANETs are more helpful in implementing the Intelligent Transport Systems concepts to provide traffic situation, weather conditions and to perform safety warnings by using authentication mechanisms. In this paper, AODV routing protocol is used to implement the Intelligent Transport Systems (ITS) concepts in VANET. A simulation is performed using AODV routing protocol in NS2 to study the hurdles involved in providing a secure and trustworthy data transfer between the vehicular nodes. The data analysis is done based on the results collected from the simulation environment. The data's are traced out to find the absolute details of the network. Finally, the graphs are plotted for Throughput of dropped packets and Throughput of packets generated.

A simulation based study to implement Intelligent Transport Systems concepts in VANETs using AODV routing protocol in NS2

Rapid advancement in information technology, business applications and its data storage are distributed in nature. Due to this distributed nature of the transaction databases, distributed association rule mining plays on important role to discover the interesting association and/or correlation relationships among large set of data items. Current research on distributed association rule mining focused to improve the efficiency of the algorithm and speed up the mining process. Few researchers have focused on to improve the efficiency of association rule mining in distributed environment by deploying intelligent agents for the mining frequent itemsets and generate association rule. Existing mobile agent based distributed association rule mining framework such as IDMA, EMADS, AeMSAR suffers the communication overhead. In this paper, the proposed framework called MAD-ARM, which attempts to reduce the communication overhead.

MAD-ARM: Mobile agent based distributed association rule mining

The present world has been dominated by wireless ad hoc communication network Having understood the purpose of ad hoc scenario in this real world, the establishment of network without clustering will not fall down to the line of expectation Thus, the cluster formation algorithm has been an essential step towards making the network to perform efficiently This paper proposes Ex-PAC as a cluster formation procedure and its performance has been compared against K-means The programming language C++ has been used to implement these two algorithms and the results are tabulated Obviously the findings say, Ex-PAC has an edge over K-means in terms of computation time and handling large sets of data in the process of making clusters

E. George Dharma Prakash Raj

Papers

An Overview of Vertical Handoff Decision Making Algorithms

Analysis of Quality of Service Routing Algorithms

A simulation based study to implement Intelligent Transport Systems concepts in VANETs using AODV routing protocol in NS2

MAD-ARM: Mobile agent based distributed association rule mining

Ex-PAC: An improved clustering technique for ad hoc network