scholarly journals FAST COMPUTATION OF ALL PAIRS OF GEODESIC DISTANCES

2011 ◽  
Vol 30 (2) ◽  
pp. 101 ◽  
Author(s):  
Guillaume Noyel ◽  
Jesús Angulo ◽  
Dominique Jeulin

Computing an array of all pairs of geodesic distances between the pixels of an image is time consuming. In the sequel, we introduce new methods exploiting the redundancy of geodesic propagations and compare them to an existing one. We show that our method in which the source point of geodesic propagations is chosen according to its minimum number of distances to the other points, improves the previous method up to 32 % and the naive method up to 50 % in terms of reduction of the number of operations.

2014 ◽  
Vol 2014 ◽  
pp. 1-8
Author(s):  
Feng-Gong Lang ◽  
Xiao-Ping Xu

We mainly present the error analysis for two new cubic spline based methods; one is a lacunary interpolation method and the other is a very simple quasi interpolation method. The new methods are able to reconstruct a function and its first two derivatives from noisy function data. The explicit error bounds for the methods are given and proved. Numerical tests and comparisons are performed. Numerical results verify the efficiency of our methods.


1994 ◽  
Vol 78 (3) ◽  
pp. 1027-1034 ◽  
Author(s):  
Frank N. Willis ◽  
Vicki A. Rawdon

Women have been reported to be more positive about same-gender touch, but cross-cultural information about this touch is limited. Male and female students from Chile (n = 26), Spain (n = 61), Malaysia (n = 32), and the US (n = 77) completed a same-gender touch scale. As in past studies, US women had more positive scores than US men. Malaysians had more negative scores than the other three groups. Spanish and US students had more positive scores than Chilean students. National differences in attitudes toward particular types of touch were also noted. The need for new methods for examining cross-cultural differences in touch was discussed.


2021 ◽  
Vol 45 ◽  
Author(s):  
Tarcísio Marcos Macedo Mota Filho ◽  
Luis Eduardo Pontes Stefanelli ◽  
Roberto da Silva Camargo ◽  
Carlos Alberto Oliveira de Matos ◽  
Luiz Carlos Forti

ABSTRACT Chemical control using toxic baits containing the active ingredient sulfluramid at 0.3% (w/w) is the main method for controlling leaf-cutting ants of the genera Atta and Acromyrmex. However, since 2009, when sulfluramid was included in Annex B of the Stockholm Convention on Persistent Organic Pollutants, there has been an intense search for new methods that are efficient in controlling these insects. Among said new methods, biological control using pathogenic fungi has shown promising results in laboratory conditions. The objective of this study, given the context presented, was to assess the potential of the fungi Beauveria bassiana and Trichoderma harzianum in controlling Atta sexdens. Colonies of A. sexdens were exposed to the fungi by means of formulated baits provided in a foraging chamber, or of suspensions sprayed on the fungus garden, and had their behavioral changes recorded for 21 days. For both formulations, concentrations of 10 and 20% (w/w) of the fungi being studied were used. The results allowed concluding that baits containing 10 and 20% (w/w) of the fungi B. bassiana and T. harzianum were not efficient in controlling colonies of A sexdens. On the other hand, spraying suspensions of 20% (w/w) of B. bassiana and 10% and 20% (w/w) of T. harzianum was efficient and resulted in 100% mortality of the colonies 11, 9 and 7 days after application, respectively. These findings indicate that the fungi B. bassiana and T. harzianum are promising as agents for the control of A. sexdens colonies, when sprayed on the fungus garden, although there are still some challenges as to their use related to the development of technologies for the application of the pathogen.


2021 ◽  
Vol 38 (1) ◽  
pp. 149-158
Author(s):  
MIRCEA MERCA ◽  

In 1963, Peter Hagis, Jr. provided a Hardy-Ramanujan-Rademacher-type convergent series that can be used to compute an isolated value of the partition function $Q(n)$ which counts partitions of $n$ into distinct parts. Computing $Q(n)$ by this method requires arithmetic with very high-precision approximate real numbers and it is complicated. In this paper, we investigate new connections between partitions into distinct parts and overpartitions and obtain a surprising recurrence relation for the number of partitions of $n$ into distinct parts. By particularization of this relation, we derive two different linear recurrence relations for the partition function $Q(n)$. One of them involves the thrice square numbers and the other involves the generalized octagonal numbers. The recurrence relation involving the thrice square numbers provide a simple and fast computation of the value of $Q(n)$. This method uses only (large) integer arithmetic and it is simpler to program. Infinite families of linear inequalities involving partitions into distinct parts and overpartitions are introduced in this context.


2013 ◽  
Vol 694-697 ◽  
pp. 2291-2294
Author(s):  
Xiao Bo Yang ◽  
Bang Ze Chen

