A naturalistic field observation study is presented, exploring the experienced riders’ eye fixations on specific traffic objects and their relative s 相似文献
Clean Technologies and Environmental Policy - Biochar has caught great attention over the last decade, yielding a large number of publications in a broad range of disciplines. This scientometric... 相似文献
Various relation-based systems, concerned with the qualitative representation and processing of spatial knowledge, have been developed in numerous application domains. In this article, we identify the common concepts underlying qualitative spatial knowledge representation, we compare the representational properties of the different systems, and we outline the computational tasks involved in relation-based spatial information processing. We also describesymbolic spatial indexes, relation-based structures that combine several ideas in spatial knowledge representation. A symbolic spatial index is an array that preserves only a set of spatial relations among distinct objects in an image, called the modeling space; the index array discards information, such as shape and size of objects, and irrelevant spatial relations. The construction of a symbolic spatial index from an input image can be thought of as a transformation that keeps only a set of representative points needed to define the relations of the modeling space. By keeping the relative arrangements of the representative points in symbolic spatial indexes and discarding all other points, we maintain enough information to answer queries regarding the spatial relations of the modeling space without the need to access the initial image or an object database. Symbolic spatial indexes can be used to solve problems involving route planning, composition of spatial relations, and update operations. 相似文献
The paper evaluates the performance effects of exposed terminals in IEEE 802.11 ad hoc networks in finite load conditions. It derives analytical models for the estimation of channel utilization and media access delay for IEEE 802.11 ad hoc networks in finite load conditions with and without exposed terminals. The simulation results show that the analytical estimated channel utilization and media access delay metrics are fairly accurate. 相似文献
We present a data-driven dynamic coupling between discrete and continuous methods for tracking objects of high dofs, which overcomes the limitations of previous techniques. In our approach, two trackers work in parallel, and the coupling between them is based on the tracking error. We use a model-based continuous method to achieve accurate results and, in cases of failure, we re-initialize the model using our discrete tracker. This method maintains the accuracy of a more tightly coupled system, while increasing its efficiency. At any given frame, our discrete tracker uses the current and several previous frames to search into a database for the best matching solution. For improved robustness, object configuration sequences, rather than single configurations, are stored in the database. We apply our framework to the problem of 3D hand tracking from image sequences and the discrimination between fingerspelling and continuous signs in American Sign Language. 相似文献
Although computer speed has steadily increased and memory is getting cheaper, the need for storage managers to deal efficiently with applications that cannot be held into main memory is vital. Dealing with large quantities of clauses implies the use of persistent knowledge and thus, indexing methods are essential to access efficiently the subset of clauses relevant to answering a query. We introduce PerKMan, a storage manager that uses G-trees, and aims at efficient manipulation of large amounts of persistent knowledge. PerKMan may be connected to Prolog systems that offer an external C language interface. As well as the fact that the storage manager allows different arguments of a predicate to share a common index dimension in a novel manner, it indexes rules and facts in the same manner. PerKMan handles compound terms efficiently and its data structures adapt their shape to large dynamic volumes of clauses, no matter what the distribution. The storage manager achieves fast clause retrieval and reasonable use of disk space. 相似文献
To improve the mechanical properties and performances of water-atomized powder metallurgy steels, it is necessary to enhance the density. Consolidating water-atomized steel powders via conventional pressing and sintering to a relative density level > 95 pct involves processing challenges. Consolidation of gas-atomized powders to full density by hot isostatic pressing (HIP) is an established process route but utilizing water-atomized powders in HIP involves challenges that result in the formation of prior particle boundaries due to higher oxygen content. In this study, the effect of density and processing conditions on the oxide transformations and mechanical properties from conventional press and sintering, and HIP are evaluated. Hence, water-atomized Cr–Mo-alloyed powder is used and consolidated into different density levels between 6.8 and 7.3 g cm−3 by conventional die pressing and sintering. Fully dense material produced through HIP is evaluated not only of mechanical properties but also for microstructural and fractographic analysis. An empirical model based on power law is fitted to the sintered material properties to estimate and predict the properties up to full density at different sintering conditions. A model describing the mechanism of oxide transformation during sintering and HIP is proposed. The challenges when it comes to the HIP of water-atomized powder are addressed and the requirements for successful HIP processing are discussed.