Calculation of the least energy path on the energy hypersurface

1975 ◽  
Vol 40 (4) ◽  
pp. 1112-1118 ◽  
Author(s):  
J. Pancíř
Author(s):  
M. S. Mokiy ◽  
E. K. Borzenko

The article on the basis of extrapolation of system laws of management of social and economic development illustrates the system reason of the Cobra effect, that is, a situation where, despite the rather attractive goals that managers formulate, the result of the activities of subordinates is opposite to what was intended. The main problem of management is the development of a system of indicators, in which, working on the indicator, employees would change the state in the right direction. The reason for the Cobra effect is the manifestation of systemic patterns of socio-economic development. The main system regularity is the desire of the system for stability and self-preservation. This state of the system is achieved using the least energy-consuming way. It is shown that any worker, realizing system regularities, aspires to stability and self-preservation. Therefore, the employee is always forced to work for achieving the indicator. The article analyzes the manifestation of these laws at the level of enterprises and state. When managers understand these patterns explicitly or covertly, changes in the economic system are moving in the right direction. It is shown that the existing system of target indicators used as indicators to assess the effectiveness of management does not meet the goals and objectives of socio-economic development. At the meso- and macrolevel, absolute, volumetric indicators, such as gross national product and others, reduce the range of benefits to the population. The article defines the vector of change in the system of indicators for assessing the effectiveness of management at the regional and state levels, based on the fact that the key element is the family. At the same time, the targets should be indicators to assess the availability of benefits for households.


Author(s):  
Rekha Goyat ◽  
Mritunjay Kumar Rai ◽  
Gulshan Kumar ◽  
Hye-Jin Kim ◽  
Se-Jung Lim

Background: Wireless Sensor Networks (WSNs) is considered one of the key research area in the recent. Various applications of WSNs need geographic location of the sensor nodes. Objective: Localization in WSNs plays an important role because without knowledge of sensor nodes location the information is useless. Finding the accurate location is very crucial in Wireless Sensor Networks. The efficiency of any localization approach is decided on the basis of accuracy and localization error. In range-free localization approaches, the location of unknown nodes are computed by collecting the information such as minimum hop count, hop size information from neighbors nodes. Methods: Although various studied have been done for computing the location of nodes but still, it is an enduring research area. To mitigate the problems of existing algorithms, a range-free Improved Weighted Novel DV-Hop localization algorithm is proposed. Main motive of the proposed study is to reduced localization error with least energy consumption. Firstly, the location information of anchor nodes is broadcasted upto M hop to decrease the energy consumption. Further, a weight factor and correction factor are introduced which refine the hop size of anchor nodes. Results: The refined hop size is further utilized for localization to reduces localization error significantly. The simulation results of the proposed algorithm are compared with other existing algorithms for evaluating the effectiveness and the performance. The simulated results are evaluated in terms localization error and computational cost by considering different parameters such as node density, percentage of anchor nodes, transmission range, effect of sensing field and effect of M on localization error. Further statistical analysis is performed on simulated results to prove the validation of proposed algorithm. A paired T-test is applied on localization error and localization time. The results of T-test depicts that the proposed algorithm significantly improves the localization accuracy with least energy consumption as compared to other existing algorithms like DV-Hop, IWCDV-Hop, and IDV-Hop. Conclusion: From the simulated results, it is concluded that the proposed algorithm offers 36% accurate localization than traditional DV-Hop and 21 % than IDV-Hop and 13% than IWCDV-Hop.


2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Víctor Hernández-Santamaría ◽  
Alberto Saldaña

Abstract We study existence and convergence properties of least-energy symmetric solutions (l.e.s.s.) to the pure critical exponent problem ( - Δ ) s ⁢ u s = | u s | 2 s ⋆ - 2 ⁢ u s , u s ∈ D 0 s ⁢ ( Ω ) ,  2 s ⋆ := 2 ⁢ N N - 2 ⁢ s , (-\Delta)^{s}u_{s}=\lvert u_{s}\rvert^{2_{s}^{\star}-2}u_{s},\quad u_{s}\in D^% {s}_{0}(\Omega),\,2^{\star}_{s}:=\frac{2N}{N-2s}, where s is any positive number, Ω is either ℝ N {\mathbb{R}^{N}} or a smooth symmetric bounded domain, and D 0 s ⁢ ( Ω ) {D^{s}_{0}(\Omega)} is the homogeneous Sobolev space. Depending on the kind of symmetry considered, solutions can be sign-changing. We show that, up to a subsequence, a l.e.s.s. u s {u_{s}} converges to a l.e.s.s. u t {u_{t}} as s goes to any t > 0 {t>0} . In bounded domains, this convergence can be characterized in terms of an homogeneous fractional norm of order t - ε {t-\varepsilon} . A similar characterization is no longer possible in unbounded domains due to scaling invariance and an incompatibility with the functional spaces; to circumvent these difficulties, we use a suitable rescaling and characterize the convergence via cut-off functions. If t is an integer, then these results describe in a precise way the nonlocal-to-local transition. Finally, we also include a nonexistence result of nontrivial nonnegative solutions in a ball for any s > 1 {s>1} .


2015 ◽  
Vol 104 (6) ◽  
pp. 1075-1107 ◽  
Author(s):  
Denis Bonheure ◽  
Ederson Moreira dos Santos ◽  
Miguel Ramos ◽  
Hugo Tavares

Sign in / Sign up

Export Citation Format

Share Document