Search results
1 – 10 of over 8000G. OLIVE, J.E. TERRY and S. DATTA
A Selective Dissemination of Information service based on computer scanning of Nuclear Science Abstracts tapes has operated at Harwell since October 1968. Users' interest profiles…
Abstract
A Selective Dissemination of Information service based on computer scanning of Nuclear Science Abstracts tapes has operated at Harwell since October 1968. Users' interest profiles are constructed using Euratom index terms and NSA subject categories and matched against the Euratom index terms and subject categories assigned to each item in NSA.
The purpose of this paper is to propose an improved optimization method for image matching problem, which is based on multi-scale Gaussian mutation pigeon-inspired optimization…
Abstract
Purpose
The purpose of this paper is to propose an improved optimization method for image matching problem, which is based on multi-scale Gaussian mutation pigeon-inspired optimization (MGMPIO) algorithm, with the objective of accomplishing the complicated image matching quickly.
Design/methodology/approach
The hybrid model of multi-scale Gaussian mutation (MGM) mechanism and pigeon-inspired optimization (PIO) algorithm is established for image matching problem. The MGM mechanism is a nonlinear model, which can adjust the position of pigeons by mutation operation. In addition, the variable parameter (VP) mechanism is exploited to adjust the map and compass factor of the original PIO. Low-cost quadrotor, a type of electric multiple rotorcraft, is used as a carrier of binocular camera to obtain the images.
Findings
This work improved the PIO algorithm by modifying the search strategy and adding some limits, so that it can have better performance when applied to the image matching problem. Experimental results show that the proposed method demonstrates satisfying performance in convergence speed, robustness and stability.
Practical implications
The proposed MGMPIO algorithm can be easily applied to solve practical problems and accelerate convergence speed of the original PIO, and thus enhancing the speed of matching process, which will considerably increase the effectiveness of algorithm.
Originality/value
A hybrid model of the MGM mechanism and PIO algorithm is proposed for image matching problem. The VP mechanism and low-cost quadrotor is also utilized in image matching problem.
Details
Keywords
Yu-Ho Chi and David A. Ziebart
– The purpose of this paper is to examine the impact of management’s choice of forecast precision on the subsequent dispersion and accuracy of analysts’ earnings forecasts.
Abstract
Purpose
The purpose of this paper is to examine the impact of management’s choice of forecast precision on the subsequent dispersion and accuracy of analysts’ earnings forecasts.
Design/methodology/approach
Using a sample of 3,584 yearly management earnings per share (EPS) forecasts and 10,287 quarterly management EPS forecasts made during the period of 2002-2007 and collected from the First Call database, the authors controlled for factors previously found to impact analysts’ forecast accuracy and dispersion and investigate the link between management forecast precision and attributes of the analysts’ forecasts.
Findings
Results provide empirical evidence that managements’ disclosure precision has a statistically significant impact on both the dispersion and the accuracy of subsequent analysts’ forecasts. It was found that the dispersion in analysts’ forecasts is negatively related to the management forecast precision. In other words, a precise management forecast is associated with a smaller dispersion in the subsequent analysts’ forecasts. Evidence consistent with accuracy in subsequent analysts’ forecasts being positively associated with the precision in the management forecast was also found. When the present analysis focuses on range forecasts provided by management, it was found that lower precision (a larger range) is associated with a larger dispersion among analysts and larger forecast errors.
Practical implications
Evidence suggests a consistency in inferences across both annual and quarterly earnings forecasts by management. Accordingly, recent calls to eliminate earnings guidance through short-term quarterly management forecasts may have failed to consider the linkage between the attributes (precision) of those forecasts and the dispersion and accuracy in subsequent analysts’ forecasts.
Originality/value
This study contributes to the literature on both management earnings forecasts and analysts’ earnings forecasts. The results assist in policy deliberations related to calls to eliminate short-term management earnings guidance.
Details
Keywords
Wenyu Chen, Zhongquan Zhang, Tao Xiang and Ru Zeng
The purpose of this paper is to obtain more accurate matching between the request and the release of web service.
Abstract
Purpose
The purpose of this paper is to obtain more accurate matching between the request and the release of web service.
Design/methodology/approach
This paper adopts Levenshtein distance algorithm to calculate the name similarity between publishing service and request service, employs cosine theorem to compute the text similarity, and uses semantic distance to count the input‐output similarity, then filters out the low similarity and bad reputation services to structure the candidate service set.
Findings
The qualitative and quantitative analysis of the scheme is given in this paper. The experimental results show that the multi‐level matching filtering algorithm can obviously improve the recall ratio and precision ratio of web service discovery.
Originality/value
This paper proposes a similarity‐based filtering algorithm for multi‐level matching.
Details
Keywords
Kirsten Kinsley, Leslie Brooke Hill and Daniel Maier-Katkin
The purpose of this article was to describe a university library instruction and research model that represents a collaborative effort between faculty, libraries, and the campus…
Abstract
Purpose
The purpose of this article was to describe a university library instruction and research model that represents a collaborative effort between faculty, libraries, and the campus reading writing center. It uses rigorous research methods to measure whether the classroom intervention impacts student perceptions and success outcomes.
Design/methodology/approach
Longitudinal, mixed-methods approach that attempts to measure the outcome of an experimental class that uses precision (exact) matching to control for extraneous variables that impact student success and a survey to measure student perceptions.
Findings
Librarians can benefit by collaborating with faculty to learn more rigorous research methods. Precision (exact) matching a control group with an experimental group is time-intensive, but easily replicated. Preliminary results are very promising for both the precision matching and the survey data. It appears that students are able to learn critical thinking, research and writing skills from the collaboration between discipline-specific faculty, librarians and reading writing center tutors.
Research limitations/implications
Precision (exact) matching a control group with an experimental group is time-intensive. Thus, the results need to be viewed cautiously due to the small sample size.
Practical implications
Combining efforts to conduct collaborative research and instruction between libraries and faculty can provide resources for applications of the model with other disciplines.
Originality/value
The library-intensive freshman writing seminar is a unique approach to student learning and an easy way for the library to be actively integrated in other disciplines. The precision matching technique is a methodologically rigorous research design that easy to replicate in other locations and with other disciplines.
Details
Keywords
Ye Su, Ye Yutang, Xie Yu, Yi Maoli, Zhang Jing, Luo Ying and Du Chunlei
– This paper aims to solve the issue of target positioning in auto stiffener bonder (ASB) systems for flexible printed circuits.
Abstract
Purpose
This paper aims to solve the issue of target positioning in auto stiffener bonder (ASB) systems for flexible printed circuits.
Design/methodology/approach
The proposed approach uses Phong’s bidirectional reflectance distribution function (BRDF) model to simulate the reflection of light off a target in ASB systems to predict the current pose of the target based on image brightness, update the template, decrease the initial errors in the template and narrow down the search range.
Findings
The experimental results indicate that the proposed approach can predict the inclination angle of the target with precision, presenting angle prediction errors of less than three degrees. Furthermore, with larger inclined angles, the overall matching errors were less than 1.5 pixels. Comparisons with the unmodified matching algorithm revealed that the proposed approach resulted in 65 per cent less calculation time for the algorithm and 14 per cent higher overall work efficiency in the ASB system.
Originality/value
The edge-based perspective shape matching algorithm was modified using the Phong BRDF model and enhanced algorithm efficiency with the target pose prediction method while ensuring the precision and robustness of the system. The proposed approach has high potential value and can be expanded to recognition systems for objects with varying inclination angles and highly reflective surfaces.
Details
Keywords
Chao Wang, Jie Lu and Guangquan Zhang
Matching relevant ontology data for integration is vitally important as the amount of ontology data increases along with the evolving Semantic web, in which data are published…
Abstract
Purpose
Matching relevant ontology data for integration is vitally important as the amount of ontology data increases along with the evolving Semantic web, in which data are published from different individuals or organizations in a decentralized environment. For any domain that has developed a suitable ontology, its ontology annotated data (or simply ontology data) from different sources often overlaps and needs to be integrated. The purpose of this paper is to develop intelligent web ontology data matching method and framework for data integration.
Design/methodology/approach
This paper develops an intelligent matching method to solve the issue of ontology data matching. Based on the matching method, it also proposes a flexible peer‐to‐peer framework to address the issue of ontology data integration in a distributed Semantic web environment.
Findings
The proposed matching method is different from existing data matching or merging methods applied to data warehouse in that it employs a machine learning approach and more similarity measurements by exploring ontology features.
Research limitations/implications
The proposed method and framework will be further tested for some more complicated real cases in the future.
Originality/value
The experiments show that this proposed intelligent matching method increases ontology data matching accuracy.
Details
Keywords
Ahmad Mehrbod, Aneesh Zutshi, António Grilo and Ricardo Jardim-Gonsalves
Searching the tender notices that publish every day in open tendering websites is a common way for finding business opportunity in public procurement. The heterogeneity of tender…
Abstract
Purpose
Searching the tender notices that publish every day in open tendering websites is a common way for finding business opportunity in public procurement. The heterogeneity of tender notices from various tendering marketplaces is a challenge for exploiting semantic technologies in the tender search.
Design/methodology/approach
Most of the semantic matching approaches require the data to be structured and integrated according to a data model. But the integration process can be expensive and time-consuming especially for multi-source data integration.
Findings
In this paper, a product search mechanism that had been developed in an e-procurement platform for matching product e-catalogues is applied to the tender search problem. The search performance has been compared using two procurement vocabularies on searching tender notices from two major tender resources.
Originality/value
The test results show that the matching mechanism is able to find tender notices from heterogeneous resources and different classification systems without transforming the tenders to a uniform data model.
Details
Keywords
Janak D. Trivedi, Sarada Devi Mandalapu and Dhara H. Dave
The purpose of this paper is to find a real-time parking location for a four-wheeler.
Abstract
Purpose
The purpose of this paper is to find a real-time parking location for a four-wheeler.
Design/methodology/approach
Real-time parking availability using specific infrastructure requires a high cost of installation and maintenance cost, which is not affordable to all urban cities. The authors present statistical block matching algorithm (SBMA) for real-time parking management in small-town cities such as Bhavnagar using an in-built surveillance CCTV system, which is not installed for parking application. In particular, data from a camera situated in a mall was used to detect the parking status of some specific parking places using a region of interest (ROI). The method proposed computes the mean value of the pixels inside the ROI using blocks of different sizes (8 × 10 and 20 × 35), and the values were compared among different frames. When the difference between frames is more significant than a threshold, the process generates “no parking space for that place.” Otherwise, the method yields “parking place available.” Then, this information is used to print a bounding box on the parking places with the color green/red to show the availability of the parking place.
Findings
The real-time feedback loop (car parking positions) helps the presented model and dynamically refines the parking strategy and parking position to the users. A whole-day experiment/validation is shown in this paper, where the evaluation of the method is performed using pattern recognition metrics for classification: precision, recall and F1 score.
Originality/value
The authors found real-time parking availability for Himalaya Mall situated in Bhavnagar, Gujarat, for 18th June 2018 video using the SBMA method with accountable computational time for finding parking slots. The limitations of the presented method with future implementation are discussed at the end of this paper.
Details
Keywords
Zhishuo Liu, Yao Dongxin, Zhao Kuan and Wang Chun Fang
There is a certain error in the satellite positioning of the vehicle. The error will cause the drift point of the positioning point, which makes the vehicle trajectory shift to…
Abstract
Purpose
There is a certain error in the satellite positioning of the vehicle. The error will cause the drift point of the positioning point, which makes the vehicle trajectory shift to the real road. This paper aims to solve this problem.
Design/methodology/approach
The key technology to solve the problem is map matching (MM). The low sampling frequency of the vehicle is far from the distance between adjacent points, which weakens the correlation between the points, making MM more difficult. In this paper, an MM algorithm based on priority rules is designed for vehicle trajectory characteristics at low sampling frequencies.
Findings
The experimental results show that the MM based on priority rule algorithm can effectively match the trajectory data of low sampling frequency with the actual road, and the matching accuracy is better than other similar algorithms, the processing speed reaches 73 per second.
Research limitations/implications
In the algorithm verification of this paper, although the algorithm design and experimental verification are considered considering the diversity of GPS data sampling frequency, the experimental data used are still a single source.
Originality/value
Based on the GPS trajectory data of the Ministry of Transport, the experimental results show that the accuracy of the priority-based weight-based algorithm is higher. The accuracy of this algorithm is over 98.1 per cent, which is better than other similar algorithms.
Details