منابع مشابه
Design for a Tag-Structured Filesystem
Tagging is an organizational system commonly used as an alternative to hierarchical systems. Many authors have recognized the desirability of a filesystem accessed with a tagging interface, as opposed to or in addition to a traditional directory interface. Existing tagging filesystems universally use conventional, hierarchical filesystems as a backing store. This paper examines the challenges i...
متن کاملCompact Printable Orientation Independent Chipless Rfid Tag
A novel design concept of a compact printable orientation independent chipless RFID tag is presented. The tag consists of a circular patch loaded with multiple slot ring resonators. This symmetric frequency domain based tag has the advantage to be read from any orientation with the reader antennas. The tag can be read in close proximity by chipless RFID tag reader with waveguide(s) and also can...
متن کاملDirectly printable compact chipless RFID tag for humidity sensing
In this letter, 8-bit paper based printable chipless tag is presented. The tag not only justifies the green electronic concept but also it is examined for sensing functionality. The compact tag structure comprises of seven L-shaped and one I-shaped dipole structure. These conducting tracks/dipole structures are of silver nano-particle based ink having a conductivity of 1.1 × 107 S/m. Each condu...
متن کاملContour Tone Distribution in Luganda
The traditional model of contour tone distribution (see, e.g., Hyman 2003) uses phonological units to describe which syllable types can bear rising or falling tones (see Zhang 2004 for an overview). A common pattern is one in which contour tones are permitted on long vowels but not on short vowels; this is explained in the traditional model by assuming that the mora is the tone-bearing unit (TB...
متن کاملCompact Forbidden-Set Routing
We study labelling schemes for X-constrained path problems. Given a graph (V,E) and X ⊆ V , a path is X-constrained if all intermediate vertices avoidX. We study the problem of assigning labels J(x) to vertices so that given {J(x) : x ∈ X} for any X ⊆ V , we can route on the shortest X-constrained path between x, y ∈ X. This problem is motivated by Internet routing, where the presence of routin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Natural Language Computing
سال: 2016
ISSN: 2319-4111,2278-1307
DOI: 10.5121/ijnlc.2016.5401