scholarly journals Introducing an Educational Tool for Learning Branch & Bound Strategy

Author(s):  
Sofriesilero Zumaytis ◽  
Oscar Karnalim

Abstract—According to our informal survey, Branch & Bound strategy is considerably difficult to learn compared to other strategies. This strategy consists of several complex algorithmic steps such as Reduced Cost Matrix (RCM) calculation and Breadth First Search. Thus, to help students understanding this strategy, AP-BB, an educational tool for learning Branch & Bound is developed. This tool includes four modules which are Brute Force solving visualization, Branch & Bound solving visualization, RCM calculator, and case-based performance comparison. These modules are expected to enhance student’s understanding about Branch & Bound strategy and its characteristics. Furthermore, our work incorporates TSP as its case study and Brute Force strategy as a baseline to provide a concrete impact of Branch & Bound strategy. According to our qualitative evaluation, AP-BB and all of its features fulfil student necessities for learning Branch & Bound strategy. Keywords— Educational Tool; Branch & Bound; Algorithm Strategy; Algorithm Visualization

Author(s):  
Faried Effendy ◽  
Taufik ◽  
Bramantyo Adhilaksono

: Substantial research has been conducted to compare web servers or to compare databases, but very limited research combines the two. Node.js and Golang (Go) are popular platforms for both web and mobile application back-ends, whereas MySQL and Go are among the best open source databases with different characters. Using MySQL and MongoDB as databases, this study aims to compare the performance of Go and Node.js as web applications back-end regarding response time, CPU utilization, and memory usage. To simulate the actual web server workload, the flow of data traffic on the server follows the Poisson distribution. The result shows that the combination of Go and MySQL is superior in CPU utilization and memory usage, while the Node.js and MySQL combination is superior in response time.


Author(s):  
David Roy Anderson ◽  
Sarah Blissett ◽  
Patricia O’Sullivan ◽  
Atif Qasim

Abstract Background Trainees learn transthoracic echocardiogram (TTE) interpretation through independently completing and reviewing selected portions of the study with experts. The diagnostic accuracy of novice TTE interpretation is known to be low and schema for reading TTEs systematically are lacking. The purpose of our study is to identify techniques experts use while reading TTEs which could be used to more effectively teach novice readers. Methods We performed a prospective qualitative case study to observe how experts and trainees interpret TTEs in an academic institution using a concurrent think aloud (CTA) method. Three TTEs of intermediate complexity were given to 3 advanced imaging fellows, 3 first year fellows and 3 expert TTE readers Participants filled out a report while reading and described aloud their thought processes. Sessions were video and audiotaped for analysis. Results Experts and advanced fellows used specific techniques that novices did not including: previewing studies, reviewing multiple images simultaneously, having flexibility in image review order and disease coding, and saving hardest elements to code for the end. Direct observation of TTE reading informed trainee inefficiencies and was a well-received educational tool. Conclusions In this single centered study we identified several unique approaches experts use to interpret TTEs which may be teachable to novices. Although limited in generalizability the findings of this study suggests that a more systematic approach to TTE interpretation, using techniques found in experts, might be of significant value for trainees. Further study is needed to evaluate teaching practices at other institutions and to assess whether implementation of these techniques by novices improves can improve their diagnostic accuracy and efficiency of reading at an earlier stage in their training.


Minerals ◽  
2021 ◽  
Vol 11 (6) ◽  
pp. 582
Author(s):  
Magner Turner-Carrión ◽  
Paúl Carrión-Mero ◽  
Israel Turner-Salamea ◽  
Fernando Morante-Carballo ◽  
Maribel Aguilar-Aguilar ◽  
...  

The Zaruma-Portovelo mining district in Ecuador, and in particular, Portovelo City, is home to the oldest mining museum in the country. This museum, named Museo Mineralógico Magner Turner (MMMT in Spanish), is a centre that reflects, through its collections, the history and culture of this territory. This work aimed to evaluate the MMMT as a possible geosite by analysing its contributions to the geomining heritage of the Zaruma-Portovelo district, and thus, to enhance it and promote its collections as a geotouristic attraction. The work involved three phases: (i) describing the museum and its surroundings; (ii) a semiquantitative evaluation of the museum using the Brilha method and a geosites assessment model (GAM); and (iii) a qualitative evaluation using the Delphi and SWOT methodologies to define strategies and proposals for museum development. The results obtained by the semiquantitative evaluation of the geosite with the Brilha method reflect high scientific (330/400), educational (380/400) and touristic (365/400) appeal. The applied GAM shows the museum as a geosite with high principal and additional value, placing it in the Z33 field of the global valuation matrix. In addition, the semiquantitative and qualitative evaluation made it possible to describe the importance of the museum and its collections in the development of the area. The study carried out qualified the museum as a mining site with an appropriate valuation, an example of ex-situ geological heritage conservation and a basis for geotourism development.


