ALBL, ALBL/HSC algorithms: Towards more scalable, more adaptive and fully utilized balancing systems
[ Full-Text ]
Sotirios Kontogiannis, Stavros Valsamidis and Alexandros Karakos
This paper presents the performance characteristics of a non-content aware load balancing algorithm, ALBL, for cluster-based web systems. Based on ALBL potential a new content aware load balancing algorithm is also introduced; called ALBL/HSC. This algorithm maintains classes of HTTP traffic based on content of HTTP requests.Then it uses ALBL algorithm to load balance requests per class accordingly. That is, ALBL/HSC maintains separate ALBL processes per HTTP service class for balancing traffic among web servers assigned to each class. Performance and scalability gains are shown from tests of ALBL against known balancing algorithms used by web-farms, such as: Round Robin, Least Connections and Least Loaded. Then, ALBL/HSC algorithm is put to the test against ALBL over a cluster based load balancing system. Moreover, CPU performance tests performed at the web switch and performance tests at the web servers indicate both positive features and drawbacks of content aware ALBL/HSC and adaptive content blind ALBL. This paper also presents new features that can be installed to content aware algorithms. That is, clustering prediction, bandwidth and web farm utilization estimation and sharing mechanisms among classes of HTTP traffic.
——————————————————————————————————————————————————————————————————–
Enhancing Employee Provident Fund System Through MMS-Based Account Statement [ Full-Text ]
Mohd Hilmi Hasan and Ahmad Nazrin Ab Manah
Mobile devices’ usage has evolved from mere phone call devices to personal management, education and entertainment devices. They have also gained interest in coustomer service system such as for banking, traffic summon and many others. The objective of this paper is to present the enhancement of current employee provident fund system which sends account statements to users via SMS. The system has been developed in three-tier architecture and tested by 35 respondents. It accepts request from users in SMS, does information searching, converts account information into PDF document, and sends the PDF document to users via MMS. The system has been evaluated through functional and user acceptance tests. The system is successfully developed and believed can improve the SMS-based employee provident fund system. The study implies time saving for users as MMS-based account statement can be used for official transactions on top of its flexibility that accessible anytime and anywhere. For future works, the system should be equipped with more security measures to ensure its reliability. It is also proposed that both MMS-based and SMS-based functionalities are integrated into a single system to offer more benefits to users.
——————————————————————————————————————————————————————————————————–
A Survey of Document Clustering Algorithms with Topic Discovery [ Full-Text ]
J. Jayabharathy, S. Kanmani and A. Ayeshaa Parveen
Nowadays all paper documents are in electronic form, because of quick access and smaller storage. So, it is a major issue to retrieve relevant documents from the larger database. Clustering documents to relevant groups is an active field of research finding various applications in the fields of text mining, topic tracking systems, intelligent web search engines and question answering systems. Unlike document classification where a set of labels or terms is predefined for each class, the documents sets grouped by a clustering algorithm have no such predefined labels for convenient recognition of the content of each set. Each of them requires assignment of a concise and descriptive title to help analysts to interpret the result. Hence, cluster labeling methods are essential. Most of the existing techniques often assign labels to clusters based on the terms that the clustered documents contain. This paper presents a survey of the existing document clustering algorithms with topic discovery and proposes a frame work for comparing them. Through this framework, the details regarding the algorithms, their capabilities, evaluation metrics, data set and performance are analyzed.
——————————————————————————————————————————————————————————————————–
Institutional Repositories: Features, Architecture, Design and Implementation Technologies [ Full-Text ]
A. O. Adewumi and N. A. Ikhu-Omoregbe
Europe is the leading continent in terms of active adoption and use of Digital Libraries – particularly Institutional Repositories (IRs). Africa has not done poorly in this area with a steady increase from 19 repositories in 2008 to 46 in January, 2011 but there is need to raise awareness and channel efforts towards making IRs easily accessible to Africans through ubiquitous channels such as hand-helds and mobile devices. This paper reviews the features, architecture, design and implementation technologies of IRs. In addition, it highlights viable research areas that can be pursued by African researchers in the field of Digital Libraries. It also encourages research efforts to focus on areas that will be beneficial to Africa.
——————————————————————————————————————————————————————————————————–
Kautz Mesh Topology for on-Chip Networks [ Full-Text ]
R. Sabbaghi-Nadooshan
During the recent years, 2D mesh Network-on-Chip has attracted much attention due to its suitability for VLSI implementation. This paper introduces the 2-dimensional Kautz topology for Network-on-Chips as an attractive alternative to the popular simple 2D mesh. The cost of 2D Kautz is equal to that of the simple 2D mesh but it has a logarithmic diameter. We compare the proposed network and the mesh network in terms of power consumption and network performance. Compared to the equal sized simple mesh NoC, the proposed Kautz-based network has better performance while consuming less energy. Also by vertically stacking two or more silicon wafers, connected with a high-density and high-speed interconnect, it is now possible to combine multiple active device layers within a single IC. In this paper we propose an efficient three dimensional layout for a novel 2D mesh structure based on the Kautz topology. Simulation results show that by using the third dimension, performance and latency can be improved compared to the 2D VLSI implementation.
——————————————————————————————————————————————————————————————————–
Pervasive Computing – an application to effective teaching-learning process [ Full-Text ]
Shalabh Agarwal and Asoke Nath
In the present work we have tried to explore the tremendous scope of pervasive computing in teaching-learning process. The teaching-learning process is been changed quite dramatically from what we had a few years back. Before the age of computers, the teaching-learning process was mainly based on printed materials such as books, journals, reports etc. Apart from printed materials audio and video materials were also used to some extent for teaching-learning process. Due to tremendous progress in Information and Communication Technology in the last decade or so, the entire teaching-learning methodology has been shifted towards technology enabled e-learning. The grater demand for learning, specially in higher education, has generated newer and challenging avenues. Pervasive and ubiquitous learning has expanded these avenues and has enabled learning anytime any moment. In the current paper, we have tried to explain the concept of pervasive and ubiquitous computing and its impact on modern teaching-learning methodology.
——————————————————————————————————————————————————————————————————–
Performance Study of Approaches for Detecting Attacks in Ad Hoc Wireless Networks [ Full-Text ]
Kashif Laeeq and Khalid Khan
The popularity graph of ad hoc networks are incredibly increasing with the increase of its utilization in all fields. No messy wired physical infrastructure and other innumerable advantages made this technology the first choice in emergency, disaster management, healthcare, education, business etc. some time ad hoc networks have to pay the price for their vulnerable features. This new technology and its associated protocols have numerous loopholes which may be the honey pots for attackers.This paper has focused three major areas of wireless communication i.e. ad-hoc network, mesh network and sensor network. These networks are mostly at risk of denial of service (DoS) attacks initiated through compromised nodes or intruders. To avoid such attacks some of cryptographic algorithms, key management schemes and security models are proposed but the networks are still insecure. Our goal here is to investigate the major issues, attacks and challenges belonging to these networks. Some proposed schemes are also discussed here that mitigate these issues with a comparative study on the basis of their performances. In future we will analyze and compare the routing protocols in wireless ad-hoc networks.
——————————————————————————————————————————————————————————————————–
Predicting Patients with Heart Disease by Using an Improved Back-propagation Algorithm [ Full-Text ]
Nazri Mohd Nawi, Rozaida Ghazali and Mohd Najib Mohd Salleh
A study on improving training efficiency of Artificial Neural Networks algorithm was carried out throughout many previous works. This paper presents a new approach to improve the training efficiency of back propagation neural network algorithms. The proposed algorithm (GDM/AG) adaptively modifies the gradient based search direction by introducing the value of gain parameter in the activation function. It has been shown that this modification significantly enhance the computational efficiency of training process. The proposed algorithm is generic and can be implemented in almost all gradient based optimization processes. The robustness of the proposed algorithm is shown by comparing convergence rates and the effectiveness of gradient descent methods using the proposed method on heart disease data.
——————————————————————————————————————————————————————————————————–
Hindi Part-of-Speech Tagger Based Neural Networks [ Full-Text ]
Jabar H. Yousif and Dinesh Kumar Saini
Multilayered perceptron part of speech tagger (POS) for Hindi language is developed and implemented. It achieves an accuracy of 82.8%. The implementation of neural network is done using NeuroSolution package which is used to create and adopt the multilayer network. For the sake of error correction the backpropagation learning algorithm is used, testing the efficiency of correctly predicting the syntactic and semantic classification tagging. The results showed clearly that the proposed MLP tagger is accurate and speedy words tagging. In addition it uses a less time to accomplish the training of network. In comparison with others results of other researchers, the proposed tagger used a little number of data sets to achieve the adaptation and learning of network.
——————————————————————————————————————————————————————————————————–
Advanced Symmetric key Cryptography using extended MSA method: DJSSA symmetric key algorithm [ Full-Text ]
Dripto Chatterjee, Joyshree Nath, Soumitra Mondal, Suvadeep Dasgupta and Asoke Nath
The present work deals with new advanced symmetric key cryptographic method for multiple encryption and decryption of any file especially image file, sound file, video file, text file, executable file or any other file. Nath et. al. developed an algorithm called MSA for encryption and decryption of any file using a 16×16 random key matrix. Recently Nath et.al proposed a method using a randomized key of size 256×256 containing all possible 2 lettered words. The proposed method was an extension of MSA algorithm(1). In the present work we have extended the MSA algorithm one step further. The present work uses a randomized key of size 65536×256 which contains all possible 3 lettered words. The MSA algorithm is very much suitable for small system as the total number of random matrix can be generated is 256! and which may not very difficult task for the hacker to hack the actual key matrix. Nath et al. recently communicated a paper where they have claimed that they defined a key matrix of size 256×256 where each element is a two lettered word. So the complexity to find the actual matrix will be 65536!. In the present work we propose a key matrix of size 65536×256 which contains all possible 3-lettered words. We use our own randomized method to make this key matrix random. So here the complexity of finding the actual key matrix will be 16777216! trial runs and which is intractable. So the current advanced DJSSA method may be taken as the ultimate symmetric key method which can not be broken by using any brute force method. Moreover we have also introduced multiple encryption here to make our system more secured. This method will be suitable in any business house, government sectors, communication network, defense network system. In the present work we have introduced a key matrix of size 65536×256 where in each cell we store all possible 3-lettered words (ASCII code 0-255). The total number of words possible is 65536×256 or 16777216. We randomize that matrix using the method proposed by Nath et. al. The user has to enter some secret text-key. The maximum length of the text key should be 16 characters long. To calculate the randomization number and the number of encryption to be done is calculated from the text-key using a method proposed by Nath et.al. The present method will be most suitable for encryption of a small file such as digital signature or watermarking etc. To encrypt a large file we have to first split the entire file into reasonable numbers and then run our encryption program parallel in different machines and after that we have to append those encrypted file to get the ultimate encrypted file. To decrypt the file we have to follow the same trick i.e. first split into same number of files and then apply the decryption algorithm in parallel from different machines and finally append all decrypted files to get back the original file.
——————————————————————————————————————————————————————————————————–
Feature Selection for Traditional Malay Musical Instruments Sounds Classification using Rough Set [ Full-Text ]
Norhalina Senan, Rosziati Ibrahim, Nazri Mohd Nawi, Iwan Tri Riyadi Yanto and Tutut Herawan
Finding the most relevant features are crucial in data mining task including musical instruments sounds classification problem. Various feature selection techniques have been proposed in this domain focusing on Western musical instruments. However, study on rough set theory for feature selection of non-Western musical instruments sounds is insufficient and still needs further exploration. Thus, in this paper, an alternative feature selection technique using maximum attributes dependency based on rough set theory for Traditional Malay musical instruments sounds is proposed. The modelling process comprises eight phases: data acquisition, sound editing, data representation, feature extraction, data discretization, data cleansing, feature selection using the proposed technique and finally features evaluation via classifier. The results show that the selected features generated from the proposed technique able to reduce the complexity process and improve the classification performance significantly.
——————————————————————————————————————————————————————————————————–
Spatial Clustering Algorithm using R-tree [ Full-Text ]
Harleen Kaur, Ritu Chauhan and M. Afshar Alam
Recently, there has been extensive growth in databases; we require proper analyzing techniques to discover hidden patterns from large databases. Spatial data mining is the application area of data mining which helps to detect hidden patterns from spatial datasets. There has been enormous growth in spatial data from last decade, growing need has forced researchers to find efficient algorithm for spatial data analysis. There are several spatial indexing techniques applied in past for storage and retrieval of spatial data. In this approach suitable indexing techniques has being proposed for three dimensional spatial objects such as R tree which has been used as a spatial data structure for indexing of spatial data. We have designed a spatial clustering model using R tree (SCART), with three dimensional spaces using spatial objects where data is organized in the form of three dimensional grid and Hilbert space filling curve is used to find the linear order points of the grid. In this paper efficient clustering algorithm with combination of hierarchical and grid based approach has being used to find the effective and efficient spatial cluster. The structure of node has been developed to find the relevant clusters with the help of R tree data structure. The novel search algorithm has being proposed for finding the objects or retrieve the answer for given query. We have found that the algorithm is suitable for achieving three dimensional searching in a grid.
——————————————————————————————————————————————————————————————————–
Introducing a New Model for Web Services Composition Using Deputy Servers [ Full-Text ]
A. Andalib, S. Mohammadi and M. Mahdavi
The latest presented technology for web is “Web Services”. The web services are the applicable programs that are accessible via web, by human being and other programs, independent from programming language. Moreover, they can be located and invoked through web. Nowadays, the main usage of World Wide Web is to have an interactive access to the documents and applicable programs. Web services (also called simply services) are self-describing, platform-agnostic computational elements that support rapid, lowcost and easy composition of loosely coupled distributed applications. From a technical standpoint, Web services are modular applications that can be described, published, located, invoked and composed over a variety of networks (including the Internet): any piece of code and any application component deployed on a system can be wrapped and transformed into a network-available service, by using standard (XML-based) languages and protocols (e.g., WSDL, SOAP, etc.). The promise of Web services is to enable the composition of new distributed applications/solutions: when no available service can satisfy a client request, (parts of) available services can. If the web develops in order to support the links between Web Services, it will considerably improve in terms of range and power.Our research is concerned with developing an efficient model for composing web services.Our goal is to enhance the potential of web services by focusing on new aspects of their composition by using of deputy servers.
——————————————————————————————————————————————————————————————————–
Rubik’s Cube Model of Software Engineering for Incremental and legacy projects [ Full-Text ]
Ajay Jain
In today’s Software development life cycle, technologies are getting complex, dependencies across components are increasing, resources are getting limited, and time to market is getting shorter. Therefore, it is extremely important to invent and adopt a project development approach that successfully addresses these issues. The development model should ensure that component changes are well absorbed and integrated in time, product features are always ready for client’s showcase, and iterative development work packages are delivered in time to manage project risks effectively. In this paper, I propose the Rubik’s Cube Model (RCM) of Software Engineering. The RCM is simulated by dividing the entire project into multiple logical components, and each component is further divided into interrelated sub-components. It helps in identifying relations and dependencies across components and modules. This model allows simultaneous execution and quick integration and absorption of change requests across components without altering any project goals. It allows critical time saving throughout the project cycle.
——————————————————————————————————————————————————————————————————–
Acute Leukemia Cancer Classification using Single Genes [ Full-Text ]
B. B. M. Krishna Kanth, U. V. Kulkarni, and B. G. V. Giridhar
Gene expression profiling provides tremendous information to resolve the complexity of cancer. The selection of the most informative single genes from microarray datasets for cancer classification has become important issue in recent times, along with predicting the classification accuracy of such identified genes using various classifiers. We propose a new method of classification system namely, the fuzzy hypersphere clustering neural network (FHCNN) which combines clustering and classification inorder to differentiate cancer tissues such as acute myeloid leukemia (AML) and acute lymphoblastic leukemia (ALL). Experimental results show that our FHCNN model using one outstanding gene, Zyxin achieves the best classification accuracy of 94.12% where as other state-of-art methods could reach the best accuracy of 91.18%. Morever FHCNN is more stable, and contains less number of parameter adjustments compared to all the other classification methods.
——————————————————————————————————————————————————————————————————–
Dynamic Pattern Based Image Steganography [ Full-Text ]
P. Thiyagarajan, G. Aghila and V. Prasanna Venkatesan
Steganography is the art of hiding secret information in media such as image, audio and video. The purpose of steganography is to conceal the existence of the secret information in any given medium. This work aims at strengthening the security in steganography algorithm by generating dynamic pattern in selection of indicator sequence. In addition to this dynamicity is also encompassed in number of bits embedded in data channel. This technique has been implemented and the results have been compared and evaluated with existing similar techniques.
——————————————————————————————————————————————————————————————————–
Anonymous and Non-Repudiation E-Cash Scheme with Partially Blind Signature [ Full-Text ]
Hani M. AL-Matari, Abdalnaseer A. Hajer and Nidal F. Shilbayeh
Partially Blind Signature techniques played an important role in building e-cash systems. It allows the signer to include pre-agreed information such as expiration date or collateral conditions in the resulting signature. In this paper, we proposed a non-repudiation and anonymous e-cash scheme based on partially blind signature that enables the Judge to specify a dishonest customer, bank, or blind office. In addition to that, our scheme is considered as a multi-purpose scheme because it satisfies the integration of multi-spendable and divisible coins. We also analyze the efficiency and the security of the proposed scheme.
——————————————————————————————————————————————————————————————————–
Power Aware Routing Scheme in Ad Hoc Network [ Full-Text ]
Divya Sharma and Ashwani Kush
A recent trend in ad hoc network routing is the reactive on-demand philosophy where routes are established only when required. Most of the protocols in this category, however, use single route and do not utilize multiple alternate paths. This paper proposes a scheme to improve existing on-demand routing protocols by introducing the power aware virtual node scheme in whole scenario. The scheme establishes the multi paths without transmitting any extra control message. It offers quick adaptation to distributed processing, dynamic linking, low processing and memory overhead and loop freedom at all times. This scheme uses the concept of Power awareness among route selection nodes by power states of each node in the topology which insures fast selection of routes with minimal efforts and faster recovery. The scheme is incorporated with the Ad-hoc On-Demand Distance Vector (AODV) protocol and the performance has been studied through simulation.
——————————————————————————————————————————————————————————————————–
Algorithm and Application of Dynamic view generation by organizing sections of a view plane based on Visibility Quotient [ Full-Text ]
Sanjeev Kumar Biswas and Kanika Dalmia Gupta
The paper outlines an algorithm for generating the dynamic view of different sections of a plane based on the visibility quotient. People browsing through a web site or a document which has different sections with different content usually skip reading those sections which are of low “visibility”. The paper describes the data structure and algorithm used to sort these sections based on their “visibility quotient” and provide a flexible way to the user to browse these sections using some kind of “navigation technique” and “scrolling” mechanism. This approach can improve the overall experience by speeding up the loading time of more relevant sections in a view and delaying loading of less relevant sections.
——————————————————————————————————————————————————————————————————–
Web 2.0 Technologies, Tools and Applications in the Realm of Medicine: A Survey and Review [ Full-Text ]
Faiza N. AlOtaibi and Nervana M. Bayoumy
Since the internet field has been recently developing very rapidly and since the participation and collaboration have been remarkably established with the evolution of Web 2.0, this study is aimed at delving into Web 2.0 in the medical field as well as identifying the familiarity and the use of Web 2.0 technologies, applications and tools among medical professionals and students in King Saud University, Riyadh, Saudi Arabia, and to view their potential benefits as well as the barriers to using such technologies and services in the medical education. An online questionnaire was distributed among all medical staff and students in king Saud University, College of Medicine and University Hospitals. The data were analyzed using Microsoft excel. One hundred seventy respondents participated in this study. Considering the familiarity with Web 2.0 technologies and services, most responses showed almost high familiarity with major types of Web 2.0 tools and applications but less actual use. As for the frequency of use, Wikis, search engines, instant messaging and media sharing were highly used in regard to learning purposes. Regarding usefulness and confidence in professional learning, Wikis, search engines and media sharing were viewed by the majority as being extremely to very useful in helping learning process. Easy and fast accessibility to information and sharing experiences and resources were amongst the advantages indicated. Insufficient definition of the concepts and technologies behind Web 2.0 was among the main disadvantages indicated along with the lack of credibility in professional purposes. Internet requirement was also pointed out as a major disadvantage of such technologies. Web 2.0 represents a highly beneficial and well-developing field in terms of medical use. Therefore, awareness and education about these Web 2.0 tools, technologies and applications should be emphasized among medical students and professionals. Despite the relatively high familiarity with Web 2.0 technologies and tools, there is a lack of knowledge and effective use in the medical application and educational purposes.
——————————————————————————————————————————————————————————————————–
Service Integration to CSOA Application: Bridge Interface between Service Provider and Consumer [ Full-Text ]
Sheikh Muhammad Saqib, Shakeel Ahmad, Bashir Ahmad, Muhammad Ahmad Jan, Muhammad Zubair Asghar
and Muhammad Javed
Careful installation of a CSOA (Customized-SOA) application is not the satisfaction of end users. Users want new changes and needs in their own services. Integration of these services is the major problem. Because developers are on one side and users are on other sides. This problem may occur due to software and hardware components incompatibility. BI (Bridge Interface) can solve these issues, if CSOA will have been made up of BOSM (Business Oriented Service Model). BI will integrate the new services or updated services to client machine only on request from user side without any confliction. For new CSOA application, each developer from different location can integrate developed services to actual application through BI. BI will work on the basis of contract between development companies and consumers.
——————————————————————————————————————————————————————————————————–
Job Analysis Based Central Recruitment Automated System: Combination of Desktop and Web Applications [ Full-Text ]
Shakeel Ahmad, Sheikh Muhammad Saqib, Bashir Ahmad, Muhammad Javed, Muhammad Zubair Asghar
and Muhammad Ahmad Jan
‘Scrutiny must be fair’ is the major complaint of all candidates. This issue is simple but its effects are very malicious. Computing makes all filters prime efficient. Instead of separate scrutiny procedure in each organization, JABCRAS (Job Analysis Based Central Recruitment System) make a central recruitment for all organization. JABCRAS will be the HUB between all organizations. It will decrease the workload of each organization and can select a deserving person from all dimensions i.e. skill and exposures. It will also provide a common platform for interview to all candidates for any job of any organization. Due to JABCRAS unselected candidates will be highly satisfied because most of the procedures will be automated. It will be developed on SOA based architecture, so due to loosely coupled nature, new services can be easily incorporated.
——————————————————————————————————————————————————————————————————–
Two Subthreshold Full Adder Cells in 65 nm CMOS Technology [ Full-Text ]
M. Alizadeh, B. Forouzandeh and R. Sabbaghi-Nadooshan
This paper presents two new 1-bit full adder topologies operating in subthresold region in 65nm technology. Circuits designed in this region usually consume less power. Inverse Majority Gate (IMG) together with NAND/NOR were used as the main computational building blocks. A modification was done to optimize W/L ratios with different supply voltages using the conventional 1.5:1 for Wp/Wn. Compared with a previously reported minority-3 based full adder; the results involve better performance in terms of power, delay, and PDP.
——————————————————————————————————————————————————————————————————–
Comparative Study in Adoption of Web2.0 Technologies between Western and Arab Universities [ Full-Text ]
Mousmi Ajay Chaurasia
Internet collaboration technologies and Web2.0 have profoundly changed the way in which individuals, institutions and organizations interact with each other. Internet environment are relatively new topic for academic institutions literature and can enhance teaching and learning methods. This paper deals with how much Web 2.0 technologies are used in education. In this paper, a comparative study is being done to show the variation of usage and adoption of Web2.0 technologies in Educational purpose.
——————————————————————————————————————————————————————————————————–
Foot Rot Disease Identification for the Betelvine Plants using Digital Images Processing [ Full-Text ]
J. Vijayakumar and S. Arumugam
This paper proposes a method for early detection of foot rot disease to initiate early preventive action before the farmer visually identifies a change in appearance, form or color of betel vine using image processing and pattern recognition techniques. Using these techniques, the disease in betelvine leaf can be identified before it spreads to entire crop. Digital image of the betel vine leaves at different stages of the disease are collected using a high-resolution digital camera with a resolution of 2 million pixels. The image analysis of the leaves done using Image processing toolbox in Mat lab version 7.0 Release 12 gives the standard patterns of the digital images. These patterns and images of various healthy betelvine leaves and diseased betelvine leaves at various stages are stored in the memory of the system. These are then used for comparison to identify the disease leaf at an early stage.
——————————————————————————————————————————————————————————————————–
L – Band Propagation Measurements for Fixed and Mobile Reception of Satellite Digital Emission [ Full-Text ]
P. K. Chopra, S. Jain, K. M. Paul and S. Sharma
The nature of variations of L-band satellite signal strength for direct reception both in fixed as well as in mobile scenario are important technical parameters for the planning of satellite broadcast and communication services network. These parameters have been assessed through field experiment using L-band signal from the Asia star satellite of Worldspace, USA. Variation of signal strength due to vegetation; urban structures; etc. as well as the building penetration LOSs along with the Standard Deviation of each of these variations has been assessed based on the data collected during the fixed and mobile reception.
——————————————————————————————————————————————————————————————————–
Conservation of Spectrum and Mobile BTS Power Saving Strategy [ Full-Text ]
P. K. Chopra and S. Jain
20th century saw the advent of technologies to travel faster, higher and further than ever before in history. The world and universe around us are shrinking in technological time and distance. We are going through an era of ICT i.e. Information Communication Technology revolution where communication and broadcasting assisted by Information Technology are leading to an explosion in Mobile Communication, Multimedia Delivery and Streaming Video on the move. We are going through a communication revolution with the cellular mobile growth at a very steep path. This growth however is being hampered for the availability of spectrum which is a limited national resource & the ever expanding requirement of BTSs to meet the demand of customers. It therefore calls for its judicious and optimal utilization so that the growth of mobile connectivity is not hampered due to this constraint of spectrum & BTS. The most important factor for mobile communication is the optimized use of BTSs. In this paper, a study made to optimize utilization of BTSs is outlined.
——————————————————————————————————————————————————————————————————–
AWRP: Adaptive Weight Ranking Policy for Improving Cache Performance [ Full-Text ]
Debabala Swain, Bijay Paikaray and Debabrata Swain
Due to the huge difference in performance between the computer memory and processor , the virtual memory management plays a vital role in system performance .A Cache memory is the fast memory which is used to compensate the speed difference between the memory and processor. This paper gives an adaptive replacement policy over the traditional policy which has low overhead, better performance and is easy to implement. Simulations show that our algorithm performs better than Least-Recently-Used (LRU), First-In-First-Out (FIFO) and Clock with Adaptive Replacement (CAR).
——————————————————————————————————————————————————————————————————–
Search Systems for Math Information Retrieval: A Survey [ Full-Text ]
A. Muhammad and M. S. H. Khiyal
The paper aims to cover the modern developments in the field of math information retrieval. This includes math search systems, search engines and digital library systems. Use of different retrieval techniques have been covered in the paper. This include similarity search, search using K-Means, self organizing map and agglomerative hierarchical clustering. Information access mechanisms utilized by different search systems are also surveyed. For instance, keyword search, expression search and hybrid search modes. Moreover, user studies conducted by researchers for math information retrieval are surveyed.