Search

Este artículo examina cómo los valores patriarcales afectan a las mujeres trabajadoras en la sociedad japonesa, específicamente a las mujeres en los negocios y en la política. Este documento se basa en los trabajos de autores anteriores que se centran en el papel de la mujer trabajadora en el Japón moderno para establecer el "punto final" de esta investigación. El presente documento también incluye el contexto histórico a partir del cual se originaron las normas patriarcales tradicionales. Además, examina el desarrollo y la influencia de estos valores en las siguientes etapas de la vida de las mujeres: el matrimonio, la maternidad y la participación en la fuerza laboral. Para concluir, este documento proporciona una idea de cómo el matrimonio y la maternidad a menudo actúan como elementos disuasivos y obstáculos para la participación de las mujeres en los negocios y la política.

The set of perceptions held by various groups based on history and expectations constitutes the reputation of organizations. There are multiple correct measurements of reputation since no general definition of the concept has been reached. ORM (Online Reputation Monitoring-management) systems oversee this measurement and have a sentiment analysis component to perform this task. The literature presents different frameworks or methodologies for measurement developed by academia and industry. These proposals’ common objective is to measure online reputation based on the opinions expressed by individuals close to the organization. In the absence of an automatic ORM system, it is necessary to perform this task manually within a company by a person; this can generate operational errors, delay processes, and make scalability impossible to increase the number of items reviewed (news, comments). These drawbacks can be mitigated by automating the measurement of a client’s online reputation. This paper contains the development of three methodologies from the literature to explore online reputation measurement starting from Twitter and Google News information sources. The implementation results conclude that the POS-Tagger elimination methodology generates the best result compared to the coded methodologies.

The EEG has showed that contains relevant information about recognition of emotional states. It is important to analyze the EEG signals to understand the emotional states not only from a time series approach but also determining the importance of the generating process of these signals, the location of electrodes and the relationship between the EEG signals. From the EEG signals of each emotional state, a functional connectivity measurement was used to construct adjacency matrices: lagged phase synchronization (LPS), averaging adjacency matrices we built a prototype network for each emotion. Based on these networks, we extracted a set node features seeking to understand their behavior and the relationship between them. We found through the strength and degree, the group of representative electrodes for each emotional state, finding differences from intensity of measurement and the spatial location of these electrodes. In addition, analyzing the cluster coefficient, degree, and strength, we find differences between the networks from the spatial patterns associated with the electrodes with the highest coefficient. This analysis can also gain evidence from the connectivity elements shared between emotional states, allowing to cluster emotions and concluding about the relationship of emotions from EEG perspective.

This paper addresses the cerebral cortex maps construction from EEG signals getting an information simplification method for an emotional state phenomenon description. Bi-dimensional density distribution of main signal features are identified and a comparison to a previous approach is presented. Feature extraction scheme is performed via windowed EEG signals Stationary Wavelet Transform with the Daubechies Family (1–10); nine temporal and spectral descriptors are computed from the decomposed signal. Recursive feature selection method based on training a Random forest classifier using a one-vs-all scheme with the full features space, then a ranking procedure via gini importance, eliminating the bottom features and restarting the entire process over the new subset. Stopping criteria is the maximum accuracy. The main contribution is the analysis of the resulting subset features as a proxy for cerebral cortex maps looking for the cognitive processes understanding from surface signals. Identifying the common location of different emotional states in the central and frontal lobes, allowing to be strong parietal and temporal lobes differentiators for different emotions.

Unsupervised learning methods are commonly used to perform the non-trivial task of uncovering structure in biological data. However, conventional approaches rely on methods that make assumptions about data distribution and reduce the dimensionality of the input data. Here we propose the incorporation of entropy related measures into the process of constructing graph-based representations for biological datasets in order to uncover their inner structure. Experimental results demonstrated the potential of the proposed entropy-based graph data representation to cope with biological applications related to unsupervised learning problems, such as metagenomic binning and neuronal spike sorting, in which it is necessary to organize data into unknown and meaningful groups.