2016 ◽  
Vol 45 (2) ◽  
pp. 233-252
Author(s):  
Pepijn Viaene ◽  
Alain De Wulf ◽  
Philippe De Maeyer

Landmarks are ideal wayfinding tools to guide a person from A to B as they allow fast reasoning and efficient communication. However, very few path-finding algorithms start from the availability of landmarks to generate a path. In this paper, which focuses on indoor wayfinding, a landmark-based path-finding algorithm is presented in which the endpoint partition is proposed as spatial model of the environment. In this model, the indoor environment is divided into convex sub-shapes, called e-spaces, that are stable with respect to the visual information provided by a person’s surroundings (e.g. walls, landmarks). The algorithm itself implements a breadth-first search on a graph in which mutually visible e-spaces suited for wayfinding are connected. The results of a case study, in which the calculated paths were compared with their corresponding shortest paths, show that the proposed algorithm is a valuable alternative for Dijkstra’s shortest path algorithm. It is able to calculate a path with a minimal amount of actions that are linked to landmarks, while the path length increase is comparable to the increase observed when applying other path algorithms that adhere to natural wayfinding behaviour. However, the practicability of the proposed algorithm is highly dependent on the availability of landmarks and on the spatial configuration of the building.


2020 ◽  
Vol 32 (2) ◽  
pp. 288-301
Author(s):  
Yan Yan ◽  
Mingkui Tan ◽  
Ivor W. Tsang ◽  
Yi Yang ◽  
Qinfeng Shi ◽  
...  

2020 ◽  
Vol 25 (2) ◽  
pp. 285-292
Author(s):  
Zhi Cao ◽  
Yunkai Huang ◽  
Baocheng Guo ◽  
Jianning Dong ◽  
Fei Peng

2021 ◽  
Vol 1 (2) ◽  
pp. 54-60
Author(s):  
Candra Irawan ◽  
Mudafiq Riyan Pratama

String matching is an algorithm for matching a text to another text or also known as a text search. There are several algorithms that can be used for string matching, including the Boyer-Moore algorithm and the Brute Force algorithm. The Boyer-Moore algorithm is a string matching algorithm published by Robert S. Boyer and J. Strother Moore in 1977. This algorithm is considered the most efficient algorithm in general applications. The Boyer-Moore algorithm starts matching characters from the pattern on the right. While the Brute Force algorithm is an algorithm that matches a pattern with all text between 0 and n-m to find the existence of a pattern in the text. These two algorithms have different patterns in the search process. In this article, a comparative analysis of the performance of the Boyer-Moore and Brute Force algorithms is carried out in a case study of the search for the Big Indonesian Dictionary (KBBI) based on Android. The search process is carried out by searching based on words and word descriptions. The results of this study indicate that the criteria for running time, the Brute Force algorithm is faster than the Boyer-Moore algorithm with the total running time of the Brute Force algorithm is 168.3 ms in words, 6994.16 ms in word descriptions, while the Boyer-Moore algorithm for running time reached 304.7 ms on the word, 8654.77 ms on the word description. In the testing criteria based on related keywords, the two algorithms can display the same list of related keywords.


2017 ◽  
Author(s):  
Mohammad Ali Kadivar ◽  
Adaner Usmani ◽  
Benjamin H. Bradlow

Over the last several decades, dozens of dictatorships have become democracies. Yet while each has held free and fair elections, they have varied in the extent to which their citizens realize the ideal of self-rule. Why do some democracies distribute power to citizens while other democracies withhold it? Existing research is suggestive, but its implications are ambiguous. Cross-national studies have focused on democracy’s formal dimensions, while work on substantive democracy is case-based. We find that one of the most consistent and powerful explanations of substantive democratization is the length of unarmed pro-democratic mobilization prior to a transition. Through a case study of Brazil, we illustrate that these movements matter in three ways: first, because practices of self-organizing model and enable democratic reforms; second, because movement veterans use state office to deepen democracy; and third, because long movements yield civil societies with the capacity to demand the continuous deepening of democracy.


Sign in / Sign up

Export Citation Format

Share Document