In everyday scenes, from perceived colors of objects and terrains, observers can simultaneously identify objects across illuminants and identify the nature of the light, e.g., as sunlight or cloudy. As a formal problem, identifying objects and illuminants from the color information provided by sensor responses is underdetermined. It is shown how the problem can be simplified considerably by the...

Goals identification is an open issue in the Requirement Analysis field for Multi-Agent System design. Stakeholders commonly don’t have full and exhaustive awareness about their real objectives in the domain problem. Goals are implicitly expressed during the inquiring phase. Thus, the goal identification task is commonly ascribed to the expertise of the analyst. In this work we propose a new me...

This paper describes a robust and efficient method for rotation and location independent identification and localization of facial images using one modified Radial Basis Function Network (RBFN) which embeds a new Heuristic Based Clustering (HBC) and Back Propagation (BP) learning. HBC in RBFN determines the natural number of clusters or groups on the basis of 'person-view'. BP network...

This paper describes research in heuristic riskbased testing. The aim of this research is to design and implement a risk assessment tool called QUART-ET (Quick Assessment of Risks for Engineering Testing) to facilitate the risk management process. The purpose of QUART-ET is to help software development teams manage risks specifically related to testing and to aid management in discovering an ac...

Heuristics are widely applied to modularity maximization models for the identification of communities in complex networks. We present an approach to be applied as a post-processing on heuristic methods in order to improve their performances. Starting from a given partition, we test with an exact algorithm for bipartitioning if it is worthwhile to split some communities or to merge two of them. ...

In this paper we investigate the usage of the Lagrangian approach as a mechanism of speeding up the optimal basis identification in simplex methods. More precisely, we have combined the volume algorithm (a variation of the subgradient algorithm) with a simplex implementation like Cplex on a strong linear programming formulation of the asymmetric traveling salesman problem known by extended disa...

The authors propose a heuristic method for Chinese automatic text segmentation based on a statistical approach. This method is developed based on statistical information about the association among adjacent characters in Chinese text. Mutual information of bi-grams and significant estimation of tri-grams are utilized. A heuristic method with six rules is then proposed to determine the segmentat...

this paper considers the economic lot scheduling problem, that is, the problem of scheduling several products on a single facility so as to minimize holding and setup costs. combination of frequency and timing as well as production quantity make this problem np-hard. a heuristic is developed to obtain a good solution to elsp. the proposed heuristic makes use of the simulated annealing technique...

Trajectories of mobile objects, are automatically collected in huge quantities. Publishing and exploiting such data is essential to improve planning, but it threatens the privacy of individuals: re-identification of the individual behind a trajectory is easy unless precautions are taken. We present two heuristics for privacy-preserving publication of trajectories. Both of them publish only true...