Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
3.7
2.3
Journals
Algorithms
Special Issues
Feature Papers in Algorithms for Multidisciplinary Applications
share announcement

Feature Papers in Algorithms for Multidisciplinary Applications

A special issue of Algorithms (ISSN 1999-4893).

Deadline for manuscript submissions: closed (15 April 2021) | Viewed by 5772

Special Issue Editor

Dr. Alberto Pinto

E-Mail Website
Guest Editor
Mathematics Department, Faculty of Sciences, University of Porto, Praça de Gomes Teixeira, 4099-002 Porto, Portugal
Interests: dynamics; game theory; applications of mathematics to biological and social sciences

Special Issue Information

Dear Colleagues,

This is a Special Issue for high-quality papers invited by the Guest Editors or those invited by the Editorial Office and Editorial Board Members. Papers will be published, free of charge, in open-access form after peer review.

Dr. Alberto Pinto
Guest Editor

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Published Papers (2 papers)

Download All Papers
Order results
Result details
Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:

Research

18 pages, 4430 KiB  
Article
Optimal Cooking Procedure Presentation System for Multiple Recipes and Investigating Its Effect
by Jin Nakabe, Teruhiro Mizumoto, Hirohiko Suwa and Keiichi Yasumoto
Algorithms 2021, 14(2), 67; https://doi.org/10.3390/a14020067 - 23 Feb 2021
Cited by 2 | Viewed by 3118
Abstract
As the number of users who cook their own food increases, there is increasing demand for an optimal cooking procedure for multiple dishes, but the optimal cooking procedure varies from user to user due to the difference of each user’s cooking skill and [...] Read more.
As the number of users who cook their own food increases, there is increasing demand for an optimal cooking procedure for multiple dishes, but the optimal cooking procedure varies from user to user due to the difference of each user’s cooking skill and environment. In this paper, we propose a system of presenting optimal cooking procedures that enables parallel cooking of multiple recipes. We formulate the problem of deciding optimal cooking procedures as a task scheduling problem by creating a task graph for each recipe. To reduce execution time, we propose two extensions to the preprocessing and bounding operation of PDF/IHS, a sequential optimization algorithm for the task scheduling problem, each taking into account the cooking characteristics. We confirmed that the proposed algorithm can reduce execution time by up to 44% compared to the base PDF/IHS, and increase execution time by about 900 times even when the number of required searches increases by 10,000 times. In addition, through the experiment with three recipes for 10 participants each, it was confirmed that by following the optimal cooking procedure for a certain menu, the actual cooking time was reduced by up to 13 min (14.8% of the time when users cooked freely) compared to the time when users cooked freely. Full article
(This article belongs to the Special Issue Feature Papers in Algorithms for Multidisciplinary Applications)
►▼ Show Figures

Figure 1

26 pages, 4942 KiB  
Article
Person Re-Identification across Data Distributions Based on General Purpose DNN Object Detector
by Roxana-Elena Mihaescu, Mihai Chindea, Constantin Paleologu, Serban Carata and Marian Ghenescu
Algorithms 2020, 13(12), 343; https://doi.org/10.3390/a13120343 - 15 Dec 2020
Cited by 7 | Viewed by 1938
Abstract
Solving the person re-identification problem involves making associations between the same person’s appearances across disjoint camera views. Further, those associations have to be made on multiple surveillance cameras in order to obtain a more efficient and powerful re-identification system. The re-identification problem becomes [...] Read more.
Solving the person re-identification problem involves making associations between the same person’s appearances across disjoint camera views. Further, those associations have to be made on multiple surveillance cameras in order to obtain a more efficient and powerful re-identification system. The re-identification problem becomes particularly challenging in very crowded areas. This mainly happens for two reasons. First, the visibility is reduced and occlusions of people can occur. Further, due to congestion, as the number of possible matches increases, the re-identification is becoming challenging to achieve. Additional challenges consist of variations of lightning, poses, or viewpoints, and the existence of noise and blurring effects. In this paper, we aim to generalize person re-identification by implementing a first attempt of a general system, which is robust in terms of distribution variations. Our method is based on the YOLO (You Only Look Once) model, which represents a general object detection system. The novelty of the proposed re-identification method consists of using a simple detection model, with minimal additional costs, but with results that are comparable with those of the other existing dedicated methods. Full article
(This article belongs to the Special Issue Feature Papers in Algorithms for Multidisciplinary Applications)
►▼ Show Figures

Figure 1

Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:
 
Displaying articles 1-2
Back to TopTop