By using object oriented method design graph vertices into class, and in this foundation to increase visual member, realize from the source point to the other vertex of the shortest path algorithm of dynamic visualization. Around the two sync window animation, the left window with thick lines drawn through the vertices and edges, " revealed the source point to the other vertex of the shortest path " list box display shortest path sequence and path length, the right window demonstration algorithm dynamic implementation process, and in the " S " text box to display the current most find shortest path vertices. The system has friendly interface, visual image.


2022 ◽  
pp. 832-845
Author(s):  
Annesha Biswas ◽  
Tinanjali Dam ◽  
Joseph Varghese Kureethara ◽  
Sankar Varma

In today's world, the concept of the game and game theory is turned into new methods of knowing and understanding some of the human behaviours followed by society. In the 21st century, behavioural economics plays a major role in understanding the concept of the `line' game and hence the strategies followed by it. It is a country game played in many parts of India. It is a two-person game with very simple rules and moves. It can be played indoors. Students play the game during the break-outs. The game keenly and minutely determines the objectivity of the game and the behaviour of the players involved inside the game and the way one starts moving helps the other players to understand what one is trying to portray through the game whether it is winning or losing. The strategies involved can be put forth and looked upon from different perspectives. Referring to one such perspective, it can be looked at from a concept of Pareto efficiency, a microeconomic concept. It helps develop logical skills and learn winning strategies.


2013 ◽  
Vol 1 (1) ◽  
pp. 14-25 ◽  
Author(s):  
Tsuyoshi Miyazaki ◽  
Toyoshiro Nakashima ◽  
Naohiro Ishii

The authors describe an improved method for detecting distinctive mouth shapes in Japanese utterance image sequences. Their previous method uses template matching. Two types of mouth shapes are formed when a Japanese phone is pronounced: one at the beginning of the utterance (the beginning mouth shape, BeMS) and the other at the end (the ending mouth shape, EMS). The authors’ previous method could detect mouth shapes, but it misdetected some shapes because the time period in which the BeMS was formed was short. Therefore, they predicted that a high-speed camera would be able to capture the BeMS with higher accuracy. Experiments showed that the BeMS could be captured; however, the authors faced another problem. Deformed mouth shapes that appeared in the transition from one shape to another were detected as the BeMS. This study describes the use of optical flow to prevent the detection of such mouth shapes. The time period in which the mouth shape is deformed is detected using optical flow, and the mouth shape during this time is ignored. The authors propose an improved method of detecting the BeMS and EMS in Japanese utterance image sequences by using template matching and optical flow.


Author(s):  
Hibiki Ono ◽  
Yoshifumi Manabe

Abstract This paper proposes new card-based cryptographic protocols to calculate logic functions with the minimum number of cards using private operations under the semi-honest model. Though various card-based cryptographic protocols were shown, the minimum number of cards used in the protocol has not been achieved yet for many problems. Operations executed by a player where the other players cannot see are called private operations. Private operations have been introduced in some protocols to solve a particular problem or to input private values. However, the effectiveness of introducing private operations to the calculation of general logic functions has not been considered. This paper introduces three new private operations: private random bisection cuts, private reverse cuts, and private reveals. With these three new operations, we show that all of AND, XOR, and copy protocols are achieved with the minimum number of cards by simple three-round protocols. This paper then shows a protocol to calculate any logical functions using these private operations. Next, we consider protocols with malicious players.


2020 ◽  
Vol 36 (2) ◽  
pp. 149-156
Author(s):  
Hero Khezri ◽  
Peyman Rezaei-Hachesu ◽  
Reza Ferdousi

Purpose Nowadays, there is a rapid growth in different sciences that has led to thousands of publications in the form of scientific research papers. The readers of these papers are generally the people that are involved in science (i.e. researchers, students, teachers and professors). On the other hand, practitioners rarely use these articles as a resource to learn and apply new methods. They prefer an easy to understand, step-by-step guide (i.e. cookbook) helping them skip over the difficult scientific terms and structures. Therefore, because of a shortage of tools in this space, it takes practitioners many years to use newly developed methods. Design/methodology/approach The purpose of this study is to review the literature on verified repositories and presents the necessity of method repositories. Findings This paper aims to introduce method repositories as new tools to bridge the gap between science and practice. Originality/value Method repositories presented in this paper act as an easy to understand guide for newly developed methods in specific fields.


Author(s):  
James Wiegold ◽  
H. Lausch

AbstractThe growth sequence of a finite semigroup S is the sequence {d(Sn)}, where Sn is the nth direct power of S and d stands for minimum generating number. When S has an identity, d(Sn) = d(Tn) + kn for all n, where T is the group of units and k is the minimum number of generators of S mod T. Thus d(Sn) is essentially known since d(Tn) is (see reference 4), and indeed d(Sn) is then eventually piecewise linear. On the other hand, if S has no identity, there exists a real number c > 1 such that d(Sn) ≥ cn for all n ≥ 2.


Sign in / Sign up

Export Citation Format

Share Document