Search results

Blockchain technology was developed to synchronize the data and transactions over the supply chain network and connected nodes. This paper aims to show how blockchain technology can enhance flexibility and agility in supply chain operations. The integration of blockchain and other recently developed technology can help deal with supply chain uncertainties and other challenges being faced by the industry.

Through an extensive literature review of existing research papers and conversation with supply chain managers, barriers and challenges in the supply chain were identified. Some elements were researched of blockchain technology that can be used to resolve some challenges. Blockchain technology and other technologies integration is developed for implementation in supply chain for better visibility and efficiency of supply chain.

The challenges in the supply chain are categorized, and the solution is given through the integration of blockchain and other technologies like Internet of Things and artificial intelligence. The integration shows the execution of tasks through blockchain and various technologies in supply chain.

Blockchain in supply chain is finding its strong place in India when compared to developing nations. There is a need for technology experts, supply chain managers and consumers to understand blockchain’s importance. Challenges faced by industries to use blockchain may be analyzed further with real-life industry case studies.

This research helps enterprises in successful execution of smart technologies in their supply chains. This research helps enterprises in successful execution of smart technologies in their supply chains. Managers and practitioners may use the models developed in real-time implementation. The technologies are described in detail to help the practitioners select the best suitable for their organization.

Digital supply chains are finding the way in industries due to lean and efficient nature. It is beneficial to use the smart technologies to make supply chain green and sustainable.

The implementation of the digital supply chain and its challenges are discussed in the research paper. This will work as a platform for research in the area of technologies for supply chain.

This paper shows a new methodology for evaluating the value and sensitivity of autocall knock-in type equity-linked securities. While the existing evaluation methods, Monte Carlo simulation and finite difference method, have limitations in underestimating the knock-in effect, which is one of the important characteristics of this type, this paper presents a precise joint probability formula for multiple autocall chances and knock-in events. Based on this, the calculation results obtained by utilizing numerical and Monte Carlo integration are presented and compared with those of existing models. The results of the proposed model show notable improvements in terms of accuracy and calculation time.

The scalability of similarity joins is threatened by the unexpected data characteristic of data skewness. This is a pervasive problem in scientific data. Due to skewness, the uneven distribution of attributes occurs, and it can cause a severe load imbalance problem. When database join operations are applied to these datasets, skewness occurs exponentially. All the algorithms developed to date for the implementation of database joins are highly skew sensitive. This paper presents a new approach for handling data-skewness in a character- based string similarity join using the MapReduce framework. In the literature, no such work exists to handle data skewness in character-based string similarity join, although work for set based string similarity joins exists. Proposed work has been divided into three stages, and every stage is further divided into mapper and reducer phases, which are dedicated to a specific task. The first stage is dedicated to finding the length of strings from a dataset. For valid candidate pair generation, MR-Pass Join framework has been suggested in the second stage. MRFA concepts are incorporated for string similarity join, which is named as “MRFA-SSJ” (MapReduce Frequency Adaptive – String Similarity Join) in the third stage which is further divided into four MapReduce phases. Hence, MRFA-SSJ has been proposed to handle skewness in the string similarity join. The experiments have been implemented on three different datasets namely: DBLP, Query log and a real dataset of IP addresses & Cookies by deploying Hadoop framework. The proposed algorithm has been compared with three known algorithms and it has been noticed that all these algorithms fail when data is highly skewed, whereas our proposed method handles highly skewed data without any problem. A set-up of the 15-node cluster has been used in this experiment, and we are following the Zipf distribution law for the analysis of skewness factor. Also, a comparison among existing and proposed techniques has been shown. Existing techniques survived till Zipf factor 0.5 whereas the proposed algorithm survives up to Zipf factor 1. Hence the proposed algorithm is skew insensitive and ensures scalability with a reasonable query processing time for string similarity database join. It also ensures the even distribution of attributes.

Recent advancement in technological development has encouraged distance learning institutions to be more productive and creative in effectively utilizing the Learning Management System (LMS). Among the many measures employed is the integration of federated search engine into the LMS which allows for a more productive and wider scope of information retrieval through the provisions of library resources and services. The purpose of this paper is to report one such case study in Wawasan Open University exploring the integration of federated search engine (EBSCO Discovery Service (EDS) widget) into the learning spaces of LMS. Widgets resemble apps that enable the integration of EDS functionality in providing access for students to retrieve library learning resources from the convenience of the LMS, excluding the need to log onto the library.

