Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
A patent map, a visual representation of related patent information, is an effective strategic tool for analysis of patent application trends. In particular, an effect-technology type patent map is commonly used as patent examinations are based on technology and effect terms of the inventions. However, conventional patent mining tools are not realized to make an effect-technology type patent map....
We present a high-speed planning method with compact precomputed search trees using a new pruning method and evaluate the effectiveness and the efficiency of our precomputation planning. Its speed is faster than an A* planner in maps in which the obstacle rate is the same as indoor environments. Precomputed search trees are one way of reducing planning time; however, there is a time-memory trade off...
If robot systems are being deployed in real world settings with untrained users who happen to accidentally pass by or could leave at any moment in time, then this places specific demands on the robot system: it needs to secure and maintain the user's engagement. In this, a common and critical problem consists of entering into a `focused encounter'. It requires each interactional partner to closely...
We present a new pruning method for compact precomputed search trees and evaluate the effectiveness and the efficiency of our precomputation planning with steering sets. Precomputed search trees are one method for reducing planning time; however, there is a time-memory trade off. Our precomputed search tree (PCS) is built with pruning based on a rule of constant memory, the maximum-size pruning method...
In this paper we present a simple but powerful one-step growth method of ultra-long vertically aligned multi-walled CNT (MWNT) array, and its possible applications. Our growth method requires no additional process for catalyst thin film (pre-deposition), and only requires iron chloride powder and acetylene gas. We also present the results of electrical properties of MWNT array, such as electrical...
In this paper, we propose a novel data hiding technique for G.711 speech based on the LSB substitution method. The novel feature of the proposed method is that a low-bitrate encoder, G.726 ADPCM, is used as a reference for deciding how many bits can be embedded in a sample. Experiments showed that the method outperformed the simple LSB substitution method and the selective embedding method proposed...
This paper proposes perceptual segmentation of natural color images using a fuzzy-based hierarchical algorithm and its application to the segmentation of dermoscopy images. A fuzzy-based homogeneity measure makes a fusion of the color features and the texture features. The proposed hierarchical segmentation method is performed in four stages: simple splitting, local merging, global merging and boundary...
Watermarking is a technique by which additional information can be embedded into the content of a signal itself, rather than the header, without any distortion that is noticeable to listeners. It can also be regarded as a method to provide a certain rule to the content, which rule is difficult to ascertain by other persons. With ordinary audio watermarking techniques, amplitude modulation, phase modulation...
In order to realize Web information retrieval using characteristic tree structured patterns in semistructured Web documents, methods for discovering frequent patterns or common characteristics in semistructured documents become more and more important. We have studied methods for discovering maximally frequent tree structured patterns in semistructured Web documents. A tag tree pattern is an edge...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.