Visualizing the cluster structure of high-dimensional data is a non-trivial task that must be able to deal with the large dimensionality of the input data. Unlike hard clustering structures, visualization of fuzzy clusterings is not as straightforward because soft clustering algorithms yield more complex clustering structures. Here is introduced the concept of membership networks, an undirected weighted network constructed based on the fuzzy partition matrix that represents a fuzzy clustering. This simple network-based method allows understanding visually how elements involved in this kind of complex data clustering structures interact with each other, without relying on a visualization of the input data themselves. Experiment results demonstrated the usefulness of the proposed method for the exploration and analysis of clustering structures on the Iris flower data set and two large and unlabeled financial datasets, which describes the financial profile of customers of a local bank.

Uncovering interesting groups in either multidimensional or network spaces has become an essential mechanism for data exploration and understanding. Decision making requires relevant information as well as high-quality on the retrieved conclusions. We presented a comparative study of two compact representations drawn from the same set of data objects by clustering high-dimensional spaces and low-dimensional Barnes-Hut t-stochastic neighbour embeddings. There is no consensus on how the problem should be addressed and how these representations/models should be analysed because of their different notions. We introduced a measure to compare their results and capability to provide insights into the information retrieved. We considered low-dimensional embeddings as a potentially revealing strategy to uncover dynamics possibly not uncovered in big-data spaces. We demonstrated that a non-guided approach can be as revealing as a user-guided approach for data exploration and presented coherent results for good uncertainty modelling capability in terms of fuzziness and densities.

The understanding of a psychological phenomena such as emotion is of paramount importance for psychologists, since it allows to recognize a pathology and to prescribe a due treatment for a patient. While approaching this problem, mathematicians and computational science engineers have proposed different unimodal techniques for emotion recognition from voice, electroencephalography, facial expression, and physiological data. It is also well known that identifying emotions is a multimodal process. The main goal in this work is to train a computer to do so. In this paper we will present our first approach to a multimodal emotion recognition via data fusion of Electroencephalography and facial expressions. The selected strategy was a feature-level fusion of both Electroencephalography and facial microexpressions, and the classification schemes used were a neural network model and a random forest classifier. Experimental set up was out with the balanced multimodal database MAHNOB-HCI. Results are promising compared to results from other authors with a 97% of accuracy. The feature-level fusion approach used in this work improves our unimodal techniques up to 12% per emotion. Therefore, we may conclude that our simple but effective approach improves the overall results of accuracy.

In this work, we perform an approach to emotion recognition from Electroencephalography (EEG) single channel signals extracted in four (4) mother-child dyads experiment in developmental psychology. Single channel EEG signals are decomposed by several types of wavelets and each subsignal are processed using several window sizes by performing a statistical analysis. Finally, three types of classifiers were used, obtaining accuracy rate between 50% to 87% for the emotional states such as happiness, sadness and neutrality.

A problem of hardware implementation of fuzzy rule-based systems with reconfigurable parametric families of operations is discussed. The methods of generation of parametric families of digital fuzzy conjunctors and t-norms by means of monotone sum and ordinal sum of basic t-norms are studied in the paper. The paper considers several methods of generation of such operations utilizing only the simplest operations, such as comparison, min, max, bounded sum and bounded difference, providing efficient hardware implementation of different reconfigurable parametric families of digital fuzzy conjunctors in one modular structure.

In this paper the authors are dealing with the detection of different mechanical faults (unbalance and misalignment) under a wide range of working conditions of speed and load. The conditions tested in a test bench are similar to the ones that can be found in different kinds of machines like for example wind turbines. The authors demonstrate how to take advantage of the information on vibrations from the mechanical system under study in a wide range of load and speed conditions. Using such information the prognosis and detection of faults is faster and more reliable than the one obtained from an analysis over a restricted range of working conditions (e.g. nominal).

