Genetic Parallel Programming: design and implementation

This paper presents a novel Genetic Parallel Programming (GPP) paradigm for evolving parallel programs running on a Multi-Arithmetic-Logic-Unit (Multi-ALU) Processor (MAP). The MAP is a Multiple Instruction-streams, Multiple Data-streams (MIMD), general-purpose register machine that can be implemented on modern Very Large-Scale Integrated Circuits (VLSIs) in order to evaluate genetic programs at high speed. For human programmers, writing parallel programs is more difficult than writing sequential programs. However, experimental results show that GPP evolves parallel programs with less computational effort than that of their sequential counterparts. It creates a new approach to evolving a feasible problem solution in parallel program form and then serializes it into a sequential program if required. The effectiveness and efficiency of GPP are investigated using a suite of 14 well-studied benchmark problems. Experimental results show that GPP speeds up evolution substantially.     

Segmentation of telecom customers based on customer value by decision tree model

The more the telecom services marketing paradigm evolves, the more important it becomes to retain high value customers. Traditional customer segmentation methods based on experience or ARPU (Average Revenue per User) consider neither customers’ future revenue nor the cost of servicing customers of different types. Therefore, it is very difficult to effectively identify high-value customers. In this paper, we propose a novel customer segmentation method based on customer lifecycle, which includes five decision models, i.e. current value, historic value, prediction of long-term value, credit and loyalty. Due to the difficulty of quantitative computation of long-term value, credit and loyalty, a decision tree method is used to extract important parameters related to long-term value, credit and loyalty. Then a judgments matrix formulated on the basis of characteristics of data and the experience of business experts is presented. Finally a simple and practical customer value evaluation system is built. This model is applied to telecom operators in a province in China and good accuracy is achieved.     

Micro- and nano-scale deformation behavior of nylon 66-based binary and ternary nanocomposites

The primary aim of this paper is to provide an insight on the effect of the location of organoclay on the micro- and nano-scale deformation processes in melt-compounded nylon 66/organoclay/SEBS-g-MA ternary nanocomposites prepared by different blending sequences. In addition, the deformation processes of the ternary nanocomposites were compared to the binary nanocomposites (nylon 66/organoclay and nylon 66/SEBS-g-MA) and neat nylon 66. The incorporation of SEBS-g-MA particles toughened nylon 66 markedly; but the flexural modulus and strength were both reduced. Conversely, the use of organoclay increased the modulus but decreased the fracture toughness of nylon 66. Nylon 66/SEBS-g-MA/organoclay ternary nanocomposites exhibited balanced elastic stiffness and toughness. Stress-whitening studies of the fracture surfaces in terms of gray level were also performed and an attempt was made to correlate the optical reflectivity characteristics with fracture toughness. It was concluded that the capability of SEBS-g-MA particles to cavitate was decreased by the presence of organoclay in the SEBS-g-MA phase, resulting in reduced toughening efficiency. The best micro-structure for toughness and other mechanical properties is thus to maximize the amount of exfoliated organoclay in the nylon 66 matrix rather than to have it embedded in the finely dispersed SEBS-g-MA particles.     

Prediction of the obstacle effect on film-boiling heat transfer

A correlation has been developed to account for the effect of obstacles (simulating the spacing devices in bundles) on heat transfer in dispersed-flow film boiling. The correlation is expressed as a modification factor to the reference geometry without any obstacles. The basic form of the correlation is an exponential decay function that resembles the diminishing effect on turbulence enhancement. The coefficients and constants in the correlation have been optimized with heat-transfer data of low-pressure single-phase (air) flow and high-pressure steam-water flow at film-boiling conditions.An experiment has been set up to obtain validation data with a heated tube of 4.1 mm inside diameter. HFC-134a was used as the working fluid. Three types of obstacles with the same blockage-area ratio of 37.8% were tested. The results showed that the obstacles exhibited a strong enhancement effect on the film-boiling heat-transfer coefficient at locations downstream of the obstacles. A comparison between predictions of the correlation for the spacing-device effect and experimental data showed an underprediction of the heat-transfer rate at locations downstream of the obstacle. The underprediction is due mainly to the rewetting of the heated surface at the location of an obstacle, beyond which the developing film-boiling effect becomes dominant. The agreement between prediction and data is significantly improved after accounting for the critical heat flux (CHF) enhancement and developing film-boiling effects in the calculations.     

HIGH‐DIMENSIONAL LEARNING FRAMEWORK FOR ADAPTIVE DOCUMENT FILTERING*

