Using Suffix Tree Document Representation in Hierarchical Agglomerative Clustering

In text categorization problem the most used method for documents representation is based on words frequency vectors called VSM (Vector Space Model). This representation is based only on words from documents and in this case loses any “word context" information found in the document. In this article we make a comparison between the classical method of document representation and a method called Suffix Tree Document Model (STDM) that is based on representing documents in the Suffix Tree format. For the STDM model we proposed a new approach for documents representation and a new formula for computing the similarity between two documents. Thus we propose to build the suffix tree only for any two documents at a time. This approach is faster, it has lower memory consumption and use entire document representation without using methods for disposing nodes. Also for this method is proposed a formula for computing the similarity between documents, which improves substantially the clustering quality. This representation method was validated using HAC - Hierarchical Agglomerative Clustering. In this context we experiment also the stemming influence in the document preprocessing step and highlight the difference between similarity or dissimilarity measures to find “closer" documents.

Protocol Modifications for Improved Co-Channel Wireless LAN Goodput in Partitioned Spaces

Partitions can play a significant role in minimising cochannel interference of Wireless LANs by attenuating signals across room boundaries. This could pave the way towards higher density deployments in home and office environments through spatial channel reuse. Yet, due to protocol limitations, the latest incantation of IEEE 802.11 standard is still unable to take advantage of this fact: Despite having clearly adequate Signal to Interference Ratio (SIR) over co-channel neighbouring networks in other rooms, its goodput falls significantly lower than its maximum in the absence of cochannel interferers. In this paper, we describe how this situation can be remedied via modest modifications to the standard.

Conservation Techniques for Soil Erosion Control in Tobacco-Based Farming System at Steep Land Areas of Progo Hulu Subwatershed, Central Java, Indonesia

This research was aimed at determining the impact of conservation techniques including bench terrace, stone terrace, mulching, grass strip and intercropping on soil erosion at tobacco-based farming system at Progo Hulu subwatershed, Central Java, Indonesia. Research was conducted from September 2007 to September 2009, located at Progo Hulu subwatershed, Central Java, Indonesia. Research site divided into 27 land units, and experimental fields were grouped based on the soil type and slope, ie: 30%, 45% and 70%, with the following treatments: 1) ST0= stone terrace (control); 2) ST1= stone terrace + Setaria spacelata grass strip on a 5 cm height dike at terrace lips + tobacco stem mulch with dose of 50% (7 ton/ ha); 3) ST2= stone terrace + Setaria spacelata grass strip on a 5 cm height dike at terrace lips + tobacco stem mulch with dose of 100% (14 ton/ ha); 4) ST3= stone terrace + tobacco and red bean intercropping + tobacco stem mulch with dose of 50% (7 ton/ ha). 5) BT0= bench terrace (control); 6) BT1= bench terrace + Setaria spacelata grass strip at terrace lips + tobacco stem mulch with dose of 50% (7 ton/ ha); 7) BT2= bench terrace + Setaria spacelata grass strip at terrace lips + tobacco stem mulch with dose of 100% (14 ton/ ha); 8) BT3= bench terrace + tobacco and red bean intercropping + tobacco stem mulch with dose of 50% (7 ton/ ha). The results showed that the actual erosion rates of research site were higher than that of tolerance erosion with mean value 89.08 ton/ha/year and 33.40 ton/ha/year, respectively. These resulted in 69% of total research site (5,119.15 ha) highly degraded. Conservation technique of ST2 was the most effective in suppressing soil erosion, by 42.87%, following with BT2 as much 30.63%. Others suppressed erosion only less than 21%.

Kaolin for Production of Souvenirs

Ranong province has the best kaolin, and it is the most useful of all the clay types used in ceramic making. Until recently, there has been only one community business making ceramics in Ranong province. And this business could not build the mix of body and glaze from their raw material without assistance. Considering these problems, this research is aimed to test the composition of ceramic body and glaze which suit. Kaolin from Ranong is the raw material which these search focuses on. All other raw materials use in the investigation will come from southern Thailand, kaolin and limestone from Ranong province, ball clay from Surat Thani province, white sand from Songkhla province, and feldspar from Nakhon Si Thammarat province. Results can be used to develop the efficiency of industrial production which in return will enhance the business process.

