I am a retired scientist. My Main interest, next to Computer science ist to understand people and mankind. I want to contribute to show people that the world will get better and mankind will increase its intelligence fast.
Abstract: One of the current trends in space missions is an increased autonomy of the spacecraft ... more Abstract: One of the current trends in space missions is an increased autonomy of the spacecraft regardless whether it is a satellite, shuttle, space station or rover / robot. The causes are manifold but the main reason is the increased amount of acquired data and the growing complexity ...
Advances in Computer Science : an International Journal, 2015
DNA sequencing technologies keep getting faster and cheaper leading to massive availability of en... more DNA sequencing technologies keep getting faster and cheaper leading to massive availability of entire human genomes. This massive availability calls for better analysis tools with a potential to realize a shift from reactive to predictive medicine. The challenge remains, since the entire human genomes need more space and processing power than that can be offered by a standard Desktop PC for their analysis. A background of key concepts surrounding the area of DNA analysis is given and a review of selected prominent algorithms used in this area. The significance of this paper would be to survey the concepts surrounding DNA analysis so as to provide a deep rooted understanding and knowledge transfer regarding existing approaches for DNA analysis using Burrows-Wheeler transform, Wavelet tree and their respective strengths and weaknesses. Consequent to this survey, the paper attempts to provide some directions for future research.
As remote sensing technology progresses, spacecrafts are generating an increasing amount of senso... more As remote sensing technology progresses, spacecrafts are generating an increasing amount of sensor data over the years - much more than what the downlink data rate can handle. The need to reduce downlink data volume through onboard image compression, ...
The instruction systolic array (ISA) is a programmable parallel architecture suitable for VLSI im... more The instruction systolic array (ISA) is a programmable parallel architecture suitable for VLSI implementation. This paper presents a generalization of the ISA, called the microprogrammed ISA, which uses simple microprogramming techniques. Microprogrammed ISAs use dynamic microcodes whose length and contents are tailor made to the current program to be executed, and this can be efficiently implemented in VLSI. Here, microprogramming has the novel advantage of extending the range of algorithms that can be implemented on a given ISA. In particular, microprogramming can extend an ISA's effective communication abilities. Also, the reduction of the program input bandwidth (and pinout) afforded by microprogramming is even more important on large-scale MIMD architectures, such as the ISA. This paper also presents a weakest precondition semantics for the (microprogrammed) ISA model, which provides a means for verifying microprogrammed ISA programs. The semantics is modeled at the micro level, and has potential in the optimization of the microcodes of ISA programs.
ABSTRACT We propose an algorithm to solve the Token Distribution problem, a static variant of the... more ABSTRACT We propose an algorithm to solve the Token Distribution problem, a static variant of the load balancing problem, on d-Dimensional, reconfigurable meshes with toroidal connections and side length n. No other algorithms have been proposed under this model of computation. We show that for token size T, the discrepancy Δ between the maximum and minimum number of tokens per PE can be reduced to 1 in at most In2nΔ(T +4d id) steps.
Storage and Retrieval for Image and Video Databases, 1994
We present in this paper an architectural design for a wavelet transform chip for use in real-tim... more We present in this paper an architectural design for a wavelet transform chip for use in real-time one-dimensional signal processing applications. Based on the observation that further levels of the wavelet transform require only as much computation as the first level, our architecture requires only one row of processing elements to compute the complete transform. This is compared to previous
ABSTRACT We study the wavelength problem and arc (edge) congestion problem for communicating perm... more ABSTRACT We study the wavelength problem and arc (edge) congestion problem for communicating permutation instances on a ring. We prove that the numbers of wavelengths in the directed case Gamma! w , in the undirected case w, and the arc congestion Gamma! ß and the edge congestion ß for a permutation instance I 1 on an n-vertex ring C n satisfy: Gamma! w (C n ; I 1 ) ¸ n 3 ß ; Gamma! ß (C n ; I 1 ) ¸ n 4 ß ; w(C n ; I 1 ) ¸ n 2 ß ; ß(C n ; I 1 ) ¯ n 2 : All bounds are the best possible. Determining Gamma! w (C n ; I 1 ) and w(C n ; I 1 ) is NP-hard, which can be shown by a modification of the NP-hardness proof of the wavelength problem in rings, for general instances. 1 Introduction Optical networking is a very quickly developing new area of research. It is a key technology in communication networks and it is expected to dominate important applications such as video conferencing, scientific visualisation, real-time medical imaging, high speed supercomput...
ABSTRACT Protein structure prediction is considered to be the holy grail of bioinformatics. Ab in... more ABSTRACT Protein structure prediction is considered to be the holy grail of bioinformatics. Ab initio and homology modelling are two important groups of methods used in protein structure prediction. Amongst these, ab initio methods assume that no previous knowledge about protein structures is required. On the other hand homology modelling is based on sequence similarity and uses information such as classification, structure, sequence and dihedral angles for prediction.
ABSTRACT We study the wavelength problem and arc (edge) congestion problem for communicating perm... more ABSTRACT We study the wavelength problem and arc (edge) congestion problem for communicating permutation instances on a ring. We prove that the numbers of wavelengths in the directed case Gamma! w , in the undirected case w, and the arc congestion Gamma! ß and the edge congestion ß for a permutation instance I 1 on an n-vertex ring C n satisfy: Gamma! w (C n ; I 1 ) ¸ n 3 ß ; Gamma! ß (C n ; I 1 ) ¸ n 4 ß ; w(C n ; I 1 ) ¸ n 2 ß ; ß(C n ; I 1 ) ¯ n 2 : All bounds are the best possible. Determining Gamma! w (C n ; I 1 ) and w(C n ; I 1 ) is NP-hard, which can be shown by a modification of the NP-hardness proof of the wavelength problem in rings, for general instances. 1 Introduction Optical networking is a very quickly developing new area of research. It is a key technology in communication networks and it is expected to dominate important applications such as video conferencing, scientific visualisation, real-time medical imaging, high speed supercomput...
... in order to find the optimum coloring for significantly larger graphs becomes too computation... more ... in order to find the optimum coloring for significantly larger graphs becomes too computationally expensive to permit performance analysis. ... 6. Sanjeev Arora, Carsten Lund, Rajeev Motwani,Madhu Sudan and Mario Szegedy: Proof verification and intractability of approximation ...
Abstract: One of the current trends in space missions is an increased autonomy of the spacecraft ... more Abstract: One of the current trends in space missions is an increased autonomy of the spacecraft regardless whether it is a satellite, shuttle, space station or rover / robot. The causes are manifold but the main reason is the increased amount of acquired data and the growing complexity ...
Advances in Computer Science : an International Journal, 2015
DNA sequencing technologies keep getting faster and cheaper leading to massive availability of en... more DNA sequencing technologies keep getting faster and cheaper leading to massive availability of entire human genomes. This massive availability calls for better analysis tools with a potential to realize a shift from reactive to predictive medicine. The challenge remains, since the entire human genomes need more space and processing power than that can be offered by a standard Desktop PC for their analysis. A background of key concepts surrounding the area of DNA analysis is given and a review of selected prominent algorithms used in this area. The significance of this paper would be to survey the concepts surrounding DNA analysis so as to provide a deep rooted understanding and knowledge transfer regarding existing approaches for DNA analysis using Burrows-Wheeler transform, Wavelet tree and their respective strengths and weaknesses. Consequent to this survey, the paper attempts to provide some directions for future research.
As remote sensing technology progresses, spacecrafts are generating an increasing amount of senso... more As remote sensing technology progresses, spacecrafts are generating an increasing amount of sensor data over the years - much more than what the downlink data rate can handle. The need to reduce downlink data volume through onboard image compression, ...
The instruction systolic array (ISA) is a programmable parallel architecture suitable for VLSI im... more The instruction systolic array (ISA) is a programmable parallel architecture suitable for VLSI implementation. This paper presents a generalization of the ISA, called the microprogrammed ISA, which uses simple microprogramming techniques. Microprogrammed ISAs use dynamic microcodes whose length and contents are tailor made to the current program to be executed, and this can be efficiently implemented in VLSI. Here, microprogramming has the novel advantage of extending the range of algorithms that can be implemented on a given ISA. In particular, microprogramming can extend an ISA's effective communication abilities. Also, the reduction of the program input bandwidth (and pinout) afforded by microprogramming is even more important on large-scale MIMD architectures, such as the ISA. This paper also presents a weakest precondition semantics for the (microprogrammed) ISA model, which provides a means for verifying microprogrammed ISA programs. The semantics is modeled at the micro level, and has potential in the optimization of the microcodes of ISA programs.
ABSTRACT We propose an algorithm to solve the Token Distribution problem, a static variant of the... more ABSTRACT We propose an algorithm to solve the Token Distribution problem, a static variant of the load balancing problem, on d-Dimensional, reconfigurable meshes with toroidal connections and side length n. No other algorithms have been proposed under this model of computation. We show that for token size T, the discrepancy Δ between the maximum and minimum number of tokens per PE can be reduced to 1 in at most In2nΔ(T +4d id) steps.
Storage and Retrieval for Image and Video Databases, 1994
We present in this paper an architectural design for a wavelet transform chip for use in real-tim... more We present in this paper an architectural design for a wavelet transform chip for use in real-time one-dimensional signal processing applications. Based on the observation that further levels of the wavelet transform require only as much computation as the first level, our architecture requires only one row of processing elements to compute the complete transform. This is compared to previous
ABSTRACT We study the wavelength problem and arc (edge) congestion problem for communicating perm... more ABSTRACT We study the wavelength problem and arc (edge) congestion problem for communicating permutation instances on a ring. We prove that the numbers of wavelengths in the directed case Gamma! w , in the undirected case w, and the arc congestion Gamma! ß and the edge congestion ß for a permutation instance I 1 on an n-vertex ring C n satisfy: Gamma! w (C n ; I 1 ) ¸ n 3 ß ; Gamma! ß (C n ; I 1 ) ¸ n 4 ß ; w(C n ; I 1 ) ¸ n 2 ß ; ß(C n ; I 1 ) ¯ n 2 : All bounds are the best possible. Determining Gamma! w (C n ; I 1 ) and w(C n ; I 1 ) is NP-hard, which can be shown by a modification of the NP-hardness proof of the wavelength problem in rings, for general instances. 1 Introduction Optical networking is a very quickly developing new area of research. It is a key technology in communication networks and it is expected to dominate important applications such as video conferencing, scientific visualisation, real-time medical imaging, high speed supercomput...
ABSTRACT Protein structure prediction is considered to be the holy grail of bioinformatics. Ab in... more ABSTRACT Protein structure prediction is considered to be the holy grail of bioinformatics. Ab initio and homology modelling are two important groups of methods used in protein structure prediction. Amongst these, ab initio methods assume that no previous knowledge about protein structures is required. On the other hand homology modelling is based on sequence similarity and uses information such as classification, structure, sequence and dihedral angles for prediction.
ABSTRACT We study the wavelength problem and arc (edge) congestion problem for communicating perm... more ABSTRACT We study the wavelength problem and arc (edge) congestion problem for communicating permutation instances on a ring. We prove that the numbers of wavelengths in the directed case Gamma! w , in the undirected case w, and the arc congestion Gamma! ß and the edge congestion ß for a permutation instance I 1 on an n-vertex ring C n satisfy: Gamma! w (C n ; I 1 ) ¸ n 3 ß ; Gamma! ß (C n ; I 1 ) ¸ n 4 ß ; w(C n ; I 1 ) ¸ n 2 ß ; ß(C n ; I 1 ) ¯ n 2 : All bounds are the best possible. Determining Gamma! w (C n ; I 1 ) and w(C n ; I 1 ) is NP-hard, which can be shown by a modification of the NP-hardness proof of the wavelength problem in rings, for general instances. 1 Introduction Optical networking is a very quickly developing new area of research. It is a key technology in communication networks and it is expected to dominate important applications such as video conferencing, scientific visualisation, real-time medical imaging, high speed supercomput...
... in order to find the optimum coloring for significantly larger graphs becomes too computation... more ... in order to find the optimum coloring for significantly larger graphs becomes too computationally expensive to permit performance analysis. ... 6. Sanjeev Arora, Carsten Lund, Rajeev Motwani,Madhu Sudan and Mario Szegedy: Proof verification and intractability of approximation ...
Uploads