Demagnetization properties of IPM and SPM motors used in the high demanding automotive application Purpose - In order to reduce CO2 emissions of new cars many hydraulic and mechanical systems like e.g.: water pump, oil pump, power steering, clime compressor have been exchanged with pure electromechanical systems, which are driven only on request. This helps to reduce fuel consumption. This trend requires of utilization of modern brushless electric motors, which are controlled from power electronic control unit - ECU. In today's car can be found between 30 to 150 electric motors. Many of them are still simple brush type with ferrite magnets. Also in this area, drift in the direction of brushless motors can bee seen, because of higher efficiency, longer lifetime, lower noise, better EMC and more controllable torque vs speed characteristic. There are different technological solutions, which can been used in the area of brushless motors in order to reduce size and cost of single component. One major factor of BLDC/AC motor is rear earth permanent magnet material used during production. A magnet material cost could be in the range from 30 percent (basis price 2010) up to 90 percent (basis price 2011) of total material motor cost, depends on actual rear earth material price level. In order to reduce magnet cost, the aim of this paper is to find the most robust motor design, which can be resistant against maximum temperature and phase current amplitude for the same magnet material properties, coercive force - Hcj. This behaviour is called demagnetization property. Design/methodology/approach - Analysis was performed based on review of literature, own theoretical and practical research and experience in the area of electromechanical systems for automotive application. During motor analysis computer numerical simulation method, CAD and experiment were used. Findings - As a result, comparison of different motors' topologies with different properties of magnet materials is presented. The worked out methodology shows very good correlation between simulations and measurements. This work can be used in order to reduce test effort and reduce cost of design. Practical implications - The presented methodology reduces for new designs test effort and development cost and gives an implication of robust motor topology for demagnetization effects. Originality/value - It is the first paper where demagnetization effects have been studied theoretically and in laboratory in order to find the most robust design, reduce magnet cost by reduction of dysprosium content and develop simulation procedure for analysis of demagnetizations behaviours of interior and surface permanent magnet.

O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O

coercive force
automotive application
dysprosium

brushless motor
interior permanent magnet - ipm
low weight
mass production
cost-effectiveness
neodymium
automotive components industry


A novel direct search approach for combined heat and power dispatch A novel approach based on the direct search method (DSM) is proposed for the solution of combined heat and power (CHP) dispatch problem. To deal with the mutual dependency of multiple-demand and heatpower capacity of cogeneration units, the penalty functions should be considered in DSM to enforce the corresponding violated constraints from the infeasible region into the feasible region. Many nonlinear characteristics of the generator can be handled properly in the direct search procedure. To increase the possibility of exploring the search space where the global optimal solution exists, another effective strategy based on a successive refinement search technique is also proposed to guarantee a possibly complete examination of the solution space. Numerical experiments are included to demonstrate the proposed direct search approach can obtain a higher quality solution than many existing techniques.

O O O O O O B I I I I O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

cogeneration
combined heat and power dispatch
direct search method


Fourth- and tenth-order compact finite difference solutions of perturbed circular vortex flows In this study, high-order compact finite difference calculations are reported for 2D unsteady incompressible circular vortex flow in primitive variable formulation. The fourth-order Runge-Kutta temporal discretization is used together with fourth- or tenth-order compact spatial discretization. Dependent on the perturbation initially imposed, the solutions display a tripole, triangular or square vortex. The comparison of the predictions with the detailed spectral calculations of Kloosterziel and Carnevale (J. Fluid Mech. 1999; 388:217-257) shows that the vorticity fields are very well captured. The spectral resolution of the present method was quantified from the decomposition of the vorticity distribution in its azimuthal components and compared with reported spectral results. Using identical grid resolution to the reference results yields negligible differences in the main features of the flow. The perturbation amplitude and its first harmonic are virtually identical to the reference results for both fourth- or tenth-order spatial discretization, as theoretically expected but seldom a posteriori verified. The differences between the two spatial discretizations appear only for coarser grids, favouring the tenth-order discretization. Copyright (c) 2005 John Wiley & Sons, Ltd.

O O O O O O O O O B I O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

high-order
compact finite differences
incompressible navier stokes


simulation based study of wireless rf interconnects for practical cmos implementation An electromagnetic analysis for the practical implementation of on-chip antennas to be used as wireless IC interconnects is presented. The undesired electromagnetic signal coupling between the on-chip antennas and the metal interconnects is characterized under varying geometries and placement of the metal interconnects. The variations in the transmission gain between the antenna pair due to the typical complementary metal oxide semiconductor (CMOS) manufacturing requirements are presented. Using a 3-D finite element method (FEM) based full wave electromagnetic solver, it is shown that the antenna characteristics are significantly impacted by the presence of the essential epitaxial layer and the required minimum metal utilization. It is also shown in a 250nm CMOS technology that there can be a significant electromagnetic signal coupling between the on-chip transmitting antenna and the metal interconnects on a die (-12.09dB for a 1.6mm long, 2?m wide interconnect at a distance of 1?m from the antenna). Design considerations are presented for the metal interconnects in the presence of on-chip antennas in order to minimize the undesired electromagnetic signal coupling.

O O O O O O B O O O O O B O O O O O O O O O O O O O O B O O O O B O O O O O O O O O B O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O B O O


Identification of tumor-immune system via recurrent neural network Cancer immunotherapy is an emerging therapy for cancer disease treatment which stimulates immune systems to fight against tumor cells. In this paper, a back propagation neural network with some feedbacks from hidden layer is used as a method of identification for one validated mathematical model. Since it is not possible to model complex system due to void of information and knowledge to model all complexity of complex system, identification methods are effective tools for modeling ill-defined system. Afterward, it is possible to perform control methods on the estimated model to reach the clinical goals. The simulation results have shown the correctness of the identification process.

B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O

multi-layer perceptron
artificial neural network
immune system


An efficient iterative algorithm for the approximation of the fast and slow dynamics of stiff systems The relation between the iterative algorithms based on the computational singular perturbation (CSP) and the invariance equation (IE) methods is examined. The success of the two methods is based on the appearance of fast and slow time scales in the dynamics of stiff systems. Both methods can identify the low-dimensional surface in the phase space (slow invariant manifold, SIM), where the state vector is attracted under the action of fast dynamics. It is shown that this equivalence of the two methods can be expressed by simple algebraic relations. CSP can also construct the simplified non-stiff system that models the slow dynamics of the state vector on the SIM. An extended version of IE is presented which can also perform this task. This new IE version is shown to be exactly similar to a modified version of CSP, which results in a very efficient algorithm, especially in cases where the SIM dimension is small, so that significant model simplifications are possible.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

invariant manifolds
model reduction
multiple time scales
asymptotic analysis
singular perturbation analysis


An Adaptive Comb Filter with Flexible Notch Gain This paper proposes an adaptive comb filter with flexible notch gain. It can appropriately remove a periodic noise from an observed signal. The proposed adaptive comb filter uses a simple LMS algorithm to update the notch gain coefficient for removing the noise and preserving a desired signal, simultaneously. Simulation results show the effectiveness of the proposed comb filter.

O O B I O O O O O O O O O B I O O O O O O O O O O O O O O O O O O B I O O O B O O O O O O O O O O O O O O O O O O O O O O O O O B I


Does the use of structured reporting improve usability? A comparative evaluation of the usability of two approaches for findings reporting in a large-scale telecardiology context Poor usability leads to a low adoption rate of telemedicine systems. Mode of input, free-text or structured report, influences usability. Usability and user satisfaction are higher for structured report interfaces in telecardiology.

O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O B

system usability scale
keystroke-level model
heuristic usability evaluation
dicom sr


Fixed points of correspondences defined on cone metric spaces In the present note, we investigate the fixed points of correspondences defined on cone metric spaces satisfying a conditionally contractive condition.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

fixed point
cone metric space
correspondence
banach lattice


