Mechanisms by which Dopamine Receptors May Influence Synaptic Plasticity While dopamine (DA) receptors mediate acute effects of amphetamine and cocaine, chronic drug administration produces many glutamate-dependent adaptations, including LTP in reward-related neuronal circuits. An important question presents itself

O O O O 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

ampa receptor
d1 dopamine receptor
cell culture
nucleus accumbens
phosphorylation
prefrontal cortex
receptor trafficking


WebMapMedia: a map-based Web application for facilitating participation in spatial planning In this paper, a new map-based Web application developed for facilitating citizen participation in spatial planning is studied. Two planning experiments testing the map-based application called WebMapMedia are featured. The literature review of the paper describes attempts to utilize geographic information systems (GIS) in participation, pointing out severe weaknesses of these systems in acquiring and processing qualitative local knowledge. The results of the experiments show that the Web-based technology supports regular but short-term lunch break participation that occurs in the week during the office hours. The other results reveal a symbiotic relationship between conventional and Web-based means of participation and the potential of the Web-based technology to broaden participation. It is also found that if the technology can be adapted to the stages of the planning process, it may facilitate knowledge creation in the process. The Google Maps mashup based on Web 2.0 approach exhibits certain advantages over GIS-based solutions. Based on the results, it is argued that a prerequisite for the full utilization of the Web-based technology in participation is the evolution of the planning process and the attitudes of the planners.

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 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 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 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

spatial planning
geographic information systems
google maps mashup

map-based web technology
web 2.0
e-democracy
web-based participation
participatory planning


Optimal bandwidth assignment for packet rings The network throughput is an important performance criteria for the packet ring networks. Since maximizing the network throughput can lead to severe bias in bandwidth allocation among all flows, fairness should be imposed to prevent bandwidth starvation. The challenge here, therefore, is the joint optimization of the network throughput and fairness. In this paper, we present the optimal bandwidth assignment scheme to decompose this optimization problem into two tasks, one for finding fair bandwidth assignment and the other for finding the optimal routing. The network throughput is maximized under the fairness constraints when these tasks are performed iteratively.

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 B 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 B I O O O O 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 B O O O O O O O

bandwidth assignment
fairness
optimization
packet rings


Optimized On-Chip-Pipelining for Memory-Intensive Computations on Multi-Core Processors with Explicit Memory Hierarchy Limited bandwidth to off-chip main memory tends to be a performance bottleneck in chip multiprocessors, and this will become even more problematic with an increasing number of cores. Especially for streaming computations where the ratio between computational work and memory transfer is low, transforming the program into more memory-efficient code is an important program optimization. On-chip pipelining reorganizes the computation so that partial results of subtasks are forwarded immediately between the cores over the high-bandwidth internal network, in order to reduce the volume of main memory accesses, and thereby improves the throughput for memory-intensive computations. At the same time, throughput is also constrained by the limited amount of on-chip memory available for buffering forwarded data. By optimizing the mapping of tasks to cores, balancing a trade-off between load balancing, buffer memory consumption, and communication load on the on-chip network, a larger buffer size can be applied, resulting in less DMA communication and scheduling overhead. In this article, we consider parallel mergesort as a representative memory-intensive application in detail, and focus on the global merging phase, which is dominating the overall sorting time for larger data sets. We work out the technical issues of applying the on-chip pipelining technique, and present several algorithms for optimized mapping of merge trees to the multiprocessor cores. We also demonstrate how some of these algorithms can be used for mapping of other streaming task graphs. We describe an implementation of pipelined parallel mergesort for the Cell Broadband Engine, which serves as an exemplary target. We evaluate experimentally the influence of buffer sizes and mapping optimizations, and show that optimized on-chip pipelining indeed speeds up, for realistic problem sizes, merging times by up to 70% on QS20 and 143% on PS3 compared to the merge phase of CellSort, which was by now the fastest merge sort implementation on Cell.

O O O O O O O O O O O O O O O O O O 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 merge sort
on-chip pipelining
multicore computing
task mapping


Tailoring a cognitive model for situation awareness using machine learning Using a pure machine learning approach to enable the generation of behavior for agents in serious gaming applications can be problematic, because such applications often require human-like behavior for agents that interact with human players. Such human-like behavior is not guaranteed with e.g. basic reinforcement learning schemes. Cognitive models can be very useful to establish human-like behavior in an agent. However, they require ample domain knowledge that might be difficult to obtain. In this paper, a cognitive model is taken as a basis, and the addition of scenario specific information is for a large part automated by means of machine learning techniques. The performance of the approach of automatically adding scenario specific information is rigorously evaluated using a case study in the domain of fighter air combat. An evolutionary algorithm is proposed for automatically tailoring a cognitive model for situation awareness of fighter pilots. The standard algorithm and several extensions are evaluated with respect to performance in air combat. The results show that it is possible to apply the algorithm to optimize belief networks for cognitive models of intelligent agents (adversarial fighters) in the aforementioned domain, thereby reducing the effort required to elicit knowledge from experts, while retaining the required human-like behavior.

O O B I O B I 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 O O O O O O O O O O O O O O O O O O O O O O O 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 O O O B I O O 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

cognitive model
machine learning
evolutionary algorithm
situation awareness


multimedia aspects in health care Recently, Body Sensor Networks (BSNs) are being deployed for monitoring and managing medical conditions as well as human performance in sports. These BSNs include various sensors such as accelerometers, gyroscopes, EMG (Electromyogram), EKG (Electro-cardiograms), and other sensors depending on the needs of the medical conditions. Data from these sensors are typically Time Series data and the data from multiple sensors form multiple, multidimensional time series data. This tutorial describes the technologies that go behind BSNs -- both in terms of the hardware infrastructure as well as the basic software. First, we outline the BSN hardware features and the related requirements. We then discuss the energy and communication choices for BSNs. Next, we discuss approaches for classification, data mining, visualization, and securing these data. We also show several demonstrations of body sensor networks as well as the software that aid in analyzing the data.

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 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 B I I O O O O O O O O O O O

association rules
factor analysis.
tinyos
qos


Steady-state response of nonlinear circuits containing parasitic elements We propose here a time-domain shooting algorithm for calculating the steady-state responses of nonlinear RF circuits containing parasitic elements that is based on both a modified Newton and a secant methods. Bipolar transistors and MOSFETs in ICs have small parasitic capacitors among their terminals. We can not neglect them because they will gives large effects to the shooting algorithm at the high frequency. Since our purpose is to develop a user friendly simulator, we mainly take into account the relatively large normal capacitors such as coupling and/or by-pass capacitors and so on, because the parasitic capacitors are usually smaller and contained in the device models. We have developed a very simple simulator only using the fundamental tools of SPICE, which can be applied to relatively large scale ICs, efficiently.

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 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 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 O O O O O O O O O O

steady-state analysis
time-domain secant method


efficient k-nn search on vertically decomposed data Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimensional spaces, rendering efficient applications hard to realize: index structures degrade rapidly with increasing dimensionality, while sequential search is not an attractive solution for repositories with millions of objects. This paper approaches the problem from a different angle. A solution is sought in an unconventional storage scheme, that opens up a new range of techniques for processing k -NN queries, especially suited for high dimensional spaces. The suggested (physical) database design accommodates well a novel variant of branch-and-bound search, that reduces the high dimensional space quickly to a small candidate set. The paper provides insight in applying this idea to k -NN search using two similarity metrics commonly encountered in image database applications, and discusses techniques for its implementation in relational database systems. The effectiveness of the proposed method is evaluated empirically on both real and synthetic data sets, reporting the significant improvements in response time yielded.

O O B O O O B B O O O O O B O B B 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 B 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 B O O O O O O O O O O O O B O O O O O O O O B B I O O O O O O O B O O O O O B O O O O O O O B O O O O O O O O O B O O B O O O O B I B O O O O O B O B I B O O O O O B O O O O O O O O B O O O O O O B I O

