Results 1 
4 of
4
An applicative randomaccess stack
 Information Processing Letters
, 1983
"... Kqwords: Applicative programming, linked list, number system. randomaccess stack 1. Introduction 2. The skewbinary number system Applicative (functional) programming has long been advocated on theoretical grounds as the formal properties of such programs are simple and elegant. Recently, there has ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
Kqwords: Applicative programming, linked list, number system. randomaccess stack 1. Introduction 2. The skewbinary number system Applicative (functional) programming has long been advocated on theoretical grounds as the formal properties of such programs are simple and elegant. Recently, there has been a trend to bring
Architecture of basic building blocks in protein and domain structural interaction networks
, 2005
"... ..."
DESIGN STRUCTURE AND ITERATIVE RELEASE OF SCIENTIFIC SOFTWARE
"... I dedicate this thesis to my wife and parents. iii One of the main objectives of software development in scientific computing is efficiency. Being focused on highly specialized application domain, important software quality metrics, e.g., usability, extensibility,etc may not be amongst the list of ..."
Abstract
 Add to MetaCart
I dedicate this thesis to my wife and parents. iii One of the main objectives of software development in scientific computing is efficiency. Being focused on highly specialized application domain, important software quality metrics, e.g., usability, extensibility,etc may not be amongst the list of primary objectives. In this research, we have studied the design structures and iterative releases of scientific research software using Design Structure Matrix(DSM). We implemented a DSM partitioning algorithm using sparse matrix data structure Compressed Row Storage(CRS), and its timing was better than those obtained from the most widely used C++ library boost. Secondly, we computed several architectural complexity metrics, compared releases and total release costs of a number of open source scientific research software. One of the important finding is the absence of circular dependencies in studied software which attributes to the strong emphasis on computational performance of the code. Iterative release analysis indicates that there might be a correspondence between “clustering coefficient ” and “release
An Efficient Algorithm for the Reliability of Consecutivekn Networks
"... A consecutivekn network is a generalization of the wellknown consecutivekoutofn system, and has many practical applications. This network consists of n + 2 nodes (node 0, the source, nodes 1, 2, …, n, and node n + 1, the target) and directed links from node i to node j (0 ≤ i < j ≤ n + 1, ..."
Abstract
 Add to MetaCart
A consecutivekn network is a generalization of the wellknown consecutivekoutofn system, and has many practical applications. This network consists of n + 2 nodes (node 0, the source, nodes 1, 2, …, n, and node n + 1, the target) and directed links from node i to node j (0 ≤ i < j ≤ n + 1, j − i ≤ k). Because all nodes except the source and target, and all links are fallible, the network works if and only if there exists a working path from the source to the target. For the k = 2 case, based on identical node reliabilities and some assumptions on link reliabilities, Chen, Hwang and Li (1993) gave a recursive algorithm for the reliability of the consecutive2n network. In this paper we give a closed form equation for the reliability of the general consecutivekn network by means of a novel Markov chain method. Based on the equation, we propose an algorithm which is more efficient than other published ones for the reliability of the consecutivekn network.