In the present aggressive world of competition, knowledge management strategies are becoming the major vehicle for the organizations to achieve their goals; to compete and to perform well. Linking knowledge management to business performance could make a strong business case in convincing senior management of any organization about the need to adopt a knowledge management strategy. Organizational performance is, therefore, a key issue and performance measurement models provide a basis for developing a structured approach to knowledge management. In this respect, organizations need to assess their knowledge management capabilities and find ways to improve their performance. This paper takes these issues into account when study the role of knowledge management in enhancing the organizational performance and consequently, developed an integrated knowledge management capabilities framework for assessing organizational performance. The results show that there is positive correlation between knowledge management capabilities and organizational performance. The results also show that the proposed framework can be used to assess organizational performance and also can be used as decision tool to decide which knowledge management capability should be improved.

Vehicular Ad Hoc Network is currently challenge for the wireless networking and its researchers. In this paper we have proposed the survey of the different MAC Layer protocols of the wireless medium those can be implemented in the Vehicular Ad Hoc Networking. The survey is based upon the study of the different protocol on their MAC level and its performance factors is evaluated. The performance factor is extracted from the studied materials and current working conditions of the protocols. These all factors are mobility, accuracy, privacy and confidentiality, safety critical message priority, delay control and suitability on vehicle and roadside. According to analyzed performance factor the IEEE 802.11p Wave is most suitable protocol for the Vehicular Ad Hoc Network but it does not cover up all conditional requirements.

This paper presents the comparison between two codecs, G.711 and G.722 at 64 kbps, referring to speech quality perception using a subjective method called interview tests. These subjective tests have been conducted with 201 subjects, who are Thai native speakers that use Thai which is a tonal language, for accuracy and reliability of results. The results from testing with both codecs are almost the same; the scores are 4.17 for G.722 and 4.14 for G.711. After analyzing the results, it has been confirmed that G.722 does not provide better speech quality than G.711 to the Thai subjects significantly, which is consistent with previous information. However, these results could be used as the benchmark of G.711 and G.722 for speech quality assessment within Thai environments.

Efficient compression reduces memory requirement in long term recording and reduces power and time requirement in transmission. A new compression algorithm combining Linear Predictive coding (LPC) and Discrete Wavelet transform is proposed in this study. Our coding algorithm offers compression ratio above 85% for records of MIT-BIH compression database. The performance of algorithm is quantified by computing distortion measures like percentage root mean square difference (PRD), wavelet-based weighted PRD (WWPRD) and Wavelet energy based diagnostic distortion (WEDD). The PRD is found to be below 6 %, values of WWPRD and WEDD are less than 0.03. Classification of decompressed signals, by employing fuzzy c means method, is achieved with accuracy of 97%.

A Total connected dominating set (TCDS) for a graph G(V,E) is a subset V'of V , such that each node in V−V' is adjacent to some node in V' and V' induces a connected subgraph.
A TCDS has been proposed as a virtual backbone for routing in wireless ad hoc networks. However, it is NP-hard to find a minimum connected dominating set (MCDS). Approximation algorithms for MCDS have been proposed in the literature. Most of these algorithms suffer from a very poor approximation ratio, and from high time complexity and message complexity. Recently, new distributed heuristics for constructing a TCDS were developed, with constant approximation ratio of 8. These new heuristics are based on a construction of a spanning tree, which makes it very costly in terms of communication overhead to maintain the TCDS in the case of mobility and topology changes.
Investigating the algorithmic complexity of total domination for wireless ad hoc network as relevant open question .An O(n^2) algorithm has been proposed for this problem by Bertossi [1].Keil [10] proposed an O(n+m)
In this paper, we propose the first distributed approximation algorithm to construct a MCDS for the unit-disk-graph with a constant approximation ratio O(n), and linear time and linear message complexity. This algorithm is fully localized, and does not depend on the spanning tree. Thus, the maintenance of the TCDS after changes of topology guarantees the maintenance of the same approximation ratio. In this algorithm each node requires knowledge of its single hop neighbors, and only a constant number of two-hop and three-hop neighbors.

Biometrics is physical or behavior characteristics that can be used for human identification. We propose the ear as a biometric and investigate it with both 2D and 3D data. The ICP-based algorithm also demonstrates good scalability with size of dataset. These results are encouraging in that they suggest a strong potential for 3D ear shape as a biometric. Multi-biometric 2D and 3D ear recognition are also explored. The proposed automatic ear detection method will integrate with the current system, and the performance will be evaluated with the original one. The investigation of ear recognition under less controlled conditions will focus on the robustness and variability of ear biometrics. Multi-modal biometrics using 3D ear images will be explored, and the performance will be compared to existing biometrics experimental results.

A new approach, to measure normalization completeness for conceptual model, is introduced using quantitative fuzzy functionality in this paper. We measure the normalization completeness of the conceptual model in two steps. In the first step, different normalization techniques are analyzed up to Boyce Codd Normal Form (BCNF) to find the current normal form of the relation. In the second step, fuzzy membership values are used to scale the normal form between 0 and 1. Case studies to explain schema transformation rules and measurements. Normalization completeness is measured by considering completeness attributes, preventing attributes of the functional dependencies and total number of attributes such as if the functional dependency is non-preventing then the attributes of that functional dependency are completeness attributes. The attributes of functional dependency which prevent to go to the next normal form are called preventing attributes.

N-version programming is a software development paradigm that draws upon the concept of diversity to increase the reliability of software. The central idea is to independently produce multiple functionally equivalent versions of a program, and execute them in parallel. If the versions fail independently, then the probability of multiple versions producing a faulty output on any given input is very small; much lower than the failure probability of any single version. In this paper, we examine and contrast various experiments that have been performed to evaluate the benefits of this approach and draw some conclusions. We find that for diversity to be effective, it must be introduced in a targeted and informed manner and encompass several phases of the software’s development.