Welcome to Journal of Theoretical and Applied Information Technology

Download Volume 2 No. 2

The idea of our work is on one of the basic problems, namely the fast calculation of the distance between two objects. We have implemented an enhanced version of the shortest distance routine on the basis of mathematical equations, which allows the tracking of the distance between a pair of conics and quadrics in time that to be bounded by a constant is expected. Experimental results confirm this result, at least for moderate shortest distance calculation, and suggest that the enhanced algorithm might also come in handy. Computing the distance between two objects is a common problem, using the mathematical model of two objects, we find the point on each object such that the distance between the objects is minimized. To do this we took care of efficient computing, which is possible with simplifying the polynomials and their relative coefficients. Effectiveness of computing algorithms and executing time are also analyzed. We tested the calculation on various natural quadrics. The graphics part is implemented in openGL and QT library is used for user interface. The execution time is calculated by running the distance calculation routines 10,000,000 times.

Full Text

K.Sureshkumar,  K.S.Ravichandran

Computing technology with its increased access has much interest in the mobile ad hoc network technology. However, the transactions strongly depend on the availability of security provisions, among other factors. In the open network environment practically any node can maliciously or selfishly disrupt and deny communication of other nodes. This paper, propose a dynamic multicast group management protocols that aims at solving problems that are specific to ad hoc networks such as mobility, unreliable links, and cost of multihop communication. The main idea is to have group members actively participate to the security of the multicast group, therefore reducing the communication and computation load on the source.

An active database system is a conventional database system extended with a facility for managing active rules (or triggers). Active rules may interact in complex and sometimes unpredictable ways, thus possibly yielding infinite rule executions by triggering each other indefinitely. In this paper, we propose a method of termination analysis of active rules based on Petri nets (PN) and give an object oriented representation to implement it. This approach is better than the previous ones because it takes into a count composite events and the rule priority on the one hand, and both rule representation and rule analysis are performed in the same PN on the other hand.

Full Text

In this paper the design and implementation of Real Time Multimedia Data Acquisition protocol (RTMDAP) for industrial applications is presented. The intended use of this protocol is factory environment, where the remote supervision and control of the devices (sensors, actuators) are important tasks. During control activities data is in shape of text strings and in some cases, symbols representing device state. Factory has many equipments like robots, Numerical Controlled Machines, Vision, Image processing and controllers for achieving the better quality, part tracking, and assembly. By deployment of multimedia applications at plant level factory can perform all above mentioned tasks effectively. RTMDAP extends common network communications facilities into the scope of real time data acquisition. RTMDAP (The Real Time Multimedia Data Acquisition Protocol) is based on Switched Ethernet 100 Mbps. TCP/IP and RTP Protocols are employed in the RTMDAP along with UDP with acknowledgement mechanism so that better reliability can be achieved. Well-established and widely used compression techniques H.263, JPEG are also used in the RTMDAP and timely data is. Both the design and implementation are presented together with results of from measurements on a prototype of the protocol. Sampling rate in case of JPEG (live video) from 41.383 to 151.492 packets per second are obtained for various resolutions and in case of H.263 (live video) sampling rate is achieved from 10.53 to 12.374 packets per second with low resolutions.    Significant contribution is to deploy the video compression in the factory environment. Well established widely supported video compression techniques H.263 and MJPEG are included in the protocol. The protocol performs the capturing of video through webcam (live).

The Bresenham line algorithm is a promising computer graphics process whose basic justification seems to have been its lack of reliance on floating-point operations. In more recent time it has sometimes been passed by for other algorithms that can support scan conversion of regions with non-linear boundaries. However, the Bresenham algorithm can be thought of as interpolating pixels, and there are ways it can be an excellent basis for other interpolation operations. In this paper, we describe several of these operations and how they can be built from the Bresenham algorithm.

Full Text

The quality of voice in IP based networks is highly reliant on Packet loss and delay. Packet loss is the failure of packets to reach the destination. The multi-path diversity is a phenomenon to send identical packets from diversified paths. Therefore, if certain packet is lost from one stream, still its identical packet has fair chance to arrive at the destination. We first discuss the modeling of packet loss and delay using Bernoulli and Extended Gilbert Model. We then evaluate the results of both models. We have developed a modified loss model for modeling of packet loss using multi-path diversity. The present research aims to increase the efficiency of Forward Error Correction (FEC) by the modeling of packet loss and delay in the real time communication. The set of examined results from our research shows that multi-path diversity bestows positive effect on the voice quality of VoIP network. The results also validate our model as comparison with actual data results in similar trend.

Full Text

In this paper we discuss our research in mounting a distributed architecture for intruder detection. The key inspiration is to use data mining techniques to ascertain patterns of system features that can describe the program and user behavior and to use machine learning algorithm to analyze audit data and to extract features that can distinguish anomalies from legitimate activities. Auditing agents are used in this research to assemble concise and accurate classifiers to detect anomalies. To increases computability we used a Web Service based distributed architecture which will provide high accuracy and low computational cost. WinMine toolkit is used to build the statistical model and to facilitate model construction and incremental updates.

Full Text

The present study examines the growth performance of India’s IT industries, with particular attention paid to the role of policy in this process. The study recognizes that emergence of a strong Indian IT industry happened due to concerted efforts on the part of the Government, particularly since 1980s, and host of other factors like Government-Diaspora relationships, private initiatives, emergence of software technology parks, clustering and public private partnerships. In this study we further look at the major parameters of the Indian IT industry and give justification for including the main factors responsible for the IT boom in India. The study has looked into the past and present trends of the Indian IT industry and has considered further needs of IT sector to act as a catalyst of growth and development. The study has examined whether the Indian IT growth does have enough lessons for other countries to model their IT policy which may help them to shape their IT industry as driver of growth and development.

Full Text