Exploring the Ambiguity Resolution in Spacecraft Attitude Determination Using GNSS Phase Measurement

Attitude Determination (AD) of a spacecraft using the phase measurements of the Global Navigation Satellite System (GNSS) is an active area of research. Various attitude determination algorithms have been developed in yester years for spacecrafts using different sensors but the last two decades have witnessed a phenomenal increase in research related with GPS receivers as a stand-alone sensor for determining the attitude of satellite using the phase measurements of the signals from GNSS. The GNSS-based Attitude determination algorithms have been experimented in many real missions. The problem of AD algorithms using GNSS phase measurements has two important parts; the ambiguity resolution and the determining of attitude. Ambiguity resolution is the widely addressed topic in literature for implementing the AD algorithm using GNSS phase measurements for achieving the accuracy of millimeter level. This paper broadly overviews the different techniques for resolving the integer ambiguities encountered in AD using GNSS phase measurements.

Quick Spatial Assessment of Drought Information Derived from MODIS Imagery Using Amplitude Analysis

The normalized difference vegetation index (NDVI) and normalized difference moisture index (NDMI) derived from the moderate resolution imaging spectroradiometer (MODIS) have been widely used to identify spatial information of drought condition. The relationship between NDVI and NDMI has been analyzed using Pearson correlation analysis and showed strong positive relationship. The drought indices have detected drought conditions and identified spatial extents of drought. A comparison between normal year and drought year demonstrates that the amplitude analysis considered both vegetation and moisture condition is an effective method to identify drought condition. We proposed the amplitude analysis is useful for quick spatial assessment of drought information at a regional scale.

TOSOM: A Topic-Oriented Self-Organizing Map for Text Organization

The self-organizing map (SOM) model is a well-known neural network model with wide spread of applications. The main characteristics of SOM are two-fold, namely dimension reduction and topology preservation. Using SOM, a high-dimensional data space will be mapped to some low-dimensional space. Meanwhile, the topological relations among data will be preserved. With such characteristics, the SOM was usually applied on data clustering and visualization tasks. However, the SOM has main disadvantage of the need to know the number and structure of neurons prior to training, which are difficult to be determined. Several schemes have been proposed to tackle such deficiency. Examples are growing/expandable SOM, hierarchical SOM, and growing hierarchical SOM. These schemes could dynamically expand the map, even generate hierarchical maps, during training. Encouraging results were reported. Basically, these schemes adapt the size and structure of the map according to the distribution of training data. That is, they are data-driven or dataoriented SOM schemes. In this work, a topic-oriented SOM scheme which is suitable for document clustering and organization will be developed. The proposed SOM will automatically adapt the number as well as the structure of the map according to identified topics. Unlike other data-oriented SOMs, our approach expands the map and generates the hierarchies both according to the topics and their characteristics of the neurons. The preliminary experiments give promising result and demonstrate the plausibility of the method.

Color Image Segmentation using Adaptive Spatial Gaussian Mixture Model

An adaptive spatial Gaussian mixture model is proposed for clustering based color image segmentation. A new clustering objective function which incorporates the spatial information is introduced in the Bayesian framework. The weighting parameter for controlling the importance of spatial information is made adaptive to the image content to augment the smoothness towards piecewisehomogeneous region and diminish the edge-blurring effect and hence the name adaptive spatial finite mixture model. The proposed approach is compared with the spatially variant finite mixture model for pixel labeling. The experimental results with synthetic and Berkeley dataset demonstrate that the proposed method is effective in improving the segmentation and it can be employed in different practical image content understanding applications.

Forming of Nanodimentional Structure Parts in Carbon Steels