Personal content management system: A semantic approach The amount of multimedia resources that is created and needs to be managed is increasing considerably. Additionally, a significant increase of metadata, either structured (metadata fields of standardized metadata formats) or unstructured (free tagging or annotations) is noticed. This increasing amount of data and metadata, combined with the substantial diversity in terms of used metadata fields and constructs, results in severe problems to manage and retrieve these multimedia resources. Standardized metadata schemes can be used but the plethora of these schemes results in interoperability issues. In this paper, we propose a metadata model suited for personal content management systems. We create a layered metadata service that implements the presented model as an upper layer and combines different metadata schemes in the lower layers. Semantic web technologies are used to define and link formal representations of these schemes. Specifically, we create an ontology for the DIG35 metadata standard and elaborate on how it is used within this metadata service. To illustrate the service, we present a representative use case scenario consisting of the upload, annotation, and retrieval of multimedia content within a personal content management system.

B I I O O O O O O O O O O O O O O O O O O O O O O O O O B O O B O O O B O O O O O O O O O O O O O O O B O O O O O O O O O B O O O O O O O O O O O O O O O B O O O O O O O O O O O O B O O O O O O O B O O O B I I O O O O O B O O O O O O O O O O O O O B O O O O O B I O O O O O O O O O O O O O O O O B O O O B O O O O O O O O O O B O O O O O O O O O O O O O O O O B O O O O O O O B I I O

personal content management
semantic web
metadata
annotation
ontology
interoperability


A next generation multimedia call center for Internet commerce: IMC Human assistance, as well as automated service, is necessary for providing more convenient services to customers on the Internet-based commerce system. Call centers have been typically human-based service systems. However, the services of existing public switched telephone network-based call centers are not enough to meet the needs of customers on the Internet. Most of them have been designed without considering the interaction involved in shopping on the Internet In our research, we design a call center named IMC (Internet-based multimedia call center) that can be integrated with an Internet shopping mall. It contains 2 parts: an Internet multimedia dialogue system and a human agent assisting system. The Internet multimedia dialogue system is an Internet and multimedia version of the interactive voice response service of computer telephony integration-based call centers because it provides access to the multimedia Web page along with the recorded voice explanation through the Internet. The human agent assisting system aims to select the most appropriate human agents in the call center and support them in providing high-quality individualized information for each customer. IMC is a real-time, human-embedded system that can provide high-quality services cost-effectively for Internet commerce.

O O O O B I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O B I O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O B I

call center
internet commerce
internet shopping mall

electronic commerce
computer telephony integration
human-embedded system


Wind tunnel experiments of tracer dispersion downwind from a small-scale physical model of a landfill Wind tunnel experiments have been carried out on a small-scale physical model of a municipal waste landfill (MWL) in the CRIACIV (Research Centre of Building Aerodynamics and Wind Engineering) environmental wind tunnel in Prato (Italy). The MWL model simulates a landfill whose surface is higher than the surrounding surface, applying a 1:200 scaling factor. Modelling an area source such as landfill is a difficult task for numerical models due to turbulence phenomena that modifies the flow near the source increasing ground level concentration (GLC). For the specific task, a new set-up of the wind tunnel has been developed, with respect to previous studies carried out on line and point sources physical models. The tracer used in the experiments was ethylene, suitable for non-buoyant plume conditions, typical for MWL emissions. A detailed result database has been obtained in terms of GLC and concentration profiles as well as flow turbulence and velocity field characterisation.

B I O O O O O O O O O O O O B B I O O O O O O O O O O O O O O B O O O O O O O O O O O O O B I O O O O O O O O B O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O

wind tunnel
concentration profiles
landfill


Exclusively Your's: Dynamic Individuate Search by Extending User Profile A universal search engine is unable to provide a personal touch to a user query. To overcome the deficiency of a universal search engine, vertical search engines are used, which return search results from a specific domain. An alternate option is to use a personalized search system. In our endeavor to provide personalized search results, the proposed system, Exclusively Your's, observes a user browsing behavior and his actions. Based on the observed user behavior, it dynamically constructs user profile which consists of some terms that are related to user's interest. The constructed profile is later used for query expansion. The goal of research work in this paper is not to provide all the relevant results, but a few high quality personalized search results at the top of ranked list, which in other words means high precision. We performed experiments by personalizing Google, Yahoo, and Naver (widely used search engine in Korea). The results show that using Exclusively Your's, a search engine yields significant improvement. We also compared the user profile constructed by the proposed approach with other similar personalization approaches; the results show a marginal increase in precision.

O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O B I O O O O O O O O O O O O O O O O O B O O O O O O O O O

summarization
weighted index
anchor text
hyperlink


Constrained diffusion-limited aggregation in 3 dimensions Diffusion-limited aggregation (DLA) has usually been studied in 2 dimensions as a model of fractal growth processes such as river networks, plant branching, frost on glass, electro-deposition, lightning, mineral deposits, and coral. Here, the basic principles are extended into 3 dimensions and used to create, among other things, believable models of root systems. An additional innovation is a means of constraining the growth of the 3D DLA by a surface or containing it within a vessel.

O O B O O O O B B O O O O O O O O O O O B O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O


skill-specific spoken dialogs in a reading tutor that listens Project LISTEN's Reading Tutor listens to children read aloud. A controlled study indicates that the Reading Tutor helps children's reading comprehension. However, the results for word attack (decoding) skills and word identification skills were not statistically better than in the control condition. Our thesis therefore proposes to develop skill-specific dialogs based on cognitive skill models and successful tutoring strategies. These dialogs will be dynamically assembled by the Reading Tutor and include text, speech, illustrations, and dialog parameters. We hypothesize that such dialogs will improve elementary students' reading abilities.

O O O O O B O O O O O B O O O B O O O O O O O O B O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O B O

spoken dialog
intelligent tutoring systems
speech recognition


A difference expansion oriented data hiding scheme for restoring the original host images This paper proposes a lossless data embedding scheme that exploits the difference expansion of the pixels to conceal large amount of message data in a digital image. The proposed scheme takes into consideration the correlation between the pixel and its surrounding pixels to determine the degree of the difference expansion for message data embedding. The performance has been evaluated in terms of image distortion, payload capacity, as well as embedding rate. The experimental results show that the scheme is capable of providing a great payload capacity, and the image quality of the embedded image is better than that of Tians and Celiks schemes for a gray-level image. What is more, for a color image, the proposed scheme outperforms Alattars scheme at low PSNR. In addition, the proposed scheme can completely restore the original image after data extraction.

O B I O O O O O O O O O O O O O O B I I O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

lossless data embedding
difference expansion

information hiding
reversible data hiding


Bit-parallel random number generation for discrete uniform distributions When a die is cast, the outcome is one of the six sides, i.e. the outcome is discrete and uniformly distributed over the range R = {1, 2, 3, 4, 5, 6}. Generating random numbers with such a distribution is very easy: obtain a random number w epsilon W, the domain of the random numbers, and take (w mod \R\) + 1. However, many uniform discrete distributions have a rather short range, e.g., \R\ = 6 in a dice game, and \R\ = 3 for the walking directions of a 2-dimensional nonreversal random walk. The number w is typically a machine word, i.e. log(2)(\W\) approximate to 32 in a 32-bit computer, so generating a log(2)(\R\)-bit random number has consumed about 32 random bits. When \W\ much greater than \R\, it is wasteful and hence inefficient. This paper presents an efficient algorithm for generating random numbers for the distributions with \R\ discrete uniform outcomes. The algorithm uses parallel bit-wise operations on machine words. The performance results of the algorithm are presented. The statistical quality of the random numbers generated from this algorithm is also discussed. (C) 2002 Elsevier Science B.V. All rights reserved.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

random number generators
monte carlo simulation
random walks
discrete uniform distribution


