Computer Science and Automation (CSA): Recent submissions

Now showing items 361-380 of 391

    • On Generalized Measures Of Information With Maximum And Minimum Entropy Prescriptions 

      Dukkipati, Ambedkar (2008-01-29)
      Kullback-Leibler relative-entropy or KL-entropy of P with respect to R defined as ∫xlnddPRdP , where P and R are probability measures on a measurable space (X, ), plays a basic role in the definitions of classical information ...

    • Design Of Incentive Compatible Broadcast Protocols For Ad hoc Wireless Networks : A Game Theoretic Approach 

      Narayanam, Ramasuri (2008-01-16)
      An ad hoc wireless network is an infrastructure-less, autonomous system of nodes connected through wireless links. In many current applications of ad hoc wireless networks, individual wireless nodes are autonomous, rational, ...

    • Efficient Bandwidth Constrained Routing Protocols For Communication Networks 

      Hadimani, Vijayalakshmi (2007-10-24)
      QoS routing is one of the major building blocks for supporting QoS in communication networks and, hence, a necessary component of future communication networks. Bandwidth- Constrained Routing Algorithm (BCRA) may help to ...

    • Algorithms For Efficient Implementation Of Secure Group Communication Systems 

      Rahul, S (2007-10-23)
      A distributed application may be considered as a set of nodes which are spread across the network, and need to communicate with each other. The design and implementation of these distributed applications is greatly simplified ...

    • IMAGINE : An Intelligent Electonic Marketplace 

      Rajagopal, A (Indian Institute of Science, 2007-01-16)
      In recent times, the Internet revolution has spawned numerous innovative enterprises-virtual companies, and electronic markets. Electronic markets (or digital markets) are scalable web-based platforms for buyers, sellers, ...

    • Hyperplane Partitioning : An Approach To Global Data Partitioning For Distributed Memory Machines 

      Prakash, S R (Indian Institute of Science, 2005-12-07)
      Automatic Global Data Partitioning for Distributed Memory Machines (DMMs) is a difficult problem. Distributed memory machines are scalable, but since the memory is distributed across processors, the scheme of placement ...

    • An Adaptive Recompilation Framework For Rotor And Architectural Support For Online Program Instrumentation 

      Vaswani, Kapil (Indian Institute of Science, 2005-12-07)
      Although runtime systems and the dynamic compilation model have revolutionized the process of application development and deployment, the associated performance overheads continue to be a cause for concern and much research. ...

    • Automatic Data Partitioning By Hierarchical Genetic Search 

      Shenoy, U Nagaraj (Indian Institute of Science, 2005-12-07)
      The introduction of languages like High Performance Fortran (HPF) which allow the programmer to indicate how the arrays used in the program have to be distributed across the local memories of a multi-computer has not ...

    • Language Support For Testing CORBA Based Applications 

      Vardhan, K Ananda (Indian Institute of Science, 2005-12-07)
      Component Based Development has emerged as economical, reusable, scalable way of developing enterprise as well as embedded software applications. Testing distributed component based systems is difficult when third party ...

    • Integrated Scheduling For Clustered VLIW Processors 

      Nagpal, Rahul (Indian Institute of Science, 2005-11-25)
      Clustered architecture processors are preferred for embedded systems because centralized register file architectures scale poorly in terms of clock rate, chip area, and power consumption. Scheduling for clustered architectures ...

    • A Unified Approach to Quantitative Software Lifecycle Modeling 

      Rao, Vijay D (Indian Institute of Science, 2005-04-06)
      An evolutionary process currently taking place in engineering systems is the shift from hardware to software where the role of software engineering is becoming more central in developing large engineering systems. This ...

    • Architecture Descriptions for Retargetable Code Translation 

      Ravindra, D V (Indian Institute of Science, 2005-03-14)
      The study of architectural parameterization has long neglected other parameterizations in favour of code selector descriptions. In this dissertation, we are concerned with providing linguistic notations for modelling ...

    • TriSL: A Software Architecture Description Language and Environment 

      Lakshminarayanan, R (Indian Institute of Science, 2005-03-14)
      As the size and complexity of a software system increases, the design problem goes beyond the algorithms and data structures of the computation. Designing and specifying the overall system structure -- or software architecture ...

    • A Knowledge-Based Approach To Pattern Clustering 

      Shekar, B (Indian Institute of Science, 2005-03-11)
      The primary objective of this thesis is to develop a methodology for clustering of objects based on their functionality typified by the notion of concept. We begin by giving a formal definition of concept. By assigning a ...

    • A Study of the Performance Benefits of Controlling Parallel Asynochrous Iteractive Applications 

      Joseph, P J (Indian Institute of Science, 2005-03-11)
      High performance networks of workstation are becoming increasingly popular a parallel computing platform because of their lower cost. Both message passing and software distributed shared memory (DSM) programming paradigms ...

    • An Environment for Automatic Generation of Code Optimizers 

      Paleri, Vineeth Kumar (Indian Institute of Science, 2005-03-11)
      Code optimization or code transformation is a complex function of a compiler involving analyses and modifications with the entire program as its scope. In spite of its complexity, hardly any tools exist to support this ...

    • Design and Implementation of Java Virtual Machine 

      Mandal, Abhijit (Indian Institute of Science, 2005-03-11)
      Interpretation of Java bytecode results in slow execution of program.First version of Java Virtual Machine(JVM) implementation was relied on interpretation techniques. On the other hand performance can be improved by ...

    • A Parallelizing Compiler for Fortran 

      Janaki, S (Indian Institute of Science, 2005-03-09)
      With the advent of Distributed Memory Machines (DMMs) numerous work have been undertaken to ease the work of a programmer these systems. Data parallel languages like Fortran D, Vienna Fortran, High Performance Fortran and ...

    • A Compiler and Symbolic Debugger for Occam 

      Chelliah, M (Indian Institute of Science, 2005-03-03)
      We have implemented Occam, a parallel programming language, on a uniprocessor machine (MC-68020 based HORIZON I11 running on UNIX system V.2) with simulated concurrency. Occam is a descendant of CSP with a few convenient ...

    • Hierarchical Data Structures for Pattern Recognition 

      Choudhury, Sabyasachy (Indian Institute of Science, 2005-02-22)
      Pattern recognition is an important area with potential applications in computer vision, Speech understanding, knowledge engineering, bio-medical data classification, earth sciences, life sciences, economics, psychology, ...