Results 1  10
of
105,478
Compressed modular matrix multiplication
 IN: MILESTONES IN COMPUTER ALGEBRA
, 2008
"... We propose to store several integers modulo a small prime into a single machine word. Modular addition is performed by addition and possibly subtraction of a word containing several times the modulo. Modular Multiplication is not directly accessible but modular dot product can be performed by an int ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
by an integer multiplication by the reverse integer. Modular multiplication by a word containing a single residue is a also possible. Therefore matrix multiplication can be performed on such a compressed storage. We here give bounds on the sizes of primes and matrices for which such a compression is possible
Finding community structure in networks using the eigenvectors of matrices
, 2006
"... We consider the problem of detecting communities or modules in networks, groups of vertices with a higherthanaverage density of edges connecting them. Previous work indicates that a robust approach to this problem is the maximization of the benefit function known as “modularity ” over possible div ..."
Abstract

Cited by 500 (0 self)
 Add to MetaCart
divisions of a network. Here we show that this maximization process can be written in terms of the eigenspectrum of a matrix we call the modularity matrix, which plays a role in community detection similar to that played by the graph Laplacian in graph partitioning calculations. This result leads us to a
A modular threedimensional finitedifference groundwater flow model
 U.S. Geological Survey Techniques of WaterResources Investigations Book 6, Chapter A1
, 1988
"... The primary objective of this course is to discuss the principals of finite difference methods and their applications in groundwater modeling. The emphasis of the class lectures is on the theoretical aspects of numerical modeling (finite difference method). Steps involved in simulation of groundwate ..."
Abstract

Cited by 485 (5 self)
 Add to MetaCart
The primary objective of this course is to discuss the principals of finite difference methods and their applications in groundwater modeling. The emphasis of the class lectures is on the theoretical aspects of numerical modeling (finite difference method). Steps involved in simulation of groundwater systems under various initial/boundary conditions and management schemes will be practiced. The emphasis of the student presentations will be based on published papers concerning the applied aspects of groundwater computer modeling utilizing finite difference and analytical computer models. GRADING:
Control and Implementation of a New Modular Matrix Converter
"... Abstract — Implementation of a new modular ACAC matrix converter and its control system are described. The converter consists of a matrix connection of capacitorclamped Hbridge switch cells. The AC output of each switch cell can assume three voltage levels during conduction. Input and output thre ..."
Abstract
 Add to MetaCart
Abstract — Implementation of a new modular ACAC matrix converter and its control system are described. The converter consists of a matrix connection of capacitorclamped Hbridge switch cells. The AC output of each switch cell can assume three voltage levels during conduction. Input and output
Network Community Detection Based on Coneighbor Modularity Matrix with Spectral Clustering
"... Abstract.The problem of community detection is one of the outstanding issues in the study of network systems. This paper presents coneighbor modularity matrix to measure the quality of community detection. The problem of community detection is projected into clustering of eigenvectors in Euclidean ..."
Abstract
 Add to MetaCart
Abstract.The problem of community detection is one of the outstanding issues in the study of network systems. This paper presents coneighbor modularity matrix to measure the quality of community detection. The problem of community detection is projected into clustering of eigenvectors in Euclidean
An Extended Set of Fortran Basic Linear Algebra Subprograms
 ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE
, 1986
"... This paper describes an extension to the set of Basic Linear Algebra Subprograms. The extensions are targeted at matrixvector operations which should provide for efficient and portable implementations of algorithms for high performance computers. ..."
Abstract

Cited by 526 (72 self)
 Add to MetaCart
This paper describes an extension to the set of Basic Linear Algebra Subprograms. The extensions are targeted at matrixvector operations which should provide for efficient and portable implementations of algorithms for high performance computers.
Capacitor Voltage Balancing Control for a Modular Matrix Converter
"... Abstract — This paper describes a simplified capacitor voltage balancing scheme for a modular matrix converter operating in twolevel switching mode. The proposed scheme is based on the conventional space vector modulation technique. By using two additional space vectors having opposite direction, t ..."
Abstract
 Add to MetaCart
Abstract — This paper describes a simplified capacitor voltage balancing scheme for a modular matrix converter operating in twolevel switching mode. The proposed scheme is based on the conventional space vector modulation technique. By using two additional space vectors having opposite direction
GloMoSim: A Library for Parallel Simulation of Largescale Wireless Networks
 in Workshop on Parallel and Distributed Simulation
, 1998
"... A number of librarybased parallel and sequential network simulators have been designed. This paper describes a library, called GloMoSim (for Global Mobile system Simulator), for parallel simulation of wireless networks. GloMoSim has been designed to be extensible and composable: the communication p ..."
Abstract

Cited by 645 (30 self)
 Add to MetaCart
protocol stack for wireless networks is divided into a set of layers, each with its own API. Models of protocols at one layer interact with those at a lower (or higher) layer only via these APIs. The modular implementation enables consistent comparison of multiple protocols at a given layer. The parallel
Community detection in graphs
, 2009
"... The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of th ..."
Abstract

Cited by 801 (1 self)
 Add to MetaCart
The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of the same cluster and comparatively few edges joining vertices of different clusters. Such
Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing
 IEEE TRANSACTIONS ON COMPUTERS
, 1987
"... Large grain data flow (LGDF) programming is natural and convenient for describing digital signal processing (DSP) systems, but its runtime overhead is costly in real time or costsensitive applications. In some situations, designers are not willing to squander computing resources for the sake of pro ..."
Abstract

Cited by 592 (37 self)
 Add to MetaCart
Large grain data flow (LGDF) programming is natural and convenient for describing digital signal processing (DSP) systems, but its runtime overhead is costly in real time or costsensitive applications. In some situations, designers are not willing to squander computing resources for the sake of programmer convenience. This is particularly true when the target machine is a programmable DSP chip. However, the runtime overhead inherent in most LGDF implementations is not required for most signal processing systems because such systems are mostly synchronous (in the DSP sense). Synchronous data flow (SDF) differs from traditional data flow in that the amount of data produced and consumed by a data flow node is specified a priori for each input and output. This is equivalent to specifying the relative sample rates in signal processing system. This means that the scheduling of SDF nodes need not be done at runtime, but can be done at compile time (statically), so the runtime overhead evaporates. The sample rates can all be different, which is not true of most current datadriven digital signal processing programming methodologies. Synchronous data flow is closely related to computation graphs, a special case of Petri nets. This selfcontained paper develops the theory necessary to statically schedule SDF programs on single or multiple processors. A class of static (compile time) scheduling algorithms is proven valid, and specific algorithms are given for scheduling SDF systems onto single or multiple processors.
Results 1  10
of
105,478