Search results

This paper aims to identify, synthesise and critically examine the extant academic research on the relation between big data analytics (BDA), corporate accountability and non-financial disclosure (NFD) across several disciplines.

This paper uses a structured literature review methodology and applies “insight-critique-transformative redefinition” framework to interpret the findings, develop critique and formulate future research directions.

This paper identifies and critically examines 12 research themes across four macro categories. The insights presented in this paper indicate that the nature of the relationship between BDA and accountability depends on whether an organisation considers BDA as a value creation instrument or as a revenue generation source. This paper discusses how NFD can effectively increase corporate accountability for ethical, social and environmental consequences of BDA.

This paper presents the results of a structured literature review exploring the state-of-the-art of academic research on the relation between BDA, NFD and corporate accountability. This paper uses a systematic approach, to provide an exhaustive analysis of the phenomenon with rigorous and reproducible research criteria. This paper also presents a series of actionable insights of how corporate accountability for the use of big data and algorithmic decision-making can be enhanced.

This paper discusses how NFD can reduce negative social and environmental impact stemming from the corporate use of BDA.

To the best of the authors’ knowledge, this paper is the first one to provide a comprehensive synthesis of academic literature, identify research gaps and outline a prospective research agenda on the implications of big data technologies for NFD and corporate accountability along social, environmental and ethical dimensions.

This article revisits some theories and concepts of public administration, including those related to public value, transaction costs and social equity, to analyze the advantages and disadvantages of using artificial intelligence (AI) algorithms in public service delivery. The author seeks to mobilize theory to guide AI-era public management practitioners and researchers.

The author uses an existing task classification model to mobilize and juxtapose public management theories against artificial intelligence potential impacts in public service delivery. Theories of social equity and transaction costs as well as some concepts such as red tape, efficiency and economy are used to argue that the discipline of public administration provides a foundation to ensure algorithms are used in a way that improves service delivery.

After presenting literature on the challenges and promises of using AI in public service, the study shows that while the adoption of algorithms in public service has benefits, some serious challenges still exist when looked at under the lenses of theory. Additionally, the author mobilizes the public administration concepts of agenda setting and coproduction and finds that designing AI-enabled public services should be centered on citizens who are not mere customers. As an implication for public management practice, this study shows that bringing citizens to the forefront of designing and implementing AI-delivered services is key to reducing the reproduction of social biases.

As a fast-growing subject, artificial intelligence research in public management is yet to empirically test some of the theories that the study presented.

The paper vulgarizes some theories of public administration which practitioners can consider in the design and implementation of AI-enabled public services. Additionally, the study shows practitioners that bringing citizens to the forefront of designing and implementing AI-delivered services is key to reducing the reproduction of social biases.

The paper informs a broad audience who might not be familiar with public administration theories and how those theories can be taken into consideration when adopting AI systems in service delivery.

This research is original, as, to the best of the author’s knowledge, no prior work has combined these concepts in analyzing AI in the public sector.

This paper introduces an audio encryption algorithm based on permutation of audio samples using discrete modified Henon map followed by substitution operation with keystream generated from the modified Lorenz-Hyperchaotic system. In this work, the audio file is initially compressed by Fast Walsh Hadamard Transform (FWHT) for removing the residual intelligibility in the transform domain. The resulting file is then encrypted in two phases. In the first phase permutation operation is carried out using modified discrete Henon map to weaken the correlation between adjacent samples. In the second phase it utilizes modified-Lorenz hyperchaotic system for substitution operation to fill the silent periods within the speech conversation. Dynamic keystream generation mechanism is also introduced to enhance the correlation between plaintext and encrypted text. Various quality metrics analysis such as correlation, signal to noise ratio (SNR), differential attacks, spectral entropy, histogram analysis, keyspace and key sensitivity are carried out to evaluate the quality of the proposed algorithm. The simulation results and numerical analyses demonstrate that the proposed algorithm has excellent security performance and robust against various cryptographic attacks.