a metaobject protocol for clforjava CLforJava is a new implementation of Common Lisp that intertwines its architecture and operation with Java. The authors describe a new architecture for a CLOS MOP that supports transparent, bi-directional access between Lisp and Java. The access requires no special techniques nor syntactic mechanisms on the part of the programmer - being either Java or Lisp. The core of the new MOP is a data structure that melds the fundamental structures of Java instances (N-tuples) and CLOS instances (2-tuples) in such a way that the respective object systems can interact without cumbersome translations. Methods from their respective object systems can interact freely. We discuss certain aspects of the respective MOPs that prevent a complete integration and replacement of one system by the other.

O O O O O O O O O O O O B O O O O O O O B O O O O O O O O B O O O O O O O B O B O O O O O O O O O O O O O O O O O O B O B O O O O O O O O O O O O O O O O B O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


A systematic evaluation of disk imaging in EnCase 6.8 and LinEn 6.1 Tools for disk imaging (or more generally speaking, digital acquisition) are a foundation for forensic examination of digital evidence. Therefore it is crucial that such tools work as expected. The only way to determine whether this is the case or not is through systematic testing of each tool. In this paper we present such an evaluation of the disk imaging functions of EnCase 6.8 and LinEn 6.1, conducted on behalf of the Swedish National Laboratory of Forensic Science. Although both tools performed as expected under most circumstances, we identified cases where flaws that can lead to inaccurate and incomplete acquisition results in LinEn 6.1 were exposed. We have also identified limitations in the tool that were not evident from its documentation. In addition summarizing the test results, we present our testing methodology, which has novel elements that we think can benefit other evaluation projects.

O O O O O O O B O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

acquisition of digital data
hard drive imaging
testing forensic tools
linux


parallel simulation of devs and cell-devs models on windows-based pc cluster systems The growing popularity of Networks of Workstations (NOW) in scientific computation has drawn increasing interest from the M&S community. This paper addresses the issue of parallel discrete-event simulation of DEVS and Cell-DEVS models on a Microsoft Windows-based cluster system comprising interconnected general-purpose personal computers. We present the architecture and features of PCD++Win, a parallel simulator that takes advantage of the multi-purpose graphical user interface of the DeinoMPI middleware for construction of ad-hoc PC clusters and configuration of simulation environment. This environment significantly reduces the learning curve for general users and the cost of the simulation platform. PCD++Win has been developed using a modular approach that promotes code reuse and allows for easy switching to other middleware technologies. The portability of the simulator is enhanced with multi-platform programming and compilation techniques. Moreover, it leaves open the possibility of further extensions such as Web-based distributed simulation and database-based model construction by leveraging the native support of Microsoft Visual Studio. The experiments demonstrate the capability of the new simulator, making it an ideal M&S toolkit for tapping the computational power of general-purpose desktop computers.

B I O B O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

devs
parallel simulation
cluster systems


A computable version of the Daniell-Stone theorem on integration and linear functionals For every measure mu, the integral I: f bar right arrow integral f d mu is a linear functional on the set of real measurable functions. By the Daniell-Stone theorem, for every abstract integral Lambda: F --> R on a stone vector lattice F of real functions f : Omega --> R there is a measure mu such that integral f d mu = Lambda(f) for all f is an element of F. In this paper we prove a computable version of this theorem. (C) 2006 Elsevier B.V. All rights reserved.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

computability
computable analysis
measure theory
daniell-stone theorem


Factors influencing intention to use e-government services among citizens in Malaysia This study is an exploratory study on the e-government in Malaysia. With the liberalization and globalization, Internet has been used as a medium of transaction in almost all aspects of human living. This study investigates the factors that influencing the intention to use e-government service among Malaysians. This study integrates constructs from the models of Technology Acceptance Model (TAM), Diffusion of Innovation (DOI) which been moderated by culture factor and Trust model with five dimensions. The study was conducted by surveying a broad diversity of citizens in Malaysia community. A structured questionnaire was used to collect data from 195 respondents but only 150 of the respondents with complete answers participating in the study. The result of the analysis showed that trust, perceived usefulness, perceived relative advantage and perceived image, respectively, has a direct positive significant relationship towards intention to use e-government service and perceived complexity has a significant negative relationship towards intention to use e-government service. While perceived strength of online privacy and perceived strength of non-repudiation have a positive impact on a citizen's trust to use e-government service. However, the uncertainty avoidance (moderating factor) used in the study has no significant effect on the relationship between the innovation factors (complexity, relative advantage and image) and intention to use e-government service. Finally in comparing the explanatory power of the entire intention based model (TAM, DOI and Trust) with the studied model, it has been found that the DOI model has a better explanatory power.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

e-government
adoptions
malaysian services


REDUCING THE ENERGY DISSIPATION OF THE ISSUE QUEUE BY EXPLOITING NARROW IMMEDIATE OPERANDS In contemporary superscalar microprocessors, issue queue is a considerable energy dissipating component due its complex scheduling logic. In addition to the energy dissipated for scheduling activities, read and write lines of the issue queue entries are also high energy consuming pieces of the issue queue. When these lines are used for reading and writing unnecessary information bits, such as the immediate operand part of an instruction that does not use the immediate field or the insignificant higher order bits of an immediate operand that are in fact not needed, significant amount of energy is wasted. In this paper, we propose two techniques to reduce the energy dissipation of the issue queue by exploiting the immediate operand files of the stored instructions: firstly by storing immediate operands in separate immediate operand files rather than storing them inside the issue queue entries and secondly by issue queue partitioning based on widths of immediate operands of instructions. We present our performance results and energy savings using a cycle accurate simulator and testing the design with SPEC2K benchmarks and 90 nm CMOS (UMC) technology.

O O O O O O B I O O O B I O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O B I O O O O O O O O O O O B I O O O O B I O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Study of Speed-Dependent Packet Error Rate for Wireless Sensor on Rotating Mechanical Structures Wireless sensors on rotating mechanical structures have rich and fast changing multipath that cannot be easily predicted by conventional regression approaches in time for effective transmission coding or power control, resulting in deteriorated transmission quality. This study aims to study the speed-dependent packet error rate (PER) of wireless sensor radios on rotating mechanical structures. A series of rotating IEEE 802.15.4 sensor radio transmission experiments and vector network analyzer measurements have been conducted to derive and validate a predictive PER model for a fast rotating sensor radio channel based on channel impulse response measurements. The proposed predictive PER model, including power attenuation, bit error rate (BER) and PER sub-models, captures the channel property of rotating sensors based on the received signal strength and the radio receiving sensitivity. The PER model has accurately predicted the PER profile of sensors on a rotating machine tool spindle as well as a rotating plate of a prototype rotation system. The analysis provides an in-depth understanding of how multipath propagation causes the fast power variation and the resulting speed-dependent PER for wireless sensors on rotating mechanical structures.

O O O B I I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

rotating mechanical structure
transmission performance


Crosstalk in VLSI interconnections We address the problem of crosstalk computation and reduction using circuit and layout techniques in this paper, We provide easily computable expressions for crosstalk amplitude and pulse width in resistive, capacitively coupled lines, The expressions hold for nets with arbitrary number of pins and of arbitrary topology under any specified input excitation. Experimental results show that the average error is about 10% and the maximum error is less than 20%. The expressions are used to motivate circuit techniques, such as transistor sizing, and layout techniques, such as wire ordering and wire width optimization to reduce crosstalk.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

coupled noise
signal integrity
timing optimization


A Hybrid Genetic Algorithm for the Energy-Efficient Virtual Machine Placement Problem in Data Centers Server consolidation using virtualization technology has become an important technology to improve the energy efficiency of data centers. Virtual machine placement is the key in the server consolidation technology. In the past few years, many approaches to the virtual machine placement have been proposed. However, existing virtual machine placement approaches consider the energy consumption by physical machines only, but do not consider the energy consumption in communication network, in a data center. However, the energy consumption in the communication network in a data center is not trivial, and therefore should be considered in the virtual machine placement. In our preliminary research, we have proposed a genetic algorithm for a new virtual machine placement problem that considers the energy consumption in both physical machines and the communication network in a data center. Aiming at improving the performance and efficiency of the genetic algorithm, this paper presents a hybrid genetic algorithm for the energy-efficient virtual machine placement problem. Experimental results show that the hybrid genetic algorithm significantly outperforms the original genetic algorithm, and that the hybrid genetic algorithm is scalable.