A way of achieving nanodimentional structural elements in high carbon steel by special kind of heat treatment and cold plastic deformation is being explored. This leads to increasing interlamellar spacing of ferrite-carbide mixture. Decreasing the interlamellar spacing with cooling temperature increasing is determined. Experiments confirm such interlamellar spacing with which high carbon steel demonstrates the highest treatment and hardening capability. Total deformation degree effect on interlamellar spacing value in a ferrite-carbide mixture is obtained. Mechanical experiments results show that high carbon steel after heat treatment and repetitive cold plastic deformation possesses high tensile strength and yield strength keeping good percentage elongation.

Fuzzy C-Means Clustering Algorithm for Voltage Stability in Large Power Systems

The steady-state operation of maintaining voltage stability is done by switching various controllers scattered all over the power network. When a contingency occurs, whether forced or unforced, the dispatcher is to alleviate the problem in a minimum time, cost, and effort. Persistent problem may lead to blackout. The dispatcher is to have the appropriate switching of controllers in terms of type, location, and size to remove the contingency and maintain voltage stability. Wrong switching may worsen the problem and that may lead to blackout. This work proposed and used a Fuzzy CMeans Clustering (FCMC) to assist the dispatcher in the decision making. The FCMC is used in the static voltage stability to map instantaneously a contingency to a set of controllers where the types, locations, and amount of switching are induced.

A Hybrid Recommender System based on Collaborative Filtering and Cloud Model

User-based Collaborative filtering (CF), one of the most prevailing and efficient recommendation techniques, provides personalized recommendations to users based on the opinions of other users. Although the CF technique has been successfully applied in various applications, it suffers from serious sparsity problems. The cloud-model approach addresses the sparsity problems by constructing the user-s global preference represented by a cloud eigenvector. The user-based CF approach works well with dense datasets while the cloud-model CF approach has a greater performance when the dataset is sparse. In this paper, we present a hybrid approach that integrates the predictions from both the user-based CF and the cloud-model CF approaches. The experimental results show that the proposed hybrid approach can ameliorate the sparsity problem and provide an improved prediction quality.

Revisiting the Concept of Risk Analysis within the Context of Geospatial Database Design: A Collaborative Framework

The aim of this research is to design a collaborative framework that integrates risk analysis activities into the geospatial database design (GDD) process. Risk analysis is rarely undertaken iteratively as part of the present GDD methods in conformance to requirement engineering (RE) guidelines and risk standards. Accordingly, when risk analysis is performed during the GDD, some foreseeable risks may be overlooked and not reach the output specifications especially when user intentions are not systematically collected. This may lead to ill-defined requirements and ultimately in higher risks of geospatial data misuse. The adopted approach consists of 1) reviewing risk analysis process within the scope of RE and GDD, 2) analyzing the challenges of risk analysis within the context of GDD, and 3) presenting the components of a risk-based collaborative framework that improves the collection of the intended/forbidden usages of the data and helps geo-IT experts to discover implicit requirements and risks.

Supercompression for Full-HD and 4k-3D (8k)Digital TV Systems

In this work, we developed the concept of supercompression, i.e., compression above the compression standard used. In this context, both compression rates are multiplied. In fact, supercompression is based on super-resolution. That is to say, supercompression is a data compression technique that superpose spatial image compression on top of bit-per-pixel compression to achieve very high compression ratios. If the compression ratio is very high, then we use a convolutive mask inside decoder that restores the edges, eliminating the blur. Finally, both, the encoder and the complete decoder are implemented on General-Purpose computation on Graphics Processing Units (GPGPU) cards. Specifically, the mentio-ned mask is coded inside texture memory of a GPGPU.

Towards Growing Self-Organizing Neural Networks with Fixed Dimensionality

The competitive learning is an adaptive process in which the neurons in a neural network gradually become sensitive to different input pattern clusters. The basic idea behind the Kohonen-s Self-Organizing Feature Maps (SOFM) is competitive learning. SOFM can generate mappings from high-dimensional signal spaces to lower dimensional topological structures. The main features of this kind of mappings are topology preserving, feature mappings and probability distribution approximation of input patterns. To overcome some limitations of SOFM, e.g., a fixed number of neural units and a topology of fixed dimensionality, Growing Self-Organizing Neural Network (GSONN) can be used. GSONN can change its topological structure during learning. It grows by learning and shrinks by forgetting. To speed up the training and convergence, a new variant of GSONN, twin growing cell structures (TGCS) is presented here. This paper first gives an introduction to competitive learning, SOFM and its variants. Then, we discuss some GSONN with fixed dimensionality, which include growing cell structures, its variants and the author-s model: TGCS. It is ended with some testing results comparison and conclusions.