This paper presents a discussion that highlights the development and conjectural implementation of a framework on the integration of the EDS widget into the University’s LMS. Data collection includes meta-analysis data from the micro- and macro-level infrastructure that make up the framework, namely, end-user layer, system layer and data management layer.

Findings from this study addressed significant importance to the library in promoting effective search and utilization of information needs. The findings will also make clear recommendations in developing effective collaborations between the library and faculties. Although the implementation of this framework is still in a developmental stage, this study still provides pertinent information in validating the integration of EDS into the University’s LMS.

While serious limitations are not anticipated, possible concerns do exist with programming algorithms in the integration of EDS into the LMS. These challenges will be reported in the paper as reference for future replications of study

One key implication is the increase in the usage of the library resources and the potential to reach a larger audience of remote library users.

The primary advantage is to minimize the need for multiple gateway login while ensuring the library to monitor relevant library databases activities throughout the system check of the LMS.

Algorithm bias refers to repetitive computer program errors that give some users more weight than others. The aim of this article is to provide a deeper insight of algorithm bias in AI-enabled ERP software customization. Although algorithmic bias in machine learning models has uneven, unfair and unjust impacts, research on it is mostly anecdotal and scattered.

As guided by the previous research (Akter et al., 2022), this study presents the possible design bias (model, data and method) one may experience with enterprise resource planning (ERP) software customization algorithm. This study then presents the artificial intelligence (AI) version of ERP customization algorithm using k-nearest neighbours algorithm.

This study illustrates the possible bias when the prioritized requirements customization estimation (PRCE) algorithm available in the ERP literature is executed without any AI. Then, the authors present their newly developed AI version of the PRCE algorithm that uses ML techniques. The authors then discuss its adjoining algorithmic bias with an illustration. Further, the authors also draw a roadmap for managing algorithmic bias during ERP customization in practice.

To the best of the authors’ knowledge, no prior research has attempted to understand the algorithmic bias that occurs during the execution of the ERP customization algorithm (with or without AI).

Metropolitan areas suffer from frequent road traffic congestion not only during peak hours but also during off-peak periods. Different machine learning methods have been used in travel time prediction, however, such machine learning methods practically face the problem of overfitting. Tree-based ensembles have been applied in various prediction fields, and such approaches usually produce high prediction accuracy by aggregating and averaging individual decision trees. The inherent advantages of these approaches not only get better prediction results but also have a good bias-variance trade-off which can help to avoid overfitting. However, the reality is that the application of tree-based integration algorithms in traffic prediction is still limited. This study aims to improve the accuracy and interpretability of the models by using random forest (RF) to analyze and model the travel time on freeways.

As the traffic conditions often greatly change, the prediction results are often unsatisfactory. To improve the accuracy of short-term travel time prediction in the freeway network, a practically feasible and computationally efficient RF prediction method for real-world freeways by using probe traffic data was generated. In addition, the variables’ relative importance was ranked, which provides an investigation platform to gain a better understanding of how different contributing factors might affect travel time on freeways.

The parameters of the RF model were estimated by using the training sample set. After the parameter tuning process was completed, the proposed RF model was developed. The features’ relative importance showed that the variables (travel time 15 min before) and time of day (TOD) contribute the most to the predicted travel time result. The model performance was also evaluated and compared against the extreme gradient boosting method and the results indicated that the RF always produces more accurate travel time predictions.

This research developed an RF method to predict the freeway travel time by using the probe vehicle-based traffic data and weather data. Detailed information about the input variables and data pre-processing were presented. To measure the effectiveness of proposed travel time prediction algorithms, the mean absolute percentage errors were computed for different observation segments combined with different prediction horizons ranging from 15 to 60 min.

Since many global path planning algorithms cannot achieve the planned path with both safety and economy, this study aims to propose a path planning method for unmanned vehicles with a controllable distance from obstacles.

First, combining satellite image and the Voronoi field algorithm (VFA) generates rasterized environmental information and establishes navigation area boundary. Second, establishing a hazard function associated with navigation area boundary improves the evaluation function of the A^* algorithm and uses the improved A^* algorithm for global path planning. Finally, to reduce the number of redundant nodes in the planned path and smooth the path, node optimization and gradient descent method (GDM) are used. Then, a continuous smooth path that meets the actual navigation requirements of unmanned vehicle is obtained.