O B I I O O O B I I O O O O B I O O O O O O O O O O O O O O O O B I I O O O O O B I O O O O O O O O O O B I I O O O O O B I I O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O B I O O O O O O O O O O B I I O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O B I I O O O B I I O O O O O O B I I O O O O O O O O O B I I O O

virtual machine placement
server consolidation
data center
hybrid genetic algorithm


Sensitivity of tapered optical fiber surface plasmon resonance sensors The effect of tapered profiles on the sensitivity of SPR sensor is studied. It is observed that as the taper ratio decreases the sensitivity of proposed sensor for each profile increases up to certain taper ratio where the plasmonic condition is satisfied. In all considered cases, the maximum sensitivity is obtained for sinusoidal tapered profile.

B O O O O B I I O O O O B I O O B O O O O O O O O O O O B I O O B O O O O O O O O O O B I O O O O O O O O O O O O B O O O B I I

sensitivity
tapered profiles
taper ratio
sinusoidal tapered profile
surface plasmon resonance


An image contrast enhancement method based on genetic algorithm Contrast enhancement plays a fundamental role in image/video processing. Histogram Equalization (HE) is one of the most commonly used methods for image contrast enhancement. However, HE and most other contrast enhancement methods may produce un-natural looking images and the images obtained by these methods are not desirable in applications such as consumer electronic products where brightness preservation is necessary to avoid annoying artifacts. To solve such problems, we proposed an efficient contrast enhancement method based on genetic algorithm in this paper. The proposed method uses a simple and novel chromosome representation together with corresponding operators. Experimental results showed that this method makes natural looking images especially when the dynamic range of input image is high. Also, it has been shown by simulation results that the proposed genetic method had better results than related ones in terms of contrast and detail enhancement and the resulted images were suitable for consumer electronic products.

O O B I O O O B I B I O O O O O O O O O O O O O O O O O O O O B I O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O B I O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

contrast enhancement
genetic algorithm
natural looking images


Limits of a conjecture on a leakage-resilient cryptosystem We introduce the Hidden Shares Number Problem, a variant of the Hidden Number Problem. We give a leakage-resilience bound for ElGamal cryptosystem with stateful decryption. We have implemented our attack and give some details about our implementation.

O O O O O O O O O O O O O O O O O O O B I I O O O O O O B O O O O O O O O O O O O O O O O

cryptography
leakage-resilient cryptography
lattice-based attacks


Robust reconstruction of low-resolution document images by exploiting repetitive character behaviour In this paper, we present a new approach for reconstructing low-resolution document images. Unlike other conventional reconstruction methods, the unknown pixel values are not estimated based on their local surrounding neighbourhood, but on the whole image. In particular, we exploit the multiple occurrence of characters in the scanned document. In order to take advantage of this repetitive behaviour, we divide the image into character segments and match similar character segments to filter relevant information before the reconstruction. A great advantage of our proposed approach over conventional approaches is that we have more information at our disposal, which leads to a better reconstruction of the high-resolution (HR) image. Experimental results confirm the effectiveness of our proposed method, which is expressed in a better optical character recognition (OCR) accuracy and visual superiority to other traditional interpolation and restoration methods.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O B O B O

repetition
character segmentation
bimodal distribution


Complexity of Inflammatory Responses in Endothelial Cells and Vascular Smooth Muscle Cells Determined by Microarray Analysis To better understand the molecular basis of vascular cell system behavior in inflammation, we used gene expression microarrays to analyze the expression of 7,075 genes and their response to IL-1? and TNF? in cultures of coronary artery endothelium and smooth muscle derived from a single coronary artery. The most noticeable difference between the cell types was the considerably greater magnitude and complexity of the transcriptional response in the endothelial cells. Two hundred and nine genes were regulated in the endothelium and only 39 in vascular smooth muscle. Among the 209 regulated genes in the endothelium, 99 have not been previously associated with endothelial cell activation and many implicate the endothelium in unconventional roles. For example, the induced genes include several that have only been associated with leukocyte function (e.g., IL-7 receptor, EBI-3 receptor) and others related to antiviral and antibacterial defense (e.g., oligoadenylate synthetase, LMP7, toll-like receptor 4, complement component 3). In addition, 43 genes likely to participate in signal transduction (eg. IL-18 receptor, STK2 kinase, STAF50, ANP receptor, VIP receptor, RAC3, IFP35) were regulated providing evidence that a major effect of TNF? and IL-1? is to alter the potential of the endothelial cell to respond to various other external stimuli.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

tnf-?
interleukin-1 beta
gene expression profiling
gene expression regulation


Partial X-ray photoelectron spectroscopy to constructing neural network model of plasma etching surface A new model to control plasma processes was constructed by combining a backpropagation neural network (BPNN) with X-ray photoelectron spectroscopy (XPS). This technique was evaluated with the data collected during the etching of silicon carbide films at NF3 inductively coupled plasma. The etching characteristics modeled were the etch rate and surface roughness measured by scanning electron microscope and atomic force microscopy, respectively. For systematic modeling, the etching was characterized by means of 24 full factorial experiment plus one center point. The BPNN was trained by the training data composed of XPS spectra corresponding to five major peaks. Prediction performance of trained BPNN model was tested with a test data set, not belonging to the training data. In modeling surface roughness, pure XPS model yielded an improvement of about 24% over PCA-XPS (99% data variance) model. For the etch rate data, the improvement was more than 40% irrespective of the data variances. These results indicate that non-reduced XPS spectra are more effective in constructing a prediction model. XPS models can be utilized to diagnose or control plasma processes.

O O O O O O B I B O B I O O O B O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O B I O O B O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O

surface roughness
neural network
atomic force microscopy
plasma etching
model


Aggregate profit-based caching replacement algorithms for streaming media transcoding proxy systems This work derives a generalized video object profit function from the extended weighted transcoding graph to calculate the individual cache profit of certain versions of a video object, and the aggregate profit from caching multiple versions of the same video object. This proposed function takes into account the popularity of certain versions of an object, the transcoding delay among versions, and the average duration of access of each version. Based on the profit function, cache-replacement algorithms are proposed to reduce the startup delay and network traffic by efficiently caching video objects with the most profits. Two kinds of simulations were conducted to evaluate the performance of the proposed algorithms. These simulations exploit partial viewing traces and complete viewing traces, separately. The results demonstrate that the proposed algorithms outperform the competing algorithms by 15%-39% in delay saving ratio and 5%-10% in byte-hit ratio.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

computer networks
multimedia communication
multimedia streaming
prefix caching
proxy caching
streaming media distribution


refining and reasoning about nonfunctional requirements Nonfunctional requirements (NFR) must be addressed early in the software development cycle to avoid the cost of revisiting those requirements or re-factoring at the later stages of the development cycle. Methods and frameworks that identify and incorporate NFR at each stage of development cycle reduce this cost. The methodology used in this work for refining and reasoning about NFR is based on the NFR framework. This work identifies four NFR types and provides the methodology for developing domain specific NFR by using techniques for converting the requirements into design artifacts per NFR type. The contribution is four NFR types: Functionally Restrictive, Additive Restrictive, Policy Restrictive, and Architecture Restrictive and the software engineering process that provides specific refinements that result in unique architectural and design artifacts. By applying the same functional requirement focus to the different NFR domains it enhances the development process and promotes software quality attributes such as composability, maintainability, evolvability, and traceability.

O O O O B I B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

software engineering
nonfunctional requirements


