PLANS & PRICING
we make your business better
DOCUMENTS & VIDEOS
STARTING A BUSINESS
GROWING A BUSINESS
Most Recent Documents
Jobs & Careers
Politics & History
Health & Fitness
Art & Literature
GUIDES & INFOGRAPHICS
Revolutionizig Sharing Of Ideas
Paper 39: Important Features Detection in Continuous Data
In this paper, a method for calculating the importance factor of continuous features from a given set of patterns is presented. A real problem in many practical cases, like medical data, is to find which parts of patterns are crucial for correct classification. This leads to the need of preprocessing all data, which has influence on both time and accuracy of applied methods (when unimportant data hide those which are important). There are some methods that allow selection of important features for binary and sometimes discrete data or, after some preprocessing, continuous data. Very often however, such conversion is burdened with the risk of losing important data, which is a result of lack of knowledge of optimal discretization consequence. Proposed method allows to avoid that problem, because it is based on original, non-transformed continuous data. Two factors - concentration and diversity - are defined and are used to calculate the importance factor for each feature and pattern. Based on those factors e.g. unimportant features can be identified to decrease dimension of input data or ''bad'' patterns can be detected to improve classification. An example how proposed method can be used to improve decision tree is given as well.
Paper 38: Masking Digital Image using a Novel technique based on a Transmission Chaotic System and SPIHT Coding Algorithm
In this article, a new transmission system of encrypted image based on novel chaotic system and SPIHT technique is proposed. This chaotic system is made up of two chaotic systems already developed: the discrete-time modified Henon chaotic system and the continuous-time Colpitts one. The transmission system is designed to take profit of two advantages. The first is the use of a robust and standard algorithm (SPIHT) which is appropriate to the digital transmission. The second is to introduce farther complexity of the encryption using the chaotic system over secure channel. Through these two advantages, our purpose is to obtain a robust system against pirate attacks. Cryptanalysis and various experiments have been carried out and the results were reported in this paper, which demonstrate the feasibility and flexibility of the proposed scheme.
Paper 37: Test Case PrioritizationUsing Fuzzy Logic for GUI based Software
Testing of GUI (Graphical User Interface) applications has many challenges due to its event driven nature and infinite input domain. It is very difficult for any programmer to test for each and every possible input. When test cases are generated using automated testing tool it uses each and every possible combination to generate test cases hence generates numerous number of test case for any GUI based application. Within a defined time frame it is not possible to test every test case, that is why test cases prioritization is required. Test-case prioritization has been widely proposed and used in recent years as it can improve the rate of fault detection during the testing phase. Very few methods are defined for GUI Test case prioritization that usually consider single criteria for assigning priority for the test case which is not sufficient for the consideration of that test case as more fault revealing. In this paper we have proposed a method for assigning weight value on the basis of multiple factors as one of the criteria for test case prioritization for GUI based software. These factors are: The type of event, Event Interaction, and Parameter-value interaction coverage-based criteria. In the proposed approach priority is assigned based upon these factors using fuzzy logic model. Experimental results indicate that the proposed model is suitable for prioritizing the test cases of GUI based software.
Paper 34: Performance Comparison of Gender and Age Group Recognition for Human-Robot Interaction
In this paper, we focus on performance comparison of gender and age group recognition to perform robot’s application services for Human-Robot Interaction (HRI). HRI is a core technology that can naturally interact between human and robot. Among various HRI components, we concentrate audio-based techniques such as gender and age group recognition from multichannel microphones and sound board equipped with robots. For comparative purposes, we perform the performance comparison of Mel-Frequency Cepstral Coefficients (MFCC) and Linear Prediction Coding Coefficients (LPCC) in the feature extraction step, Support Vector Machine (SVM) and C4.5 Decision Tree (DT) in the classification step. Finally, we deal with the usefulness of gender and age group recognition for human-robot interaction in home service robot environments.
Paper 30: Financial Statement Fraud Detection using Text Mining
Data mining techniques have been used enormously by the researchers’ community in detecting financial statement fraud. Most of the research in this direction has used the numbers (quantitative information) i.e. financial ratios present in the financial statements for detecting fraud. There is very little or no research on the analysis of text such as auditor’s comments or notes present in published reports. In this study we propose a text mining approach for detecting financial statement fraud by analyzing the hidden clues in the qualitative information (text) present in financial statements.
Paper 29: Passing VBR in Mobile Ad Hoc Networks – for effective live video Streaming
Mobile ad hoc networks (often referred to as MANETs) consist of wireless hosts that communicate with each other in the absence of a fixed infrastructure. This technique can be used effectively in disaster management, intellectual conference and also in the battlefield environments. It has the significant attention in the recent years. This research paper depicts the remuneration of using suggestion tracking for selecting energy-conserving routes in delay-tolerant applications and it sends Variable Bit Rate delivery. The previous investigation set up from earlier period surveillance that delay can be traded for energy efficiency in selecting a path. The Prior objective is to find an experiential upper bound on the energy savings by assuming that each node accurately knows or predicts its future path. It examines the effect of varying the amount of future information on routing. Such a bound may prove useful in deciding how far to look in advance, and thus how much convolution to provide in mobility tracking.
Paper 27: Scalable and Flexible heterogeneous multi-core system
Multi-core system has wide utility in today’s applications due to less power consumption and high performance. Many researchers are aiming at improving the performance of these systems by providing flexible multi-core architecture. Flexibility in the multi-core processors system provides high throughput for uniform parallel applications as well as high performance for more general work. This flexibility in the architecture can be achieved by scalable and changeable-size window micro architecture. It uses the concept of execution locality to provide large-window capabilities. Use of high memory-level parallelism (MLP) reduces the memory wall. Micro architecture contains a set of small and fast cache processors which execute high locality code. A network of small in-order memory engines use low locality code to improve performance by using instruction level parallelism (ILP). Dynamic heterogeneous multi-core architecture is capable of recon?guring itself to ?t application requirements. Study of different scalable and ?exible architectures of heterogeneous multi-core system has been carried out and has been presented.
Paper 23: Method for Water Vapor Profile Retievals by Means of Minimizing Difference Between Estimated and Actual Brightness Temperatures Derived from AIRS data and Radiative Transfer Model
Method for water vapor profile retrievals by means of minimizing difference between estimated and actual brightness temperatures derived from AIRS data and radiative transfer model is proposed. Initial value is determined by linearized radiative transfer equation. It is found that this initial value determination method makes improvement of estimation accuracy together with reducing convergence time.
Paper 22: Optimizing the Performance Evaluation of Robotic Arms with the Aid of Particle Swarm Optimization
In this modern world, robotic evaluation plays a most important role. In secure distance, this leads the humans to execute insecure task. To acquire an effective result, the system which makes the human task easier should be taken care of and the holdup behind the system should be eradicated. Only static parameters are considered and such parameters are not enough to obtain optimized value in existing work. For consecutively attaining optimized value in our previous work, we focused on both static and dynamic parameters in the robotic arm gearbox model. Now, a genetic algorithm is utilized and the result obtained is greater than the existing work. On the other hand, to attain an effective result the genetic algorithm itself is not enough since it takes massive time for computation process and the result obtained in this computation is not as much closer to the true value. By eliminating all those aforementioned issues, a proper algorithm needs to be utilized in order to achieve an efficient result than the existing and our previous works. In this paper, we anticipated to suggest a Particle Swarm Optimization technique that reduce the computation time as well as make the output result as much closer to the true value (i.e.,) experimentally obtained value.
Paper 21: Cloud Computing for Solving E-Learning Problems
The integration of information and communication technologies in education according to the global trend occupied a great interest in the Arab world through E-Learning techniques and put it into the form of services within Services Oriented Architecture Technique (SOA), and mixing its input and outputs within the components of the Education Business Intelligence (EBI) and enhance it to simulate reality by educational virtual worlds.This paper presents a creative environment derived from both virtual and personal learning environments based on cloud computing which contains variety of tools and techniques to enhance the educational process. The proposed environment focuses on designing and monitoring educational environment based on reusing the existing web tools, techniques, and services to provide Browser-based-Application.
Paper 20: Finding Association Rules through Efficient Knowledge Management Technique
One of the recent research topics in databases is Data Mining, to find, extract and mine the useful information from databases. In case of updating transactions in the database the already discovered knowledge may become invalid. So we need efficient knowledge management techniques for finding the updated knowledge from the database. There have been lot of research in data mining, but Knowledge Management in databases is not studied much. One of the data mining techniques is to find association rules from databases. But most of association rule algorithms find association rules from transactional databases. Our research is a further step of the Tree Based Association Rule Mining (TBAR) algorithm, used in relational databases for finding the association rules .In our approach of updating the already discovered knowledge; the proposed algorithm Association Rule Update (ARU), updates the already discovered association rules found through the TBAR algorithm. Our algorithm will be able to find incremental association rules from relational databases and efficiently manage the previously found knowledge.
Paper 18: A Novel Block Cipher Involving a Key bunch Matrix and a Key-based Permutation and Substitution
In this paper, we have developed a novel block cipher involving a key bunch matrix supported by a key-based permutation and a key-based substitution. In this analysis, the decryption key bunch matrix is obtained by using the given encryption key bunch matrix and the concept of multiplicative inverse. From the cryptanalysis carried out in this investigation, we have seen that the strength of the cipher is remarkably good and it cannot be broken by any conventional attack.
Paper 17: A Block Cipher Involving a Key Bunch Matrix and an Additional Key Matrix, Supplemented with Modular Arithmetic Addition and supported by Key-based Substitution
In this paper, we have devoted our attention to the development of a block cipher, which involves a key bunch matrix, an additional matrix, and a key matrix utilized in the development of a pair of functions called Permute() and Substitute(). These two functions are used for the creation of confusion and diffusion for each round of the iteration process of the encryption algorithm. The avalanche effect shows the strength of the cipher, and the cryptanalysis ensures that this cipher cannot be broken by any cryptanalytic attack generally available in the literature of cryptography.
Paper 14: A Novel Feistel Cipher Involving a Bunch of Keys Supplemented with XOR Operation
In this investigation, we have developed a novel block cipher by modifying classical Feistel cipher. In this, we have used a key bunched wherein each key has a multiplicative inverse. The cryptanalysis carried out in this investigation clearly shows that this cipher cannot be broken by any attack.
Paper 13: A Novel Feistel Cipher Involving a Bunch of Keys supplemented with Modular Arithmetic Addition
In the present investigation, we developed a novel Feistel cipher by dividing the plaintext into a pair of matrices. In the process of encryption, we have used a bunch of keys and modular arithmetic addition. The avalanche effect shows that the cipher is a strong one. The cryptanalysis carried out on this cipher indicates that this cipher cannot be broken by any cryptanalytic attack and it can be used for secured transmission of information
The best documents & resources to start and grow a business.
How are you planning on using Docstoc?
JOIN WITH FACEBOOK
By registering with docstoc.com you agree to our
terms of service
, and to receive content and offer notifications.
Already a member?
Sign Into your Account
Not a member yet?
Sign in with Facebook