The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In the cognitive radio networks (CRNs), efficient spectrum sensing is a key enabling techniques for the effective spectrum exploration. However, Majority of the existing works on spectrum sensing is conducted the spectrum sensing serially in cognitive radio networks, which may bring about the sensing delay problem. In this paper, in order to make full use of the available channel resources and improve...
Wideband Spectrum Sensing (WSS) is considered as one of the challenging issues in Cognitive Radio (CR) dealing with the opportunistic utilization of a wide frequency band. Compressive sampling (CS, also known as compressive sensing) has been introduced recently with a revolutionary idea to detect the sparse wideband spectrum by using a much lower sampling rate. However, in traditional compressive...
Let G=(V,E) be a graph and f:(V ∪ E) → [k] be a proper total k-coloring of G. We say that f is an adjacent vertex distinguishing total coloring if for any two adjacent vertices, the set of colors appearing on the vertex and incident edges are different. We call the smallest k for which such a coloring of G exists the adjacent vertex distinguishing total chromatic number, and denote it by χat(G). In...
The Smarandachely adjacent-vertex distinguishing total coloring of graphs is a proper k-total coloring such that every adjacent vertex coloring set not embrace each other, the minimal number k is denoted the Smarandachely adjacent-vertex distinguishing total coloring chromatic number of graphs. Where the coloring set include the colors of all edges incident to the vertex plus the color of it. In this...
The Smarandachely adjacent-vertex total chromatic number of graph G is the smallest positive integer k for which G has a proper total k-coloring such that for any pair of adjacent vertices u, v, the set of colors appearing at vertex u and its incident edges is not a subset of the set of colors appearing at vertex v and its incident edges. This paper,we obtain the Smarandachely adjacent-vertex total...
The secondary reaction of fluidized-bed catalytically cracked gasoline (FCC gasoline) was investigated experimentally with a riser reactor using an improved Y zeolite catalyst in different operating conditions. The product distributions were predicted using a new black-box model based on fuzzy neural network (FNN) combined with genetic algorithm (GA) named FNN–GA method. In this new approach, the...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.