This work presents the development of an angular resampling algorithm for applying in conditions of high speed variability, as occurs in wind turbines, and the results obtained when applied to simulated signals, bearings diagnostic test-beds and wind turbines. The results improve the accuracy of similar resampling algorithms offered by the consulted bibliography. This algorithm is part of the wind turbine diagnostic system developed by the authors.

Research into fault diagnosis in machines with a wide range of variable loads and speeds, such as wind turbines, is of great industrial interest. Analysis of the power signals emitted by wind turbines for the diagnosis of mechanical faults in their mechanical transmission chain is insufficient. A successful diagnosis requires the inclusion of accelerometers to evaluate vibrations. This work presents a multi-sensory system for fault diagnosis in wind turbines, combined with a data-mining solution for the classification of the operational state of the turbine. The selected sensors are accelerometers, in which vibration signals are processed using angular resampling techniques and electrical, torque and speed measurements. Support vector machines (SVMs) are selected for the classification task, including two traditional and two promising new kernels. This multi-sensory system has been validated on a test-bed that simulates the real conditions of wind turbines with two fault typologies: misalignment and imbalance. Comparison of SVM performance with the results of artificial neural networks (ANNs) shows that linear kernel SVM outperforms other kernels and ANNs in terms of accuracy, training and tuning times. The suitability and superior performance of linear SVM is also experimentally analyzed, to conclude that this data acquisition technique generates linearly separable datasets., Projects, CENIT-2008-1028, TIN2011-24046, IPT-2011-1265-020000 and DPI2009-06124-E/DPI of the Spanish Ministry of Economy and Competitiveness

Fault diagnosis in machines that work under a wide range of speeds and loads is currently an active area of research. Wind turbines are one of the most recent examples of these machines in industry. Conventional vibration analysis applied to machines throughout their operation is of limited utility when the speed variation is too high. This work proposes an alternative methodology for fault diagnosis in machines: the combination of angular resampling techniques for vibration signal processing and the use of data mining techniques for the classification of the operational state of wind turbines. The methodology has been validated over a test-bed with a large variation of speeds and loads which simulates, on a smaller scale, the real conditions of wind turbines. Over this test-bed two of the most common typologies of faults in wind turbines have been generated: imbalance and misalignment. Several data mining techniques have been used to analyze the dataset obtained by order analysis, having previously processed signals with angular resampling technique. Specifically, the methods used are ensemble classifiers built with Bagging, Adaboost, Geneneral Boosting Projection and Rotation Forest; the best results having been achieved with Adaboost using C4.5 decision trees as base classifiers.

Information retrieval problem occurs when the target information is not available 'literally' into the set of documents. In problems in which the goal is to find 'hidden' information, it is important to develop hybrid methodologies or improve and design a new one. In this work the authors are dealing with identifying the most informative piece of data on a collection of documents, in order to obtain the best result on a posterior fuzzy clustering stage. The aim is to find similarities between the documents and a reference target, to establish relationships related to a non-literal feature. We propose to apply the well-known entropy term weighting scheme and then show a posterior different procedures to the right election of the interest data. This procedure brings the biggest amount of information within the smallest amount of data. Applying a specific selection procedure for a group of words, gives more information to differentiate and separate the documents after using the entropy weighting. This returns considerable results on the processing time and the right fuzzy clustering of the documents collection.

Instruction queues consume a significant amount of power in a high-performance processor. The wakeup logic delay is also a critical timing parameter. This paper compares a commonly used CAM-based instruction queue organization with a new pointer-based design for delay and energy efficiency. A design and pre-layout of all critical structures in 70nm technology is performed for both organizations. The pointer-based design is shown to use 10 to 15 times less power than the CAM-based design, depending on queue size, for a 4-wide issue, 5GHz processor. The results also demonstrate the importance of evaluating all steps of instruction queue access: allocation, issue and wakeup rather than wakeup alone, especially for power consumption.