Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
Articles 1 - 4 of 4
Full-Text Articles in Physical Sciences and Mathematics
New Graph Model For Channel Assignment In Ad Hoc Wireless Networks, Maggie Xiaoyan Cheng, S. C. Huang, X. Huang, Weili Wu
New Graph Model For Channel Assignment In Ad Hoc Wireless Networks, Maggie Xiaoyan Cheng, S. C. Huang, X. Huang, Weili Wu
Computer Science Faculty Research & Creative Works
The channel assignment problem in ad hoc wireless networks is investigated. The problem is to assign channels to hosts in such a way that interference among hosts is eliminated and the total number of channels is minimised. Interference is caused by direct collisions from hosts that can hear each other or indirect collisions from hosts that cannot hear each other, but simultaneously transmit to the same destination. A new class of disk graphs (FDD: interFerence Double Disk graphs) is proposed that include both kinds of interference edges. Channel assignment in wireless networks is a vertex colouring problem in FDD graphs. …
Power Transmission Control Using Distributed Max-Flow, Bruce M. Mcmillin, Austin Armbruster, Mariesa Crow, Michael R. Gosnell
Power Transmission Control Using Distributed Max-Flow, Bruce M. Mcmillin, Austin Armbruster, Mariesa Crow, Michael R. Gosnell
Computer Science Faculty Research & Creative Works
Existing maximum flow algorithms use one processor for all calculations or one processor per vertex in a graph to calculate the maximum possible flow through a graph's vertices. This is not suitable for practical implementation. We extend the max-flow work of Goldberg and Tarjan to a distributed algorithm to calculate maximum flow where the number of processors is less than the number of vertices in a graph. Our algorithm is applied to maximizing electrical flow within a power network where the power grid is modeled as a graph. Error detection measures are included to detect problems in a simulated power …
A Fuzzy Logic-Based Foundation For Analyzing Imprecise Conflicting Requirements, J. Yen, Xiaoqing Frank Liu
A Fuzzy Logic-Based Foundation For Analyzing Imprecise Conflicting Requirements, J. Yen, Xiaoqing Frank Liu
Computer Science Faculty Research & Creative Works
Imprecise requirements are represented by the canonical form in test-score semantics. The concepts of feasibility, satisfiability, and specificity are formalized based on the fuzzy sets. The relationships between requirements are classified to be conflicting and cooperative. A feasible overall requirement can thus be formulated based on the tradeoff analysis of the conflicting requirements by using fuzzy multi-criteria optimization technique
Parallel Implementation Of A Recursive Least Squares Neural Network Training Method On The Intel Ipsc/2, James Edward Steck, Bruce M. Mcmillin, K. Krishnamurthy, M. Reza Ashouri, Gary G. Leininger
Parallel Implementation Of A Recursive Least Squares Neural Network Training Method On The Intel Ipsc/2, James Edward Steck, Bruce M. Mcmillin, K. Krishnamurthy, M. Reza Ashouri, Gary G. Leininger
Computer Science Faculty Research & Creative Works
An algorithm based on the Marquardt-Levenberg least-square optimization method has been shown by S. Kollias and D. Anastassiou (IEEE Trans. on Circuits Syst. vol.36, no.8, p.1092-101, Aug. 1989) to be a much more efficient training method than gradient descent, when applied to some small feedforward neural networks. Yet, for many applications, the increase in computational complexity of the method outweighs any gain in learning rate obtained over current training methods. However, the least-squares method can be more efficiently implemented on parallel architectures than standard methods. This is demonstrated by comparing computation times and learning rates for the least-squares method implemented …