Nonstational Dual Wavelet Frames in Sobolev Spaces

In view of the good properties of nonstationary wavelet frames and the better flexibility of wavelets in Sobolev spaces, the nonstationary dual wavelet frames in a pair of dual Sobolev spaces are studied in this paper. We mainly give the oblique extension principle and the mixed extension principle for nonstationary dual wavelet frames in a pair of dual Sobolev spaces Hs(Rd) and H-s(Rd).

Reversible, Embedded and Highly Scalable Image Compression System

In this work a new method for low complexity image coding is presented, that permits different settings and great scalability in the generation of the final bit stream. This coding presents a continuous-tone still image compression system that groups loss and lossless compression making use of finite arithmetic reversible transforms. Both transformation in the space of color and wavelet transformation are reversible. The transformed coefficients are coded by means of a coding system in depending on a subdivision into smaller components (CFDS) similar to the bit importance codification. The subcomponents so obtained are reordered by means of a highly configure alignment system depending on the application that makes possible the re-configure of the elements of the image and obtaining different importance levels from which the bit stream will be generated. The subcomponents of each importance level are coded using a variable length entropy coding system (VBLm) that permits the generation of an embedded bit stream. This bit stream supposes itself a bit stream that codes a compressed still image. However, the use of a packing system on the bit stream after the VBLm allows the realization of a final highly scalable bit stream from a basic image level and one or several improvement levels.

An Experiment on Personal Archiving and Retrieving Image System (PARIS)

PARIS (Personal Archiving and Retrieving Image System) is an experiment personal photograph library, which includes more than 80,000 of consumer photographs accumulated within a duration of approximately five years, metadata based on our proposed MPEG-7 annotation architecture, Dozen Dimensional Digital Content (DDDC), and a relational database structure. The DDDC architecture is specially designed for facilitating the managing, browsing and retrieving of personal digital photograph collections. In annotating process, we also utilize a proposed Spatial and Temporal Ontology (STO) designed based on the general characteristic of personal photograph collections. This paper explains PRAIS system.

A P-SPACE Algorithm for Groebner Bases Computation in Boolean Rings

The theory of Groebner Bases, which has recently been honored with the ACM Paris Kanellakis Theory and Practice Award, has become a crucial building block to computer algebra, and is widely used in science, engineering, and computer science. It is wellknown that Groebner bases computation is EXP-SPACE in a general setting. In this paper, we give an algorithm to show that Groebner bases computation is P-SPACE in Boolean rings. We also show that with this discovery, the Groebner bases method can theoretically be as efficient as other methods for automated verification of hardware and software. Additionally, many useful and interesting properties of Groebner bases including the ability to efficiently convert the bases for different orders of variables making Groebner bases a promising method in automated verification.

An Algorithm for Computing the Analytic Singular Value Decomposition

A proof of convergence of a new continuation algorithm for computing the Analytic SVD for a large sparse parameter– dependent matrix is given. The algorithm itself was developed and numerically tested in [5].

Developing of Fragility Curve for Two-Span Simply Supported Concrete Bridge in Near-Fault Area

Bridges are one of the main components of transportation networks. They should be functional before and after earthquake for emergency services. Therefore we need to assess seismic performance of bridges under different seismic loadings. Fragility curve is one of the popular tools in seismic evaluations. The fragility curves are conditional probability statements, which give the probability of a bridge reaching or exceeding a particular damage level for a given intensity level. In this study, the seismic performance of a two-span simply supported concrete bridge is assessed. Due to usual lack of empirical data, the analytical fragility curve was developed by results of the dynamic analysis of bridge subjected to the different time histories in near-fault area.