The simulation experiment proved that the proposed global path planning method can realize the control of the distance between the planned path and the obstacle by setting different navigation area boundaries. The node reduction rate is between 33.52% and 73.15%, and the smoothness meets the navigation requirements. This method is reasonable and effective in the global path planning process of unmanned vehicle and can provide reference to unmanned vehicles’ autonomous obstacle avoidance decision-making.

This study establishes navigation area boundary for the environment based on the VFA and uses the improved A* algorithm to generate a navigation path that takes into account both safety and economy. This study also proposes a method to solve the redundancy of grid environment path nodes and large-angle steering and to smooth the path to improve the applicability of the proposed global path planning method. The proposed global path planning method solves the requirements of path safety and smoothness.

The purpose of this paper is to develop a proof-of-concept (POC) Forward Collision Warning (FWC) system for the motorcyclist, which determines a potential clash based on time-to-collision and trajectory of both the detected and ego vehicle (motorcycle).

This comes in three approaches. First, time-to-collision value is to be calculated based on low-cost camera video input. Second, the trajectory of the detected vehicle is predicted based on video data in the 2 D pixel coordinate. Third, the trajectory of the ego vehicle is predicted via the lean direction of the motorcycle from a low-cost inertial measurement unit sensor.

This encompasses a comprehensive Advanced FWC system which is an amalgamation of the three approaches mentioned above. First, to predict time-to-collision, nested Kalman filter and vehicle detection is used to convert image pixel matrix to relative distance, velocity and time-to-collision data. Next, for trajectory prediction of detected vehicles, a few algorithms were compared, and it was found that long short-term memory performs the best on the data set. The last finding is that to determine the leaning direction of the ego vehicle, it is better to use lean angle measurement compared to riding pattern classification.

The value of this paper is that it provides a POC FWC system that considers time-to-collision and trajectory of both detected and ego vehicle (motorcycle).

For many pattern recognition problems, the relation between the sample vectors and the class labels are known during the data acquisition procedure. However, how to find the useful rules or knowledge hidden in the data is very important and challengeable. Rule extraction methods are very useful in mining the important and heuristic knowledge hidden in the original high-dimensional data. It can help us to construct predictive models with few attributes of the data so as to provide valuable model interpretability and less training times.

In this paper, a novel rule extraction method with the application of biclustering algorithm is proposed.

To choose the most significant biclusters from the huge number of detected biclusters, a specially modified information entropy calculation method is also provided. It will be shown that all of the important knowledge is in practice hidden in these biclusters.

The novelty of the new method lies in the detected biclusters can be conveniently translated into if-then rules. It provides an intuitively explainable and comprehensive approach to extract rules from high-dimensional data while keeping high classification accuracy.

The Reflective Middleware for Acoustic Management (ReM-AM), based on the Middleware for Cloud Learning Environments (AmICL), aims to improve the interaction between users and agents in a Smart Environment (SE) using acoustic services, in order to consider the unpredictable situations due to the sounds and vibrations. The middleware allows observing, analyzing, modifying and interacting in every state of a SE from the acoustics. This work details an extension of the ReM-AM using the ontology-driven architecture (ODA) paradigm for acoustic management.

This work details an extension of the ReM-AM using the ontology-driven architecture (ODA) paradigm for acoustic management. In this paper are defined the different domains of knowledge required for the management of the sounds in SEs, which are modeled using ontologies.

This work proposes an acoustics and sound ontology, a service-oriented architecture (SOA) ontology, and a data analytics and autonomic computing ontology, which work together. Finally, the paper presents three case studies in the context of smart workplace (SWP), ambient-assisted living (AAL) and Smart Cities (SC).

Future works will be based on the development of algorithms for classification and analysis of sound events, to help with emotion recognition not only from speech but also from random and separate sound events. Also, other works will be about the definition of the implementation requirements, and the definition of the real context modeling requirements to develop a real prototype.

In the case studies is possible to observe the flexibility that the ReM-AM middleware based on the ODA paradigm has by being aware of different contexts and acquire information of each, using this information to adapt itself to the environment and improve it using the autonomic cycles. To achieve this, the middleware integrates the classes and relations in its ontologies naturally in the autonomic cycles.

The main contribution of this work is the description of the ontologies required for future works about acoustic management in SE, considering that what has been studied by other works is the utilization of ontologies for sound event recognition but not have been expanded like knowledge source in an SE middleware. Specifically, this paper presents the theoretical framework of this work composed of the AmICL middleware, ReM-AM middleware and the ODA paradigm.