a new meta-heuristic method, based on neuronal communication (nc), is introduced in this article. the neuronal communication illustrates how data is exchanged between neurons in neural system. actually, this pattern works efficiently in the nature. the present paper shows it is the same to find the global minimum. in addition, since few numbers of neurons participate in each step of the method,...

Determining shape from stereo has often been posed as a global minimization problem. Once formulated, the minimization problems are then solved with a variety of algorithmic approaches. These approaches include techniques such as dynamic programming min-cut and alpha-expansion. In this paper we show how an algorithmic technique that constructs a discrete spatial minimal cost surface can be brou...

We propose a novel dynamic approach to forecast the weights of global minimum variance portfolio (GMVP) for conditional covariance matrix asset returns. The GMVP are population coefficients linear regression benchmark return on vector differences. This representation enables us derive consistent loss function from which we can infer without imposing any distributional assumptions In order captu...

Let $S= \{e_1,\,e_2‎, ‎\ldots,\,e_m\}$ be an ordered subset of edges of a connected graph $G$‎. ‎The edge $S$-representation of an edge set $M\subseteq E(G)$ with respect to $S$ is the‎ ‎vector $r_e(M|S) = (d_1,\,d_2,\ldots,\,d_m)$‎, ‎where $d_i=1$ if $e_i\in M$ and $d_i=0$‎ ‎otherwise‎, ‎for each $i\in\{1,\ldots‎ , ‎k\}$‎. ‎We say $S$ is a global forcing set for maximal matchings of $G$‎ ‎if $...

Seven years have passed since the BEPS Action Plan was launched by OECD, and 1 identified tax challenges derived from digitalization of economy as a relevant area to be addressed. However, no concrete recommendations were delivered and, in an increasingly digitized economy, countries started acting unilaterally. Against this situation, January 2019, stream work at OECD has changed apparently, n...

Let G = ( V, E ) be a simple graph. A non-empty set D ⊆ V is called global offensive alliance if dominating and for every vertex ν in − , | N [ν] ∩ |≥| |. The number the minimum cardinality of . In this paper, we give constructive characterization trees having unique alliance.