Abstract

Emotions in workplace is a topic that has increasingly at
tracted attention of both organizational practitioners and academics. This is due to the fundamental role emotions play in shaping human resources behaviors, performance, productivity, interpersonal relationships and engagement at work. In the current research, a computational social simulation approach is adopted to replicate and study the emotional experiences of employees in organizations. More speci cally, an emotional
agent-based model of an employee at work is proposed. The developed model is used in a computer simulator WEMOS (Workers EMotions in Organizations Simulator) to conduct certain analyzes in relation to the most likely emotions-evoking stimuli as well as the emotional content of several work-related stimuli. Simulation results can be employed to gain deeper understanding about emotions in the work life.

Abstract

Decomposition-based evolutionary algorithms using predefined reference points have shown good performance in many-objective optimization. Unfortunately, almost all experimental studies have focused on problems having regular Pareto fronts (PFs). Recently, it has been shown that the performance of such algorithms is deteriorated when facing irregular PFs, such as degenerate, discontinuous, inverted, strongly convex, and/or strongly concave fronts. The main issue is that the predefined reference points may not all intersect with the PF. Therefore, many researchers have proposed to update the reference points with the aim of adapting them to the discovered Pareto shape. Unfortunately, the adaptive update does not really solve the issue for two main reasons. On the one hand, there is a considerable difficulty to set the time and the frequency of updates. On the other hand, it is not easy to define how to update the search directions for an unknown PF shape. This article proposes to approximate irregular PFs using a set of predefined normal-boundary intersection (NBI) directions. The main motivation behind this article is that when using a set of well-distributed NBI directions, all these directions intersect with the PF regardless of its shape, except for the case of discontinuous and/or degenerate fronts. To handle the latter cases, a simple interaction mechanism between the decision maker (DM) and the algorithm is used. In fact, the DM is asked if the number of NBI directions needs to be increased in some stages of the evolutionary process. If so, the resolution of the NBI directions that intersect the PF is increased to properly cover discontinuous and/or degenerate PFs. Our experimental results on benchmark problems with regular and irregular PFs, having up to fifteen objectives, show the merits of our algorithm when compared to eight of the most representative state-of-the-art algorithms.

Abstract

Abstract

Deep Convolutional Neural Network (DCNN) is considered as a popular and powerful deep learning algorithm in image classification. However, there are not many DCNN applications used in medical imaging, because large dataset for medical images is not always available. In this paper, we present two DCNN architectures, a shallow DCNN and a pre-trained DCNN model: AlexNet, to detect breast cancer from 8000 mammographic images extracted from the Digital Database for Screening Mammography. In order to validate the performance of DCNN in breast cancer detection using a big data , we carried out a comparative study with a second deep learning algorithm Stacked AutoEncoders (SAE) in terms accuracy, sensitivity and specificity. The DCNN method achieved the best results with 89.23% of accuracy, 91.11% of sensitivity and 87.75% of specificity.

Abstract

Road crashes are present as an epidemic in road traffic and continue to grow up, where, according to World Health Organization; they cause more than 1.24 million deaths each year and 20 to 50 million non-fatal injuries, so they should represent by 2020 the third leading global cause of illness and injury. In this context, we are interested in this paper to the car-following driving behavior problem, since it alone accounts for almost 70% of road accidents, which they are caused by the incorrect judgment of the driver to keep a safe distance. Thus, we propose in this paper a decision-making model based on bi-level modeling, whose objective is to ensure the integration between road safety and the reducing travel time. To ensure this objective, we used the fuzzy logic approach to model the anticipation concept in order to extract more unobservable data from the road environment. Furthermore, we used the fuzzy logic approach in order to model the driver behaviors, in particular, the normative behaviors. The experimental results indicate that the decision to increase in velocity based on our model is ensured in the context of respecting the road safety.

Abstract

Feature selection and construction are important
pre-processing techniques in machine learning and data mining.
They may allow not only dimensionality reduction but also
classifier accuracy and efficiency improvement. Feature selection
aims at selecting relevant features from the original feature set,
which could be less informative to achieve good performance.
Feature construction may work well as it creates new highlevel features, but these features do not have the same degree
of importance, which makes the use of weighted-features construction a very challenging topic. In this paper, we propose a
bi-level evolutionary approach for efficient feature selection and
simultaneous feature construction and feature weighting, called
Bi-level Weighted-Features Construction (BWFC). The basic idea
of our BWFC is to exploit the bi-level model for performing
feature selection and weighted-features construction with the
aim of finding an optimal subset of features combinations. Our
approach has been assessed on six high-dimensional datasets and
compared against three existing approaches, using three different
classifiers for accuracy evaluation. Experimental results show
that our proposed algorithm gives competitive and better results
with respect to the state-of-the-art algorithms