A Geometric Algorithm for Learning Oblique Decision Trees

In this paper we present a novel algorithm for learning oblique decision trees. Most of the current decision tree algorithms rely on impurity measures to assess goodness of hyperplanes at each node. These impurity measures do not properly capture the geometric structures in the data. Motivated by this, our algorithm uses a strategy, based on some recent variants of SVM, to assess the hyperplanes in such a way that the geometric structure in the data is taken into account. We show through empirical studies that our method is effective.

Clustering in Concept Association Networks

We view association of concepts as a complex network and present a heuristic for clustering concepts by taking into account the underlying network structure of their associations. Clusters generated from our approach are qualitatively better than clusters generated from the conventional spectral clustering mechanism used for graph partitioning.

Resolving Ambiguities in Confused Online Tamil Characters with Post Processing Algorithms

This paper addresses the problem of resolving ambiguities in frequently confused online Tamil character pairs by employing script specific algorithms as a post classification step. Robust structural cues and temporal information of the preprocessed character are extensively utilized in the design of these algorithms. The methods are quite robust in automatically extracting the discriminative sub-strokes of confused characters for further analysis. Experimental validation on the IWFHR Database indicates error rates of less than 3 % for the confused characters. Thus, these post processing steps have a good potential to improve the performance of online Tamil handwritten character recognition.

Behaviour of Bi-adhesive Joints

The use of relatively low modulus adhesive at the ends of overlap in a bi-adhesive bondline of a bonded joint can reduce the stress concentration significantly and, therefore, potentially lead to higher strength of the joint. This study presents the two-dimensional and three-dimensional nonlinear (geometric and material) finite element analyses of adhesively bonded single lap joints having modulus-graded bondline under monotonic loading conditions. The adhesives were modelled as an elasto-plastic multi-linear material, while the substrates were regarded as both linear elastic and bi-linear elasto-plastic material. The computational simulations have been performed to investigate the bondline behaviour by studying the stress and strain distributions both at the mid-plane as well as at the interface of the bondline. It has been observed that the static strength is higher for joints with bi-adhesive bondlines compared to those with single adhesives in bondline. Higher joint strength has also been observed for optimum bi-adhesive bondline ratio through parametric studies. Effects of load level, and bondline thickness on stress distribution in the bi-adhesive bondline have also been studied. 3D analysis results reveal the existence of complex multi-axial stress/strain state at the ends of the overlap in the bondline which cannot be observed in 2D plane strain analysis. About 1/3rd of the width of the joint from the free edge in the width direction has 3D stress state, especially in the compliant adhesive of the bondline. Magnitudes of longitudinal and lateral stress/strain components are comparable to peel stress/strain components. It has also been analytically shown that the in-plane global stiffness of the joint remains unaffected by modulus gradation of the bondline adhesive. (C) Koninklijke Brill NV, Leiden, 2010.

State of Charge of Lead Acid Battery

Lead acid batteries are used in hybrid vehicles and telecommunications power supply. For reliable operation of these systems, an indication of state of charge of battery is essential. To determine the state of charge of battery, current integration method combined with open circuit voltage, is being implemented. To reduce the error in the current integration method the dependence of available capacity as a function of discharge current is determined. The current integration method is modified to incorporate this factor. The experimental setup built to obtain the discharge characterstics of the battery is presented.

Real-Time Simulation of Electrical Machines on FPGA Platform

This paper presents real-time simulation models of electrical machines on FPGA platform. Implementation of the real-time numerical integration methods with digital logic elements is discussed. Several numerical integrations are presented. A real-time simulation of DC machine is carried out on this FPGA platform and important transient results are presented. These results are compared to simulation results obtained through a commercial off-line simulation software

An auction algorithm for procuring wireless channel in a heterogenous wireless network

