In this paper, technique for order of preference by similarity to ideal solution(TOPSIS) method is used to find the best compromising design of intake manifold for a 3-cylinder engine considering mean value of torque, torque at 3500 rpm, mean value of brake mean specific consumption (BSFC) and BSFC at 3500 rpmas four objective functions. To calculate the objective functions, engine simulation i...

In this paper we consider the use of non-uniform QAM constellations (Quadrature Amplitude Modulation) for broadcast or multicast transmissions within WCDMA-based systems (Wideband Code Division Multiple Access). These constellations are employed so as to increase the transmission efficiency, since they are able to provide unequal error protection. This allows the transmission of several simulta...

When structures are subjected to strong ground motion excitations, structural elements may be prone to yielding, and consequently experience significant levels of inelastic behavior. The effects of inelastic behavior on the distribution of peak floor loads are not explicitly accounted for in current seismic code procedures. During recent years, many studies have been conducted to develop new de...

LinkedVis implements a JavaScript and SVG data visualisation toolkit that can be used to generate a wide range of interactive information visualisations from RDF graphs using a grammar of graphics style syntax extended with operations for structural transformation of the RDF data graph. Additionally, LinkedVis visualisations make it possible to embed meta-data about the visualisation and the wa...

Persistent programming languages exhibit several requirements that affect the generation of native code, namely: garbage collection; arbitrary persistence of code, data and processes; dynamic binding; and the introduction of new code into a running system. The problems of garbage collection are not unique to persistent systems and are well understood: both code and data may move during a comput...

A new decoding algorithm for geomelrically uniform trellis codes exploiting the group structure of the codes is presented. The algorithm complexity does not depend on the number of states of the trellis describing the code. Performance of the algorithm are evaluated through simulation, and its complexity is compared to the Viterbi algorithm.