We investigate the unique requirements of the adaptive textual document filtering problem and propose a new high‐dimensional on‐line learning framework, known as the REPGER (relevant feature pool with good training example retrieval rule) algorithm to tackle this problem. Our algorithm possesses three characteristics. First, it maintains a pool of selective features with potentially high predictive power to predict document relevance. Second, besides retrieving documents according to their predicted relevance, it also retrieves incoming documents that are considered good training examples. Third, it can dynamically adjust the dissemination threshold throughout the filtering process so as to maintain a good filtering performance in a fully interactive environment. We have conducted experiments on three document corpora, namely, Associated Press, Foreign Broadcast Information Service, and Wall Street Journal to compare the performance of our REPGER algorithm with two existing on‐line learning algorithms. The results demonstrate that our REPGER algorithm gives better performance most of the time. Comparison with the TREC (Text Retrieval Conference) adaptive text filtering track participants was also made. The result shows that our REPGER algorithm is comparable to them.     

An efficient self-organizing map designed by genetic algorithms for the traveling salesman problem

As a typical combinatorial optimization problem, the traveling salesman problem (TSP) has attracted extensive research interest. In this paper, we develop a self-organizing map (SOM) with a novel learning rule. It is called the integrated SOM (ISOM) since its learning rule integrates the three learning mechanisms in the SOM literature. Within a single learning step, the excited neuron is first dragged toward the input city, then pushed to the convex hull of the TSP, and finally drawn toward the middle point of its two neighboring neurons. A genetic algorithm is successfully specified to determine the elaborate coordination among the three learning mechanisms as well as the suitable parameter setting. The evolved ISOM (eISOM) is examined on three sets of TSP to demonstrate its power and efficiency. The computation complexity of the eISOM is quadratic, which is comparable to other SOM-like neural networks. Moreover, the eISOM can generate more accurate solutions than several typical approaches for TSP including the SOM developed by Budinich, the expanding SOM, the convex elastic net, and the FLEXMAP algorithm. Though its solution accuracy is not yet comparable to some sophisticated heuristics, the eISOM is one of the most accurate neural networks for the TSP.     

Design of an interactive video-on-demand system

We design an interactive video-on-demand (VOD) system using both the client-server paradigm and broadcast delivery paradigm. Between the VOD warehouse and customers, we adopt a client-server paradigm to provide an interactive service. Within the VOD warehouse, we adopt a broadcast delivery paradigm to support many concurrent customers. In particular, we exploit the enormous bandwidth of optical fibers for broadcast delivery, so that the system can provide many video programs and maintain a small access delay. In addition, we design and adopt an interleaved broadcast delivery scheme, so that every video stream only requires a small buffer size for temporary storage. A simple proxy is allocated to each ongoing customer, and it retrieves video from optical channels and delivers video to the customer through an information network. The proposed VOD system is suitable for large scale applications with many customers, and has several desirable features: 1) it can be scaled up to serve more concurrent customers and provide more video programs, 2) it provides interactive operations, 3) it only requires point-to-point communication between the VOD warehouse and the customer and involves no network control, 4) it has a small access delay, and 5) it requires a small buffer size for each video stream.     

A Multi-User 3-D Virtual Environment with Interactive Collaboration and Shared Whiteboard Technologies

A multi-user 3-D virtual environment allows remote participants to have a transparent communication as if they are communicating face-to-face. The sense of presence in such an environment can be established by representing each participant with a vivid human-like character called an avatar. We review several immersive technologies, including directional sound, eye gaze, hand gestures, lip synchronization and facial expressions, that facilitates multimodal interaction among participants in the virtual environment using speech processing and animation techniques. Interactive collaboration can be further encouraged with the ability to share and manipulate 3-D objects in the virtual environment. A shared whiteboard makes it easy for participants in the virtual environment to convey their ideas graphically. We survey various kinds of capture devices used for providing the input for the shared whiteboard. Efficient storage of the whiteboard session and precise archival at a later time bring up interesting research topics in information retrieval.     

Scheduling with Conflicts on Bipartite and Interval Graphs

In this paper, we consider the on-line scheduling of jobs that may be competing for mutually exclusive resources. We model the conflicts between jobs with a conflict graph, so that the set of all concurrently running jobs must form an independent set in the graph. This model is natural and general enough to have applications in a variety of settings; however, we are motivated by the following two specific applications: traffic intersection control and session scheduling in high speed local area networks with spatial reuse. Our results focus on two special classes of graphs motivated by our applications: bipartite graphs and interval graphs. The cost function we use is maximum response time. In all of the upper bounds, we devise algorithms which maintain a set of invariants which bound the accumulation of jobs on cliques (in the case of bipartite graphs, edges) in the graph. The lower bounds show that the invariants maintained by the algorithms are tight to within a constant factor. For a specific graph which arises in the traffic intersection control problem, we show a simple algorithm which achieves the optimal competitive ratio.