Model-updated image guidance: Initial clinical experiences with gravity-induced brain deformation Image-guided neurosurgery relies on accurate registration of the patient, the preoperative image series, and the surgical instruments in the same coordinate space. Recent clinical reports have documented the magnitude of gravity-induced brain deformation in the operating room and suggest these levels of tissue motion may compromise the integrity of such systems, We are investigating a model-based strategy which exploits the wealth of readily-available preoperative information in conjunction with intraoperatively acquired data to construct and drive a three dimensional (3-D) computational model which estimates volumetric displacements in order to update the neuronavigational image set. Using model calculations, the preoperative image database can be deformed to generate a more accurate representation of the surgical focus during an operation, In this paper, we present a preliminary study of four patients that experienced substantial brain deformation from gravity and correlate cortical shift measurements with model predictions, Additionally, me illustrate our image deforming algorithm and demonstrate that preoperative image resolution is maintained. Results over the four cases show that the brain shifted, on average, 5.7 mm in the direction of gravity and that model predictions could reduce this misregistration error to an average of 1.2 mm.

O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

brain deformation model
brain shift
consolidation
finite element model
porous media


communication structure and collective actions in social media In this paper I present results a study of different types of social media communication and networking channels that allow for collective action (CA): Twitter, Jaiku / Qaiku, Ning and Facebook. My preliminary findings indicate, that the visual outlining and the structure of communication create different kinds of collectivity and collective actions. A status stream is effective for simple and fast repetitive mass actions and for individual mass broadcasting, while channels and threads are needed as a backchannel for more complicated, coordinated and iterative tasks and support a sense of community. When planning collective action on the Internet, ranging from citizen participation to marketing campaigns, it is essential to note that different social media tools support different forms of collective action and feelings of collectiveness.

O O O O O O B I O O O O O O O O O O O O B I O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O B I O O O O O B I O O O O

backchannel
collective action
social media

crowdsourcing
collective intelligence
real-time web
micro channel


Better reporting of randomized trials in biomedical journal and conference abstracts Well reported research published in conference and journal abstracts is important as individuals reading these reports often base their initial assessment of a study based on information reported in the abstract. However, there is growing concern about the reliability and quality of information published in these reports. This article provides an overview of research evidence underpinning the need for better reporting of abstracts reported in conference proceedings and abstracts of journal articles; with a particular focus in the area of health care. Where available we highlight evidence which refers specifically to abstracts reporting randomized trials. We seek to identify current initiatives aimed at improving the reporting of these reports and recommend that an extension of the CONSORT Statement (Consolidated Standards of Reporting Trials), CONSORT for Abstracts, be developed. This checklist would include a list of essential items to be reported in any conference or journal abstract reporting the results of a randomized trial.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

randomized controlled trial
methodological quality
structured abstracts
checklists


continuous testing in eclipse Continuous testing uses excess cycles on a developer's workstation to continuously run regression tests in the background, providing rapid feedback about test failures as code is edited. It reduces the time and energy required to keep code well-tested, and it prevents regression errors from persisting uncaught for long periods of time.

B I O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Bayesian analysis of the Logit model and comparison of two MetropolisHastings strategies We examine some Markov chain Monte Carlo (MCMC) methods for a generalized non-linear regression model, the Logit model. It is first shown that MCMC algorithms may be used since the posterior is proper under the choice of non-informative priors. Then two non-standard MCMC methods are compared: a MetropolisHastings algorithm with a bivariate normal proposal resulting from an approximation, and a MetropolisHastings algorithm with an adaptive proposal. The results presented here are illustrated by simulations, and show the good behavior of both methods, and superior performances of the method with an adaptive proposal in terms of convergence to the stationary distribution and exploration of the posterior distribution surface.

O O O O O O O O O O O O O O O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

markov chain monte carlo
metropolishastings algorithm

bayesian statistic
adaptive algorithm
stationarity
convergence assessment


Aggregate features and ADABOOST for music classification We present an algorithm that predicts musical genre and artist from an audio waveform. Our method uses the ensemble learner ADABOOST to select from a set of audio features that have been extracted from segmented audio and then aggregated. Our classifier proved to be the most effective method for genre classification at the recent MIREX 2005 international contests in music information extraction, and the second-best method for recognizing artists. This paper describes our method in detail, from feature extraction to song classification, and presents an evaluation of our method on three genre databases and two artist-recognition databases. Furthermore, we present evidence collected from a variety of popular features and classifiers that the technique of classifying features aggregated over segments of audio is better than classifying either entire songs or individual short-timescale features.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

artist recognition
audio feature aggregation
multiclass adaboost


Weak limits and their calculation in analog signal theory Purpose - This paper aims to improve the mathematical justification of certain analog signal theory concepts and offer a rigorous framework for it. Design/methodology/approach - The framework relies on functional analysis, namely theory of distributions and the concept of weak limit. Its notation is adjusted to resemble the notation usually used in engineering signal theory. It can be used to prove in a rigorous manner already established results in signal theory, but also to establish new ones. Findings - Examples have shown the lack of rigour caused by using ordinary calculus in proving fundamental signal theoretic results. On that basis, concepts of limit, Fourier transform and derivative are revisited in the spirit of functional analysis. A new useful formula for weak limit computation is proved. Originality/value - Functional analysis is efficiently used in signal theory in a manner approachable by engineers. An original and efficient formula for weak limit computation is presented and proved.

O O O O O O B I I O O O O O O O O O O O O B I I O O O O O O O O O O O O O O B I O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O B I O O O O O B I O O O O O O O O O O O O O O O O O O B I O O O O O

analog signal theory
functional analysis
weak limit

schwartz distribution
fourier transforms


THE SOCIAL INFORMATION INFRASTRUCTURE The Division of Social, Behavioral, and Economic Research of the National Science Foundation has explored aggressively the potential involvement of the social sciences in the National Information Infrastructure. We invision the NII as a global network of computer communications, which will evolve out of the Internet, linking all social scientists to massive digital libraries and to myriad smaller distributed data sources containing information of every imaginable sort. Five workshops have charted applications of high-performance computing in the social and behavioral sciences: cognitive science, computational geography computational economics, artificial social intelligence, and electronic networks. A survey of SEER programs revealed that many are helping to create the information infrastructure, and substantial investment in six ''flagship'' digital library projects will develop the systems necessary for the NII of the 21st century.

O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I B I B I O O O O O O O O O O O O O O O O O O O B I O O O O O O B I O O O O O O O O O O O O O

information infrastructure
digital library
cognitive science
computational geography
computational economics
internet


Web-based public participation geographical information systems: an aid to local environmental decision-making Current research examining the potential of the World-Wide Web as a means of increasing public participation in local environmental decision making in the UK is discussed. The paper considers traditional methods of public participation and argues that new Internet-based technologies have the potential to widen participation in the UK planning system. Evidence is provided of the potential and actual benefits of online spatial decision support systems in the UK through a real environmental decision support problem in a village in northern England. The paper identifies key themes developing in this area of Web-based geographical information systems (GIS) and provides a case-study example of an online public participation GIS from inception to the final phase in a public participation process. It is shown that in certain UK planning problems and policy formulation processes, participatory online systems are a useful means of informing and engaging the public and can potentially bring the public closer to a participatory planning system.

O B I O O O O O O O O O O O O O O O O O B O O O O O B I O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O B I B O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Medical image analysis for cancer management in natural computing framework Natural computing, through its repertoire of nature-inspired strategies, is playing a major role in the development of intelligent decision-making systems. The objective is to provide flexible, application-oriented solutions to current medical image analysis problems. It encompasses fuzzy sets, neural networks, genetic algorithms, rough sets, swarm intelligence, and a host of other paradigms, mimicking biological and physical processes from nature. Radiographic imaging modalities, like computed tomography (CT), positron emission tomography (PET), and magnetic resonance imaging (MRI), help in providing improved diagnosis, prognosis and treatment planning for cancer. This survey highlights the role of natural computing, in efficiently analyzing radiographic medical images, for improved tumor management. We also provide a categorization of the segmentation, feature extraction and selection methods, based on different natural computing technologies, with reference to the application involving malignancy of the brain, breast, prostate, skin, lung, and liver.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O

