Accepted Papers

  • A Few Thoughts on Code Review and Cooperative Pair Programming: Expectations, Outcomes and Challenges
    Qiang Fu, Francis Grady, Bjoern Flemming Broberg, Andrew Roberts, Geir Gil Martens, Kjetil Vatland Johansen and Pieyre Le Loher, Schlumberger Information Solutions AS, Stavanger, Norway
    ABSTRACT
    The paper discusses the about the improvement of mandatory code review and pair programming practiced in the commercial software development, and also proposes effective approaches to customize the code review and pair programming to avoid the pitfalls and keep the benefits.
  • Classification of Questions and Learning Outcome Statements (LOS) into bloom’s Taxonomy (BT) by Similarity Measurements Towards extracting of learning outcome from learning material
    Shadi Diab and Badie Sartawi, Al-Quds Open University, Palestine
    ABSTRACT
    Bloom’s Taxonomy (BT) is used to classify the objectives of learning outcome by dividing the learning into three different domains; the cognitive domain, the effective domain and the psychomotor domain, in this paper, we introduce a new algorithm to classify the questions and learning outcome statements (LOS) into Blooms taxonomy (BT) and to verify BT verb lists, which are being cited and used by academicians to write questions and (LOS). An experiment was designed to investigate the semantic relationship between the action verbs used in both questions and LOS to obtain more accurate classification into levels of BT, A sample of 775 different action verbs collected from different universities allows us to measure an accurate and clear-cut cognitive level for the action verb. It is worth mentioning that natural language processing techniques were used to develop our rules as to induce the questions into chunks in order to extract the action verbs. Our proposed solution was able to classify the action verb into a precise level of the cognitive domain. We, on our side, have tested and evaluated our proposed solution using confusion matrix. The results of evaluation tests yielded 97% for the macro average of precision and 90% for F1. Thus, the outcome of the research suggests that it is crucial to analyse and verify the action verbs cited and used by academicians to write LOS and classify their questions based on blooms taxonomy in order to obtain a definite and more accurate classification
  • Fault Tolerant Consensus Agreement Algorithm
    Marius Rafailescu, Politehnica University of Bucharest, Romania
    ABSTRACT
    Recently a new fault tolerant and simple mechanism was designed for solving commit consensus problem. It is based on replicated validation of messages sent between transaction participants and a special dispatcher validator manager node. This paper presents a correctness, safety proofs and performance analysis of this algorithm.
  • Application of the Hierarchical Temporal Memory Theory for Document Categorization
    Deven Shah1 Pinak Ghate1 Manali Paranjape1 and Amit Kumar2, 1College of Engineering, India, 2Tech Mahindra Pvt. Ltd., India
    ABSTRACT
    The current work intends to study the performance of the Hierarchical Temporal Memory(HTM) theory for automated categorization of text as well as documents. HTM is a biologically inspired theory based on the working principles of the human neocortex. The current study intends to provide a framework for document categorization using the principles of the Spatial Pooler learning algorithm in the HTM Theory. As HTM is modelled after the mammalian brain, its input should also be in accordance with the input format received by the brain. Latent Semantic Indexing(LSI) technique is used for extracting the top features from the input and converting them into binary format. The Spatial Pooler algorithm converts the binary input into sparse patterns with similar input text having overlapping spatial patterns making it easy for classifying the patterns into categories. Our results prove that HTM theory, although is in its early stages, performs well for categorizing documents.
  • An Energy-Distance Factor Based Congestion Control Protocol in MANET
    Rahma Bintey Mufiz Mukta and Ayesha Siddiqua Dina, University of Chittagong, Bangladesh
    ABSTRACT
    Mobility of nodes creates congestion frequently in MANET. This paper presents an energy efficient and cooperative congestion control protocol for multicasting in MANET. Proposed scheme overcomes the disadvantages of existing multicast congestion control protocols which depend on individual receivers to detect congestion. We build a multicast tree routed at the source, by including the nodes with higher energy distance factor towards the receivers. Proposed scheme tests whether the relay node has been up before a minimum required time to load the contents regarding routing table properly in the memory of the node, if not then choose another node with second highest energy distance factor as a new relay node. An admission control scheme is introduced in which a multicast flow is admitted or rejected depending upon on the output queue size. A scheme is used here which adjusts the multicast traffic rate at each bottleneck of a multicast tree. On-the-spot information collection and rate control ensure very limited control traffic overhead and delay in this scheme. Moreover, the proposed scheme does not impose any significant changes on the policies of existing networks. Simulation results show that proposed protocol has better delivery ratio and throughput with less delay and energy consumption when compared with existing protocol.