A refinement approach to search and constraint satisfaction problem

title: Finding Actionable Knowledge via Automated Comparison
abstract: The problem of finding interesting and actionable patterns is a major challenge in data mining. It has been studied by many data mining researchers. The issue is that data mining algorithms often generate too many patterns, which make it very hard for the user to find those truly useful ones. Over the years many techniques have been proposed. However, few have made it to real-life applications. At the end of 2005, we built a data mining system for Motorola (called Opportunity Map) to enable the user to explore the space of a large number of rules in order to find actionable knowledge. The approach is based on the concept of rule cubes and operations on rule cubes. A rule cube is similar to a data cube, but stores rules. Since its deployment, some issues have also been identified during the regular use of the system in Motorola. One of the key issues is that although the operations on rule cubes are flexible, each operation is primitive and has to be initiated by the user. Finding a piece of actionable knowledge typically involves many operations and intense visual inspections, which are labor-intensive and time-consuming. From interactions with our users, we identified a generic problem that is crucial for finding actionable knowledge. The problem involves extensive comparison of sub-populations and identification of the cause of their differences. This paper first defines the problem and then proposes an effective method to solve the problem automatically. To the best of our knowledge, there is no reported study of this problem. The new method has been added to the Opportunity Map system and is now in daily use in Motorola.

title: Opinion Mining
abstract: Описанл процедуру формування інтегрального показника об’єкта згідно з відгуками користувачів під час застосування методів оцінювання опінії текстової інформації у web-документах. Запропоновано використання лінгвістичних змінних та застосування вагових коефіцієнтів для достовірнішого результату оцінювання емоційного забарвлення текстової інформації. Ключові слова: опінія, емоційне забарвлення, об’єкт, інтегральний показник, лінгвістична змінна, ваговий коефіцієнт.

title: Entity discovery and assignment for opinion mining applications
abstract: Opinion mining became an important topic of study in recent years due to its wide range of applications. There are also many companies offering opinion mining services. One problem that has not been studied so far is the assignment of entities that have been talked about in each sentence. Let us use forum discussions about products as an example to make the problem concrete. In a typical discussion post, the author may give opinions on multiple products and also compare them. The issue is how to detect what products have been talked about in each sentence. If the sentence contains the product names, they need to be identified. We call this problem entity discovery. If the product names are not explicitly mentioned in the sentence but are implied due to the use of pronouns and language conventions, we need to infer the products. We call this problem entity assignment. These problems are important because without knowing what products each sentence talks about the opinion mined from the sentence is of little use. In this paper, we study these problems and propose two effective methods to solve the problems. Entity discovery is based on pattern discovery and entity assignment is based on mining of comparative sentences. Experimental results using a large number of forum posts demonstrate the effectiveness of the technique. Our system has also been successfully tested in a commercial setting.

title: Dealing with different distributions in learning from
abstract: In the problem of learning with positive and unlabeled examples, existing research all assumes that positive examples P and the hidden positive examples in the unlabeled set U are generated from the same distribution. This assumption may be violated in practice. In such cases, existing methods perform poorly. This paper proposes a novel technique A-EM to deal with the problem. Experimental results with product page classification demonstrate the effectiveness of the proposed technique.

title: Speed-up iterative frequent itemset mining with constraint changes
abstract: Mining of frequent itemsets is a fundamental data mining task. Past research has proposed many efficient algorithms for this purpose. Recent work also highlighted the importance of using constraints to focus the mining process to mine only those relevant itemsets. In practice, data mining is often an interactive and iterative process. The user typically changes constraints and runs the mining algorithm many times before being satisfied with the final results. This interactive process is very time consuming. Existing mining algorithms are unable to take advantage of this iterative process to use previous mining results to speed up the current mining process. This results in an enormous waste of time and computation. In this paper, we propose an efficient technique to utilize previous mining results to improve the efficiency of current mining when constraints are changed. We first introduce the concept of tree boundary to summarize useful information available from previous mining. We then show that the tree boundary provides an effective and efficient framework for the new mining. The proposed technique has been implemented in the context of two existing frequent itemset mining algorithms, FP-tree and tree projection. Experiment results on both synthetic and real-life datasets show that the proposed approach achieves a dramatic saving of computation.

title: An Ontology-Based Approach to Knowledge Management
abstract: Combining with the respective advantages of ontology and Web Service, this paper puts forward a knowledge management approach to overcome the problem of semantic heterogeneity in distributed environments. The emphasis is placed on establishing an XML-oriented semantic data model and the mapping between XML data based on a global semantic view, which enhances knowledge process efficiency, accuracy and the semantic interoperability as well.

title: Design and Implementation of Control System on Embedded Downloading Server Based on C/S Architecture
abstract: Based on Client-Server architecture, this paper proposes the design and implementation of system controlling embedded-Linux downloading server. The software architecture design of this system is composed of three parts: network layer, control layer, and application layer, which is modular and pluggable. The implementation also proved the feasibility, reliability and portability of this design.

title: Multithreaded Optimizing Technique for Dynamic Binary Translator CrossBit
abstract: Dynamic binary translator (DBT) systems enable the architectural incompatible platforms to execute binaries of other architectures transparently. And binary translation and optimization are always deemed as the key techniques to constructing high performance DBT systems. Many previous optimization including fragment chaining, trace/superblock formation, translated code optimization, has been applied to improve performance. However, seldom any effort is made to optimize under multi-core processor environment. Therefore, this paper describes the new multiple threads execution engine (MTEE) of the dynamic binary translator CrossBit, which is a both resourceable and retargetable infrastructure for cross binary translation. The multithreaded technique decomposes the common binary translation working routine into dynamic translation and translated code execution phases, and then multi-threads enable parallelized translation of host binaries. As a result, the multithreaded optimizing technique accelerates the translation of binaries.We evaluated our binary translation system across the SPEC CPU2000 and found that the system under MTEE has reached a performance level equal to that of the conventional CrossBit engine which was executed on the IA32 multi-cores processor environment. And several SPEC benchmark programs even show that the MTEE have speed up the execution of CrossBit about 30% at best. And we are still looking forward to a higher performance improvement through this new software pipelined method.

title: Positive solutions of a nonlinear three-point boundary value problem
abstract: In this paper, by using Krasnoselskii's fixed point theorem in a cone, we study the existence of single and multiple positive solutions to the three-point boundary value problem (BVP)y''(t)+a(t)f(y(t))=0,0

title: Robot Obstacle Avoidance based on an Improved Ant Colony Algorithm
abstract: Obstacle Avoidance for mobile robot is a nondeterministic polynomial hard (NP-hard) problem. Ant algorithm is the bionic algorithm which simulated ants foraging behavior, which can effectively solve the problems of this kind. In this paper, we propose an improved ant colony algorithm for robot obstacle avoidance, in which heuristic information is adjusted at run-time during the searching process. The proposed algorithm can effectively alleviate the local optimum problem, global optimal path can be robustly found in our experiments.