quantitative imaging
feature selection
radiomics
evolutionary algorithms
biomedical imaging


Parallelisation of the Lagrangian model in a mixed Eulerian-Lagrangian CFD algorithm This manuscript presents an algorithm implemented in a commercial computational fluid dynamics (CFD) code for parallelisation of the Lagrangian particle tracking model in a mixed Eulerian-Lagrangian CFD algorithm. The algorithm is based on the domain decomposition parallelisation strategy and asynchronous message passing protocol. The methodology is tested on two industrial CFD test cases and the parallelisation results are presented. Further, it is discussed how the parallel efficiency of the runs can be improved by adopting the domain decomposition scattering technique. (C) 2003 Elsevier Inc. All rights reserved.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

parallel eulerian-lagrangian cfd
parallel particle tracking
parallelisation of the spray model


Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum Degree Elimination Game is a well-known algorithm that simulates Gaussian elimination of matrices on graphs, and it computes a triangulation of the input graph. The number of fill edges in the computed triangulation is highly dependent on the order in which Elimination Game processes the vertices, and in general the produced triangulations are neither minimum nor minimal. In order to obtain a triangulation which is close to minimum, the Minimum Degree heuristic is widely used in practice, but until now little was known on the theoretical mechanisms involved. In this paper we show some interesting properties of Elimination Came; in particular that it is able to compute a partial minimal triangulation of the input graph regardless of the order in which the vertices are processed. This results in a new algorithm to compute minimal triangulations that are sandwiched between the input graph and the triangulation resulting from Elimination Came. One of the strengths of the new approach is that it is easily parallelizable, and thus we are able to present the first parallel algorithm to compute such sandwiched minimal triangulations. In addition, the insight that we gain through Elimination Game is used to partly explain the good behavior of the Minimum Degree algorithm. We also give a new algorithm for producing minimal triangulations that is able to use the minimum degree idea to a wider extent. (C) 2008 Elsevier B.V. All rights reserved.

O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O

chordal graphs
parallel and sequential algorithms


quality evaluation of e-government digital services In this paper we present a "quality estimation model" for digital e-Government services suitable for quality evaluation, monitoring, discovery, selection and composition.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O

quality model
quality of service
e-government


throughput improvement of incremental redundancy ldpc coded mimo v-blast system In this paper, we present ensembles of incremental redundancy low-density parity-check (IR-LDPC) codes to improve the throughput performance of hybrid forward error correction (FEC)/automatic repeat request (ARQ) schemes in a vertical Bell lab layered space-time (V-BLAST) system. These ensembles are designed to have good error rate performance at short block lengths, which result in higher throughput performance. The throughput simulations in various fading conditions show that these ensembles outperform a conventional random punctured ensemble by 3 dB Eb/N0 at a throughput region of 0.8. To reduce the traffic of feedback channels, we consider using an adaptive code selection algorithm. In these adaptive hybrid FEC/ARQ schemes, the number of negative acknowledgement signals for retransmission is greatly reduced at operating SNR ranges without any significant throughput loss.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

mimo system
ldpc codes
hybrid fec/arq scheme


Benefits of averaging lateration estimates obtained using overlapped subgroups of sensor data ? In this paper, we suggest averaging lateration estimates obtained using overlapped subgroups of distance measurements as opposed to obtaining a single lateration estimate from all of the measurements directly if a redundant number of measurements are available. Least squares based closed form equations are used in the lateration. In the case of Gaussian measurement noise the performances are similar in general and for some subgroup sizes marginal gains are attained. Averaging laterations method becomes especially beneficial if the lateration estimates are classified as useful or not in the presence of outlier measurements whose distributions are modeled by a mixture of Gaussians (MOG) pdf. A new modified trimmed mean robust averager helps to regain the performance loss caused by the outliers. If the measurement noise is Gaussian, large subgroup sizes are preferable. On the contrary, in robust averaging small subgroup sizes are more effective for eliminating measurements highly contaminated with MOG noise. The effect of high-variance noise was almost totally eliminated when robust averaging of estimates is applied to QR decomposition based location estimator. The performance of this estimator is just 1 cm worse in root mean square error compared to the CramrRao lower bound (CRLB) on the variance both for Gaussian and MOG noise cases. Theoretical CRLBs in the case of MOG noise are derived both for time of arrival and time difference of arrival measurement data.

O O B B O O O O O O O O O O O O O O B B O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

least squares time of arrival location estimator

least squares time difference of arrival location estimator


EM-based iterative receiver for coded MIMO systems in unknown spatially correlated noise We present iterative channel estimation and decoding schemes for multi-input multi-output (MIMO) Rayleigh block fading channels in spatially correlated noise. An expectation-maximization (EM) algorithm is utilized to find the maximum likelihood (ML) estimates of the channel and spatial noise covariance matrices, and to compute soft information of coded symbols which is sent to an error-control decoder. The extrinsic information produced by the decoder is then used to refine channel estimation. Several iterations are performed between the above channel estimation and decoding steps. We derive modified Cramer-Rao Bound (MCRB) for the unknown channel and noise parameters, and show that the proposed EM-based channel estimation scheme achieves the MCRB at medium and high SNRs. For a bit error rate of 10(-6) and long frame length, there is negligible performance difference between the proposed scheme and the ideal coherent detector that utilizes the true channel and noise covariance matrices. Copyright (c) 2006 John Wiley & Sons, Ltd.

O O O O O B O O O O O O O O O B I O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

expectation-maximization
turbo code
crb
ber


Parameter Exploration in Science and Engineering Using Many-Task Computing Robust scientific methods require the exploration of the parameter space of a system (some of which can be run in parallel on distributed resources), and may involve complete state space exploration, experimental design, or numerical optimization techniques. Many-Task Computing (MTC) provides a framework for performing robust design, because it supports the execution of a large number of otherwise independent processes. Further, scientific workflow engines facilitate the specification and execution of complex software pipelines, such as those found in real science and engineering design problems. However, most existing workflow engines do not support a wide range of experimentation techniques, nor do they support a large number of independent tasks. In this paper, we discuss Nimrod/K-a set of add in components and a new run time machine for a general workflow engine, Kepler. Nimrod/K provides an execution architecture based on the tagged dataflow concepts, developed in 1980s for highly parallel machines. This is embodied in a new Kepler "Director" that supports many-task computing by orchestrating execution of tasks on on clusters, Grids, and Clouds. Further, Nimrod/K provides a set of "Actors" that facilitate the various modes of parameter exploration discussed above. We demonstrate the power of Nimrod/K to solve real problems in cardiac science.

B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O

scientific workflows
many-task computing


group context-based adaptations for recommendation In groupware or community based applications the user interface is usually static or tailored to the individual user's needs. Newer developments try to adapt the user interface automatically in regard to user contexts. Even though these techniques are proven useful, there exists no contextadaptive system taking the current context of a group or community in regard. In this paper, we briefly discuss the problems of defining context and present our understanding of context as a subset of the current information state. We provide an exemplary scenario to present different approaches how to compute group contexts based on semantic models and user contexts, and the consequences for the adaptation goals - in the interface or through changes at system functionalities or tools. We additionally discuss the problems occurring at evaluating adaptations and the value of group context for collaborative work.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O B O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O

user context
content recommendation
group context-based adaptation


