Localization and tracking of objects (e.g. objects or people) in indoor environment will facilitate many location dependent or context-aware applications. Localization of passive ultra high frequency (UHF) radio-frequ...
详细信息
ISBN:
(纸本)9783319512044;9783319512037
Localization and tracking of objects (e.g. objects or people) in indoor environment will facilitate many location dependent or context-aware applications. Localization of passive ultra high frequency (UHF) radio-frequency identification (RFID) tags attached to objects or people is of special interest because of the low cost of the tags and backscatter communication that is power efficient. An augmented RFID system for localization based on a new tag called Sense-a-Tag (ST) that communicates with the RFID reader as a passive tags and can detect and record communication of other passive tags in its proximity was introduced several years ago. In ST-based localization system, a large set of passive landmark tags are placed at the known locations. The system localizes ST based on the aggregation of binary detection measurements according to localization algorithm, such as weighted centroid localization (WCL). However, the aforementioned method is easily affected by the outlier detection of distant landmark tags by ST. To improve localization accuracy, this paper propose to iteratively refine the interrogation area of the reader so that it includes only the most relevant landmark tags. The performance of the proposed method is demonstrated by extensive computer simulation and realistic experiments.
Pig production is one of the largest livestock activities in agricultural sector. Among all the livestock produce, pork is the most consumed meat in the world aside from beef and chicken. However, swine diseases like ...
详细信息
ISBN:
(纸本)9781665419710
Pig production is one of the largest livestock activities in agricultural sector. Among all the livestock produce, pork is the most consumed meat in the world aside from beef and chicken. However, swine diseases like African Swine Fever or ASF resulted to high mortality rates and affect the production and the livelihood of the hog raisers. ASF is a non-curable disease of pigs and have been savaging the world's pig population. As this type of disease does not have cure and vaccine, one of the ways to control and stop the spread of the virus is through zoning. Its primary purpose was to segregate the infected locale or city and restrict the trading process to implement the required mitigation control. This work developed an algorithm in Matlab that can be used in the zoning process based on the 1-7-10 protocol set by the government. Spherical geometry distance was calculated from the suspected premise and classify each city based on the defined protocol. Generated output was compared to the zoning data released by the government to determine the accuracy of the algorithm.
In processing a page image by a given zoning algorithm (automatic or manual), a certain text string is generated which may not be the same as the correct string. The difference may be due to the incorrect reading orde...
详细信息
In processing a page image by a given zoning algorithm (automatic or manual), a certain text string is generated which may not be the same as the correct string. The difference may be due to the incorrect reading order selected by the employed zoning algorithm or poor recognition of characters. A difference algorithm is commonly used to find the best match between the generated string and the correct string. The output of such an algorithm will then be a sequence of matched substrings which are not in the correct order. To determine the performance of a given zoning algorithm, it is of interest to find the minimum number of moves needed to obtain the correct string from the string generated by that algorithm. The problem can be modeled as a sorting problem where a string of n integers ordered in a random manner, must be sorted in ascending (or descending) order. In this paper, we derive bounds on the time complexity of sorting a given string and present a near-optimal algorithm for that.
Along with the advance of information technologies and open data availability, transport models have become more complex in the last years. However, the basic structure is often neglected in model design. Transport an...
详细信息
Along with the advance of information technologies and open data availability, transport models have become more complex in the last years. However, the basic structure is often neglected in model design. Transport analysis zones which form the spatial base of a model are often drawn alongside administrative boundaries and remain untouched, while the model evolves. This paper presents an automated approach to design traffic analysis zones as first step of a model, taking into account the administrative structure and possible data availability dimensions. A quality control step is included into the model framework. (C) 2019 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://***/licenses/by-nc-nd/4.0/) Peer-review under responsibility of the Conference Program Chairs.
Along with the advance of information technologies and open data availability, transport models have become more complex in the last years. However, the basic structure is often neglected in model design. Transport an...
详细信息
Along with the advance of information technologies and open data availability, transport models have become more complex in the last years. However, the basic structure is often neglected in model design. Transport analysis zones which form the spatial base of a model are often drawn alongside administrative boundaries and remain untouched, while the model evolves. This paper presents an automated approach to design traffic analysis zones as first step of a model, taking into account the administrative structure and possible data availability dimensions. A quality control step is included into the model framework.
When modelling spatial real data in environmental context, the border between two zones is rarely a sharp edge. Often, the transition from one zone to another is a gradual process. Fuzzy zones intend to model this unc...
详细信息
When modelling spatial real data in environmental context, the border between two zones is rarely a sharp edge. Often, the transition from one zone to another is a gradual process. Fuzzy zones intend to model this uncertainty in zones by allowing a spatial point to belong partially to different zones with different membership degrees. Generating fuzzy zones is not easy to perform and can be time-consuming and difficult to interpret. It is also difficult to ensure the convexity of the generated fuzzy zones. Our idea is to generate plateau zones instead of fuzzy zones. Plateau zones are an approximation of fuzzy zones. The interest of using plateau zones lies in the following: easier spatial coherence and convexity of zones, preservation of uncertainties, level and number of plateaus can be chosen depending on the application, interpretation and easier operations between zones. Our algorithm is based on quantiles of spatial data in order to produce some isocontours. According to the desired number of plateaus, it is possible to adjust the quantile values to find next plateaus for each resulting zones. The goal of this representation is to provide the user a simplification of the spatial representation and to preserve uncertainties in order to use them in the decision process.
In recent years there has been a trend towards large-scale logistics for individual members of the public, such as ride-sharing services and drone package delivery. Efficient coordination of pickups and deliveries is ...
详细信息
In recent years there has been a trend towards large-scale logistics for individual members of the public, such as ride-sharing services and drone package delivery. Efficient coordination of pickups and deliveries is essential in order to keep costs and wait times down.
In this thesis we present these types of problems in a more general framework, expanding applicability of our discussion to an even wider domain of problems. We present fast new al- gorithms with supporting theoretical and experimental analysis, providing certain guarantees about how close our algorithms compare to a theoretically optimal approach.
暂无评论