applications
response time
paper
search
image database
method
systems
database design
rendering
space
storage
implementation
data
support
queries
physical
similarity
repositories
relational database
scheme

efficiency
branch-and-bound
metrication
object
indexing
multimedia information retrieval
data collection
process
similarity search
effect
nearest-neighbor search


Simulation and analytical approaches for estimating the performability of a multicast address dynamic allocation mechanism The specification of the Multicast Address Dynamic Client Allocation Protocol (MADCAP) includes a mechanism to assign multicast addresses to the hosts in the Internet environment. MADCAP servers provide multicast address allocation services. A MADCAP client (that is, a host requesting multicast address allocation services via MADCAP) identifies a suitable MADCAP server and sends appropriate messages to the MADCAP server in order to request a multicast address. The mechanism makes the reuse of multicast addresses available with the MADCAP server, through the application of the lease-time concept. Estimating the performance measures of such a system, accurately and reliably, is very important for efficient use of resources and for achieving the QoS (Quality of Service) requirements. This paper proposes two approaches to estimate performability measures of the MADCAP dynamic allocation mechanism. They are essentially, an accurate one by simulation and a fast but approximate one by analytical solution. While the accuracy of the simulation method is limited by the length of the simulation, the analytical method is an approximate one but fast in computation. The detailed simulation model and the analytical method of the MADCAP dynamic allocation mechanism are presented, and the results are compared. Fairly good agreement is established between the simulation and the analytical results, giving rise to accurate and dependable computation of the performability measures. A solution approach using the QBD model for the performability analysis of the MADCAP mechanism is proposed, which has the computational complexity of the order O(c) O ( c ) . Besides possessing the capability of tackling the problem with large c (the number of available IP multicast addresses is of the order of tens of thousands in the MADCAP server) in a very short time, it also gives numerically stable solution. The impact of the lease-time parameter on the performability of the MADCAP dynamic allocation mechanism is also investigated through a numerical study, and illustrated by graphs.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 B I I I O O 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 O O O O B O B I O O O O O O O O O O B O O O B I O O B I I 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 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 B O O B I I I O O O O O O O O O O O

madcap dynamic allocation mechanism
performability
simulation
analytical method

stochastic model
telecommunications
networking
simulation of madcap model
lease-time


Technology-induced Errors The Current Use of Frameworks and Models from the Biomedical and Life Sciences Literatures Objective: The objective of this paper is to examine the extent, range and scope to which frameworks, models and theories dealing with technology-induced error have arisen in the biomedical and life sciences literature as indexed by Medline (R). Methods: To better understand the state of work in the area of technology-induced error involving frameworks, models and theories, the authors conducted a search of Medline (R) using selected key words identified from seminal articles in this research area. Articles were reviewed and those pertaining to frameworks, models or theories dealing with technology-induced error were further reviewed by two researchers. Results: All articles from Medline (R) from its inception to April of 2011 were searched using the above outlined strategy. 239 citations were returned. Each of the abstracts for the 239 citations were reviewed by two researchers. Eleven articles met the criteria based on abstract review. These 11 articles were downloaded for further in-depth review. The majority of the articles obtained describe frameworks and models with reference to theories developed in other literatures outside of healthcare. The papers were grouped into several areas. It was found that articles drew mainly from three literatures: 1) the human factors literature (including human-computer interaction and cognition), 2) the organizational behavior/socio-technical literature, and 3) the software engineering literature. Conclusions: A variety of frameworks and models were found in the biomedical and life sciences literatures. These frameworks and models drew upon and extended frameworks, models and theoretical perspectives that have emerged in other literatures. These frameworks and models are informing an emerging line of research in health and biomedical informatics involving technology-induced errors in healthcare.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 B 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

human factors
organizational
software engineering

framework
model
theory
technology-induced error
unintended consequences
e-iatrogenesis
technology facilitated error
sociotechnical


how does personality affect trust in b2c e-commerce? Trust is a critical component of successful e-Commerce. Given the impersonality, anonymity, and automation of transactions, online vendor trustworthiness cannot be assessed by means of body language and other environmental cues that consumers typically use when deciding to trust offline retailers. It is therefore essential that the design of e-Commerce websites compensate by incorporating circumstantial cues in the form of appropriate trust triggers. This paper presents and discusses the results of a study which took an initial look at whether consumers with different personality types (a) are generally more trusting and (b) rely on different trust cues during their assessment of first impression vendor trustworthiness in B2C e-Commerce.

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 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 O O 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


Relational reinforcement learning Relational reinforcement learning is presented, a learning technique that combines reinforcement learning with relational learning or inductive logic programming. Due to the use of a more expressive representation language to represent states, actions and Q-functions, relational reinforcement learning can be potentially applied to a new range of learning tasks. One such task that we investigate is planning in the blocks world, where it is assumed that the effects of the actions are unknown to the agent and the agent has to learn a policy. Within this simple domain we show that relational reinforcement learning solves some existing problems with reinforcement learning. In particular, relational reinforcement learning allows us to employ structural representations, to abstract from specific goals pursued and to exploit the results of previous learning phases when addressing new (more complex) situations.

O B I O B I O O O O O O O B I O O O O B I 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 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 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 O O O

reinforcement learning
inductive logic programming
planning


The asymptotic memory capacity of the generalized Hopfield network This paper presents a theoretical analysis on the asymptotic memory capacity of the generalized Hopfield network. The perceptron learning scheme is proposed to store sample patterns as the stable states in a generalized Hopfield network. We have obtained that (n?1) and 2n are a lower and an upper bound of the asymptotic memory capacity of the network of n neurons, respectively, which shows that the generalized Hopfield network can store the larger number of sample patterns than Hopfield network.

O B I I O O O B I O O O O O O O O B I I 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 O O O O B I I 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

hopfield network
asymptotic memory capacity

neural network
associative memory
perceptron learning algorithm


Approximating the maximum common subgraph isomorphism problem with a weighted graph The maximum common subgraph isomorphism problem is a difficult graph problem, and the problem of finding the maximum common subgraph isomorphism problem is NP-hard. This means there is likely no algorithm that will be able to find the maximal isomorphic common subgraph in polynomial time because as the size of the graphs grows the search space for the solution will grow exponentially. This research provides a method that will approximate the maximum common subgraph isomorphism problem by producing a weighted graph, where the weights will give an indication of the probability that the associated link will be in the maximum common subgraph of the two input graphs. The experimental results show that the method can effectively generate a weighted graph containing most of the expected links that would exist in the maximum common subgraph of some given graphs with similar structures.

O O B I I B O O O B I O B I I B 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 O O 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 B I 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 B I O O O O O O O O O O O B I I O O O O O O O

maximum common subgraph
isomorphism
weighted graph


coevolution of intelligent agents using cartesian genetic programming A coevolutionary competitive learning environment for two antagonistic agents is presented. The agents are controlled by a new kind of computational network based on a compartmentalised model of neurons. We have taken the view that the genetic basis of neurons is an important [27] and neglected aspect of previous approaches. Accordingly, we have defined a collection of chromosomes representing various aspects of the neuron: soma, dendrites and axon branches, and synaptic connections. Chromosomes are represented and evolved using a form of genetic programming known as Cartesian Genetic Programming. The network formed by running the chromosomal programs has a highly dynamic morphology in which neurons grow, and die, and neurite branches together with synaptic connections form and change in response to environmental interactions. The idea of this paper is to demonstrate the importance of the genetic transfer of learned experience and life time learning. The learning is a consequence of the complex dynamics produced as a result of interaction (coevolution) between two intelligent agents. Our results show that both agents exhibit interesting learning capabilities.

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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

co-evolution
artificial neural networks
brain


