Goran Martinović

Bio: Goran Martinović is an academic researcher from Josip Juraj Strossmayer University of Osijek. The author has contributed to research in topics: Scheduling (computing) & Wireless sensor network. The author has an hindex of 14, co-authored 121 publications receiving 676 citations.

Emotion Recognition System by a Neural Network Based Facial Expression Analysis

Abstract: Human-computer interfaces are getting more complex every day with the purpose of easing the use of computers and enhancing the overall user experience. Since research has shown that a majority of human interaction comes from non-verbal communication, user emotion detection is one of the directions that can be taken to enhance the overall user experience. This paper proposes a system for human emotion recognition by analyzing key facial regions using principal component analysis and neural networks. The proposed system has been trained and tested on the FEEDTUM database where it achieved a relatively high average score of correct recognition and therefore showed promise for future development.

Single-Commodity Vehicle Routing Problem with Pickup and Delivery Service

Abstract: We present a novel variation of the vehicle routing problem (VRP). Single commodity cargo with pickup and delivery service is considered. Customers are labeled as either cargo sink or cargo source, depending on their pickup or delivery demand. This problem is called a single commodity vehicle routing problem with pickup and delivery service (1-VRPPD). 1-VRPPD deals with multiple vehicles and is the same as the single-commodity traveling salesman problem (1-PDTSP) when the number of vehicles is equal to 1. Since 1-VRPPD specializes VRP, it is 𝒩𝒫 hard in the strong sense. Iterative modified simulated annealing (IMSA) is presented along with greedy random-based initial solution algorithm. IMSA provides a good approximation to the global optimum in a large search space. Experiment is done for the instances with different number of customers and their demands. With respect to average values of IMSA execution times, proposed method is appropriate for practical applications.

Greenhouse Microclimatic Environment Controlled by a Mobile Measuring Station

Abstract: This paper investigates a greenhouse microclimatic environment controlled by a mobile measuring station with the aim of improving performance by using wireless sensor networks (WSN) technology. The algorithms for the mobile measuring station that perform navigation tasks are called Bug algorithms. The existing potential field method based algorithms are improved with an RSSI signal propagation model and implemented on a two-wheel driven robot developing system and their performances are measured and analyzed. The implementation part is done on Boe-Bot equipped with SunSPOT enabling the wireless control ability. The control surface is generally made with LabVIEW and a relational database. Control strategy selection system is supported by Fuzzy Analytic Hierarchy Process (FAHP). Navigation of the mobile measuring robot can be done manually, relying on the visual data from the robot's camera, or it can be switched to automatic mode where the developed algorithm does the navigation job. Mobile robot navigation is based on the potential field method considering a wide range of energy-aware parameters.

A Population Initialization Method for Evolutionary Algorithms based on Clustering and Cauchy Deviates

Abstract: The initial population of an evolutionary algorithm is an important factor which affects the convergence rate and ultimately its ability to find high quality solutions or satisfactory solutions for that matter. If composed of good individuals it may bias the search towards promising regions of the search space right from the beginning. Although, if no knowledge about the problem at hand is available, the initial population is most often generated completely random, thus no such behavior can be expected. This paper proposes a method for initializing the population that attempts to identify i.e., to get close to promising parts of the search space and to generate (relatively) good solutions in their proximity. The method is based on clustering and a simple Cauchy mutation. The results obtained on a broad set of standard benchmark functions suggest that the proposed method succeeds in the aforementioned which is most noticeable as an increase in convergence rate compared to the usual initialization approach and a method from the literature. Also, insight into the usefulness of advanced initialization methods in higher-dimensional search spaces is provided, at least to some degree, by the results obtained on higher-dimensional problem instances—the proposed method is beneficial in such spaces as well. Moreover, results on several very high-dimensional problem instances suggest that the proposed method is able to provide a good starting position for the search.

I and i

Abstract: There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality. Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

The Health Insurance Portability and Accountability Act.

Abstract: The Health Insurance Portability and Accountability Act, also known as HIPAA, was first delivered to congress in 1996 and consisted of just two Titles. It was designed to protect health insurance coverage for workers and their families while between jobs. It establishes standards for electronic health care transactions and addresses the issues of privacy and security when dealing with Protected Health Information (PHI). HIPAA is applicable only in the United States of America.