A weighted constraint satisfaction problem (WCSP) is a constraint satisfaction problem in which preferences among solutions can be expressed. Bucket elimination is a complete technique commonly used to solve this kind of constraint satisfaction problem. When the memory required to apply bucket elimination is too high, a heuristic method based on it (denominated mini-buckets) can be used to calculate bounds for the optimal solution. Nevertheless, the curse of dimensionality makes these techniques impractical on large scale problems. In response to this situation, we present a memetic algorithm for WCSPs in which bucket elimination is used as a mechanism for recombining solutions, providing the best possible child from the parental set. Subsequently, a multi-level model in which this exact/metaheuristic hybrid is further hybridized with branch-and-bound techniques and mini-buckets is studied. As a case study, we have applied these algorithms to the resolution of the maximum density still life problem, a hard constraint optimization problem based on Conway's game of life. The resulting algorithm consistently finds optimal patterns for up to date solved instances in less time than current approaches. Moreover, it is shown that this proposal provides new best known solutions for very large instances.

Music genre classification is an essential tool for music information retrieval systems and it has been finding critical applications in various media platforms. Two important problems of the automatic music genre classification are feature extraction and classifier design. This paper investigates inter-genre similarity modelling (IGS) to improve the performance of automatic music genre classification. Inter-genre similarity information is extracted over the mis-classified feature population. Once the inter-genre similarity is modelled, elimination of the inter-genre similarity reduces the inter-genre confusion and improves the identification rates. Inter-genre similarity modelling is further improved with iterative IGS modelling(IIGS) and score modelling for IGS elimination(SMIGS). Experimental results with promising classification improvements are provided.

The Tokyo Metropolitan Government is the largest municipality in Japan and conducts building change identification work. Recently, Tokyo terminated its traditional visual identification work that has been in use for 20 years and shifted to a new automated system. This paper is intended to introduce the Fixed Assets Change Judgment (FACJ) system and its core tool, RealScape. RealScape automatically detects the changes in the height and color of buildings based on three-dimensional (3D) analysis of aerial photographs. It employs a unique pixel-by-pixel stereo processing method and enables the foot-level precision for each building. RealScape detects building changes more accurately than visual judgment operations by humans and reduces the labor costs to one third of the traditional approach and the required judgment duration to about two weeks per 100km2.

Spam filtering, as a key problem in electronic communication, has drawn significant attention due to increasingly huge amounts of junk email on the Internet. Content-based filtering is one reliable method in combating with spammers' changing tactics. Naive Bayes (NB) is one of the earliest content-based machine learning methods both in theory and practice in combating with spammers, which is easy to implement while can achieve considerable accuracy. In this paper, the traditional online Bayesian classifier are enhanced  by two ways. First, from theory's point of view, we devise a self-adaptive mechanism to gradually weaken the assumption of independence required by original NB in the online training process, and as a result of that our NSNB is no longer ``naive''. Second, we propose other engineering ways to make the classifier more robust and accuracy. The experiment results show that our NSNB does give state-of-the-art classification performance on online spam filtering on large benchmark data sets while it is extremely fast and takes up little memory in comparison with other statistical methods.

In this paper, an event-centric commodity trading simulation powered by the multiagent framework is presented. The purpose of this simulation platform is for training novice traders. The simulation is progressed by announcing news events that affect various aspects of the commodity supply chain. Upon receiving these events, market agents that play the roles of producers, consumers, and speculators would adjust their views on the market and act accordingly. Their actions would be based on their roles and also their private information, and collectively they shape the market dynamics. This simulation has been effectively deployed for several training sessions. We will present the underlying technologies that are employed and discuss the practical significance of such platform.

This paper presents a project awarded by MGB HK to handle their inspection scheduling problem. MGB HK is the buying office of one of the largest retailers in the world, Metro Group. MGB HK handles all product procurement of Metro Group out of Europe. The inspection process is one of their critical processes along their entire procurement exercise. The objective of this project is to provide an effective scheduling engine so that in-house inspectors can handle as many inspections as possible using the least amount of time and costs. Meanwhile, we also help the company overcome their difficulties of data collection and maintenance as a result of the system we developed. Our engine will be deployed and integrated into the company’s IMS. The engine recorded an improvement in the scheduling of their inspections and initial prognosis indicates that delayed inspections have been greatly reduced by compared with previous schedule. The system can effectively schedule inspections by urgency, shipment value, and supplier’s historical performance. Other than the schedule, the AI engine can also generate solutions based on different strategies and criteria, which facilitate the decision-making process for the scheduling team and management at MGB HK.

Historical document images are subject to intrinsic distortions such as background noise and bleed-through interference due to aging and extrinsic distortions such as displacement, uneven surfaces introduced during image acquisition procedure. In this paper, we propose a fully automatic restoration framework that corrects bleed-through distortion on double-sided handwritten historical document images. First, the two sides of a document are registered with corresponding control points which are selected by inspecting the images' gradient maps and minimizing a predefined dissimilarity measure. The established correspondences are refined by median filters and consistency checking. Piecewise linear mapping function is chosen to represent the spatial relationship between the two images. Based on the estimated transform model, backward re-sampling strategy and bi-cubic spline interpolation are adopted to obtain final registered images. Once the two sides of a page have been registered, enhancement/smearing feature images are extracted and iterative wavelet decomposition/construction is performed to restore the degraded images. Experiments on the real documents from the National Archives of Singapore demonstrate a completely automatic framework to the restoration of historical document images.

Language students can increase their effectiveness in learning written Japanese by mastering the visual structure and written technique of Japanese kanji.  Yet, existing kanji handwriting recognition systems do not assess the written technique sufficiently enough to discourage students from developing bad learning habits.  In this paper, we describe our work on Hashigo, a kanji sketch interactive system which achieves human instructor-level critique and feedback on both the visual structure and written technique of students’ sketched kanji.  This type of automated critique and feedback allows students to target and correct specific deficiencies in their sketches that, if left untreated, are detrimental to effective long-term kanji learning.

Personal handwritings can add colors to human communication. Handwriting, however, takes more time and is less favored than typing in the digital age. In this paper we propose an intelligent algorithm which can generate imitations of Chinese handwriting by a person requiring only a very small set of training characters written by the person. Our method first decomposes the sample Chinese handwriting characters into a hierarchy of reusable components, called character components. During handwriting generation, the algorithm tries and compares different possible ways to compose the target character. The likeliness of a given personal handwriting generation result is evaluated according to the captured characteristics of the person's handwriting. We then find among all the candidate generation results an optimal one which can maximize a likeliness estimation. Experiment results show that our algorithm works reasonably well in the majority of the cases and sometimes remarkably well, which was verified through comparison with the groundtruth data and by a small scale user survey.

Comments on ``A new combination of evidence based on compromise'' by K. Yamada