134 research outputs found

    Information Extraction based on Named Entity for Tourism Corpus

    Full text link
    Tourism information is scattered around nowadays. To search for the information, it is usually time consuming to browse through the results from search engine, select and view the details of each accommodation. In this paper, we present a methodology to extract particular information from full text returned from the search engine to facilitate the users. Then, the users can specifically look to the desired relevant information. The approach can be used for the same task in other domains. The main steps are 1) building training data and 2) building recognition model. First, the tourism data is gathered and the vocabularies are built. The raw corpus is used to train for creating vocabulary embedding. Also, it is used for creating annotated data. The process of creating named entity annotation is presented. Then, the recognition model of a given entity type can be built. From the experiments, given hotel description, the model can extract the desired entity,i.e, name, location, facility. The extracted data can further be stored as a structured information, e.g., in the ontology format, for future querying and inference. The model for automatic named entity identification, based on machine learning, yields the error ranging 8%-25%.Comment: 6 pages, 9 figure

    Parallel Simulation of HGMS of Weakly Magnetic Nanoparticles in Irrotational Flow of Inviscid Fluid

    Get PDF
    The process of high gradient magnetic separation (HGMS) using a microferromagnetic wire for capturing weakly magnetic nanoparticles in the irrotational flow of inviscid fluid is simulated by using parallel algorithm developed based on openMP. The two-dimensional problem of particle transport under the influences of magnetic force and fluid flow is considered in an annular domain surrounding the wire with inner radius equal to that of the wire and outer radius equal to various multiples of wire radius. The differential equations governing particle transport are solved numerically as an initial and boundary values problem by using the finite-difference method. Concentration distribution of the particles around the wire is investigated and compared with some previously reported results and shows the good agreement between them. The results show the feasibility of accumulating weakly magnetic nanoparticles in specific regions on the wire surface which is useful for applications in biomedical and environmental works. The speedup of parallel simulation ranges from 1.8 to 21 depending on the number of threads and the domain problem size as well as the number of iterations. With the nature of computing in the application and current multicore technology, it is observed that 4–8 threads are sufficient to obtain the optimized speedup

    āđ€āļ„āļĢāļ·āđˆāļ­āļ‡āļĄāļ·āļ­āļŠāļĢāđ‰āļēāļ‡āļ āļēāļžāļ§āļąāļāļˆāļąāļāļĢāļĢāļēāļ„āļēāļŦāļļāđ‰āļ™āļĢāļ°āļĒāļ°āļŠāļąāđ‰āļ™āđ‚āļ”āļĒāđƒāļŠāđ‰āļāļĢāļēāļŸāļ–āđˆāļ§āļ‡āļ™āđ‰āļģāļŦāļ™āļąāļA short-term stock price cycle visualization tool using a weighted graph

    No full text
    āļ‡āļēāļ™āļ§āļīāļˆāļąāļĒāļ™āļĩāđ‰āļ™āļģāđ€āļŠāļ™āļ­āđ€āļ„āļĢāļ·āđˆāļ­āļ‡āļĄāļ·āļ­āļŠāļĢāđ‰āļēāļ‡āļ āļēāļžāļ§āļąāļāļˆāļąāļāļĢāļĢāļēāļ„āļēāļŦāļļāđ‰āļ™āļ—āļĩāđˆāđ€āļāļīāļ”āļ§āļ‡āļĢāļ­āļšāļĢāļ°āļĒāļ°āļŠāļąāđ‰āļ™ āđ‚āļ”āļĒāđƒāļŠāđ‰āđ„āļĨāļšāļĢāļēāļĢāļĩāđ„āļŸāļĨāđŒ vis.js āļŠāļģāļŦāļĢāļąāļšāļŠāļĢāđ‰āļēāļ‡āļāļĢāļēāļŸāļ–āđˆāļ§āļ‡āļ™āđ‰āļģāļŦāļ™āļąāļāļˆāļēāļāļāļēāļ™āļ‚āđ‰āļ­āļĄāļđāļĨāļāļēāļĢāļ‹āļ·āđ‰āļ­āļ‚āļēāļĒāļŦāļĨāļąāļāļ—āļĢāļąāļžāļĒāđŒāļ—āļĩāđˆāđ„āļ”āđ‰āļĢāļ§āļšāļĢāļ§āļĄ āđ€āļžāļ·āđˆāļ­āļ™āļģāđ€āļŠāļ™āļ­āļāļĢāļ­āļšāļĢāļēāļ„āļēāļŦāļļāđ‰āļ™āđāļĨāļ°āđāļ™āļ§āđ‚āļ™āđ‰āļĄāļāļēāļĢāđ€āļ›āļĨāļĩāđˆāļĒāļ™āđāļ›āļĨāļ‡āļ—āļĩāđˆāļŠāđˆāļ§āļĒāđƒāļŦāđ‰āļ™āļąāļāļĨāļ‡āļ—āļļāļ™āđ€āļŦāđ‡āļ™āļ āļēāļžāđ„āļ”āđ‰āļ­āļĒāđˆāļēāļ‡āļŠāļąāļ”āđ€āļˆāļ™ āļ‹āļķāđˆāļ‡āļāļĢāļēāļŸāļˆāļąāļ”āđ€āļĢāļĩāļĒāļ‡āđ‚āļŦāļ™āļ”āļĢāļēāļ„āļēāđāļĨāļ°āļĢāļ°āļšāļļāļ„āđˆāļēāļ„āļ§āļēāļĄāļ–āļĩāđˆāļ—āļĩāđˆāđ€āļāļīāļ”āļ‹āđ‰āļģ āđāļĨāđ‰āļ§āļĨāļēāļāđ€āļŠāđ‰āļ™āđ€āļŠāļ·āđˆāļ­āļĄāđ‚āļŦāļ™āļ”āļĢāļēāļ„āļēāđāļšāļšāļĢāļ°āļšāļļāļ—āļīāļĻāļ—āļēāļ‡āļ•āļēāļĄāļĨāļģāļ”āļąāļš āļāļģāļŦāļ™āļ”āļĢāļđāļ›āđāļšāļšāļāļēāļĢāđ€āļ›āļĨāļĩāđˆāļĒāļ™āđāļ›āļĨāļ‡āļœāđˆāļēāļ™āđ€āļŠāđ‰āļ™āđ€āļŠāļ·āđˆāļ­āļĄāļ•āđˆāļ­āļ”āđ‰āļ§āļĒāļāļēāļĢāđƒāļŠāđ‰āļŠāļĩ āļ‚āļ™āļēāļ” āļ„āļ§āļēāļĄāļĒāļēāļ§ āļāļģāļāļąāļšāļ”āđ‰āļ§āļĒāļĨāļģāļ”āļąāļšāđāļĨāļ°āļˆāļģāļ™āļ§āļ™āļŦāļ™āđˆāļ§āļĒāļ—āļĩāđˆāđ€āļ›āļĨāļĩāđˆāļĒāļ™āđāļ›āļĨāļ‡āļ„āļĨāđ‰āļēāļĒāļāļēāļĢāļ§āļēāļ”āđ€āļŠāđ‰āļ™āļˆāļģāļ™āļ§āļ™ āļˆāļēāļāļāļĢāļ­āļšāļāļēāļĢāļĨāļ‡āļ—āļļāļ™āļˆāļķāļ‡āđāļšāđˆāļ‡āļāļĢāļēāļŸāļ­āļ­āļāđ€āļ›āđ‡āļ™ 1) āļāļĢāļēāļŸāļĢāļēāļ„āļēāļ•āđˆāļģāļŠāļļāļ”āļŠāļģāļŦāļĢāļąāļšāļ­āđ‰āļēāļ‡āļ­āļīāļ‡āļāļĢāļ­āļšāđāļ™āļ§āļĢāļąāļšāđƒāļ™āļāļēāļĢāļ‹āļ·āđ‰āļ­āđāļĨāļ° 2) āļāļĢāļēāļŸāļĢāļēāļ„āļēāļŠāļđāļ‡āļŠāļļāļ”āļŠāļģāļŦāļĢāļąāļšāļ­āđ‰āļēāļ‡āļ­āļīāļ‡āļāļĢāļ­āļšāđāļ™āļ§āļ•āđ‰āļēāļ™āđƒāļ™āļāļēāļĢāļ‚āļēāļĒ āļˆāļēāļāļāļēāļĢāļˆāļąāļ”āđ€āļāđ‡āļšāļ‚āđ‰āļ­āļĄāļđāļĨāļĢāļēāļ„āļēāļŦāļļāđ‰āļ™āļ‚āļ­āļ‡āļšāļĢāļīāļĐāļąāļ—āļŦāļĨāļąāļāļ—āļĢāļąāļžāļĒāđŒāđƒāļ™āļ•āļĨāļēāļ”āļŦāļĨāļąāļāļ—āļĢāļąāļžāļĒāđŒāđāļŦāđˆāļ‡āļ›āļĢāļ°āđ€āļ—āļĻāđ„āļ—āļĒāļĒāđ‰āļ­āļ™āļŦāļĨāļąāļ‡ 1 āļ›āļĩ āđāļĨāļ°āļ›āļĢāļ°āđ€āļĄāļīāļ™āļœāļĨāđāļ­āļ›āļžāļĨāļīāđ€āļ„āļŠāļąāļ™āđƒāļ™āļāļēāļĢāļŠāļĢāđ‰āļēāļ‡āļāļĢāļēāļŸāļ§āļąāļāļˆāļąāļāļĢāļĢāļēāļ„āļēāļŦāļļāđ‰āļ™āļ‚āļ­āļ‡āļšāļĢāļīāļĐāļąāļ—āđƒāļ™āļāļĨāļļāđˆāļĄ SET100 āļˆāļģāļ™āļ§āļ™ 10 āļšāļĢāļīāļĐāļąāļ— āļ”āđ‰āļ§āļĒāļŠāļļāļ”āļ‚āđ‰āļ­āļĄāļđāļĨāļĒāđ‰āļ­āļ™āļŦāļĨāļąāļ‡ 5, 10, 15, 20 āđāļĨāļ° 25 āļ§āļąāļ™ āļžāļšāļ§āđˆāļēāļāļĢāļēāļŸāļŠāļēāļĄāļēāļĢāļ–āđāļŠāļ”āļ‡āļāļēāļĢāđ€āļ›āļĨāļĩāđˆāļĒāļ™āđāļ›āļĨāļ‡āļĢāļēāļ„āļēāđāļšāļšāļ§āļ‡āļĢāļ­āļš āļ—āļīāļĻāļ—āļēāļ‡āđāļĨāļ°āđāļ™āļ§āđ‚āļ™āđ‰āļĄāļāļēāļĢāđāļāļ§āđˆāļ‡āļ‚āļ­āļ‡āļĢāļēāļ„āļēāļŦāļļāđ‰āļ™āđ„āļ”āđ‰ āļŠāđˆāļ§āļĒāđƒāļŦāđ‰āļ™āļąāļāļĨāļ‡āļ—āļļāļ™āļŠāļēāļĄāļēāļĢāļ–āļāļģāļŦāļ™āļ”āļāļĢāļ­āļšāļĢāļēāļ„āļēāđƒāļ™āļāļēāļĢāļ‹āļ·āđ‰āļ­āļ‚āļēāļĒāđ„āļ”āđ‰āđ€āļŦāļĄāļēāļ°āļŠāļĄāļāļąāļšāđ€āļ§āļĨāļēāļ‚āļ­āļ‡āļāļēāļĢāļĨāļ‡āļ—āļļāļ™ āđ€āļžāļ·āđˆāļ­āđƒāļŠāđ‰āļŦāļēāļˆāļļāļ”āļāļĨāļąāļšāļ•āļąāļ§āđƒāļ™āļāļēāļĢāļĨāļ‡āļ—āļļāļ™ āļœāļĨāļˆāļēāļāļāļēāļĢāļ•āļąāđ‰āļ‡āļĢāļēāļ„āļēāļ•āļēāļĄāļ—āļĩāđˆāļ™āļģāđ€āļŠāļ™āļ­āđƒāļ™āļ āļēāļžāļ§āļąāļāļˆāļąāļāļĢāļĢāļēāļ„āļē āļŠāđˆāļ§āļĒāđ€āļžāļīāđˆāļĄāđ‚āļ­āļāļēāļŠāđƒāļ™āļāļēāļĢāļ‹āļ·āđ‰āļ­āđ„āļ”āđ‰āļŠāļģāđ€āļĢāđ‡āļˆāļ„āļīāļ”āđ€āļ›āđ‡āļ™āļĢāđ‰āļ­āļĒāļĨāļ° 64 āđāļĨāļ°āļĄāļĩāđ‚āļ­āļāļēāļŠāđƒāļ™āļāļēāļĢāļ‚āļēāļĒāđ„āļ”āđ‰āļŠāļģāđ€āļĢāđ‡āļˆāļĢāđ‰āļ­āļĒāļĨāļ° 57 āđ€āļ›āđ‡āļ™āļāļēāļĢāļ§āļīāđ€āļ„āļĢāļēāļ°āļŦāđŒāļĢāļđāļ›āđāļšāļšāļāļēāļĢāđ€āļ›āļĨāļĩāđˆāļĒāļ™āđāļ›āļĨāļ‡āļāļēāļĢāļ‹āļ·āđ‰āļ­āļ‚āļēāļĒāļŦāļĨāļąāļāļ—āļĢāļąāļžāļĒāđŒāļŠāļģāļŦāļĢāļąāļšāļŠāļ™āļąāļšāļŠāļ™āļļāļ™āļāļēāļĢāļ•āļąāļ”āļŠāļīāļ™āđƒāļˆāđ€āļŠāļ™āļ­āļĢāļēāļ„āļēāļ‹āļ·āđ‰āļ­āļ‚āļēāļĒāļ•āļēāļĄāļāļĢāļ­āļšāđ€āļ§āļĨāļēāļĨāļ‡āļ—āļļāļ™āļĢāļ°āļĒāļ°āļŠāļąāđ‰āļ™āđ„āļ”āđ‰This research presents the visualization tool for creating a weighted graph that shows a short cycle of stock prices. The weighted graph is implemented using vis.js library based on the gathered stock price database. The visualization presents the stock price boundary and trend which can aid the investors. The graph orders nodes by prices and includes the frequency of cycle occurrences. Nodes are connected and formed as a directed graph. The amount of price change is implied by edges with the size, color, length and is labeled in the order of the unit of change similar to the number line. From the investment scope, we divide the graph into: 1) the graph showing the minimum reference price suggesting for buying 2) the graph showing the maximum reference price against selling. From the stock price collected from SET for 1 year, we evaluated the application in creating the stock price cycle graph for the companies under SET100 for 10 companies with the history data 5, 10, 15, 20 and 25 days backward. The graph can demonstrate the price change as a cycle, the direction, and the change trend. This enables the investors to specify the boundary of buying and selling price at the appropriate time in order to find the turning point for investment. This pricing scheme resulting from the price cycle can lead to 64% of the success of buying and lead to 57% of the success of selling. This visualization is a decision support system helping the investor to buy and sell within the time frame for a short investment period

    On the 3D point clouds–palm and coconut trees data set extraction and their usages

    No full text
    Abstract Objective Drone image data set can be utilized for field surveying and image data collection which can be useful for analytics. With the current drone mapping software, useful 3D object reconstruction is possible. This research aims to learn the 3D data set construction process for trees with open-source software along with their usage. Thus, we research the tools used for 3D data set construction, especially in the agriculture field. Due to the growing open-source community, we demonstrate the case study of our palm and coconut data sets against the open-source ones. Results The methodology for achieving the point cloud data set was based on the tools: OpenDroneMap, CloudCompare, and Open3D. As a result, 40 palm trees and 40 coconut tree point clouds were extracted. Examples of the usages are provided in the area of volume estimation and graph analytics
    • â€Ķ
    corecore