Search results

Increasing carbon productivity is an effective way to reduce carbon emissions, while boosting economic prosperity. For appropriate formulating and enforcement of energy saving and carbon emissions reduction policies in various sectors, it is of great significance to investigate the evolution characteristics and convergence modes of carbon productivity across the manufacturing sectors.

Using slack-based measure directional distance function (SBM-DDF) and global Malmquist–Luenberger (GML) productivity index, this paper measures the carbon productivities of 29 manufacturing subsectors in Shanghai, China, from 2001 to 2016 under the total factor framework. Furthermore, based on the convergence theories, it empirically examines the convergence of carbon productivity across these manufacturing sectors.

The measurement results suggest that the carbon productivities of the manufacturing sectors in Shanghai show an increasing tendency on the whole, and technical efficiency instead of technological change makes a main contribution to the increase. It is found that there is no obvious σ convergence across the manufacturing sectors in Shanghai, but there exist both absolute ß convergence and conditional ß convergence. Moreover, there is heterogeneity in convergence characteristics between the clean sectors and polluting sectors. The findings also show that firm size and industry structure have significant positive impacts on the growth of carbon productivities of the manufacturing sectors, whereas the impacts of capital deepening and energy consumption structure are significantly negative.

This paper measures the carbon productivities of the manufacturing subsectors by applying SBM-DDF and GML index, so as to improve the accuracy. It provides an insight into the convergence of carbon productivity across the manufacturing sectors.

The purpose of this paper is to introduce instruction of technical analysis on the undergraduate level that can coincide with traditional teachings of fundamental analysis.

Through examples using the latest in security analysis technology, this paper illustrates the importance of technical security analysis.

This research illustrates how technical analysis techniques may be used to make more significant investment decisions.

Kirkpatrick and Dahlquist define technical analysis as a security analysis discipline for forecasting future direction of prices through the study of past market data primarily price and volume This form of analysis has stood in direct contrast to the fundamental analysis approach whereby actual facts of the company its industry and sector may be ignored. Understanding this contrast, much of academia has chosen to continue to focus its finance curricula on fundamental analysis techniques. As more universities implement trading rooms to reflect that of industry, they must recognize that any large brokerage trading group or financial institution will typically have both a technical analysis and fundamental analysis team. Thus, the need to incorporate technical analysis into undergraduate finance curricula.

In this paper, we present a new hybrid binary version of bat and enhanced particle swarm optimization algorithm in order to solve feature selection problems. The proposed algorithm is called Hybrid Binary Bat Enhanced Particle Swarm Optimization Algorithm (HBBEPSO). In the proposed HBBEPSO algorithm, we combine the bat algorithm with its capacity for echolocation helping explore the feature space and enhanced version of the particle swarm optimization with its ability to converge to the best global solution in the search space. In order to investigate the general performance of the proposed HBBEPSO algorithm, the proposed algorithm is compared with the original optimizers and other optimizers that have been used for feature selection in the past. A set of assessment indicators are used to evaluate and compare the different optimizers over 20 standard data sets obtained from the UCI repository. Results prove the ability of the proposed HBBEPSO algorithm to search the feature space for optimal feature combinations.

The main motivation of this paper is to present  the Yosida approximation of a semi-linear backward stochastic differential equation in infinite dimension. Under suitable assumption and condition, an L²-convergence rate is established.

The authors establish a result concerning the L²-convergence rate of the solution of backward stochastic differential equation with jumps with respect to the Yosida approximation.

The authors carry out a convergence rate of Yosida approximation to the semi-linear backward stochastic differential equation in infinite dimension.

In this paper, the authors present the Yosida approximation of a semi-linear backward stochastic differential equation in infinite dimension. Under suitable assumption and condition, an L²-convergence rate is established.

The purpose of this paper is to study large deviations for the solution processes of a stochastic equation incorporated with the effects of nonlocal condition.

A weak convergence approach is adopted to establish the Laplace principle, which is same as the large deviation principle in a Polish space. The sufficient condition for any family of solutions to satisfy the Laplace principle formulated by Budhiraja and Dupuis is used in this work.

Freidlin–Wentzell type large deviation principle holds good for the solution processes of the stochastic functional integral equation with nonlocal condition.

The asymptotic exponential decay rate of the solution processes of the considered equation towards its deterministic counterpart can be estimated using the established results.

The volumes of international containerized trade substantially increased over the past years. In the meantime, marine container terminal (MCT) operators are facing congestion issues at their terminals because of the increasing number of large-size vessels, the lack of innovative technologies and advanced handling equipment and the inability of proper scheduling of the available resources. This study aims to propose a novel memetic algorithm with a deterministic parameter control to facilitate the berth scheduling at MCTs and minimize the total vessel service cost.

A local search heuristic, which is based on the first-come-first-served policy, is applied at the chromosomes and population initialization stage within the developed memetic algorithm (MA). The deterministic parameter control strategy is implemented for a custom mutation operator, which alters the mutation rate values based on the piecewise function throughout the evolution of the algorithm. Performance of the proposed MA is compared with that of the alternative solution algorithms widely used in the berth scheduling literature, including a MA that does not apply the deterministic parameter control strategy, typical evolutionary algorithm, simulated annealing and variable neighborhood search.

Results demonstrate that the developed MA with a deterministic parameter control can obtain superior berth schedules in terms of the total vessel service cost within a reasonable computational time. Furthermore, greater cost savings are observed for the cases with high demand and low berthing capacity at the terminal. A comprehensive analysis of the convergence patterns indicates that introduction of the custom mutation operator with a deterministic control for the mutation rate value would provide more efficient exploration and exploitation of the search space.

This study does not account for uncertainty in vessel arrivals. Furthermore, potential changes in the vessel handling times owing to terminal disruptions are not captured.

The developed solution algorithm can serve as an efficient planning tool for MCT operators and assist with efficient berth scheduling for both discrete and continuous berthing layout cases.

The majority of studies on berth scheduling rely on the stochastic search algorithms without considering the specific problem properties and applying the guided search heuristics. Unlike canonical evolutionary algorithms, the developed algorithm uses a local search heuristic for the chromosomes and population initialization and adjusts the mutation rate values based on a deterministic parameter control strategy for more efficient exploration and exploitation of the search space.

This paper investigates the development of efficiency and the progress of banking integration in the European Union by checking for convergence among banks of European and Eurozone countries as well as contrasting the results with those of United States banks.

Initially, we employ the two-stage semi-parametric double bootstrap DEA method, which absorbs the effects of possible integration barriers in the measurement of efficiency. Afterwards, we apply a panel data model, in order to investigate the process of banking integration by testing for convergence and for convergent clusters in banking efficiency.

Our main findings show that the bank efficiency of the US is considerably higher than that of the Eurozone and the European Union. Although there is no evidence of convergence across the banking groups, our results indicate the presence of club convergence. We also conclude that the US banking system is closer to convergence than the Eurozone and the European Union banks. Nevertheless, this outcome is subject to change in the future due to the fact that Eurozone and European Union banks' speed of convergence is higher than that of US banks.

Our survey is unique in trying to check for convergence while controlling for country-specific and bank-specific factors that affect the efficiency of European and Eurozone banks. Moreover, recent literature does not compare the convergence of efficiency of Eurozone, European and US banking. Finally, in our paper special consideration was given to the comparison of commercial, cooperative and savings banks, as subsets of our banking groups.