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.
A graphene reflectarray is designed to realize two functions simultaneously at terahertz frequency: generating vortex waves, and steering the waves. Four parts of graphene patches with different values of reflection phase are used to generate vortex waves. On the other hand, generalized Snell's Law is applied to introduce additional reflection phase. Anomalous reflection is realized to steer the Vortex...
We consider two problems in the context of tree-structured data sets (e.g., XML): (1) searching for a data element, (2) synchronizing two data trees (replicas) stored at remote locations. We propose to compute bloom filters for the interior tree nodes, this bloom filter tree is used for both data search and synchronization. It is more efficient than tree traversal since it prunes out entire subtrees,...
This paper presents a novel substrate integrated dual-wideband magneto-electric (ME) dipole antenna for WLAN and WiMAX applications. By employing a ladder-shaped feeding structure to excite the dual-layer electric dipole radiated patches, a dual-band feature can be acquired. Besides, by using the ladder-shaped feeding structure and the printed metal via technology, the impedance matching can be easily...
We consider the problem of searching for a data element in a tree-structured data set (e.g., XML). We propose a method which is more efficient than tree traversal and which still retains all the important metadata information that would be lost in the naive method of linear list search. We compute a bloom filter for each interior node of the tree, essentially building a bloom filter tree to enhance...
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.