Advanced delivery of sensitive multimedia content for better serving user expectations in Virtual Collaboration applications A major challenge when accessing protected multimedia content in heterogeneous usage environments is the ability to provide acceptable levels of quality of experience to all involving users. Additionally, different levels of protection should be possible to be addressed when manipulating the content towards the quality of experience maximization. This paper describes the use of a context-aware and Digital Rights Management (DRM)-enabled content adaptation platform towards meeting these challenges. The platform was conceived to deliver advanced content adaptation within different application scenarios, among which Virtual Collaboration (VC) was central. Descriptions of use cases implemented by the platform in heterogeneous VC environments are provided. Conducted experiments have highlighted the benefits to users when compared to an operation without the platform. Results of different adaptations suitable to sensed context conditions are also provided and analyzed. A brief description of the platform functionality is included together with pointers to additional information.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 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 B O O O O O O O O O O O O O O O O O O O O O

drm
virtual collaborations
ontology reasoning


Omni-directional mobile robot controller based on trajectory linearization In this paper, a nonlinear controller design for an omni-directional mobile robot is presented. The robot controller consists of an outer-loop (kinematics) controller and an inner-loop (dynamics) controller, which are both designed using the Trajectory Linearization Control (TLC) method based on a nonlinear robot dynamic model. The TLC controller design combines a nonlinear dynamic inversion and a linear time-varying regulator in a novel way, thereby achieving robust stability and performance along the trajectory without interpolating controller gains. A sensor fusion method, which combines the onboard sensor and the vision system data, is employed to provide accurate and reliable robot position and orientation measurements, thereby reducing the wheel slippage induced tracking error. A time-varying command filter is employed to reshape an abrupt command trajectory for control saturation avoidance. The real-time hardware-in-the-loop (HIL) test results show that with a set of fixed controller design parameters, the TLC robot controller is able to follow a large class of 3-degrees-of-freedom (3DOF) trajectory commands accurately.

O B I 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 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 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

mobile robot
trajectory linearization
sensor fusion

nonlinear control
omni-directional
robocup


Assessing legal challenges on the mobile Internet This article describes some legal challenges related to information products and services on the mobile Internet and the World Wide Web. Using a scenario-based methodology, it describes the future mobile Internet and explains how information products and services would be used on it. A systematic method is used to build the scenarios. As the problems likely to emerge are very complex, the scenarios take into account several major factors that delineate the mobile Internet and its use-not just technological changes and economic factors, but societal issues and how individuals feel and behave. The scenarios make it possible to identify the kinds of legal challenges that are likely to emerge. Analysis of the scenarios indicates that intellectual property rights, privacy, and contracts are the legal areas most likely to involve challenges on the mobile Internet.

O O O O O B 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 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 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 B O B O O O O O O O O O O O B I

societal aspects of information technology


Looking

for

high

energy

density

compounds

among

polynitraminecubanes

Based

on

fully

optimized

geometric

structures

at

level,

we

calculated

electronic

structures,

heats

of

formation,

strain

energies,

bond

dissociation

energies

and

detonation

performance

(detonation

velocity

and

detonation

pressure)

for

a

series

of

polynitraminecubanes.

Our

results

have

shown

that

energy

gaps

of

cubane

derivatives

are

much

higher

than

that

of

triaminotrinitrobenzene

(TATB),

which

means

that

cubane

derivatives

may

be

more

sensitive

than

TATB.

Polynitraminecubanes

have

high

and

positive

heats

of

formation,

and

a

good

linear

relationship

between

heats

of

formation

and

nitramine

group

numbers

was

presented.

As

the

number

of

nitramine

groups

in

the

molecule

increases,

the

enthalpies

of

combustion

values

are

increasingly

negative,

but

the

specific

enthalpy

of

combustion

values

decreases.

It

is

found

that

all

cubane

derivatives

have

high

strain

energies,

which

are

affected

by

the

number

and

position

of

nitramine

group.

The

calculated

bond

dissociation

energies

of

and

C-C

bond

show

that

the

C-C

bond

should

be

the

trigger

bond

in

the

pyrolysis

process.

It

is

found

that

detonation

velocity

(D),

detonation

pressure

(P)

and

molecule

density

(rho)

have

good

linear

relationship

with

substituented

group

numbers.

Heptanitraminecubane

and

octanitraminecubane

have

good

detonation

performance

over

1,3,5,7-tetranitro-1,3,5,7-tetraazacyclooctane

(HMX),

and

they

can

be

regarded

as

potential

candidates

of

high

energy

density

compounds

(HEDCs).

The

results

have

not

only

shown

that

these

compounds

may

be

used

as

HEDCs,

but

also

provide

some

useful

information

for

further

investigation.

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 B I 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 O O O O O O O O O O B I I 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 B 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 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

cubane
detonation performance
heats of formation
nitramine group


