Search results for "Heuristic"

Social Network Banking : A Case Study of 100 Leading Global Banks

2018

Social media is widely recognized as a challenging new communication technology in both economic and social contexts. The present article explores how banks have exploited this technology in the range of consumer retail banking services offered by 100 leading global banks on the three major social networking sites (SNS): Facebook, Twitter, and YouTube. Viewing social network (SN) banking as a separate delivery channel and offering a working definition of SN banking, the article shows that banks have been more cautious than other businesses in using SNS. The available services are classified on nine main dimensions: marketing, financial education and advice, information support, customer sup…

A new heuristic algorithm for the analysis of NMRD dispersion curves

Regression analysis of the NMRD dispersion curves obtained by the FFC-NMR relaxometric technique involves several conceptual and practical issues, which must be carefully addressed in order to gain reliable information on the system studied. Indeed, particular caution is needed when the FFC technique is applied to the investigation of complex systems such as polymeric matrixes, porous materials, food samples, and so on. In these cases, and in general whenever a rigorous approach based on a suitable physical modelization of the system is not available, data analysis must be performed by means of a “model–free” approach. Moving forward from previous literature, in the present communication we…

An update to Hippocampome.org by integrating single-cell phenotypes with circuit function in vivo.

2021

Understanding brain operation demands linking basic behavioral traits to cell-type specific dynamics of different brain-wide subcircuits. This requires a system to classify the basic operational modes of neurons and circuits. Single-cell phenotyping of firing behavior during ongoing oscillations in vivo has provided a large body of evidence on entorhinal–hippocampal function, but data are dispersed and diverse. Here, we mined literature to search for information regarding the phase-timing dynamics of over 100 hippocampal/entorhinal neuron types defined in Hippocampome.org. We identified missing and unresolved pieces of knowledge (e.g., the preferred theta phase for a specific neuron type) a…

A Comparison between Heuristic, Statistical and Data-driven Methods in Landslide Susceptibility Assessment: an Application to the Briga and Giampilie…

2014

Susceptibility assessment concerning the estimation of areas prone to landslide is one of the most useful approach in the analysis of landslide hazard. Over the last years, in an attempt to find the best approach to evaluate landslide susceptibility, many methods have been developed. Among these, the heuristic, the statistical, and the data-driven approaches are very widespread, and they all are based on the concept that the conditions which led to landslide movements in the past will control the probability of movement occurrence in the future. This study presents an assessment of landslide susceptibility in which models of the three different methodologies, such as the heuristic approach,…

Some recent contributions to routing and location problems

2003

CORAL 2003, a Conference on Routing and Location, washeld in Puerto de la Cruz (Tenerife, Spain) from February24–26, 2003. A wonderful place, close to the black sand ofthe beach, and a nice temperature welcomed a group ofsenior and young researchers from Canada, England,France, Germany, and Spain. Social activities were alsoprovided and sponsored by the Cabildo Insular de Tenerife(the local government) and TITSA (the public bus transpor-tation company on the island). The conference corre-sponded to the third annual meeting of a research project,funded by the Spanish Ministry of Science and Technology,developing a Decision Support System for Vehicle Routingand Facility Location Problems (SAD…

Extracting Formal Models from Normative Texts

2016

Normative texts are documents based on the deontic notions of obligation, permission, and prohibition. Our goal is model such texts using the C-O Diagram formalism, making them amenable to formal analysis, in particular verifying that a text satisfies properties concerning causality of actions and timing constraints. We present an experimental, semi-automatic aid to bridge the gap between a normative text and its formal representation. Our approach uses dependency trees combined with our own rules and heuristics for extracting the relevant components. The resulting tabular data can then be converted into a C-O Diagram.

2020

Ensemble Planning for Digital Audio Broadcasting

2003

An Heuristic Approach for the Training Dataset Selection in Fingerprint Classification Tasks

2015

Fingerprint classification is a key issue in automatic fingerprint identification systems. It aims to reduce the item search time within the fingerprint database without affecting the accuracy rate. In this paper an heuristic approach using only the directional image information for the training dataset selection in fingerprint classification tasks is described. The method combines a Fuzzy C-Means clustering method and a Naive Bayes Classifier and it is composed of three modules: the first module builds the working datasets, the second module extracts the training images dataset and, finally, the third module classifies fingerprint images in four classes. Unlike literature approaches using …

Online Scheduling of Task Graphs on Heterogeneous Platforms

2020

Modern computing platforms commonly include accelerators. We target the problem of scheduling applications modeled as task graphs on hybrid platforms made of two types of resources, such as CPUs and GPUs. We consider that task graphs are uncovered dynamically, and that the scheduler has information only on the available tasks, i.e., tasks whose predecessors have all been completed. Each task can be processed by either a CPU or a GPU, and the corresponding processing times are known. Our study extends a previous $4\sqrt{m/k}$ 4 m / k -competitive online algorithm by Amaris et al. [1] , where $m$ m is the number of CPUs and $k$ k the number of GPUs ( $m\geq k$ m ≥ k ). We prove that no online…