With the rapid development of internet technology, open online social networks provide a broader platform for information spreading. While dissemination of information provides convenience for life, it also brings many problems such as security risks and public opinion orientation. Various negative, malicious and false information spread across regions, which seriously affect social harmony and national security. Therefore, this paper aims to minimize negative information such as online rumors that has attracted extensive attention. The most existing algorithms for blocking rumors have prevented the spread of rumors to some extent, but these algorithms are designed based on entire social networks, mainly focusing on the microstructure of the network, i.e. the pairwise relationship or similarity between nodes. The blocking effect of these algorithms may be unsatisfactory in some networks because of the sparse data in the microstructure.

An algorithm for minimizing the influence of dynamic rumor based on community structure is proposed in this paper. The algorithm first divides the network into communities, and integrates the influence of each node within communities and rumor influence probability to measure the influence of each node in the entire network, and then selects key nodes and bridge nodes in communities as blocked nodes. After that, a dynamic blocking strategy is adopted to improve the blocking effect of rumors.

Community structure is one of the most prominent features of networks. It reveals the organizational structure and functional components of a network from a mesoscopic level. The utilization of community structure can provide effective and rich information to solve the problem of data sparsity in the microstructure, thus effectively improve the blocking effect. Extensive experiments on two real-world data sets have validated that the proposed algorithm has superior performance than the baseline algorithms.

As an important research direction of social network analysis, rumor minimization has a profound effect on the harmony and stability of society and the development of social media. However, because the rumor spread has the characteristics of multiple propagation paths, fast propagation speed, wide propagation area and time-varying, it is a huge challenge to improve the effectiveness of the rumor blocking algorithm.

Although proactive fault handling plans are widely spread, many unexpected data center outages still occurred. To rescue the jobs from faulty data centers, the authors propose a novel independent job rescheduling strategy for cloud resilience to reschedule the task from the faulty data center to other working-proper cloud data centers, by jointly considering job nature, timeline scenario and overall cloud performance.

A job parsing system and a priority assignment system are developed to identify the eligible time slots for the jobs and prioritize the jobs, respectively. A dynamic job rescheduling algorithm is proposed.

The simulation results show that our proposed approach has better cloud resiliency and load balancing performance than the HEFT series approaches.

This paper contributes to the cloud resilience by developing a novel job prioritizing, task rescheduling and timeline allocation method when facing faults.

The purpose of this research is to systematically review the properties of supply chains demonstrating that they are complex systems, and that the management of supply chains is best achieved by steering rather than controlling these systems toward desired outcomes.

The research study was designed as both exploratory and explanatory. Data were collected from secondary sources using a comprehensive literature review process. In parallel with data collection, data were analyzed and synthesized.

The main finding is the introduction of an inductive framework for steering supply chains from a complex systems perspective by explaining why supply chains have properties of complex systems and how to deal with their complexity while steering them toward desired outcomes. Complexity properties are summarized in four inter-dependent categories: Structural, Dynamic, Behavioral and Decision making, which together enable the assessment of supply chains as complex systems. Furthermore, five mechanisms emerged for dealing with the complexity of supply chains: classification, modeling, measurement, relational analysis and handling.

Recognizing that supply chains are complex systems allows for a better grasp of the effect of positive feedback on change and transformation, and also interactions leading to dynamic equilibria, nonlinearity and the role of inter-organizational learning, as well as emerging capabilities, and existing trade-offs and paradoxical tensions in decision-making. It recognizes changing dynamics and the co-evolution of supply chain phenomena in different scales and contexts.