Combinatorial Sublinear-Time Fourier Algorithms We study the problem of estimating the best k term Fourier representation for a given frequency sparse signal (i.e., vector) A of length N >> k. More explicitly, we investigate how to deterministically identify k of the largest magnitude frequencies of (A) over cap, and estimate their coefficients, in polynomial(k, log N) time. Randomized sublinear-time algorithms which have a small (controllable) probability of failure for each processed signal exist for solving this problem (Gilbert et al. in ACM STOC, pp. 152-161, 2002; Proceedings of SPIE Wavelets XI, 2005). In this paper we develop the first known deterministic sublinear-time sparse Fourier Transform algorithm which is guaranteed to produce accurate results. As an added bonus, a simple relaxation of our deterministic Fourier result leads to a new Monte Carlo Fourier algorithm with similar runtime/sampling bounds to the current best randomized Fourier method (Gilbert et al. in Proceedings of SPIE Wavelets XI, 2005). Finally, the Fourier algorithm we develop here implies a simpler optimized version of the deterministic compressed sensing method previously developed in (Iwen in Proc. of ACM-SIAM Symposium on Discrete Algorithms (SODA'08), 2008).

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

trigonometric approximation and interpolation


INTEGRATED FRAMEWORK FOR SEAMLESS MODELING OF BUSINESS AND TECHNICAL ASPECTS IN PROCESS-ORIENTED ENTERPRISE APPLICATIONS The different views and modeling techniques of both the business analysts and software developers are a common problem in business process modeling. Various modeling approaches result in communication problems, as well as redundancies and inconsistencies in system documentation. Thus, when modeling process-oriented enterprise applications seamless support of both expert groups is necessary. However, current business process management and workflow technologies are not fully integrated with user interaction, nor do they offer an appropriate data model. Based on the requirements of two industrial projects, we developed an integrated framework that combines the best practices from process-oriented and form-based approaches to overcome these shortcomings. The described framework supports the submit/response-style interaction paradigm and is independent of modeling languages and tools. In this work, we will present a detailed description of the proposed framework, its application to an industrial project and a discussion of related 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 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 O O O O O O O


Cooperation in wireless ad hoc networks: A market-based approach We consider a market-based approach to stimulate cooperation in ad hoc networks where nodes charge a price for relaying data packets. Assuming that nodes set prices to maximize their own net benefit, we characterize the equilibria of the resulting market. In addition, we propose an iterative algorithm for the nodes to adapt their price and rate allocation, and study its convergence behavior. We use a numerical case study to illustrate our results.

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

ad hoc network
pricing
rate control
wireless networks


Effective techniques for automatic extraction of Web publications Research organisations and individual researchers increasingly choose to share their research findings by providing lists of their published works on the World Wide Web. To facilitate the exchange of ideas, the lists often include links to published papers in portable document format (PDF) or Postscript (PS) format. Generally, these publication Web sites are updated regularly to include new works. While manual monitoring of relevant Web sites is tedious, commercial search engines and information monitoring systems are ineffective in finding and tracking scholarly publications. Analyses the characteristics of publication index pages and describes effective automatic extraction techniques that the authors have developed, The authors' techniques combine lexical and syntactic analyses with heuristics. The proposed techniques have been implemented and tested for more than 14,000 Web pages and achieved consistently high success rates of around 90 percent.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

internet
electronic publishing
content analysis


Mathematical programming models for revenue management under customer choice We study a network airline revenue management problem with discrete customer choice behavior. We discuss a choice model based on the concept of preference orders, in which customers can be grouped according to a list of options in decreasing order of preference. If a customers preferred option is not available, the customer moves to the next choice on the list with some probability. If that option is not available, the customer moves to the third choice on the list with some probability, and so forth until either the customer has no other choice but to leave or his/her request is accepted. Using this choice model as an input, we propose some mathematical programs to determine seat allocations. We also propose a post-optimization heuristic to refine the allocation suggested by the optimization model. Simulation results are presented to illustrate the effectiveness of our method, including comparisons with other models.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems ? ?? We study synthesis of controllers for real-time systems, where the objective is to stay in a given safe set. The problem is solved by obtaining winning strategies in the setting of concurrent two player timed automaton games with safety objectives. To prevent a player from winning by blocking time, we restrict each player to strategies that ensure that the player cannot be responsible for causing a Zeno run. We construct winning strategies for the controller which require access only to (1) the system clocks (thus, controllers which require their own internal infinitely precise clocks are not necessary), and (2) a logarithmic (in the number of clocks) number of memory bits (i.e. a linear number of memory states). Precisely, we show that for safety objectives, a memory of size (3+lg(|C|+1)) ( 3 + lg ( | C | + 1 ) ) bits suffices for winning controller strategies, where C is the set of clocks of the timed automaton game, significantly improving the previous known exponential memory states bound. We also settle the open question of whether winning region-based strategies require memory for safety objectives by showing with an example the necessity of memory for such strategies to win for safety objectives. Finally, we show that the decision problem of determining if there exists a receptive player-1 winning strategy for safety objectives is EXPTIME-complete over timed automaton games.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 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 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 B I O O O O O O

timed automata and timed games
controller synthesis
zeno systems


accelerating evolutionary computation with graphics processing units Graphics Processing Units (GPUs) have become a major source of computational power for numerical applications. Originally designed for application of time-consuming graphics operations, GPUs are stream processors that implement the SIMD paradigm. Modern programming tools allow developers to access the parallelism of the GPU in a flexible and convenient way, hiding many low level details from the user. In this tutorial we shall provide a gentle introduction of how to put GPUs to good use with Evolutionary Computation.

O B I O B I I 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 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

evolutionary computation
gpu
graphics processing units


Goodwill, inventory penalty, and adaptive supply chain management Information visibility is generally useful for decision makers distributed across supply chains. Availability of information on inventory levels, price, lead times, demand, etc. can help reduce uncertainties as well as alleviate problems associated with bullwhip effect. A majority of extant literature in this area assume a static supply chain network configuration. While this was sufficient a few decades ago, advances in e-commerce and the ease with which order processing can be performed over the Internet necessitates appropriate dynamic (re)configuration of supply chains over time. Each node in the supply chain is modeled as an actor who makes independent decisions based on information gathered from the next level upstream. A knowledge-based framework is used for dynamic supply chain configuration and to consider the effects of inventory constraints and goodwill, as well as their effects on the performance dynamics of supply chains. Preliminary results indicate that neither static nor dynamic configurations are consistently dominant. Scenarios where static configurations perform better than the modeled system are identified.

B B O O O B I I 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 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

supply chain management
inventory
goodwill


agile software reuse recommender No abstract available

agile reuse
recommender systems
data mining


Matrix representation of discrete quasi-copulas In this paper discrete quasi-copulas (defined on a square grid I-n(2) of [0, 1](2)) are studied and it is proved that they can be represented by means of a special class of matrices with entries in [-1, 1]. Special considerations are made for the case of irreducible discrete quasi-copulas (those with range I-n), showing that they can be represented through alternating-sign matrices and that they generate all discrete quasi-copulas through convex sums. In the process, the number of irreducible quasi-copulas on I-n is given and those functions delta for which there exists a unique copula with delta as its diagonal section are characterized. (C) 2007 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 B O O O O B I O O O O O O O O O

quasi-copula
discrete scale
irreducible discrete quasi-copula
asm


Low-complexity policies for energy-performance tradeoff in chip-multi-processors Chip-multi-processor (CMP) utilize multiple energy-efficient processing elements (PEs) to deliver high performance while reducing energy-consumption. Dynamic frequency-Voltage Scaling (DVS) balances performance and energy consumption by varying PEs' frequency-voltage workpoints to save energy while meeting performance requirements. We consider multi-task CMP applications with unknown workloads, and dynamically set workpoints to minimize ET(2). Heuristic policies for serial/parallel task-graphs are investigated. We compare these policies to a theoretical bound and show that they achieve good result,; with low complexity. In most cases the simplest policy, which usually assigns constant workpoints, is also the most cost-effective one.

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

chip-multi-processor (cmp)
dynamic voltage scaling
low power
slack utilization


event synchronization analysis for debugging parallel programs One of the major difficulties of explicit parallel programming for a shared memory machine model is detecting the potential for nondeterminacy and identifying its causes. There will often be shared variables in a parallel program, and the tasks comprising the program may need to be synchronized when accessing these variables. This paper discusses this problem and presents a method for automatically detecting non-determinacy in parallel programs that utilize event style synchronization instructions, using the Post, Wait, and Clear primitives. With event style synchronization, especially when there are many references to the same event, the difficulty lies in computing the execution order that is guaranteed given the synchronization instructions and the sequential components of the program. The main result in this paper is an algorithm that computes such an execution order and yields a Task Graph upon which a nondeterminacy detection algorithm can be applied. We have focused on events because they are a frequently used synchronization mechanism in parallel versions of Fortran, including Cray [Cray87], IBM [IBM88], Cedar [GPHL88], and PCF Fortran [PCF88].

B B B O B B O O O O O O O O B O O O B I 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 O O O O O O O O O O O O O B O O O O O O B O O O O O B O O O B O B O O O 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 B O O O O O B O O O O O O O O O O O O O B O O B O O O O O B O O O B B O O O O B B 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

shared memory
task
order
detection
method
synchronization
event
parallel
analysis
graph
algorithm
model
paper
debugging

sharing
variability
computation
parallel programming
instruction
version
component


Parallel Star Join plus DataIndexes: Efficient query processing in data warehouses and OLAP On-Line Analytical Processing (OLAP) refers to the technologies that allow users to efficiently retrieve data from the data warehouse for decision-support purposes. Data warehouses tend to be extremely large-it is quite possible for a data warehouse to be hundreds of gigabytes to terabytes in size [3]. Queries tend to be complex and ad hoc, often requiring computationally expensive operations such as joins and aggregation. Given this, we are interested in developing strategies for improving query processing in data warehouses by exploring the applicability of parallel processing techniques. In particular, we exploit the natural partitionability of a star schema and render it even more efficient by applying DataIndexes-a storage structure that serves both as an index as well as data and lends itself naturally to vertical partitioning of the data. Dataindexes are derived from the various special purpose access mechanisms currently supported in commercial OLAP products. Specifically, we propose a declustering strategy which incorporates both task and data partitioning and present the Parallel Star Join (PSJ) Algorithm, which provides a means to perform a star join in parallel using efficient operations involving only rowsets and projection columns. We compare the performance of the PSJ Algorithm with two parallel query processing strategies. The first is a parallel join strategy utilizing the Bitmap Join Index (BJI), arguably the state-of-the-art OLAP join structure in use today. For the second strategy we choose a well-known parallel join algorithm, namely the pipelined hash algorithm. To assist in the performance comparison, we first develop a cost model of the disk access and transmission costs for all three approaches. Performance comparisons show that the Dataindex-based approach leads to dramatically lower disk access costs than the BJI, as well as the hybrid hash approaches, in both speedup and scaleup experiments, while the hash-based approach outperforms the BJI in disk access costs. With regard to transmission overhead, our performance results show that PSJ and BJI outperform the hash-based approach. Overall, our parallel star join algorithm and dataindexes form a winning combination.

B I I O B O B I 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 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 B 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 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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 O O O O

parallel star join
olap
query processing
dataindexes


Contribution to quality of life: A new outcome variable for mobile data service The rapid spread of technological innovations like mobile data services ( MDS) has made mobile computing a fact of everyday life for many people. Therefore, we need to understand the contribution of mobile computing to overall quality of life ( QoL). Employing the satisfaction hierarchy model and bottom- up spillover theory, this study proposes a theoretical model in the context of MDS that connects user satisfaction ( a traditional outcome variable of IT) with contribution to QoL ( a new outcome variable for mobile computing) in a range of life domains. The validity of the proposed model and outcome variable was tested through three empirical studies conducted in Korea. User satisfaction with MDS was found to affect the contribution of MDS to QoL in eleven life domains, and these contributions in turn influenced the overall contribution of MDS to QoL. The paper ends with a discussion of the study's implications and limitations.

O O B I I 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 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

contribution to quality of life
life domain
online survey


An adaptive branch and bound approach for transforming job shops into flow shops In this paper we address the problem of transforming a job shop layout into a flow shop with the objective of minimizing the length of the resulting flow-fine. First, we present five properties of the problem under consideration that are employed for constructing a branch and bound algorithm. The approach is named adaptive since the development of the children nodes depends on the particular instance in order to try tightening the lower bounds and hence performing faster. The computational experiments carried out show the approach to be effective for a variety of problem sizes. (c) 2007 Published by Elsevier Ltd.

O O B I 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 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 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


A 128-bit Chip Identification Generating Scheme Exploiting Load Transistors' Variation in SRAM Bitcells We propose a chip identification (ID) generating scheme with random variation of transistor characteristics in SRAM bitcells. In the proposed scheme, a unique fingerprint is generated by grounding both bitlines in write operations. Through minor modifications, this scheme can be implemented for existing SRAMs. It has high speed, and it can be implemented in a very small area overhead. The generated fingerprint mainly reflects threshold voltages of load transistors in the bitcells. We fabricated test chips in a 65-nm process and obtained 12,288 sets of unique 128-bit fingerprints, which are evaluated in this paper. The failure rate of the IDs is found to be 2.1 x 10(-12).

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 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

chip id
physical unclonable function (puf)


Permutation group approach to the one-dimensional XXX Heisenberg open spin-1/2 chains Permutation group approach to the one-dimensional XXX Heisenberg open spin-1/2 chain with nearest neighbor interaction is proposed, which is formulated not only for half-filling excitations, but also for general case. Regularity of energy matrices and the corresponding wavefunctions are made up by using an induction method, which makes it possible to study the eigenvalue problem systematically. A Mathematica package for generating the energy matrices is implemented according to this procedure.

B I I 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


Is

text-to-speech

synthesis

ready

for

use

in

computer-assisted

language

learning?

Text-to-speech

(TTS)

synthesis,

the

generation

of

speech

from

text

input,

offers

another

means

of

providing

spoken

language

input

to

learners

in

Computer-Assisted

Language

Learning

(CALL)

environments.

Indeed,

many

potential

benefits

(ease

of

creation

and

editing

of

speech

models,

generation

of

speech

models

and

feedback

on

demand,

etc.)

and

uses

(talking

dictionaries,

talking

texts,

dictation,

pronunciation

training,

dialogue

partner,

etc.)

of

TTS

synthesis

in

CALL

have

been

put

forward.

Yet,

the

use

of

TTS

synthesis

in

CALL

is

not

widely

accepted

and

only

a

few

applications

have

found

their

way

onto

the

market.

One

potential

reason

for

this

is

that

TTS

synthesis

has

not

been

adequately

evaluated

for

this

purpose.

Previous

evaluations

of

TTS

synthesis

for

use

in

CALL,

have

only

addressed

the

comprehensibility

of

TTS

synthesis.

Yet,

CALL

places

demands

on

the

comprehensibility,

naturalness,

accuracy,

register

and

expressiveness

of

the

output

of

TTS

synthesis.

In

this

paper,

the

aforementioned

aspects

of

the

quality

of

the

output

of

four

state-of-the-art

French

TTS

synthesis

systems

are

evaluated

with

respect

to

their

use

in

the

three

different

roles

that

TTS

synthesis

systems

may

assume

within

CALL

applications,

namely:

reading

machine,

pronunciation

model

and

conversational

partner

[Handley,

Z.,

Hamel,

M.-J.,

Establishing

a

methodology

for

benchmarking

speech

synthesis

for

computer-assisted

language

learning

(CALL).

Language

Learning

and

Technology

Journal

Retrieved

from:

The

results

of

this

evaluation

suggest

that

the

best

TTS

synthesis

systems

are

ready

for

use

in

applications

in

which

they

add

value

to

CALL,

i.e.

exploit

the

unique

capacity

of

TTS

synthesis

to

generate

speech

models

on

demand.

An

example

of

such

an

application

is

a

dialogue

partner.

In

order

to

fully

meet

the

requirements

of

CALL,

further

attention

needs

to

be

paid

to

accuracy

and

naturalness,

in

particular

at

the

prosodic

level,

and

expressiveness.

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 O O O O O O O O O O O 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 B O O O O O O O O B I 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 I O O O O O O O O O O O B I O O O B O O O O O O B I O B 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 B I O O O O O O O O O O O O O O B I 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 I 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 I O O O O O O O O O O O O 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 B O O O O O O O O O O O O O O O O O O

call
speech synthesis
tts synthesis
evaluation


locality discriminating indexing for document classification This paper introduces a locality discriminating indexing (LDI) algorithm for document classification. Based on the hypothesis that samples from different classes reside in class-specific manifold structures, LDI seeks for a projection which best preserves the within-class local structures while suppresses the between-class overlap. Comparative experiments show that the proposed method isable to derives compact discriminating document representations for classification.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


How to create awareness and ensure broad dissemination of health informatics standards There is a range of organisations with responsibility for information standards development within Australia. These include Standards Australia, which is formally linked to the International Organisation for Standards (ISO), the National Health Information Management Group, which deals with the government sector and several statutory organisations such as the Australian Institute of Health and Welfare and the National Centre for Classification in Health. The different constituencies involved with each of these organisations, the scope of healthcare informatics and the rate of organisational and technological change in the industry present a significant challenge in ensuring that the standard setting process is highly visible, responsive and capable of demonstrating its value through effective implementation. Creating awareness and ensuring broad dissemination of healthcare informatics standards is a key component in meeting this challenge. This can operate at a number of levels from strategic to operational. At the strategic level, it requires active engagement and commitment of the key decision-makers, both political and professional. This may require directly lobbying and promoting the benefits of standardisation to those decision-makers but can be achieved even more effectively by creating industry awareness and demand through carefully targeted presentations on the impact of standards to broader health industry forums. At the tactical level, the standards development medium itself can be used to engage and gain commitment from government, professionals, vendors and the health industry by operating as an inclusive, open and effective process. At the operational level, there is the opportunity for much more efficient use of technology to create awareness of both these processes and their outcomes. The establishment in Australia of a web enabled National Health Information Knowledge base built around ISO standards is one example of the type of development which will assist in the acceleration of awareness of standards and standardisation, which is needed to cope with the increasing demand.

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 B O O O O O O O O O O B 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 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 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 O O O O O O O O O O O O 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 O O O O O O


A methodology for implementing decimator FIR filters on FPGA This paper presents a methodology which can be used to implement any decimator symmetric/antisymmetric (S/A) finite impulse response (FIR) filter. Two varieties are developed: a classic distributed arithmetic (CDA) based and a modified distributed arithmetic (MDA) based one. Both exploit the polyphase structure and the symmetry/antisymmetry of the filter and are evaluated in terms of area efficiency, speed and power consumption. The choice of the algorithm depends on the performance metrics targeted. The methodology has been applied to implement the filter bank CDF9/7 which constitutes a one dimensional (1D) and one level discrete wavelet transform (DWT). The filter bank also known as the bior4.4 biorthogonal wavelets is recommended by the JPEG2000 standard for lossy compression of images and video. The architecture has been implemented on an Altera field programmable gate array (FPGA) and the simulations run in Matlab, Modelsim and Altera Quartus II. The results prove the efficiency of the algorithms and show the tradeoff between the area occupied, the throughput and the power consumption.

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 I O O O O O O B I 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

distributed arithmetic
fir filter
fpga
polyphase structure


The use of hybrid meshes to improve the efficiency of a discontinuous Galerkin method for the solution of Maxwells equations This paper investigates the efficiency of a high-order nodal discontinuous Galerkin method for the numerical solution of Maxwells equations using hybrid meshes. An unstructured triangular or tetrahedral mesh is used near curved boundaries and a structured Cartesian mesh is used to fill the remainder of the domain. A quadrature-free implementation is employed for the regular quadrilateral and hexahedral elements which, together with the reduction in the number of internal faces, leads to a reduction in the cpu time requirements. Numerical examples in two and three dimensions are used to illustrate the benefits of using hybrid meshes.

O O O B I O O O O O O B I O O O O O B I O O O O O O O O O B I O O 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 B I

maxwells equations
discontinuous galerkin
hybrid meshes

high-order approximations
computational cost


Multifunctionality of the ?-thymosin/WH2 module: G-actin sequestration, actin filament growth, nucleation, and severing The ?-thymosin/WH2 actin-binding module shows an amazing adaptation to multifunctionality. The ?-thymosins are genuine G-actin sequesterers of moderate affinity for G-actin, allowing an efficient regulation of the G-actin/F-actin ratio in cells by amplifying changes in the critical concentration for filament assembly. In contrast, the first ?-thymosin domain of the protein Ciboulot makes with G-actin a complex that supports filament growth, such as profilinactin. We illustrate how the use of engineered chimeric proteins, actin-binding and polymerization assays, crystallographic, NMR, and SAXS structural approaches complement each other to decipher the molecular basis for the functional versatility of these intrinsically disordered domains when they form various 1:1 complexes with G-actin. Multifunctionality is expanded in tandem repeats of WH2 domains present in WASP family proteins and proteins involved in axis patterning like Cordon-Bleu and Spire. The tandem repeats generate new functions such as filament nucleation and severing, as well as barbed end binding, which add up to the G-actin sequestering activity. Novel regulation pathways in actin assembly emerge from these additional activities.

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 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


Rational cubic spirals We consider the problem of finding parametric rational Bzier cubic spirals (planar curves of monotonic curvature) that interpolate end conditions consisting of positions, tangents and curvatures. Rational cubics give more design flexibility than polynomial cubics for creating spirals, making them suitable for many applications. The problem is formulated to enable the numerical robustness and efficiency of the solution-algorithm which is presented and analyzed.

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


Numerical modeling of the coupled electromagnetic and thermal fields in the controlled solidification process Purpose - The purpose of this paper is to present the numerical modeling of the coupled electromagnetic and thermal fields for the controlled solidification process of non-ferrous alloys. Design/methodology/approach - The paper uses a numerical modeling program for the controlled solidification process modeling to allow visualization of the model and collection of the data. The data are then processed using spreadsheets in order to obtain graphic representations for the variations of the measured values. Findings - The probes cast using this method will have a uniform structure, without micro-fissures. If the solid part growth of the molten is controlled, the process can be stopped that creates solidification centers, thus the material structure will be homogenous. A solution for this matter is given by the control of the solidification structure using forced heating of the liquid part with eddy currents and forced cooling of the solid part. The evolution of the area with eddy currents and the cooled one controls the phase transformation. Originality/value - It is presented here a computation method for the thermal field diffusion and the results of the numerical modelling of the thermal and electromagnetic fields during casting process with controlled solidification layer for the non-ferrous alloys.

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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

numerical analysis
phase transformations
non-ferrous alloys


A non-linear index to evaluate a journal's scientific impact The purpose of this study is to define a bibliometric indicator of the scientific impact of a journal, which combines objectivity with the ability to bridge many different bibliometric factors and in particular the side factors presented along with celebrated ISI impact factor. The particular goal is to determine a standard threshold value in which an independent self-organizing system will decide the correlation between this value and the impact factor of a journal. We name this factor "Cited Distance Factor (CDF)" and it is extracted via a well-fitted, recurrent Elman neural network. For a case study of this implementation we used a dataset of all journals of cell biology, ranking them according to the impact factor from the Web of Science Database and then comparing the rank according to the cited distance. For clarity reasons we also compare the cited distance factor with already known measures and especially with the recently introduced eigenfactor of the institute of scientific information (ISI). (C) 2010 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 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 B I 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 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


HIV/AIDS: vaccines and alternate strategies for treatment and prevention The symposium HIV/AIDS: Vaccines and Alternate Strategies for Treatment and Prevention brought together HIV vaccine researchers to discuss the latest developments in the field. From basic discoveries in virus diversity and mechanisms of neutralization by antibodies to nonhuman primate research and clinical trials of vaccine candidates in volunteers, scientists are making great strides in understanding the mechanisms that may protect against HIV and pathways to achieve this protection through vaccination.

O O O O O O O O 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 O O O O O O B O O O O O B I 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 O


Modeling and managing of micro grid connected system using Improved Artificial Bee Colony algorithm We determine the microgrid combinations with reduced cost by using IABC technique. We enhance the scout bee phase of the ABC algorithm by using the GSA technique. We examine the optimal combination of the microgrids for various load demands. We analyze the cost factors of the microgrid combinations with various techniques.

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 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

mg
fuel cost
operating and maintenance cost


Coupled BEMFEM analysis of flow and heat transfer over a solar thermal collector A wavelet transform based BEM numerical scheme is used for Large Eddy Simulation of turbulent natural and forced convection of air flowing over a solar thermal collector. The collector is enclosed by vertical fins forming an open shallow cavity. The numerical scheme employs the velocityvorticity formulation of NavierStokes equations using LES turbulence model where boundary element and finite element methods are combined. Grids with up to 2105 nodes are used in simulations lasting for 6104 time steps. Three inflow air velocities are considered corresponding to Reynolds number value up to 2104 2 10 4 . Temperature difference between air and collector of about 50K is considered. Heat transfer from the thermal solar collector is studied via the average Nusselt number value, its time series and its relationship to the values of Reynolds and Rayleigh numbers. The results show that the largest heat losses occur behind the fin due to shedding of large vortices that transport hot air away from the collector. Heat losses decrease along the central part of the collector and feature another smaller peak just before the air hits the fin on the opposite side of the collector.

O O O O O O B I O O B I 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 B I 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 O O 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

solar thermal collector
heat transfer
velocityvorticity
large eddy simulation


Cell-Surface-Bound Nucleic Acids: Free and Cell-Surface-Bound Nucleic Acids in Blood of Healthy Donors and Breast Cancer Patients Concentrations of extracellular DNA and RNA in the blood of healthy donors and patients with malignant and nonmalignant breast tumors were investigated. Cell-surface-bound extracellular DNA and RNA were detached by PBS-EDTA treatment or mild trypsin treatment of erythrocytes and leukocytes. In healthy donors, almost all extracellular nucleic acids (98%) are bound at the surface of blood cells. In the blood of cancer patients, extracellular nucleic acids were found in plasma and not at the cell surface. In patients with nonmalignant breast tumors, extracellular nucleic acids were found both at the surface of blood cells and in plasma. In healthy donors, the cell-surface-bound DNA is represented by 20-kbp DNA fragments and smaller fragments that varied in amounts in different fractions.

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 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

extracellular rna
cell-surface-bound dna
cell-surface-bound rna
fibroadenoma


Depth perception from a 2D natural scene using scale variation of texture patterns In this paper, we introduce a new method for depth perception from a 2D natural scene using scale variation of patterns. As the surface from a 2D scene gets farther away from us, the texture appears finer and smoother. Texture gradient is one of the monocular depth cues which can be represented by gradual scale variations of textured patterns. To extract feature vectors from textured patterns, higher order local autocorrelation functions are utilized at each scale step. The hierarchical linear discriminant analysis is employed to classify the scale rate of the feature vector which can be divided into subspaces by recursively grouping the overlapped classes. In the experiment. relative depth perception of 2D natural scenes is performed on the proposed method and it is expected to play an important role in natural scene analysis.

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 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 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

depth perception
texture gradient
autocorrelation functions


exploring social annotations for the semantic web In order to obtain a machine understandable semantics for web resources, research on the Semantic Web tries to annotate web resources with concepts and relations from explicitly defined formal ontologies. This kind of formal annotation is usually done manually or semi-automatically. In this paper, we explore a complement approach that focuses on the "social annotations of the web" which are annotations manually made by normal web users without a pre-defined formal ontology. Compared to the formal annotations, although social annotations are coarse-grained, informal and vague, they are also more accessible to more people and better reflect the web resources' meaning from the users' point of views during their actual usage of the web resources. Using a social bookmark service as an example, we show how emergent semantics [2] can be statistically derived from the social annotations. Furthermore, we apply the derived emergent semantics to discover and search shared web bookmarks. The initial evaluation on our implementation shows that our method can effectively discover semantically related web bookmarks that current social bookmark service can not discover easily.

O O O O O B B O B O O O O O O O B O B O O B B O O O B 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 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 O O O O O O O O O O B O O O O B B O B O O O O O O B O O O O B O O O O O O O B I O O O O O O O O O O O O O O B I O O O B O B O O O B O O B O O O B O O O O O B O O O O B O O O O O

point
order
web
paper
informal
evaluation
search
ontologies
emergent semantics
research
views
method
users
semantic
implementation
annotation
bookmark

examples
concept
access
normalization
exploration
sharing
social bookmarks
formalism
semantic web
mean
social annotation
resource
emergence


Proper orthogonal decomposition of direct numerical simulation data of by-pass transition Reduced Order Modeling (ROM) of by-pass transition over a zero pressure gradient shear layer data is presented here in a Proper Orthogonal Decomposition (POD) framework. Here, by-pass transition is triggered by a convecting vortex outside the shear layer. POD analysis is relevant for those fluid-structure interaction problems where the fluid dynamical analysis necessarily requires solving the full NavierStokes equation. Two types of cases are reported here for which the vortex is either stationary or it convects with a constant speed. Analysis of the complex unsteady flow is performed by locating the eigenvalues and eigenvectors of the covariance matrix by using Lanczos iteration. The local description produces eigenvectors that match seamlessly due to the linearity property of POD.

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 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

proper orthogonal decomposition
direct numerical simulation

by-pass transition
navierstokes simulation


Collaborative information behaviour - exploring Kuhlthau's Information Search Process model in a group-based educational setting Though much information behaviour takes place in collaborative settings, information behaviour processes are commonly perceived and modelled by information scientists as individual processes. The paper presents and discusses the findings from a qualitative preliminary case study exploring Kuhlthau's Information Search Process (ISP) model in a group-based educational setting. The aim of the study was to explore if members of a group behave differently from the individual modelled in the ISP model and further, if members of a group demonstrate different behaviours or they will assimilate and turn the group into 'an individual', just in another sense. During a project assignment, which lasted seven weeks, two groups of information science students filled out a questionnaire and kept diaries of their activities and information-related behaviour. Further, the students were interviewed three times each during the study. It was found that contextual and social factors seem to affect group members' physical activities and their cognitive and emotional experiences during a project assignment with relevance to information behaviour. Though group members to some extent demonstrated similar cognitive experiences as the individual in the ISP model, these experiences did not only result from information seeking activities but also from work task activities and intragroup interactions. Regarding group members' emotional experiences, no emotional 'turning point' resulting in certainty and relief by the end of the information seeking process was identified. Further, some of the group members still felt uncertain, frustrated and disappointed at the end of the project assignment, which partly was associated with a mis-match in motivations, ambitions and project focus among group members. Regarding the intragroup behaviour, group members did not demonstrate similar behaviours, meaning that 'groups' cannot be perceived or modelled as 'an individual', just in another sense. Groups consist of individuals engaged in and affected by a collaborative problem solving process involving information (seeking) behaviour. A natural extension of the ISP model in relation to group processes is suggested, addressing also the impact of social and contextual factors on the individual's information behaviour. (c) 2004 Elsevier Ltd. All rights reserved.

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 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 O O O O 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 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 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

isp model
collaborative information behaviour
diaries


Low cost IMU-Odometer-GPS ego localization for unusual maneuvers This paper presents the problem of outdoor vehicle localization during unusual maneuvers with the Interacting Multiple Model (IMM) and Extended Kalman Filter (EKF) approaches. IMM, contrary to classical methods, is based on the discretization of the vehicle evolution space into simple maneuvers. Each maneuver is represented by a simple dynamic model such as a constant velocity or a constant turning model. This allows the method to be optimized for highly dynamic vehicles. In this work, we focus on unusual vehicle maneuvers during some special driving situations, including very strong accelerations, high speed turnings or backwards driving with stop stages. The presented results are based on real measurements collected from different scenarios. Based on an EKF vs. IMM comparison, these results show a real interest of using the IMM method in order to take into account unusual maneuvers. (C) 2010 Elsevier B.V. All rights reserved.

O O O O B O O O O O O O O O O O B O O O O O B I 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

localization
kalman filter
interacting multiple model

multiple sensor fusion
intelligent vehicles


Three-dimensional solution structure of Tropidechis carinatus venom extract trocarin: a structural homologue of Xa and prothrombin activator Trocarin belongs to group D of prothrombin activators derived from snake venom of Tropidechis carinatus and is a rich non-hepatic source of Xa, the only known hepatic prothrombin activator. The structural and functional similarity with Xa makes trocarin an interesting target for exploring the structure-functional relationship with Xa. Herein we report a predicted complete three-dimensional all-atom structural model of trocarin equilibrated in explicit water using 4 ns of molecular dynamics simulation. The tertiary structure was modeled using the structure of human blood coagulation factor Xa. The conformational and structural features of trocarin are then compared with the X-ray crystal and solution simulation structures of human factor Xa. The modeled structure of trocarin has four individual domains (Gla, EGF1, EGF2 and SP) connected along the long axis with similar secondary structural elements to Xa. The simulations suggest that sodium ion binding in the serine protease domain is impaired in trocarin as compared to Xa. In contrast to Xa, for which the sodium ion forms an octahedral coordination network that brings two loop regions connecting four anti-parallel beta-sheets together, we do not find a similar pattern of network in trocarin. We observe that the difference in the binding pattern of sodium ion leads to a similar to2-Angstrom "shrinkage" of the beta2 strand (B2), in comparison to human Xa, as marked by a shorter distance between (189)Asp373 (S1-site residue) and (195)Ser379 (active-site residue) in the B2 strand. We propose that these differences may be linked to the experimentally observed lower amidolytic activity of trocarin as compared to Xa.

O O O O B I O O B O O O O O O O O B O O O O O 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 B 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 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 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 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 B O O O O

tropidechis carinatus
trocarin
snake venom
blood coagulation

homology modeling
molecular dynamics simulations


A similarity-based bidirectional approximate reasoning method for decision-making systems This paper presents a similarity-based bidirectional approximate reasoning method which can express the decision maker's disposition. For this, we shall propose a new type of similarity measure based on the ordered weighted aggregation (OWA) operator. The proposed similarity measure has a structure to involve the disposition of a decision maker by choosing a suitable weighting vector of the OWA operator. From this property, we derive a simple and flexible type of similarity-based bidirectional approximate reasoning method which can support the making of a decision under more complex situations such as industrial inspection systems for example. (C) 2001 Elsevier Science B.V. All rights reserved.

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 B I O O O O O O 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 B 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 O O O O O O O O O O O O O O

similarity measure
bidirectional approximate reasoning
owa operator


A GIS-BASED DECISION SUPPORT SYSTEM FOR PLANT SPECIES SELECTION IN DUMP AREA REVEGETATION In this study a GIS-based decision support system (DSS) was built for selecting proper plant species in dump area revegetation. This was done by integrating a matching model fuzzy pattern recognition (FPR) and a benefit optimization model dynamic programming (DP) into geographical information system (GIS) software (ArcGIS 9.2) as a toolbar (DLL) using ArcObjects in ArcGIS and Visual Basic 6. The DSS consists of database, model base, rule base and parameter weighting database. The parameters come from soil, climate, plant characteristic, ecology, landscape and social. This database includes detailed data about plant types and their properties. The proposed system is able to integrate both the quantitative and qualitative factors together. For the qualitative factors, IF THEN rules are summarized from the questionnaire survey for the production experts. In this DSS complex problems are solved within program so that proper plant and plant distribution are automatically tracked when the dump area environmental changes. This DSS can help land consolidation managers to analyze and visualize (charts, maps) the possible plant species of dump area revegetation, such as plant characters, proper plant species, benefit of plant and the map for the plant distribution. Finally, a case study is conducted to demonstrate the procedure of the proposed system and identify the suitable proper plant species.

O O O O O O B I I 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 B I I 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 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

plant species selection
fuzzy pattern recognition
dynamic programming
revegetation


A fuzzy DEA and knapsack formulation integrated model for project selection Project selection has become crucial in the fields of science and engineering. This paper discusses the specific problem of selecting a portfolio of projects that achieves an organization's objectives without exceeding limited capital resources, especially when each project possesses vague input and output data in the selection. In this paper, a data envelopment analysis (DEA), knapsack formulation and fuzzy set theory integrated model is proposed to deal with the problem, and the model is demonstrated via a case study problem in engineering-procurement-construction (EPC) industry. Moreover, this paper applies three constraint handling techniques, which are factor-free penalty function based, to transform a constrained optimization problem into an unconstrained problem, and for the first time adopts the artificial bee colony (ABC) algorithm to search the solutions. The performances of these three constraint handling techniques with respect to the ABC algorithm are compared for the first time in this paper.

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 O O O O O O O O O O O O O O O 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 B I 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 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

project selection
constraint handling techniques
penalty function
fuzzy set theory

data envelopment analysis (dea)
knapsack problem
artificial bee colony (abc)


Modified matrix splitting method for the support vector machine and its application to the credit classification of companies in Korea This research proposes a solving approach for the ?-support vector machine (SVM) for classification problems using the modified matrix splitting method and incomplete Cholesky decomposition. With a minor modification, the dual formulation of the ?-SVM classification becomes a singly linearly constrained convex quadratic program with box constraints. The Kernel Hessian matrix of the SVM problem is dense and large. The matrix splitting method combined with the projection gradient method solves the subproblem with a diagonal Hessian matrix iteratively until the solution reaches the optimum. The method can use one of several line search and updating alpha methods in the projection gradient method. The incomplete Cholesky decomposition is used for the calculation of the large scale Hessian and vectors. The newly proposed method applies for a real world classification problem of the credit prediction for small-sized Korean companies.

O B I I O O B I I 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 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 B I I 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 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

support vector machine
matrix splitting method
incomplete cholesky decomposition
projection gradient method

convex programming
company credit prediction


Limit cycle prediction of a neurocontrol vehicle system based on gain-phase margin analysis Based on some useful frequency domain methods, this paper proposes a systematic procedure to address the limit cycle prediction of a neural vehicle control system with adjustable parameters. A simple neurocontroller can be linearized by using describing function method firstly. According to the classical method of parameter plane, the stability of linearized system with adjustable parameters is then considered. In addition, gain margin and phase margin for limit cycle generation are also analyzed by adding a gain-phase margin tester into open loop system. Computer simulations show the efficiency of this approach.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

neural network
describing functions
gain-phase margin


Intelligent data analysis and model interpretation with spectral analysis fuzzy symbolic modeling This paper proposes fuzzy symbolic modeling as a framework for intelligent data analysis and model interpretation in classification and regression problems. The fuzzy symbolic modeling approach is based on the eigenstructure analysis of the data similarity matrix to define the number of fuzzy rules in the model. Each fuzzy rule is associated with a symbol and is defined by a Gaussian membership function. The prototypes for the rules are computed by a clustering algorithm, and the model output parameters are computed as the solutions of a bounded quadratic optimization problem. In classification problems, the rules' parameters are interpreted as the rules' confidence. In regression problems, the rules' parameters are used to derive rules' confidences for classes that represent ranges of output variable values. The resulting model is evaluated based on a set of benchmark datasets for classification and regression problems. Nonparametric statistical tests were performed on the benchmark results, showing that the proposed approach produces compact fuzzy models with accuracy comparable to models produced by the standard modeling approaches. The resulting model is also exploited from the interpretability point of view, showing how the rule weights provide additional information to help in data and model understanding, such that it can be used as a decision support tool for the prediction of new data. (C) 2011 Elsevier Inc. All rights reserved.

O O O O O O O B I 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 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

fuzzy system models
pattern recognition
function approximation
learning


Bibliographic description of electronic resources and user needs This paper discusses various examples of selection, bibliographic description of electronic resources, and how the mediation provided by librarians can help users with their choices during searching. Users are confronted with more information than ever before, and their expectations are becoming increasingly diverse. This article presents several observations gathered from public libraries and considers the conditions of access and description to electronic resources in various French libraries. Finally added value in authority records is discussed, with particular reference to URLs.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 B O O O O O O O O O O O O O

electronic media
internet
bibliographies
user satisfaction
france


integrating user operations in multichannel hypermedia Web Applications are progressively becoming multi-channel and cross-channel . The "same" service should be made available in different delivery environments and devices. A user may invoke a service on one device, suspend it, and complete its execution in another one. In this paper we provide the reader with the main concepts and innovative aspects of MC2 a design framework for specifying Multi/Cross Channel web application services. MC2 adopts an high-level, end user perspective and exploits the notion of context , to characterize who, where and how an operation can be invoked.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

multi-channel
uml
conceptual modelling
ocl
web operations
services on the web


About regression-kriging: From equations to case studies ? This paper discusses the characteristics of regression-kriging (RK), its strengths and limitations, and illustrates these with a simple example and three case studies. RK is a spatial interpolation technique that combines a regression of the dependent variable on auxiliary variables (such as land surface parameters, remote sensing imagery and thematic maps) with simple kriging of the regression residuals. It is mathematically equivalent to the interpolation method variously called Universal Kriging (UK) and Kriging with External Drift (KED), where auxiliary predictors are used directly to solve the kriging weights. The advantage of RK is the ability to extend the method to a broader range of regression techniques and to allow separate interpretation of the two interpolated components. Data processing and interpretation of results are illustrated with three case studies covering the national territory of Croatia. The case studies use land surface parameters derived from combined Shuttle Radar Topography Mission and contour-based digital elevation models and multitemporal-enhanced vegetation indices derived from the MODIS imagery as auxiliary predictors. These are used to improve mapping of two continuous variables (soil organic matter content and mean annual land surface temperature) and one binary variable (presence of yew). In the case of mapping temperature, a physical model is used to estimate values of temperature at unvisited locations and RK is then used to calibrate the model with ground observations. The discussion addresses pragmatic issues: implementation of RK in existing software packages, comparison of RK with alternative interpolation techniques, and practical limitations to using RK. The most serious constraint to wider use of RK is that the analyst must carry out various steps in different software environments, both statistical and GIS.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

spatial prediction
multiple regression
gstat
environmental predictors
srtm