This paper examines the nonlinear connection between corporate governance (CG) and leverage. Our study applied dynamic panel threshold model (DPTM) to facilitate capture of effect CG on a firm’s leverage for Japanese listed companies. Additionally, our sought demonstrate linkage speed adjustment (SOA), particularly following reforms in Japan’s system, reach targeted level The empirical findings...

The Oriented FAST and Rotated BRIEF (ORB) algorithm has the problem that extracted feature points are overconcentrated or even overlapped, leading to information loss of local image features. A homogenized ORB using dynamic thresholds improved quadtree method is proposed in this paper, named Quadtree (QTORB). In point extraction stage, a new threshold calculation enhance algorithm’s ability ext...

the area of bargaining mechanisms has been well explored in both multi-agent systems and economics. in bargaining, participants raise/reduce their offers until an agreement is hopefully reached. in this dynamic environment, finding superior agreements without having the knowledge about the strategic private information of the counterpart is considerable. in this paper, we present a simple semi-...

In a threshold scheme, the sensitivity of the secret as well as the number of players may fluctuate due to various reasons, e.g., mutual trust may vary or the structure of the players’ organization might be changed. A possible solution to this problem is to modify the threshold and/or change the secret. Moreover, a common problem with almost all secret sharing schemes is that they are “one-time...

A family of models was given to explain how the public budgeting process, as a multi-stage institutional decision making mechanism transforms the stimuli characterized by Gaussian distribution to skew, power law distributions. While the annual change is generally incremental, deviations from this incremental changes are more frequent, than the Gaussian distribution suggests. A set of threshold ...

Dynamic Threshold Optimization (DTO) adaptively “compresses” the decision space (DS) in a global search and optimization problem by bounding the objective function from below. This approach is different from “shrinking” DS by reducing bounds on the decision variables. DTO is applied to Schwefel’s Problem 2.26 in 2 and 30 dimensions with good results. DTO is universally applicable, and the autho...