In this paper, we develop a novel auction algorithm for procuring wireless channel by a wireless node in a heterogeneous wireless network. We assume that the service providers of the heterogeneous wireless network are selfish and non-cooperative in the sense that they are only interested in maximizing their own utilities. The wireless user needs to procure wireless channels to execute multiple tasks. To solve the problem of the wireless user, we propose a reverse optimal (REVOPT) auction and derive an expression for the expected payment by the wireless user. The proposed auction mechanism REVOPT satisfies important game theoretic properties such as Bayesian incentive compatibility and individual rationality.

Wavelength/Time Multiple-Pulses-per-Row codes: Construction and verification

Two dimensional Optical Orthogonal Codes (OOCs) named Wavelength/Time Multiple-Pulses-per-Row (W/T MPR) codes suitable for use in incoherent fiber-optic code division multiple access (FO-CDMA) networks are reported in [6]. In this paper, we report the construction of W/T MPR codes, using Greedy Algorithm (GA), with distinct 1-D OOCs [1] as the row vectors. We present the W/T MPR codes obtained using the GA. Further, we verify the correlation properties of the generated W/T MPR codes using Matlab.

A generalized Linear Programming based approach to optimal divisible load scheduling

In this paper we propose a general Linear Programming (LP) based formulation and solution methodology for obtaining optimal solution to the load distribution problem in divisible load scheduling. We exploit the power of the versatile LP formulation to propose algorithms that yield exact solutions to several very general load distribution problems for which either no solutions or only heuristic solutions were available. We consider both star (single-level tree) networks and linear daisy chain networks, having processors equipped with front-ends, that form the generic models for several important network topologies. We consider arbitrary processing node availability or release times and general models for communication delays and computation time that account for constant overheads such as start up times in communication and computation. The optimality of the LP based algorithms is proved rigorously.

Viscous flow computations using a meshless solver, LSFD-U

The Upwind-Least Squares Finite Difference (LSFD-U) scheme has been successfully applied for inviscid flow computations. In the present work, we extend the procedure for computing viscous flows. Different ways of discretizing the viscous fluxes are analysed for the positivity, which determines the robustness of the solution procedure. The scheme which is found to be more positive is employed for viscous flux computation. The numerical results for validating the procedure are presented.

Parallelization of an unstructured data based cell centre finite volume code, HIFUN-3D

This work describes the parallelization of High Resolution flow solver on unstructured meshes, HIFUN-3D, an unstructured data based finite volume solver for 3-D Euler equations. For mesh partitioning, we use METIS, a software based on multilevel graph partitioning. The unstructured graph used for partitioning is associated with weights both on its vertices and edges. The data residing on every processor is split into four layers. Such a novel procedure of handling data helps in maintaining the effectiveness of the serial code. The communication of data across the processors is achieved by explicit message passing using the standard blocking mode feature of Message Passing Interface (MPI). The parallel code is tested on PACE++128 available in CFD Center

A one point shock capturing kinetic scheme for hyperbolic conservation laws

We have presented a new low dissipative kinetic scheme based on a modified Courant Splitting of the molecular velocity through a parameter φ. Conditions for the split fluxes derived based on equilibrium determine φ for a one point shock. It turns out that φ is a function of the Left and Right states to the shock and that these states should satisfy the Rankine-Hugoniot Jump condition. Hence φ is utilized in regions where the gradients are sufficiently high, and is switched to unity in smooth regions. Numerical results confirm a discrete shock structure with a single interior point when the shock is aligned with the grid.

La música en la fiesta del dios Xipe Totec

In Aztec mythology and religion, Xipe Totec ("our lord the flayed one") was a life-death-rebirth deity, god of agriculture, vegetation, the east, disease, spring, goldsmiths, silversmiths and the seasons. The music used for his worship has been described by a diversity of documents (carved stones, depicted codices, and chronicles made by the first European friars arrived to Mexico). This article explores the symbolic content of these descriptions, especially in association with Xochipilli Macuilxochitl, master of music and poetry.

Puunoston kehittäminen Stora Enso Metsän Helsingin palvelupisteessä

