A genetic algorithm based heuristic for scheduling of virtual manufacturing cells (VMCs)

We present a genetic algorithm (GA) based heuristic approach for job scheduling in virtual manufacturing cells (VMCs). In a VMC, machines are dedicated to a part as in a regular cell, but machines are not physically relocated in a contiguous area. Cell configurations are therefore temporary, and assignments are made to optimize the scheduling objective under changing demand conditions. We consider the case where there are multiple jobs with different processing routes. There are multiple machine types with several identical machines in each type and are located in different locations in the shop floor. Scheduling objective is weighted makespan and total traveling distance minimization. The scheduling decisions are the (i) assignment of jobs to the machines, and (ii) the job start time at each machine. To evaluate the effectiveness of the GA heuristic we compare it with a mixed integer programming (MIP) solution. This is done on a wide range of benchmark problem. Computational results show that GA is promising in finding good solutions in very shorter times and can be substituted in the place of MIP model.     

Mobility profiler: A framework for discovering mobility profiles of cell phone users

Mobility path information of cell phone users play a crucial role in a wide range of cell phone applications, including context based search and advertising, early warning systems, city-wide sensing applications such as air pollution exposure estimation and traffic planning. However, there is a disconnect between the low level location data logs available from the cell phones and the high level mobility path information required to support these cell phone applications. In this paper, we present formal definitions to capture the cell phone users’ mobility patterns and profiles, and provide a complete framework, Mobility Profiler, for discovering mobile cell phone user profiles starting from cell based location data. We use real-world cell phone log data (of over 350 K h of coverage) to demonstrate our framework and perform experiments for discovering frequent mobility patterns and profiles. Our analysis of mobility profiles of cell phone users expose a significant long tail in a user’s location-time distribution: A total of 15% of a cell phone user’s time is spent on average in locations that each appears with less than 1% of total time.     

Multi-objective rule mining using a chaotic particle swarm optimization algorithm

In this paper, classification rule mining which is one of the most studied tasks in data mining community has been modeled as a multi-objective optimization problem with predictive accuracy and comprehensibility objectives. A multi-objective chaotic particle swarm optimization (PSO) method has been introduced as a search strategy to mine classification rules within datasets. The used extension to PSO uses similarity measure for neighborhood and far-neighborhood search to store the global best particles found in multi-objective manner. For the bi-objective problem of rule mining of high accuracy/comprehensibility, the multi-objective approach is intended to allow the PSO algorithm to return an approximation to the upper accuracy/comprehensibility border, containing solutions that are spread across the border. The experimental results show the efficiency of the algorithm.     

An upper bound on the minimum number of monomials required to separate dichotomies of {-1, 1}n

It is known that any dichotomy of {-1, 1}n can be learned (separated) with a higher-order neuron (polynomial function) with 2n inputs (monomials). In general, less than 2n monomials are sufficient to solve a given dichotomy. In spite of the efforts to develop algorithms for finding solutions with fewer monomials, there have been relatively fewer studies investigating maximum density (Pi(n)), the minimum number of monomials that would suffice to separate an arbitrary dichotomy of {-1, 1}n . This article derives a theoretical (upper) bound for this quantity, superseding previously known bounds. The main theorem here states that for any binary classification problem in {-1, 1}n (n > 1), one can always find a polynomial function solution with 2n -2n/4 or fewer monomials. In particular, any dichotomy of {-1, 1}n can be learned by a higher-order neuron with a fan-in of 2n -2n/4 or less. With this result, for the first time, a deterministic ratio bound independent of n is established as Pi(n)/2n < or = 0 75. The main theorem is constructive, so it provides a deterministic algorithm for achieving the theoretical result. The study presented provides the basic mathematical tools and forms the basis for further analyses that may have implications for neural computation mechanisms employed in the cerebral cortex.     

Robotic grasping and manipulation through human visuomotor learning

