Efficient algorithms for collision-free energy sub-optimal path planning for formations of spacecraft flying in deep space are presented. The idea is to introduce a set of way-poi...
An orthogonal coloring of a graph G is a pair {c1, c2} of proper colorings of G, having the property that if two vertices are colored with the same color in c1, then they must hav...
We consider the problem of providing opportunistic spectrum access to secondary users in wireless cellular networks. From the standpoint of spectrum license holders, achieving ben...
Ashraf Al Daoud, Murat Alanyali, David Starobinski
Consider a linear [n, k, d]q code C. We say that that i-th coordinate of C has locality r, if the value at this coordinate can be recovered from accessing some other r coordinates...
In this letter, we proposed a new recoloring method for people with protanopic and deuteranopic color deficiencies.We present a color transformation that aims to preserve the color...
Jia-Bin Huang, Yu-Cheng Tseng, Se-In Wu, and Sheng...