The operation environment in the roundwood trade in Finland in the 1990’s include several changes. They are changes in the structure of non-industrial private forest (NIPF) ownership, forest taxation, in forest legislation, in price recommendation agreement, diminishing resources of forestry extension services, etc. At the same time, the roundwood demand has been rising. All these developments cause uncertainty in wood procurement organisations, and call for research to find out how to adapt into the changing environment. The objective of this study is to produce information for roundwood purchasing planning and cus-tomer satisfaction management to be used by Stora Enso Metsä Customer Service, Helsinki. For this pur-pose, data needs to be gathered about the urban NIPFs and their forest estates, behaviour related to forestry and timber-selling, customer satisfaction in their latest timber selling transaction, and their opinions about Enso’s new customer service office and its service concept. To fulfil the objective of the study, a NIPF -owner -survey (N=1064, response rate 39,7%) was con-ducted in October 1998-January 1999. The sample was made on the basis of the marketing database of Stora Enso Oyj Forest Customer Service in Helsinki. In planning the frame of reference of the empirical study, the model of service quality by Grönroos was applied. The following aspects were included in the 7-page questionnaire: demographic, sosio-economic and forest estate background, relation to the forest service supply, behaviour related to forestry, timber-selling motives and behaviour, last contact organisation and its image in forestry business, expectations and percep-tions in the latest timber-selling transactions, and behavioural intentions. The results revealed that the share of women, pensioners and academically educated people among forest owners was quite high. The majority of the forest estates of the metropolitan forest owners were situ-ated in the provinces of South Finland and East Finland. The average forest estate area was considerably smaller than in a previous study. Economic and recreational objectives were most important in the use of forests. Forest Associations were involved in half of the roundwood sales transactions of the respondents in the metropolitan area. The wood quantity of transactions was considerably higher than the average in the whole country. Bank-organised forest-related activities, taxation infos and trips to the forest were the most popular activities. Among the services, silvicultural advices were needed mostly and stub treatment least. Brochure material related to stumpage timber sales and taxation were considered most important compared to material related to delivery sales. The service expectations were at highest for women and they were less satisfied with the service than men. 2nd and 3rd generation residents of the metropolitan area thought about the new customer service concept more positively than the 1st generation residents. Internet users under 60 years thought more positively about new satellite picture-based woodlot search concept. Cross-tabulation of factor scores against background variables indicated that women with relatively low education level a greater need to sell roundwood than entrepreneurs, white-collar workers and directors, and Internet users. Suspiciousness towards timber procurement organisations was relatively strong among women and those whose forest income share of the total income was either null or over 20 %. The average customer satisfaction score was negative in all nine questions. Statistical differences be-tween different companies did not exist in the average satisfaction scores. Stora Enso’s Helsinki forest cus-tomer service could choose the ability to purchase all timber grades as its competitive advantage. Out of nine service dimension included in the questionnaire, in this particular service dimension, Enso’s Helsinki forest customer service’s score exceeded most all organisations’ average customer satisfaction score. On the basis of importance – performance matrix, advice and quidance could have been provided more to the forest owners in their latest timber–selling transaction.

Regenerating Codes for Distributed Storage Networks

In a storage system where individual storage nodes are prone to failure, the redundant storage of data in a distributed manner across multiple nodes is a must to ensure reliability. Reed-Solomon codes possess the reconstruction property under which the stored data can be recovered by connecting to any k of the n nodes in the network across which data is dispersed. This property can be shown to lead to vastly improved network reliability over simple replication schemes. Also of interest in such storage systems is the minimization of the repair bandwidth, i.e., the amount of data needed to be downloaded from the network in order to repair a single failed node. Reed-Solomon codes perform poorly here as they require the entire data to be downloaded. Regenerating codes are a new class of codes which minimize the repair bandwidth while retaining the reconstruction property. This paper provides an overview of regenerating codes including a discussion on the explicit construction of optimum codes.