Issues of trust and control on agent autonomy The relationship between trust and control is quite relevant both for the very notion of trust and for modelling and implementing trust-control relations with autonomous systems. We claim that control is antagonistic of the strict form of trust: 'trust in y'; but also that it completes and complements it for arriving to a global trust. In other words, putting control and guaranties is trust-building; it produces a sufficient trust, when trust in y's autonomous willingness and competence would not be enough. We also argue that control requires new forms of trust: trust in the control itself or in the controller, trust in y as for being monitored and controlled, trust in possible authorities, etc. Finally, we show that paradoxically control could not be antagonistic of strict trust in y, but it can even create, increase it by making y more willing or more effective. In conclusion, depending on the circumstances, control makes y more reliable or less reliable; control can either decrease or increase trust. A good theory of trust cannot be complete without a theory of control.

O O B O B O O O O O O B O B O O O O O O O O O B O O O O O O O O O O O O O B O O O O O O O B B O O O O O O O O O O O O O O O B O O O O B O O O O O O O O B O B O O O O O O O O O O O O O O B O O O O B B O O B O O O O O B O O O O O O O O B O O O O O O O O O B O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O B O O O O O B O O O O B O O O O O O O B

autonomous agents
cooperation
adjustable autonomy


Youubi: Open software for ubiquitous learning We propose a reference architecture for u-learning environments. We propose a method development and validation of u-learning environments. We present a u-learning environment that combines playful aspects with learning strategies.

O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

ubiquitous computing
software engineering
design interactive
gamification


Single-symbol ML decodable distributed STBCs for cooperative networks In this correspondence, the distributed orthogonal space-time block codes (DOSTBCs), which achieve the single-symbol maximum likelihood (ML) decodability and full diversity order, are first considered. However, systematic construction of the DOSTBCs is very hard, since the noise covariance matrix is not diagonal in general. Thus, some special DOSTBCs, which have diagonal noise covariance matrices at the destination terminal, are investigated. These codes are referred to as the row-monomial DOSTBCs. An upper bound of the data-rate of the row-monomial DOSTBC is derived and it is approximately twice higher than that of the repetition-based cooperative strategy. Furthermore, systematic construction methods of the row-monomial DOSTBCs achieving the upper bound of the data-rate are developed when the number of relays and/or the number of information-bearing symbols are even.

O O O O O O B I O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

single-symbol maximum likelihood (ml) decoding


Ontology-based data mining approach implemented for sport marketing Since sport marketing is a commercial activity, precise customer and marketing segmentation must be investigated frequently and it would help to know the sport market after a specific customer profile, segmentation, or pattern come with marketing activities has found. Such knowledge would not only help sport firms, but would also contribute to the broader field of sport customer behavior and marketing. This paper proposes using the Apriori algorithm of association rules, and clustering analysis based on an ontology-based data mining approach, for mining customer knowledge from the database. Knowledge extracted from data mining results is illustrated as knowledge patterns, rules, and maps in order to propose suggestions and solutions to the case firm, Taiwan Adidas, for possible product promotion and sport marketing.

O B I O O O B I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O B I O O O O B I O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O B I

sport marketing
data mining
apriori algorithm
clustering analysis


layered acting for character animation We introduce an acting-based animation system for creating and editing character animation at interactive speeds. Our system requires minimal training, typically under an hour, and is well suited for rapidly prototyping and creating expressive motion. A real-time motion-capture framework records the user's motions for simultaneous analysis and playback on a large screen. The animator's real-world, expressive motions are mapped into the character's virtual world. Visual feedback maintains a tight coupling between the animator and character. Complex motion is created by layering multiple passes of acting. We also introduce a novel motion-editing technique, which derives implicit relationships between the animator and character. The animator mimics some aspect of the character motion, and the system infers the association between features of the animator's motion and those of the character. The animator modifies the mimic by acting again, and the system maps the changes onto the character. We demonstrate our system with several examples and present the results from informal user studies with expert and novice animators.

O O O B B O O O O B O O O O O B B O O O O O O B B O O O O O O O O O O O O O O B O O O B B O O O O O B O O O O O O O O O O O O O O O O B I O B O O O O O O O O B O B O O O O O O O O O O O O O O O O O O B O O O O B O O O O B O O B B O O O O O B O O O O O B O O O O B O O O O O O O O O O O B O O O O B O B O O O O B O O O O O B B O O O O B O

framework
examples
association
maps
analysis
novice
informal
motion
user
minimal
virtual world
records
training
character
aspect
relationships
demonstrate
feedback
animation

statistical analysis
express
3d user interfaces
real-time
change
interaction
motion transformation
visualization
systems
motion-capture
character animation
motion editing
couples
prototype
edit
layer
complexity
feature
user studies


An extensible architecture-based framework for coordination languages The dynamic and heterogeneous nature of distributed systems makes the development of distributed applications a difficult task. Various tools, such as middleware systems, component systems, and coordination languages, offer support the application developer at different levels. There are several coordination systems that integrate such tools into a complete environment to build applications from heterogeneous components. To achieve extensibility they usually have a layered architecture: an application is first mapped to a middle layer and then to a target system. But this approach hides the specific features of a target system from the developer, as they are not represented in the middle layer, and often induces additional run-time overhead. In this paper, we introduce the extensible coordination framework ECF that allows developers to build efficient distributed applications which exploit the specific features of the target systems. Support for target systems and application domains are encapsulated by extension modules. Modules can be built on top of other modules to support refined functionality.

O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

coordination language
component technology
developer framework
software architectures


Novel approaches to the measurement of arterial blood flow from dynamic digital X-ray images We have developed two new algorithms for the measurement of blood flow from dynamic X-ray angiographic images. Both algorithms aim to improve on existing techniques. First, a model-based (MB) algorithm is used to constrain the concentration-distance curve matching approach. Second, a weighted optical flow algorithm (OP) is used to improve on point-based optical flow methods by averaging velocity estimates along a vessel with weighting based on the magnitude of the spatial derivative. The OP algorithm was validated using a computer simulation of pulsatile blood flow. Both the OP and the MB algorithms were validated using a physiological blood flow circuit. Dynamic biplane digital X-ray images were acquired following injection of iodine contrast medium into a variety of simulated arterial vessels. The image data were analyzed using our integrated angiographic analysis software SARA to give blood How waveforms using the NIB and OP algorithms. These waveforms were compared to flow measured using an electromagnetic flow meter (EMF). In total 4935 instantaneous measurements of flow were made and compared to the EMF recordings. It was found that the new algorithms showed low measurement bias and narrow limits of agreement and also outperformed the concentration-distance curve matching algorithm (ORG) and a modification of this algorithm (PA) in all studies.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

blood flow measurement
x-ray angiography
x-ray measurements


HIS-Monitor: An approach to assess the quality of information processing in hospitals Hospital information systems (HIS) are a substantial quality and cost factor for hospitals. Systematic monitoring of HIS quality is an important task; however, this task is often seen to be insufficiently supported. To support systematic HIS monitoring, we developed HIS-Monitor, comprising about 107 questions, focusing on how a hospital information system does efficiently support clinical and administrative tasks. The structure of HIS-Monitor consists of a matrix, crossing HIS quality criteria on one axis with a list of process steps within patient care on the other axis. HIS-Monitor was developed based on several pretests and was now tested in a larger feasibility study with 102 participants. HIS-Monitor intends to describe strengths and weaknesses of information processing in a hospital. Results of the feasibility study show that HIS-Monitor was able to highlight certain HIS problems such as insufficiently supported cross-departmental communication, legibility of drug orders and other paper-based documents, and overall time needed for documentation. We discuss feasibility of HIS-Monitor and the reliability and validity of the results. Further refinement and more formal validation of HIS-Monitor are planned.

O O O O O O B O O O O O B I I O O O O B O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

healthcare information systems
information management
evaluation
questionnaire


