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.
By exploiting properties of the wireless medium, network coding may provide even larger throughput increases for wireless networks than possible for wired networks. In particular, simultaneously transmitted signals are seen as noisy linear combinations at the antennas of receivers. It is thus quite tempting to use the physical layer to directly perform network coding "on the air". However,...
The aim of this paper is to investigate the potential of Visible and short-wave near-infrared spectroscopy (Vis/SWNIR) technique used for brand discrimination of milk powder. Fifty samples for each brand were studied. Based on the independent components (ICs) as the input variable obtained from fast fixed-point independent component analysis (FastICA), Least-squares Support Vector Machine (LS-SVM)...
In this paper the performance of the ESPAR (electronically steerable passive array radiator) antenna in suppressing both the co-channel and inter-symbol interferences is compared with the conventional circular and linear arrays. For this purpose, the STAP (space-time adaptive processing) is implemented in both arrays with equal elements. Simulation results show that when the pattern of the ESPAR antenna...
We consider the problem of approximating an integer program by first solving its relaxation linear program and "rounding" the resulting solution. For several packing problems, we prove probabilistically that there exists an integer solution close to the optimum of the relaxation solution. We then develop a methodology for converting such a probabilistic existence proof to a deterministic...
We show that there can be no computationally tractable description by linear inequalities of the polyhedron associated with any NP-complete combinatorial optimization problem unless NP = co-NP -- a very unlikely event. We also apply the ellipsoid method for linear programming to show that a combinatorial optimization problem is solvable in polynomial time if and only if it admits a small generator...
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.