Image segmentation is one of the most essential tasks in image processing applications. It is a valuable tool in many oriented applications such as health-care systems, pattern recognition, traffic control, surveillance systems, etc. However, an accurate segmentation is a critical task since finding a correct model that fits a different type of image processing application is a persistent problem. This paper develops a novel segmentation model that aims to be a unified model using any kind of image processing application. The proposed precise and parallel segmentation model (PPSM) combines the three benchmark distribution thresholding techniques to estimate an optimum threshold value that leads to optimum extraction of the segmented region: Gaussian, lognormal and gamma distributions. Moreover, a parallel boosting algorithm is proposed to improve the performance of the developed segmentation algorithm and minimize its computational cost. To evaluate the effectiveness of the proposed PPSM, different benchmark data sets for image segmentation are used such as Planet Hunters 2 (PH2), the International Skin Imaging Collaboration (ISIC), Microsoft Research in Cambridge (MSRC), the Berkley Segmentation Benchmark Data set (BSDS) and Common Objects in COntext (COCO). The obtained results indicate the efficacy of the proposed model in achieving high accuracy with significant processing time reduction compared to other segmentation models and using different types and fields of benchmarking data sets.

The proposed PPSM combines the three benchmark distribution thresholding techniques to estimate an optimum threshold value that leads to optimum extraction of the segmented region: Gaussian, lognormal and gamma distributions.

On the basis of the achieved results, it can be observed that the proposed PPSM–minimum cross-entropy thresholding (PPSM–MCET)-based segmentation model is a robust, accurate and highly consistent method with high-performance ability.

A novel hybrid segmentation model is constructed exploiting a combination of Gaussian, gamma and lognormal distributions using MCET. Moreover, and to provide an accurate and high-performance thresholding with minimum computational cost, the proposed PPSM uses a parallel processing method to minimize the computational effort in MCET computing. The proposed model might be used as a valuable tool in many oriented applications such as health-care systems, pattern recognition, traffic control, surveillance systems, etc.

This paper aims to review the studies on intersection control with connected and automated vehicles (CAVs).

The most seminal and recent research in this area is reviewed. This study specifically focuses on two categories: CAV trajectory planning and joint intersection and CAV control.

It is found that there is a lack of widely recognized benchmarks in this area, which hinders the validation and demonstration of new studies.

In this review, the authors focus on the methodological approaches taken to empower intersection control with CAVs. The authors hope the present review could shed light on the state-of-the-art methods, research gaps and future research directions.

This paper seeks to assess the performance levels of BA-GS-LSSVM compared to popular standalone algorithms used to build NO₂ prediction models. The purpose of this paper is to pre-process a relatively large data of NO₂ from Internet of Thing (IoT) sensors with time-corresponding weather and traffic data and to use the data to develop NO₂ prediction models using BA-GS-LSSVM and popular standalone algorithms to allow for a fair comparison.

This research installed and used data from 14 IoT emission sensors to develop machine learning predictive models for NO₂ pollution concentration. The authors used big data analytics infrastructure to retrieve the large volume of data collected in tens of seconds for over 5 months. Weather data from the UK meteorology department and traffic data from the department for transport were collected and merged for the corresponding time and location where the pollution sensors exist.

The results show that the hybrid BA-GS-LSSVM outperforms all other standalone machine learning predictive Model for NO₂ pollution.

This paper's hybrid model provides a basis for giving an informed decision on the NO₂ pollutant avoidance system.

This research installed and used data from 14 IoT emission sensors to develop machine learning predictive models for NO₂ pollution concentration.

Data service (DS) is a special software service that enables data access in cloud environment and provides a unified data model for cross-origination data integration and data sharing. The purpose of the work is to automatically compose DSs and quickly generate data view to satisfy users' various data requirements (DRs).

The paper proposes an automatic DS composition and view generation approach. DSs are organized into DS dependence graph (DSDG) based on their inherent dependences, and DSs can be automatically composed using the DSDG according to user's DRs. Then, data view will be generated by interpreting the composed DS.

Experimental results with real cross-origination data sets show the proposed approaches have high efficiency and good quality for DS composition and view generation.

The authors propose a DS composition algorithm and a data view generation algorithm according to users' DRs.