Search results for "Heuristic"
showing 10 items of 476 documents
Multiple Protein Sequence Alignment with MSAProbs
2013
Multiple sequence alignment (MSA) generally constitutes the foundation of many bioinformatics studies involving functional, structural, and evolutionary relationship analysis between sequences. As a result of the exponential computational complexity of the exact approach to producing optimal multiple alignments, the majority of state-of-the-art MSA algorithms are designed based on the progressive alignment heuristic. In this chapter, we outline MSAProbs, a parallelized MSA algorithm for protein sequences based on progressive alignment. To achieve high alignment accuracy, this algorithm employs a hybrid combination of a pair hidden Markov model and a partition function to calculate posterior…
Influence of Ad Congruence and Social Cues on the Probability of Choosing a Restaurant
2020
Abstract. Information processing of digital content includes conscious and un-conscious processes, memory, attitudes, and emotions and moods. Build up into the Heuristic‐Systematic Model, that states that persuasion can occur through a systematic or heuristic way, this research explores the effect of social media (SM) ratings and the ad content embedded in the SM website. Online ratings (part of the user-generated content (UGC) in SM platforms) are often heuristics cues. Subtle forms of congruence, such as the matching category between a restaurant advertiser and the third-party ad, as well as UGC, could have an impact on con-sumers’ attitudes towards the former. However, research on …
Quasidisks and string theory
1990
Abstract A heuristic model of non-perturbative bosonic string theory on the Bers universal Teichmuller space of normalized quasidisks is discussed. It is suggested that the infinite-dimensional analogue of the Polyakov energy might be the quasidisk area.
A Comparative Study on Feature Selection for Retinal Vessel Segmentation Using FABC
2009
This paper presents a comparative study on five feature selection heuristics applied to a retinal image database called DRIVE. Features are chosen from a feature vector (encoding local information, but as well information from structures and shapes available in the image) constructed for each pixel in the field of view (FOV) of the image. After selecting the most discriminatory features, an AdaBoost classifier is applied for training. The results of classifications are used to compare the effectiveness of the five feature selection methods.
Usability of Programming Languages
2016
Programming languages form the interface between programmers (the users) and the computation that they desire the computer to execute. Although studies exist for some aspects of programming language design (such as conditionals), other aspects have received little or no human factors evaluations. Designers thus have little they can rely on if they want to make new languages highly usable, and users cannot easily chose a language based on usability criteria. This SIG will bring together researchers and practitioners interested in increasing the depth and breadth of studies on the usability of programming languages, and ultimately in improving the usability of future languages. nonPeerReviewed
Usability challenges in digital learning solutions
2015
Usability is a key element in successful software. Ensuring the technical usability of a learning solution enables users to focus on their main task, learning. The purpose of this paper is to demonstrate the results of heuristic usability evaluations of digital learning solutions. Heuristic evaluations were conducted on 24 digital learning solutions from one country (Finland) and two country groups (Asian countries and Spanish speaking countries) concentrating on the usability of the user interface of each evaluated solution. The main results of this study indicate that a few heuristics cover the majority of all usability problems (UPs) observed in learning solutions, but these heuristics c…
An empirical approach for evaluating the usability of model-driven tools
2013
MDD tools are very useful to draw conceptual models and to automate code generation. Even though this would bring many benefits, wide adoption of MDD tools is not yet a reality. Various research activities are being undertaken to find why and to provide the required solutions. However, insufficient research has been done on a key factor for the acceptance of MDD tools: usability. With the help of end-users, this paper presents a framework to evaluate the usability of MDD tools. The framework will be used as a basis for a family of experiments to get clear insights into the barriers to usability that prevent MDD tools from being widely adopted in industry. To illustrate the applicability of …
The impact of landfills on the air quality of towns: A simple heuristic model for the city of Palermo
2009
In this study, the landfill of Palermo, is investigated as a potential source of the unusual methane concentrations found in the urban context. The source for these pollution episodes is identified by means of a simple heuristic method. A cross-correlation analysis between wind data and methane concentration levels is also used to confirm the hypotheses formulated. Doppler Sound Detection And Ranging (SODAR) measurements are used to investigate the air masses dynamics at the landfill, in order to better support the adopted assumptions. This interpretative method can be adopted in the first assessment stages of the environmental site performance in order to single out the candidate pollution…
Brief communication: Vehicle routing problem and UAV application in the post-earthquake scenario
2017
Abstract. In this paper we simulate a Unmanned Aerial Vehicle's (UAV) recognition after a possible case of diffuse damage after a seismic event in the town of Acireale (Sicily, Italy). Given a set of sites (84 relevant buildings) and the range of the UAV, we are able to find the number of vehicles to employ and the shortest survey path. The problem of finding the shortest survey path is an operational research problem called Vehicle Routing Problem (VRP) whose solution is known to be computationally time-consuming. We used the Simulated Annealing (SA) heuristic that is able to provide stable solutions in relatively short computing time. We also examined the distribution of the cost of the s…
New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem
2011
[EN] The min-max windy rural postman problem is a multiple vehicle version of the windy rural postman problem, WRPP, which consists of minimizing the length of the longest route to find a set of balanced routes for the vehicles. In a previous paper, an ILP formulation and a partial polyhedral study were presented, and a preliminary branch-and-cut algorithm that produced some promising computational results was implemented. In this article, we present further results for this problem. We describe several new facet-inducing inequalities obtained from the WRPP, as well as some inequalities that have to be satisfied by any optimal solution. We present an enhanced branch-and-cut algorithm that t…