Recursive channel estimation based on finite parameter model using reduced-complexity maximum likelihood equalizer for OFDM over doubly-selective channels To take intercarrier interference (ICI) attributed to time variations of the channel into consideration, the time- and frequency-selective (doubly-selective) channel is parameterized by a finite parameter model. By capitalizing on the finite parameter model to approximate the doubly-selective channel, a Kalman filter is developed for channel estimation. The ICI suppressing, reduced-complexity Viterbi-type Maximum Likelihood (RML) equalizer is incorporated into the Kalman filter for recursive channel tracking and equalization to improve the system performance. An enhancement in the channel tracking ability is validated by theoretical analysis, and a significant improvement in BER performance using the channel estimates obtained by the recursive channel estimation method is verified by Monte-Carlo simulations.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

polynomial model
oversampled basis expansion model
recursive kalman
reduced-complexity ml equalizer


A web-service agent-based decision support system for securities exception management With rising trading volumes and increasing risks in securities transactions, the securities industry is making an effort to shorten the trade lifecycle and minimize transaction risks. While attempting to achieve this, exception management is crucial to pass trade information within the trade lifecycle in a timely and accurate fashion. For a competitive solution to exception management, a web-service-agent-based decision support system is developed in this paper. Agent technology is applied to deal with the dynamic, complex, and distributed processes in exception management; web services techniques are proposed for more scalability and interoperability in network-based business environment. By integrating agent technology with web services to make use of the advantages from both, this approach leads to more intelligence, flexibility and collaboration in business exception management. The effectiveness of this approach is evaluated through a use case and demonstration feedback.

O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O B I B I O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O

intelligent agents
decision support systems
securities trading


Measuring energy consumption using EML (energy measurement library) Energy consumption and efficiency is a main issue in high performance computing systems in order to reach exascale computing. Researchers in the field are focusing their effort in reducing the first and increasing the latter while there is no current standard for energy measurement. Current energy measurement tools are specific and architectural dependent and this has to be addressed. By creating a standard tool, it is possible to generate independence between the experiments and the hardware, and thus, researchers effort can be focused in energy, by maximizing the portability of the code used for experimentation with the multiple architectures we have access nowadays. We present the energy measurement library (EML) library, a software library that eases the access to the energy measurement tools and can be easily extended to add new measurement systems. Using EML, it is viable to obtain architectural and algorithmic parameters that affect energy consumption and efficiency. The use of this library is tested in the field of the analytic modeling of the energy consumed by parallel programs.

O O O O B B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I B O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

energy-aware computing
energy efficiency


Methylation-Sensitive Representational Difference Analysis and Its Application to Cancer Research Methylation-sensitive representational difference analysis (MS-RDA) was previously established to detect differences in the methylation status of two genomes. This method uses the digestion of genomic DNA with a methylation-sensitive restriction enzyme, HpaII, and PCR to prepare HpaII-amplicons, followed by RDA. An HpaII-amplicon prepared using betaine and reverse electrophoresis was enriched 3.6-fold (compared with the HpaII-amplicon prepared by the original method) with DNA fragments originating from CpG islands (CGIs). As for the specificity of MS-RDA, it was shown that DNA fragments that are unmethylated in the tester and almost completely methylated in the driver are efficiently isolated. This indicated that genes that are in biallelic methylation or in monoallelic methylation with loss of the other allele are efficiently isolated. Further, by use of two additional methylation-sensitive six-base recognition restriction enzymes, SacII and NarI, more DNA fragments were isolated from CGIs in the 5? regions of genes. After analysis of human lung, gastric, and breast cancers, 12 genes were seen to be silenced and additional genes seen to show decreased expression in association with methylation of genomic regions outside CGIs in the 5? regions of genes. MS-RDA is effective in identifying silenced genes in various cancers.

O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

dna methylation
cpg island
gene silencing
genome scanning


Simple PTASs for families of graphs excluding a minor ? We show that very simple algorithms based on local search are polynomial-time approximation schemes for Maximum Independent Set, Minimum Vertex Cover and Minimum Dominating Set, when the input graphs have a fixed forbidden minor.

O O O O O O O O O O O O O O O O O O O O O O O O O B I I B I I O B I I O O O O O O O B I

forbidden minor
maximum independent set
minimum vertex cover
minimum dominating set

polynomial-time approximation scheme
separator
local optimization


A modification of the index of Liou and Wang for ranking fuzzy number Different methods have been proposed for ranking fuzzy numbers. These include methods based on distances, centroid point, coefficient of variation, and weighted mean value. However, there is still no method that can always give a satisfactory result to every situation; some are counterintuitive and not discriminating. This paper presents an approach for ranking fuzzy numbers with integral value that is an extension of the index of Liou and Wang. This method, that is independent of the type of membership function used, can rank more than two fuzzy numbers simultaneously. This ranking method use an index of optimism to reflect the decision maker's optimistic attitude, but rather it also contains an index of modality that represents the neutrality of the decision maker. The approach is illustrated with numerical examples.

O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O

ranking fuzzy numbers
integral value
index of optimism
index of modality


A mobility-based load control scheme in Hierarchical Mobile IPv6 networks By introducing a mobility anchor point (MAP), Hierarchical Mobile IPv6 (HMIPv6) reduces the signaling overhead and handoff latency associated with Mobile IPv6. In this paper, we propose a mobility-based load control (MLC) scheme, which mitigates the burden of the MAP in fully distributed and adaptive manners. The MLC scheme combines two algorithms: a threshold-based admission control algorithm and a session-to-mobility ratio (SMR)-based replacement algorithm. The threshold-based admission control algorithm gives higher priority to ongoing mobile nodes (MNs) than new MNs, by blocking new MNs when the number of MNs being serviced by the MAP is greater than a predetermined threshold. On the other hand, the SMR-based replacement algorithm achieves efficient MAP load distribution by considering MNs traffic and mobility patterns. We analyze the MLC scheme using the continuous time Markov chain in terms of the new MN blocking probability, ongoing MN dropping probability, and binding update cost. Also, the MAP processing latency is evaluated based on the M/G/1 queueing model. Analytical and simulation results demonstrate that the MLC scheme outperforms other schemes and thus it is a viable solution for scalable HMIPv6 networks.

O O O O O O B I I O O O O B I I O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

hierarchical mobile ipv6
mobility anchor point
admission control algorithm

mobility-based load control
session-to-mobility ratio


Randomized diffusion for indivisible loads Presentation of new algorithm for balancing discrete loads. Algorithm is very natural and avoids nodes having negative loads. Quality measure is the gap between maximum and minimum load, called discrepancy. Upper bounds on discrepancy after algorithm has run as long as its continuous counterpart.

O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

distributed computing
load balancing
randomized algorithms
random walk


Automatic Image Segmentation by Dynamic Region Merging This paper addresses the automatic image segmentation problem in a region merging style. With an initially oversegmented image, in which many regions (or superpixels) with homogeneous color are detected, an image segmentation is performed by iteratively merging the regions according to a statistical test. There are two essential issues in a region-merging algorithm: order of merging and the stopping criterion. In the proposed algorithm, these two issues are solved by a novel predicate, which is defined by the sequential probability ratio test and the minimal cost criterion. Starting from an oversegmented image, neighboring regions are progressively merged if there is an evidence for merging according to this predicate. We show that the merging order follows the principle of dynamic programming. This formulates the image segmentation as an inference problem, where the final segmentation is established based on the observed image. We also prove that the produced segmentation satisfies certain global properties. In addition, a faster algorithm is developed to accelerate the region-merging process, which maintains a nearest neighbor graph in each iteration. Experiments on real natural images are conducted to demonstrate the performance of the proposed dynamic region-merging algorithm.

O B I O O B I O O O O O B I O O O B I O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

wald's sequential probability ratio test (sprt)


Boundary properties of the inconsistency of pairwise comparisons in group decisions We study the inconsistency of pairwise comparisons in group decision making. We study the effect of the aggregation of pairwise comparisons on their consistency. We derive general results and provide a complete study for well-known inconsistency indices. We start a discussion on the meaning of inconsistency of aggregated preferences.

B I O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O

inconsistency indices
boundary properties
group decision making

pairwise comparison matrix
analytic hierarchy process