A major goal of robotics research is to develop techniques that allow non-experts to teach robots dexterous skills. In this paper, we report our progress on the development of a framework which exploits human sensorimotor learning capability to address this aim. The idea is to place the human operator in the robot control loop where he/she can intuitively control the robot, and by practice, learn to perform the target task with the robot. Subsequently, by analyzing the robot control obtained by the human, it is possible to design a controller that allows the robot to autonomously perform the task. First, we introduce this framework with the ball-swapping task where a robot hand has to swap the position of the balls without dropping them, and present new analyses investigating the intrinsic dimension of the ball-swapping skill obtained through this framework. Then, we present new experiments toward obtaining an autonomous grasp controller on an anthropomorphic robot. In the experiments, the operator directly controls the (simulated) robot using visual feedback to achieve robust grasping with the robot. The data collected is then analyzed for inferring the grasping strategy discovered by the human operator. Finally, a method to generalize grasping actions using the collected data is presented, which allows the robot to autonomously generate grasping actions for different orientations of the target object.     

Reinforcement learning to adjust parametrized motor primitives to new situations

Humans manage to adapt learned movements very quickly to new situations by generalizing learned behaviors from similar situations. In contrast, robots currently often need to re-learn the complete movement. In this paper, we propose a method that learns to generalize parametrized motor plans by adapting a small set of global parameters, called meta-parameters. We employ reinforcement learning to learn the required meta-parameters to deal with the current situation, described by states. We introduce an appropriate reinforcement learning algorithm based on a kernelized version of the reward-weighted regression. To show its feasibility, we evaluate this algorithm on a toy example and compare it to several previous approaches. Subsequently, we apply the approach to three robot tasks, i.e., the generalization of throwing movements in darts, of hitting movements in table tennis, and of throwing balls where the tasks are learned on several different real physical robots, i.e., a Barrett WAM, a BioRob, the JST-ICORP/SARCOS CBi and a Kuka KR?6.     

Evaluation of natural gas hydrates as a future methane source

In recent years, attention has been given to obtaining methane gas from natural gas hydrates (NGHs) sediment; but its production, economics, and safety are still far away from being commercially viable for many years, and so more research is needed. NGHs are nonstoichiometric crystalline solid compounds that form from mixtures of water molecules and light weight natural gases such as methane, ethane, propane, and carbon dioxide. They are formed in specific thermodynamic conditions, low temperatures (5–15°C) and high pressures (2–3 MPa), and are found in (a) onshore polar regions beneath permafrost and (b) offshore deep-sea sediments. Methane, NG, is the cleanest fossil fuel and its huge amounts in NGHs have carbon quantities more than double of all fossil fuels. The methods that have been proposed for NG extraction from NGHs include: (a) depressurization, (b) thermal stimulation, and (c) chemical inhibitor injections. The authors review the potential of methane gas from NGHs as an unconventional source of future energy. The formation of NGHs as well as extraction of methane from NGHs coupled with technical and environmental challenges are also addressed.     

Large scale micro finite element analysis of 3D bone poroelasticity

In this paper, a solver for poroelasticity problems related to osteoporotic human bones is discussed. Osteoporosis is a major health problem that compromises the integrity of bones. A good understanding of the disease requires an accurate simulation of the physics. For that purpose, a finite element solver based on Biot’s consolidation equations has been developed. A mixed formulation is used to discretize the geometries taken from medical imaging. The resulting indefinite linear systems are solved by Krylov space methods supplemented by variants of Schur complement-based block preconditioners.     

What installed mobile applications tell about their owners and how they affect users’ download behavior

The rapid growth in the mobile application market presents a significant challenge to find interesting and relevant applications for users. An experimental study was conducted through the use of a specifically designed mobile application, on users’ mobile phones. The goals were; first, to learn about the users’ personality and the applications they downloaded to their mobile phones, second to recommend applications to users via notifications through the use of experimental mobile application and learn about user behavior in mobile environment. The question of how the personality features of users affect their compliance to recommendations is explored in this study. It is found that conscientiousness is positively related with accepting recommended applications and being agreeable is related with the preference for the applications of editor’s choice. Furthermore, in this study, applications owned by the user and the composition of applications under categories and their relation with personality features are explored. It is shown that the number of user owned applications and their category differ according to gender and personality. Having similar applications and the number of applications owned under specific categories increase the probability of accepting recommended applications.