Robust dissipative control for internet-based switching systems A class of hybrid multi-rate control models with time-delay and switching controllers are formulated based on combined remote control and local control strategies. The problem of robust dissipative control for this discrete system is investigated. An improved LyapunovKrasovskii functional is constructed and the subsequent analysis provides some new sufficient conditions in the form of LMIs for both nominal and uncertain representations. Several special cases of practical interests are derived. A numerical simulation example is given to illustrate the effectiveness of the theoretical result.

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

dissipative control
switching controllers
lmis

internet-based switching systems
multi-rate control models


Estimating receptive fields in the presence of spike-time jitter Neurons in sensory systems are commonly characterized by their receptive fields. These are experimentally often obtained by reverse-correlation analyses, for example, by calculating the spike-triggered average. The reverse-correlation approach, however, generally assumes a fixed temporal relation between spike-generating stimulus features and measured spikes. Temporal jitter of spikes will therefore distort the estimated receptive fields. Here, a novel extension of widely used reverse-correlation techniques (spike-triggered average as well as spike-triggered covariance) is presented that allows accurate measurements of receptive fields even in the presence of considerable spike-time jitter. It is shown that the method correctly recovers the receptive fields from simulated spike trains. When applied to recordings from auditory receptor cells of locusts, a considerable sharpening of receptive fields as compared to standard spike-triggered averages is observed. In addition, the multiple filters that are obtained from a conventional spike-triggered covariance analysis of these data can be collapsed into a single component if spike jitter is accounted for. Finally, it is shown how further effects on spike timing, such as systematic shifts in spike latency, can be included in the approach.

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

receptive field
reverse correlation
spike-triggered analysis


Topological conceptual model of geological relative time scale for geoinformation systems In geological information systems, the methods of encoding geological age, both relative and absolute, play an important role. Interoperable exchange of information between these systems requires application of solutions based upon recognized international standards. The ISO 19108 standard can serve as a basis for elaboration of a conceptual model for geological data, as well as its implementation, for instance in Extensible Markup Language (XML). The nature of the relative geological time scale requires application of topological elements in this model, and the model presented here is a complex construction of such elements. As a result, operations of the interface used for objects belonging to classes derived from the TimeTopologicalOrdinalEra class may return a value in the form of topological time relations such as: Before, After, During and OverlappedBy.

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

geographic information system
ordinal temporal reference system
uml language
xml language
topological relation


The Involvement of Thyroid Hormone Metabolism in Gilthead Sea Bream (Sparus auratus) Osmoregulation Abstract: We have investigated the effect of adaptation to low salinity water on the thyroid status of the euryhaline teleost, Sparus auratus. We show that, following low salinity adaptation, the plasma T4 concentration increases and branchial deiodination activities of T4, T3, and rT3 decrease. Moreover, branchial and hepatic enzyme activities that are putatively involved in thyroid hormone metabolism respond differentially in low salinity conditions. Our results indicate the involvement of thyroid hormones in Sparus auratus osmoregulation. Moreover, the gills appear well equipped to play an important role in the modulation of plasma thyroid hormone titers.

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

thyroid hormone
osmoregulation
sparus auratus


A lower-bound formulation for the geometry and topology optimization of truss structures under multiple loading In this contribution, we propose an effective formulation to address the stress-based minimum volume problem of truss structures. Starting from the lower-bound formulation in topology optimization, the problem is further expanded to geometry optimization and multiple loading scenarios, and systematically reformulated to alleviate numerical difficulties related to the melting node effect and stress singularities. The subsequent simultaneous analysis and design (SAND) formulation is well suited for a direct treatment by introducing a barrier function. Using exact second derivatives, this difficult class of problem is solved by sequential quadratic programming with trust regions. These building blocks result into an integrated design process. Two examples-including a large-scale application-illustrate the robustness of the proposed formulation.

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

geometry optimization
topology optimization
multiple loading
melting node effect
simultaneous analysis and design


Flexible and stretchable micro-electrodes for in vitro and in vivo neural interfaces Microelectrode arrays (MEAs) are designed to monitor and/or stimulate extracellularly neuronal activity. However, the biomechanical and structural mismatch between current MEAs and neural tissues remains a challenge for neural interfaces. This article describes a material strategy to prepare neural electrodes with improved mechanical compliance that relies on thin metal film electrodes embedded in polymeric substrates. The electrode impedance of micro-electrodes on polymer is comparable to that of MEA on glass substrates. Furthermore, MEAs on plastic can be flexed and rolled offering improved structural interface with brain and nerves in vivo. MEAs on elastomer can be stretched reversibly and provide in vitro unique platforms to simultaneously investigate the electrophysiological of neural cells and tissues to mechanical stimulation. Adding mechanical compliance to MEAs is a promising vehicle for robust and reliable neural interfaces.

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

micro-electrodes
polymers
action potentials
field potentials
peripheral nerve
slice culture


Study of temporal stationarity and spatial consistency of fMRI noise using independent component analysis Spatial independent component analysis (ICA) was used to study the temporal stationarity and spatial consistency of structured functional MRI (fMRI) noise. Spatial correlations have been used in the past to generate filters for the removal of structured noise for each time-course in an fMRI dataset. It would be beneficial to produce a multivariate filter based on the same principles. ICA is examined to determine if it has properties that are beneficial for this type of filtering. Six fMRI baseline datasets were decomposed via spatial ICA. The time-courses associated with each component were tested for wide-sense stationarity using the wide sense stationarity quotient (WSS). Each dataset was divided into three subsets and each subset was decomposed. The components of first and third subset were matched by the strength of their correlation. The components produced by ICA were found to have largely nonstationary time-courses. Despite the temporal nonstationarity in the data, ICA was found to produce consistent spatial components. The degree of correlation among components differed depending on the amount of dimension reduction performed on the data. It was found that a relatively small number of dimensions produced components that are potentially useful for generating a spatial fMRI filter.

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

functional mri (fmri)
independent component analysis (ica)
stationarity of structured noise


Petri Net-Based FTL Architecture for Parametric WCET Estimation via FTL Operation Sequence Derivation A flash translation layer (FTL) provides file systems with transparent access to NAND flash memory. Although many applications running on it require real-time guarantees, it is difficult to provide tight worst case execution time (WCET) bounds with conventional static WCET analysis since an FTL exhibits a large variance in execution time depending on its runtime state. Parametric WCET analysis could be an effective alternative but it is also challenging to formulate a parametric WCET function for an FTL program because traditional FTL architecture does not properly model the runtime availability of flash resources in its code structure. To overcome such a limitation, we propose Petri net-based FTL architecture where a Petri net explicitly specifies dependencies between FTL operations and the runtime resource availability. It comes with an FTL operation sequencer that derives at runtime the shortest sequence of FTL operations for servicing an incoming FTL request under the current resource availability. The sequencer computes the WCET of the request by merely summing the WCETs of only those FTL operations in the sequence. Our experimental results show the effectiveness of our FTL architecture. It allowed for tight WCET estimation that yielded WCETs shorter by a factor of 54 than statically analyzed ones.

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

real-time and embedded systems
software architectures
performance modeling and prediction


Students participation intention in an online discussion forum: Why is computer-mediated interaction attractive? Anecdotal evidence indicates that an online discussion forum may not be utilized to its full potential in enhancing the effectiveness and efficiency of teaching due to a lower than expected student participation rate. This paper seeks to identify the motivational behavioral factors influencing students intention to participate in an online discussion forums (ODF). Drawing on the literature on social psychology and applying the theory of reasoned action, we develop a conceptual model of intention to participate in an online discussion forum and empirically test the hypotheses in a cross-sectional quantitative survey. The findings indicate that expectancy on hedonic outcome and utilitarian outcome and peer pressure positively influence the participation intention of students. Also, the perceived importance of learning positively moderates the relationship between utilitarian outcome expectancy and participation intention. Theoretical and practical implications of the findings are discussed.

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

online discussion forum
theory of reasoned action


Transient response of a plateliquid system under an aerial detonation : Simulations and experiments The unsteady flow equations for air blasts were solved with a home house CFD code. The simulation of the plateliquid system under this blast load has been validated. Space and time scales of the CFD and structural models are made compatible. Experimental strains and pressures show good agreement with the simulations.

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

blast wave
fluidstructure interaction
cartesian methods
reduced scale experiments


On equations for union-free regular languages In this paper we consider the variety UF, generated by all algebras of binary relations equipped with the operations of composition, reflexive-transitive closure, and the empty set and the identity relation as constants. This variety coincides with the variety generated by the union-free reducts of Kleene algebras of languages and its free objects are formed by union-free regular languages, that is, regular languages represented by regular expressions having no occurrence of +. We show that the variety UF; is not finitely based. The situation does not change if we consider the variety UFv generated by the above algebras of binary relations equipped with the conversion operation. (C) 2001 Academic Press.

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

regular language
kleene algebra
equational logic


A

reappraisal

on

advanced

planning

and

scheduling

systems

Purpose

This

paper

sets

out

to

present

a

reappraisal

on

advanced

planning

and

scheduling

(APS)

systems

in

industrial

settings

and

propose

an

effective

approach

for

APS

implementation.

Design/methodology/approach

A

case

study

approach

is

adopted,

and

a

research

framework

comprising

human-,

technological-,

and

organizational-dimensions

is

developed

to

analyze

the

evidence

database

which

includes

business

flows,

system

design

documents,

archival

records,

post-system

assessment,

participant-observation

and

semi-structured

interviews.

Findings

The

findings

indicate

that

real-world

production

planning

problems

are

ill-defined,

complex

and

dynamic.

A

post-implementation

evaluation

reveals

major

pitfalls

in

the

technology-dominant

approach,

whose

negative

ramifications

are

usually

overlooked.

Besides,

these

APS

implementation

pitfalls

are

found

to

be

attributable

to

the

real-world

context,

human

factors

and

organizational

aspects.

Research

limitations/implications

Despite

advances

in

information

technology

(IT)

and

computer

modeling

techniques,

humans

still

play

critical

roles

in

the

production-planning

processes

especially

in

a

complex

and

dynamic

manufacturing

environment

where

incomplete,

ambiguous,

inconsistent

and

untimely

data

make

automatic

planning

unrealistic.

A

rational

human-computer

collaboration

scheme

under

an

effective

organizational

structure

would

be

in

a

better

position

to

take

advantage

of

the

IT.

Originality/value

This

paper

presents

a

humans-technology-organization-framework

of

real

planning

systems,

which

is

employed

to

analyze

a

case

of

APS

implementation.

Practical

insights

are

extracted

as

a

result

of

this

field

research,

and

a

realist

approach

is

proposed

to

cope

with

the

problems

and

pitfalls

of

APS

implementation

in

industrial

settings.

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

supply chain management
semiconductors
production scheduling
human resource accounting


Dominant parameter selection in the marginally identifiable case Often a rather limited set of experimental data is available for the identification of a dynamic model, which contains many parameters. This is, e.g. the usual case for crop growth models. In this situation, only some parameter values can be estimated. Based on an analysis of the Fisher information matrix, a method for a reasonable selection of parameters is suggested here. The method chooses the most sensitive parameters, i.e. those to which the model under the considered experimental conditions is most sensitive, and excludes both coupled parameters and those that exhibit multiplecorrelation. A comparison with different ridge regression methods is made. The methodology is illustrated with a simple lettuce growth model. (C) 2003 IMACS. Published by 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 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

model calibration
system identification
fisher matrix


Parallels between the analytic hierarchy and network processes (AHP/ANP) and fractal geometry The aim of this work is to show the parallelisms and analogies that exist in modeling and measuring of dependence and feedback processes, in physical and in decision making processes, that is, to compare among the scales of measurement of the physical world (geometry) and the scales of measurement of the human being's internal decision process, in other words, the brain's internal generation of a relative measure scale. (C) 2007 Elsevier Ltd. All rights reserved.

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

anp
fractals
system representations
history


Development of a hybrid methodology for dimensionality reduction in Mahalanobis-Taguchi system using Mahalanobis distance and binary particle swarm optimization Mahalanobis-Taguchi System (MTS) is a pattern recognition method applied to classify data into categories - "healthy" and "unhealthy" or "acceptable" and "unacceptable". MTS has found applications in a wide range of problem domains. Dimensionality reduction of the input set of attributes forms an important step in MTS. The current practice is to apply Taguchi's design of experiments (DOE) and orthogonal array (OA) method to achieve this end. Maximization of Signal-to-Noise (SIN) ratio forms the basis for selection of the optimal combination of variables. However the DOE-OA method has been reviewed to be inadequate for the purpose In this research study, we propose a dimensionality reduction method by addressing the problem as feature selection exercise. The optimal combination of attributes minimizes a weighted sum of total fractional misclassification and the percentage of the total number of variables employed to obtain the misclassification. Mahalanobis distances (MDs) of "healthy" and "unhealthy" conditions are used to compute I he misclassification. A mathematical model formulates the feature selection approach and it is solved by binary particle swarm optimization (PSO). Data from an Indian foundry shop is adopted to test the mathematical model and the swarm heuristic. Results are compared with that of DOE-OA method of MTS. (C) 2009 Elsevier Ltd. All rights reserved

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

dimensionality reduction
feature selection
mahalanobis distance
orthogonal array
binary particle swarm optimization


real time design and animation of fractal plants and trees The goal of science is to understand why things are the way they are. By emulating the logic of nature, computer simulation programs capture the essence of natural objects, thereby serving as a tool of science. When these programs express this essence visually, they serve as an instrument of art as well.This paper presents a fractal computer model of branching objects. This program generates pictures of simple orderly plants, complex gnarled trees, leaves, vein systems, as well as inorganic structures such as river deltas, snow flakes, etc. The geometry and topology of the model are controlled by numerical parameters which are analogous to the organism's DNA. By manipulating the genetic parameters, one can modify the geometry of the object in real time, using tree based graphics hardware. The random effects of the environment are taken into account, to produce greater diversity and realism. Increasing the number of significant parameters yields more complex and evolved species.The program provides a study in the structure of branching objects that is both scientific and artistic. The results suggest that organisms and computers deal with complexity in similar ways.

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

geometry
design
fractal
tool
object
trees
account
art
instrument
paper
model
graphics hardware
program
science
structure
systems
diversity
computer simulation
logic
complexity
animation

computation
topologies
real-time
randomization
organization
environments
computer modeling
effect


The fully implicit stochastic-? ? method for stiff stochastic differential equations ? A fully implicit integration method for stochastic differential equations with significant multiplicative noise and stiffness in both the drift and diffusion coefficients has been constructed, analyzed and illustrated with numerical examples in this work. The method has strong order 1.0 consistency and has user-selectable parameters that allow the user to expand the stability region of the method to cover almost the entire drift-diffusion stability plane. The large stability region enables the method to take computationally efficient time steps. A system of chemical Langevin equations simulated with the method illustrates its computational efficiency.

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

multiplicative noise
chemical langevin equations

stiff stochastic differential equation
fully implicit numerical method


Looking beyond learning: notes towards the critical study of educational technology This paper makes a case for academic research and writing that looks beyond the learning potential of technology and, instead, seeks to develop social scientific accounts of the often compromised and constrained realities of education technology use on the ground. The paper discusses how this critical approach differs from the ways that educational technology scholarship has tended to be pursued to date. These differences include viewing technology as being socially constructed and negotiated rather than imbued with pre-determined characteristics; developing objective and realistic accounts of technology use in situ; and producing context rich analyses of the social conflicts and politics that underpin the use of technology in educational settings. The paper concludes by encouraging academic researchers and writers to show greater interest in the issues of democracy and social justice that surround educational technology.

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


A soft computing method to predict sludge volume index based on a recurrent self-organizing neural network The structure of RSONN can be self-organized based on the contributions of each hidden node, which uses not only the past states but also the current states. The appropriately adjusted learning rates of RSONN is derived based on the Lyapunov stability theorem. Moreover, the convergence of the proposed RSONN is discussed. An experimental hardware, including the proposed soft computing method is set up. The experimental results have confirmed that the soft computing method exhibits satisfactory predicting performance for SVI.

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

soft computing method
sludge volume index


Varieties of Helmholtz Machine The Helmholtz machine is a new unsupervised learning architecture that uses top-down connections to build probability density models of input and bottom-up connections to build inverses to those models. The wake-sleep learning algorithm for the machine involves just the purely local delta rule. This paper suggests a number of different varieties of Helmholtz machines, each with its own strengths and weaknesses, and relates them to cortical information processing. Copyright 1996 Elsevier Science Ltd.

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


Cyclophosphamides as hypoxia-activated diffusible cytotoxins: A theoretical study Cyclophosphamides have been in clinical use as anti-cancer drugs for a long time and much research has been directed towards reducing their side effects. Here we have performed a theoretical investigation into the possibility of designing bioreductive analogues of cyclophosphamides. Our calculations have employed semiempirical molecular orbital AM1-SM2 and PM3-SM3 calculations, as implemented in MOPAC 93, which include a modified Born method for the treatment of solvation. We have investigated the effect of bioreductive activation on the beta-elimination reaction that is central to the activation of cyclophosphamides. The approach was tested on two known bioreductive agents, including CB1954, and gave results in agreement with experiment. Non-local density functional calculations on CB1954 and its metabolites, including the radical anion, were in agreement with the semiempirical calculations. The calculations have identified a number of potentially novel bioreductive cyclophosphamides. In particular, our calculations identified compounds in which the initial one-electron reduction was not activating. Such compounds are likely to be more effective bioreductive agents, as the beta-elimination will not compete under oxic conditions with the important re-oxidation required for the protection of oxic tissue.

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

bioreductive
cyclophosphamides
molecular orbital


power-aware operand delivery Based on operand delivery, existing microprocessors can be categorized into architected register file ( ARF ) or physical register file ( PRF ) machines, both with or without payload RAM ( PL ). Though many previous generation microprocessors use a PRF without PL , the trend of newer microprocessors targeting lower power environments seem to be moving towards ARF with PL . We quantitatively analyze power consumption of different machine styles: ARF with PL , ARF without PL , PRF with PL , and PRF only machine. Our result shows that PRF without PL consumes the least amount of power and is fundamentally the best approach for building power-aware out-of-order microprocessors.

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


Nanomechanical strength mechanisms of hierarchical biological materials and tissues Biological protein materials (BPMs), intriguing hierarchical structures formed by assembly of chemical building blocks, are crucial for critical functions of life. The structural details of BPMs are fascinating: They represent a combination of universally found motifs such as -helices or -sheets with highly adapted protein structures such as cytoskeletal networks or spider silk nanocomposites. BPMs combine properties like strength and robustness, self-healing ability, adaptability, changeability, evolvability and others into multi-functional materials at a level unmatched in synthetic materials. The ability to achieve these properties depends critically on the particular traits of these materials, first and foremost their hierarchical architecture and seamless integration of material and structure, from nano to macro. Here, we provide a brief review of this field and outline new research directions, along with a review of recent research results in the development of structure-property relationships of biological protein materials exemplified in a study of vimentin intermediate filaments.

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

hierarchical
biological protein materials
vimentin

nanomechanics fracture deformation experiment simulation cytoskeleton


Dense Crystalline Dimer Packings of Regular Tetrahedra We present the densest known packing of regular tetrahedra with density phi = 4000/4671 = 0.856341 .... Like the recently discovered packings of Kallus et al. and Torquato-Jiao, our packing is crystalline with a unit cell of four tetrahedra forming two triangular dipyramids (dimer clusters). We show that our packing has maximal density within a three-parameter family of dimer packings. Numerical compressions starting from random configurations suggest that the packing may be optimal at least for small cells with up to 16 tetrahedra and periodic boundaries.

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

crystallography
regular solid
hilbert problem


A generic architecture to synchronise design models issued from heterogeneous business tools: towards more interoperability between design expertises Product development involves many experts collaborating to the same design goal. Every expert has his own formalisms and tools leading to a high heterogeneity of information systems supporting design activities. Interoperability became a major challenge to avoid information incompatibility along the product life cycle. To synchronise heterogeneous representations of product will be a major step to integrate expert activities. In this paper, the authors propose a meta-model framework to connect together heterogeneous design models. This meta-model framework is used to formalise possible interactions between heterogeneous representations. Interaction formalisation is considered as a key point to synchronise heterogeneous models and to provide more interoperability between various computer assisted systems. The synchronisation loop is also presented as a major sequence of activities to manage collaborative design. Tools to support synchronisation are proposed. However, through a basic case study, authors highlight what can be automated and where human intervention is still expected.

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

collaborative design
interoperability
heterogeneous models
synchronisation


Oh behave! Agent-based behavioral representations in problem solving environments The development of deregulated electricity systems around the world has produced the need for simulation systems that are capable of addressing the complexities that arise in the new markets. Agent-based models allow the use of complex adaptive systems approaches that are capable of producing tools or problem solving environments that can address the behavior of each of the participants within the electricity market. The agents in the tools are allowed to establish their own objectives and apply their own decision rules. They can be developed to learn from their previous experiences and change their behavior when future opportunities arise. In this paper, we will argue that the same type of agent-based technology that is used to produce realistic agent behavior in agent-based simulation tools at Argonne National Laboratory can also be used to embed these tools in problem solving environments.

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

problem solving environments
behavioral representations


Keypoint recognition using randomized trees In many 3D object-detection and pose-estimation problems, runtime performance is of critical importance. However, there usually is time to train the system, which we will show to be very useful. Assuming that several registered images of the target object are available, we developed a keypoint-based approach that is effective in this context by formulating wide-baseline matching of keypoints extracted from the input images to those found in the model images as a classification problem. This shifts much of the computational burden to a training phase, without sacrificing recognition performance. As a results, the resulting algorithm is robust, accurate, and fast-enough for frame-rate performance. This reduction in runtime computational complexity is our first contribution. Our second contribution is to show that, in this context, a simple and fast keypoint detector suffices to support detection and tracking even under large perspective and scale variations. While earlier methods require a detector that can be expected to produce very repeatable results, in general, which usually is very time-consuming, we simply find the most repeatable object keypoints for the specific target object during the training phase. We have incorporated these ideas into a real-time system that detects planar, nonplanar, and deformable objects. It then estimates the pose of the rigid ones and the deformations of the others.

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

image processing and computer vision
object recognition
statistical
classifier design and evaluation
edge and feature detection


Driver behaviour at roadworks Road networks around the world are reaching a critical stage in their lifecycle. Transport authorities are planning significant maintenance activities with associated roadworks and traffic management. Traffic microsimulation is used to plan these roadworks but modelled drivers are not behaving in the same way as real drivers. A range of psychological explanations for this difference are reviewed. Guidance for incorporating these psychological factors into future models is proposed.

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

roadworks
driver behaviour
microsimulation


Sally: A Tool for Embedding Strings in Vector Spaces Strings and sequences are ubiquitous in many areas of data analysis. However, only few learning methods can be directly applied to this form of data. We present Sally, a tool for embedding strings in vector spaces that allows for applying a wide range of learning methods to string data. Sally implements a generalized form of the bag-of-words model, where strings are mapped to a vector space that is spanned by a set of string features, such as words or n-grams of words. The implementation of Sally builds on efficient string algorithms and enables processing millions of strings and features. The tool supports several data formats and is capable of interfacing with common learning environments, such as Weka, Shogun, Matlab, or Pylab. Sally has been successfully applied for learning with natural language text, DNA sequences and monitored program behavior.

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

string embedding
bag-of-words models
learning with sequential data


photon splatting for participating media Since the beginning of image synthesis, much research have been done on global illumination simulation. However, simulation in participating media is still an open problem as far as computing time is concerned. Recently some methods, like Photon Mapping, proposed an optimization of the resolution of global illumination in participating media. Nevertheless, the computing costs of these methods remain very expensive.In this paper, we present a method which takes advantage of density estimation to efficiently reconstruct volume irradiance from the photon map. Our idea is to separate the computation of emission, absorption and out-scattering from the computation of in-scattering. Then we use a dual approach of density estimation to optimize this last part as it is the most computational expensive. Our method extends Photon Splatting, which optimizes the computation time of Photon Mapping for surface rendering, to participating media, and then considerably reduce participating media rendering times. Even though our method is faster than Photon Mapping for equal quality, we also propose a GPU based optimization of our algorithm.

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

density estimation
participating media
photon splatting
global illumination


A genetic algorithm based approach for simultaneously balancing and sequencing of mixed-model U-lines with parallel workstations and zoning constraints This paper presents a Priority-Based Genetic Algorithm (PGA) based method for the simultaneously tackling of the mixed-model U-shape assembly line (MMUL) line balancing/model sequencing problems (MMUL/BS) with parallel workstations and zoning constraints and allows the decision maker to control the process to create parallel workstations and to work in different scenarios. In the presented method, simulated annealing based fitness evaluation approach (SABFEA) is developed to be able to make fitness function calculations easily and effectively. A new fitness function is adapted to MMULs for aiming at minimizing the number of workstations as primary goal and smoothing the workload between-within workstations by taking all cycles into consideration. A numerical example to clarify the solution methodology is presented. Performance of the proposed approach is tested through sets of test problem with randomly generated minimum part sets. The results of the computational experiments indicate that SABFEA works with PGA very concordantly; and it is an effective method in solving MMUL/BS with parallel workstations and zoning constraints. (C) 2011 Elsevier Ltd. All rights reserved.

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

mixed-model u-shape balancing/sequencing problem


URSA: A SYSTEM FOR UNIFORM REDUCTION TO SAT There are a huge number of problems, from various areas, being solved by reducing them to SAT. However, for many applications, translation into SAT is performed by specialized, problem-specific tools. In this paper we describe a new system for uniform solving of a wide class of problems by reducing them to SAT. The system uses a new specification language URSA that combines imperative and declarative programming paradigms. The reduction to SAT is defined precisely by the semantics of the specification language. The domain of the approach is wide (e.g., many NP-complete problems can be simply specified and then solved by the system) and there are problems easily solvable by the proposed system, while they can be hardly solved by using other programming languages or constraint programming systems. So, the system can be seen not only as a tool for solving problems by reducing them to SAT, but also as a general-purpose constraint solving system (for finite domains). In this paper, we also describe an open-source implementation of the described approach. The performed experiments suggest that the system is competitive to state-of-the-art related modelling systems.

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


Transient analysis of zero attracting NLMS algorithm without Gaussian inputs assumption ? We present the individual weight error variance analysis (IWV) of the ZA-NLMS algorithm without Gaussian inputs assumption. Our IWV analysis is based on exact individual weight error relation. we use IWV analysis to derive the transient and steady-state behavior of the ZA-NLMS algorithm without restricting the input to being Gaussian or white. We use IWV analysis to deduce the mean square convergence condition on step-size for the ZA-NLMS algorithm.

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

zero attracting
individual weight error variance
transient analysis


An entropy-based query expansion approach for learning researchers dynamic information needs Proposing an entropy-based query expansion with a reweighting (E_QE) approach. The E_QE used to learn the researchers evolving information needs at different levels of topic change. Adopting a simulation pseudo-relevance feedback process to evaluate the proposed approach. The results show that the proposed E_QE approach can achieve better search results than the TFIDF.

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

pseudo-relevance feedback
term weighting
entropy


Laplacian spectrum characterization of extensions of vertices of wheel graphs and multi-fan graphs ? The graph Cn1?Kk C n 1 ? K k is the product of a circuit Cn1 C n 1 and a clique Kk K k . In this paper, we will prove that it is determined by their Laplacian spectrum except when n1=6 n 1 = 6 . If n1=6 n 1 = 6 , there are several counterexamples. We also prove that the product of s s vertexdisjoint paths and a clique (Pn1?Pn2???Pns)?Kk ( P n 1 ? P n 2 ? ? ? P n s ) ? K k is also determined by the Laplacian spectrum.

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

cn1?kk c n 1 ? k k cn1?kk c n 1 ? k k cn1?kk c n 1 ? k k c n 1 ? k k

(pn1?pn2???pns)?kk ( p n 1 ? p n 2 ? ? ? p n s ) ? k k (pn1?pn2???pns)?kk ( p n 1 ? p n 2 ? ? ? p n s ) ? k k (pn1?pn2???pns)?kk ( p n 1 ? p n 2 ? ? ? p n s ) ? k k ( p n 1 ? p n 2 ? ? ? p n s ) ? k k


A Travel-Efficient Driving Assistance Scheme in VANETs by Providing Recommended Speed Vehicles' speed is one of the key factors in vehicle travel efficiency, as speed is related to vehicle travel time, travel safety, fuel consumption, and exhaust gas emissions (e.g., CO2 emissions). Therefore, to improve the travel efficiency, a recommended speed calculation scheme is proposed to assist driving in Vehicle Ad hoc networks (VANETs) circumstances. In the proposed scheme, vehicles' current speed and space headway are obtained by Vehicle-to-Roadside unit (V2R) communication and Vehicle-to-Vehicle (V2V) communication. Based on the vehicles' current speed and adjacent vehicles' space headway, a recommended speed is calculated by on-board units installed in the vehicles, and then this recommended speed is provided to drivers. The drivers can change their speed to the recommended speed. At the recommended speed, vehicle travel efficiency can be improved: vehicles can arrive at destinations in a shorter travel time with fewer stop times, lower fuel consumption, and less CO2 emission. In particular, when approaching intersections, vehicles can pass through the intersections with less red light waiting time and a higher nonstop passing rate.

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

travel efficiency
vanets
recommended speed
co2 emissions

intelligent transportation systems (its)


Open access to scholarly full-text documents Purpose - The purpose of this article is to discuss open access to scholarly full-text documents. Design/methodology/approach - Discusses open access to scholarly full-text documents. Findings - The paper shows that while open access archives are good for the majority, for publishers, editors and authors, open access articles can substantially increase their impact, and the impact factor for the source journals. Originality/value - The paper offers insights into scholarly full-text documents.

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


The numerical methods for oscillating singularities in elliptic boundary value problems The singularities near the crack tips of homogeneous materials are monotone of type r(alpha) and r(alpha)log(delta)r, (depending on the boundary conditions along nonsmooth domains). However. the singularities around the interfacial cracks of the heterogeneous bimaterials are oscillatory of type, r(alpha) sin(epsilon logr). The method of auxiliary mapping (MAM). introduced by Babuska and Oh, was proven to be successful in dealing with, r(alpha) type singularities. However, the effectiveness of MAM is reduced in handling oscillating singularities. This paper deals with oscillating singularities as well as the monotone singularities by extending MAM through introducing the power auxiliary mapping and the exponential auxiliary mapping. (C) 2001 Academic Press.

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

interfacial cracks
elliptic boundary value problems
method

the p-version (the h-p version) of finite element

the power (the exponential) auxiliary mapping


HOPE: A genetic algorithm for the unequal area facility layout problem The paper discusses the application of an evolutionary computation technique for the design of efficient facilities. Genetic algorithms (GA) have been applied to heuristically solve a number of combinatorial problems such as scheduling, the traveling salesman problem and the quadratic assignment problem. We apply GA to the layout problem which arises frequently in the design of manufacturing and service organizations to find good solutions. In this paper we outline a GA based algorithm for solving the single-floor facility layout problem. We consider departments of both equal and unequal sizes. The GAs performance is evaluated using several test problems available in the literature. The results indicate that GA may provide a better alternative in a realistic environment where the objective is to find a number of reasonably good layouts. The implementation also provides the flexibility of having fixed departments and to interactively modify the layouts produced.

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

genetic algorithm
quadratic assignment problem
facility layout problem


A Multi-Society-Based Intelligent Association Discovery and Selection for Ambient Intelligence Environments This article presents a novel intelligent embedded agent approach for reducing the number of associations and interconnections between various agents operating within ad hoc multiagent societies of an Ambient Intelligent Environment (AIE) in order to reduce the processing latency and overheads. The main goal of the proposed fuzzy-based intelligent embedded agents (F-IAS) includes learning the overall network configuration and adapting to the system functionality to personalize themselves to the user needs based on monitoring the user in a lifelong nonintrusive mode. In addition, the F-IAS agents aim to reduce the agent interconnections to the most relevant set of agents in order to reduce the processing overheads and thus implicitly improving the system overall efficiency. We employ embedded ambassador agents, namely embassadors, which are designated F-IAS agents utilized with additional novel characteristics to not only act as a gateway filtering the number of messages multicast across societies but also discover, recommend, and establish associations between agents residing in separate societies. In order to validate the efficiency of the proposed methods for multiagent and society-based intelligent association discovery and learning of F-IAS agents/embassadors we will present two sets of unique experiments. The first experiment describes the obtained results carried out within the intelligent Dormitory (iDorm) which is a real-world testbed for AIE research. Here we specifically demonstrate the utilization of the F-IAS agents and discuss that by optimizing the set of associations the agents increase efficiency and performance. The second set of experiments is based on emulating an iDorm-like large-scale multi-society-based AIE environment. The results illustrate how embassadors discover strongly correlated agent pairs and cause them to form associations so that relevant agents of separate societies can start interacting with each other.

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

algorithms
experimentation
fuzzy control
computing methodologies


Sorting in Column Stores In recent years, we have seen a number of new database architectures based on the idea of vertical fragmentation of relations. These architectures target the analysis of huge amounts of relational data, because vertical fragmentation facilitates column scans which are common in analytic applications at the expense of single-tuple operations. Although sorting is a common operation for analytics, few is known about sorting vertically fragmented relations. This paper compares various possibilities to apply (external) merge sort to vertically fragmented relations on different layers of the memory hierarchy and gives hints on when to apply which one. We propose a Greedy algorithm to find the optimum mixture of steps that leads to a sorted version of a given relation which is stored column-wise.

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


An integrated model for site selection and space determination of warehouses In this paper we present an integrated model for site selection and space determination for warehouses in a two-stage network in which products are shipped from part suppliers to warehouses, where they are stored for an uncertain length of time and then delivered to assembly plants. The objective is to minimize the total inbound and outbound transportation costs and the total warehouse operation costs, which include the fixed costs related to their locations and the variable costs related to their space requirements for given service levels. Each warehouse is modeled as an M/G/c M / G / c queueing system in which each storage slot acts as a server. We formulate this problem as a nonlinear mixed integer program with a probabilistic constraint. Two cases are considered. For the continuous unbounded size case, we find an approximate formula for the overflow probability and reformulate the problem into a set-covering problem. For the discrete size option case, we reformulate the problem into a capacitated connection location problem with discrete size options. Computational experiments are performed and the results show that the continuous model is appropriate for the small and median size problems and the discrete model is a good choice for the large size problems.

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


Fast spectral solution of the generalized Enskog equation for dense gases We propose a fast spectral method for solving the generalized Enskog equation for dense gases. For elastic collisions, the method solves the Enskog collision operator with a computational cost of O(Md?1Ndlog?N) O ( M d ? 1 N d log ? N ) , where d is the dimension of the velocity space, and Md?1 M d ? 1 and Nd N d are the number of solid angle and velocity space discretizations, respectively. For inelastic collisions, the cost is N times higher. The accuracy of this fast spectral method is assessed by comparing our numerical results with analytical solutions of the spatially-homogeneous relaxation of heated granular gases. We also compare our results for force-driven Poiseuille flow and Fourier flow with those from molecular dynamics and Monte Carlo simulations. Although it is phenomenological, the generalized Enskog equation is capable of capturing the flow dynamics of dense granular gases, and the fast spectral method is accurate and efficient. As example applications, Fourier and Couette flows of a dense granular gas are investigated. In addition to the temperature profile, both the density and the high-energy tails in the velocity distribution functions are found to be strongly influenced by the restitution coefficient.

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

enskog equation
dense granular gas
fast spectral method


A new approach to chaotic image encryption based on quantum chaotic system, exploiting color spaces A new color image encryption based on quantum chaotic system is proposed. It comprises efficient confusion and diffusion properties for image cipher. It achieves brilliant characteristics for color image encryption applications. Experimental results and analysis show better performance than other schemes.

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

toral automorphism
lifting-wavelet transform (lwt)


A circular visualization of people?s activities in distributed teams ? A visualization technique that shows daily patterns of people activities. Visualization of activities of several individuals at once. The goal of the visualization is to foster interpersonal awareness. The tool implementing the technique is also described. The technique can be generalized and used in different contexts.

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

circular boxplot
circular histograms
activity traces


Simulation of geometrical and electronic structure of quasi-two-dimensional layer consisting of fullerenes D6h-C36 This article describes a computer simulation of the geometrical and electronic structure of a quasi-two-dimensional carbon layer with a trigonal lattice consisting of fullerenes C36 (1) with topological symmetry D6h. Every polyhedral cluster 1 of this polymeric layer (2) is surrounded by six similar fullerenes and connected with every such a fullerene by two covalent bonds. Atomic coordinates of the repeating unit are estimated on the basis of MNDO/PM3 calculations of hydrocarbon molecule (D6h)-C132H48 (3). The carbon skeleton of 3 coincides with a sufficiently large fragment of the polymeric layer 2. The electronic spectrum of the quasi-two-dimensional layer 2 is calculated by the crystalline orbital method in the EHT approximation. The band gap in the electronic spectrum of 2 was found to be equal to 1.5 eV. The geometric and electronic structure of some oligomers of cluster C36, quasi-linear macromolecule [C36]n, and hypergraphite layer is also discussed.

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

quantum-chemical calculations
mndo/pm3 method
crystals of c36
hydrocarbons


Generating chordal graphs included in given graphs A chordal graph is a graph which contains no chordless cycle of at least four edges as an induced subgraph. The class of chordal graphs contains many famous graph classes such as trees, interval graphs, and split graphs, and is also a subclass of perfect graphs. In this paper, we address the problem of enumerating all labeled chordal graphs included in a given graph. We think of some variations of this problem. First we introduce an algorithm to enumerate all connected labeled chordal graphs in a complete graph of n vertices. Next, we extend the algorithm to an algorithm to enumerate all labeled chordal graphs in a n-vertices complete graph. Then, we show that we can use, with small changes, these algorithms to generate all (connected or not necessarily connected) labeled chordal graphs in arbitrary graph. All our algorithms are based on reverse search method, and time complexities to generate a chordal graph are O(l), and also O(l) delay. Additionally, we present an algorithm to generate every clique of a given chordal graph in constant time. Using these algorithms we obtain combinatorial Gray code like sequences for these graph structures in which the differences between two consecutive graphs are bounded by a constant size.

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


Optimal camera placement for automated surveillance tasks Camera placement has an enormous impact on the performance of vision systems, but the best placement to maximize performance depends on the purpose of the system. As a result, this paper focuses largely on the problem of task-specific camera placement. We propose a new camera placement method that optimizes views to provide the highest resolution images of objects and motions in the scene that are critical for the performance of some specified task (e.g. motion recognition, visual metrology, part identification, etc.). A general analytical formulation of the observation problem is developed in terms of motion statistics of a scene and resolution of observed actions resulting in an aggregate observability measure. The goal of this system is to optimize across multiple cameras the aggregate observability of the set of actions performed in a defined area. The method considers dynamic and unpredictable environments, where the subject of interest changes in time. It does not attempt to measure or reconstruct surfaces or objects, and does not use an internal model of the subjects for reference. As a result, this method differs significantly in its core formulation from camera placement solutions applied to problems such as inspection, reconstruction or the Art Gallery class of problems. We present tests of the system's optimized camera placement solutions using real-world data in both indoor and outdoor situations and robot-based experimentation using an all terrain robot vehicle-Jr robot in an indoor setting.

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

camera networks
robot/camera placement
optimization
sensor networks
vision-based robotics


On some geometric problems of color-spanning sets In this paper we study several geometric problems of color-spanning sets: given n points with m colors in the plane, selecting m points with m distinct colors such that some geometric properties of the m selected points are minimized or maximized. The geometric properties studied in this paper are the maximum diameter, the largest closest pair, the planar smallest minimum spanning tree, the planar largest minimum spanning tree and the planar smallest perimeter convex hull. We propose an O(n 1+? ) time algorithm for the maximum diameter color-spanning set problem where ? could be an arbitrarily small positive constant. Then, we present hardness proofs for the other problems and propose two efficient constant factor approximation algorithms for the planar smallest perimeter color-spanning convex hull problem.

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

computational geometry
color-spanning set
np complete


Feature-guided Convolution for Pencil Rendering We re-render a photographic image as a simulated pencil drawing using two independent line integral convolution (LIC) algorithms that express tone and feature lines. The LIC for tone is then applied in the same direction across the image, while the LIC for features is applied in pixels close to each feature line in the direction of that line. Features are extracted using the coherent line scheme. Changing the direction and range of the LICs allows a wide range of pencil drawing style to be mimicked. We tested our algorithm on diverse images and obtained encouraging results.

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

non-photorealistic rendering
coherent lines


A fuzzy model for human fall detection in infrared video Fall detection, especially for elderly people, is a challenging problem which demands new products and technologies. In this paper a fuzzy model for fall detection and inactivity monitoring in infrared video is presented. The classification features proposed include geometric and kinematic parameters associated with more or less sudden changes in the tracked human-related regions of interest. A complete segmentation and tracking algorithm for infrared video as well as a fuzzy fall detection and confirmation algorithm are introduced. The proposed system is capable of identifying true and false falls, enhanced with inactivity monitoring aimed at confirming the need for medical assistance and/or care. The fall indicators used as well as their fuzzy model is explained in detail. The fuzzy model has been tested for a wide number of static and dynamic falls, demonstrating exciting initial results.

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

video segmentation and tracking
fuzzy system


Multiple hypothesis tracking for data association in vehicular networks The introduction of Vehicle to Vehicle (V2V) and Vehicle to Infrastructure (V2I) communications in Intelligent Transportation Systems of the future brings new opportunities and new challenges into the automotive scene. Vehicular communications broaden the information spectrum that is available to each vehicle, allowing the enhancement of existing applications and the introduction of new ones. Undoubtedly, the impact of this new technology in transportation safety, efficiency and infotainment is expected to be very important. A significant part of research in vehicular networks (VANETs) is dedicated to networking issues like routing and safety. However, perception systems which until now were based on onboard sensors only, need to incorporate the wirelessly received information in order to extend the situation awareness of the vehicle and the driver. This paper presents an algorithm for associating targets tracked from an onboard radar sensor with the position and motion data received from the VANET. The core of the algorithm is a track oriented multiple hypothesis tracker that is modified for incorporating information included in VANET messages. The algorithm is tested in real scenarios using two experimental vehicles and then compared with two other algorithmic approaches. One is using a simpler single hypothesis algorithm for association of VANET messages and the second is using only the onboard sensors for environment perception. As a result, the advantages of the Multiple Hypothesis Algorithm regarding association performance and the added value of wireless information in the perception system are highlighted. (c) 2013 Elsevier B.V. All rights reserved.

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

track oriented multiple hypothesis tracking


Basic competitive neural networks as adaptive mechanisms for non-stationary colour quantisation In this paper we consider the application of two basic Competitive Neural Networks (CNN) to the adaptive computation of colour representatives on image sequences that show non-stationary distributions of pixel colours. The tested algorithms are the Simple Competitive Learning (SCL) algorithm and the Frequency-Sensitive Competitive Learning (FSCL) algorithm. Both, SCL and FCSL are the simplest adaptive methods based, respectively, on minimising the distortion and on the search for a uniform quantisation. The aim of this paper is to study several computational properties of these methods when applied to non-stationary clustering as adaptive vector quantisation algorithms. Nonstationary colour quantisation is, therefore, representative of the more general class of non-stationary clustering problems. We expect our results to be meaningful for other algorithms that involve either the minimisation of the distortion or the search for uniform quantisers. We study experimentally the effect of the size of the image sample employed in the one-pass adaptation, their robustness to initial conditions, and the effect of local versus global scheduling of the learning rate.

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

colour quantisation frequency-sensitive
non-stationary clustering
simple competitive learning


An efficient PD data mining method for power transformer defect models using SOM technique Laboratory PD measurement set-up is developed. HFCT is employed to pick up PD current pulses. Texture feature extraction method is applied on time-domain PD data. Capability in different PD sources discrimination (using texture features) is assessed by SOM.

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

pdc polarization and depolarization current


An expeditious cum efficient algorithm for salt-and-pepper noise removal and edge-detail preservation using cardinal spline interpolation Salt-and-pepper impulse noise removal for noise densities up to 95%. Edge-Detail preservation with PSNR for noise densities up to 95%. The variation of the parameters ? and ? to maximize the PSNR. The comparative analysis and time complexity with existing algorithms.

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

edge-preserving regularization
salt-and-pepper impulse noise
cardinal splines
expeditious algorithm
image de-noising
edge preservation
two-phase noise removal


Semi-supervised learning by disagreement In many real-world tasks, there are abundant unlabeled examples but the number of labeled training examples is limited, because labeling the examples requires human efforts and expertise. So, semi-supervised learning which tries to exploit unlabeled examples to improve learning performance has become a hot topic. Disagreement-based semi-supervised learning is an interesting paradigm, where multiple learners are trained for the task and the disagreements among the learners are exploited during the semi-supervised learning process. This survey article provides an introduction to research advances in this paradigm.

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


Applying hierarchical grey relation clustering analysis to geographical information systems - A case study of the hospitals in Taipei City Deng proposed grey clustering analysis (GCA) in 1987. Later, Jin presented a new method in 1993, called grey relational clustering (GRC) method that combined grey relational analysis with clustering. However, the CRC method cannot use a tree diagram to make appropriate classification decisions without re-computation. This study thus attempts to combine CRC and hierarchical clustering analysis. Given the existence of an excess of medical resources in the Taipei area, this study attempts to understand the degree of concentration of medical resources in this area. Specifically, this study applies a geographical information system (GIS) to present the geographical distribution of hospitals in Taipei. Additionally, a new-type of cluster analysis, known as hierarchical grey relation clustering analysis, is used to analyze the distribution of hospitals and understand how they compete with one another. The analytical results demonstrate that hierarchical grey relation clustering analysis is a suitable method of analyzing geographical position. Tree diagrams can help policymakers make appropriate classification decisions without re-computation. The study results can inform hospitals of their competitors and help them to develop appropriate responses. Additionally, the analytical results can also provide a reference to government or hospital policymakers to help them position hospitals in areas, thus achieving a better distribution of medical resources in Taipei. (C) 2012 Elsevier Ltd. 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 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 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 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 O

grey relational analysis
grey clustering analysis
hierarchical clustering analysis
geographical information system


Optimization of Test Power and Data Volume in BIST Scheme Based on Scan Slice Overlapping In order to further reduce test data storage and test power of deterministic BIST based on scan slice overlapping, this paper proposes a novel optimization approach. Firstly, a san cell grouping method considering layout constraint is introduced to shorten the scan chain. Secondly, a novel scan cell ordering approach considering layout constraint is proposed to optimize the order of scan chain. Lastly, the authors propose an improved test pattern partition algorithm which selects the scan slice with the most specified bits as the first scan slice of the current overlapping block. Experimental results indicate that the proposed optimization approach significantly reduces the scan-in transitions and test data storage by 73%93% and 60%87%, respectively.

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

layout constraint
scan slice overlapping


Relational databases as a massive information source for defeasible argumentation Argumentation provides a sophisticated yet powerful mechanism for the formalization of commonsense reasoning in knowledge-based systems, with application in many areas of Artificial Intelligence. Nowadays, most argumentation systems build their arguments on the basis of a single, fixed knowledge base, often under the form of a logic program as in Defeasible Logic Programming or in Assumption-Based Argumentation. Currently, adding new information to such programs requires a manual encoding, which is not feasible for many real-world environments which involve large amounts of data, usually conceptualized as relational databases. This paper presents a novel approach to compute arguments from premises obtained from relational databases, identifying several relevant aspects. In our setting, different databases can be updated by external, independent applications, leading to changes in the spectrum of available arguments. We present algorithms for integrating a database management system with an argument-based inference engine. Empirical results and running-time analysis associated with our approach show that it provides a powerful alternative for efficiently achieving massive argumentation, taking advantage of modern DBMS technologies. We contend that our proposal is significant for developing new architectures for knowledge-based applications, such as Decision Support Systems and Recommender Systems, using argumentation as the underlying inference model.

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

defeasible argumentation
relational databases
massive argumentation

knowledge-based systems
argument-supporting data retrieval


Iterative inversion of fuzzified neural networks The inversion of a neural network is a process of computing inputs that produce a given target when fed into the neural network. The inversion algorithm of crisp neural networks is based on the gradient descent search in which a candidate inverse is iteratively refined to decrease the error between its output and the target. In this paper, me derive an inversion algorithm of fuzzified neural networks from that of crisp neural networks. First, we present a framework of learning algorithms of fuzzified neural networks and introduce the idea of adjusting schemes for fuzzy variables. Next, we derive the inversion algorithm of fuzzified neural networks by applying the adjusting scheme for fuzzy variables to total inputs in the input layer, Finally, we make three experiments on the parity-three problem; we examine the effect of the size of training sets on the inversion and investigate how the fuzziness of inputs and targets of training sets affects the inversion.

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

fuzzified neural network
learning algorithm


Upper Bounds on Overloaded LDPCOptimum Combinied System Over Rayleigh Fading Channel In this paper a closed form expression for the bit error rate of LDPCOC system in the presence of interferers is derived over an i.i.d Rayleigh fading channel using message passing algorithm. All interferers are assumed to have equal power. The analysis is done for the case when the number of interferes is more than the number of receive antenna elements. In this paper, analytical results showed that for a BER of 10?2, the LDPCOC system provides an additional gain of 6.3dB over OC system alone. Both the systems provide identical diversity gain of 1.2dB when the number of receive antennas are increased from 5 to 6.

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

irregular low-density parity check codes


Accelerating Boolean Matching Using Bloom Filter Boolean matching is a fundamental problem in FPGA synthesis, but existing Boolean matchers are not scalable to complex PLBs (programmable logic blocks) and large circuits. This paper proposes a filter-based Boolean matching method, F-BM, which accelerates Boolean matching using lookup tables implemented by Bloom filters storing pre-calculated matching results. To show the effectiveness of the proposed F-BM, a post-mapping re-synthesis minimizing area which employs Boolean matching as the kernel has been implemented. Tested on a broad selection of benchmarks, the re-synthesizer using F-BM is 80X faster with 0.5% more area, compared with the one using a SAT-based Boolean matcher.

O B I O B I B I 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 I O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O 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 binary method for fast computation of inter and intra cluster similarities for combining multiple clusterings In this paper, we introduce a novel binary method for fast computation of an objective function to measure inter and intra class similarities, which is used for combining multiple clusterings. Our method has the advantages of using less memory and CPU time. Moreover, compared with the conventional technique, we reduce the time complexity of the problem considerably. Experimental test results demonstrate the effectiveness of our new method.

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

binary techniques
clustering algorithms
clustering


creating animation with personal photo collections and map for storytelling The goal of our research is to support the sharing of stories with digital photographs. Some map sites are now collecting stories associated with peoples' relationships to places. Users are mapping collections of places including intangible emotional associations of places along with photographs, videos. Though this framework of mapping stories is important for accelerating individual creation and transmission of map content, it is not expressive enough to communicate stories narratively. For example, especially when the number of the mapped collections of places is large, it is not easy for viewers to read the map, and it is not easy for creators to express stories as series of events in the real world. That is because one narrative story in a form of a sequence of text narrations, a sequence of photographs, a movie, and an audio like podcasting, etc. is mapped to just one point. As a result, it's up to the viewers which point on the map to read, and in what order. The common framework is rather suitable for mapping and expressing fragments or snapshots of a whole story, and not suitable for expressing a whole story narratively by using a whole area of a map as the setting of the story. We therefore propose a new framework for mapping personal photo collections and constructing them as stories such as route guidances, sightseeing guidances, historical topics, fieldwork records, personal diaries, and so on. We named this framework as spatial slideshow. A spatial slideshow is a fusion of personal photo mapping and photo storytelling. Each story of a spatial slideshow is made of a sequence of mapped photographs, and presented as synchronized animations of a map and an enhanced photo slideshow. The main technical suggestion of this paper is a method for creating a three-dimensional animation of photo image which has a visual effect of moving from photo to photo. We have developed a personal photo album software and released it on the Web, which works as an editor and a browser of spatial slideshows. We assume the proposed framework has a significance of helping with grassroots development of spatial content driven by visual communications about places or events in the real world.

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

photo mapping
photo storytelling
animation


Key issues in data center security: An investigation of government audit reports The rising volume of electronic data, the growth in cloud computing and the need for secure and affordable large-scale data storage all contribute to the increasing reliance on data centers in society. This paper provides an overview of security issues relevant to data centers. We offer an aggregation and exploratory analysis of four audit reports of government data centers operating in the United States. Using the information security common body of knowledge to categorize audit findings, we identify the key issues from the reoccurring findings in the reports, particularly in regards to operations security, data center management, physical security, and disaster planning. The security of data centers has become a paramount concern for both government and the information technology industry. Both practitioners and academics can benefit from our research results because it provides insight into the key security issues facing modern data centers.

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

data center
information security
audit reports
common body of knowledge
operations security
physical security


Charged partial surface area (CPSA) descriptors QSAR applications The charged partial surface area, or CPSA descriptors were originally designed for use in structure-physical relationship studies to capture information about the features of molecules responsible for polar intermolecular interactions. Since their development, they have found applications in abroad variety of both structure-property and structure-activity relationship studies. In the present work, the CPSA descriptors are examined in more detail, evaluating their characteristics with regard to conformational dependence, sources of partial atomic charges, utility of whole molecule and substructure varieties, and the inclusion or exclusion of explicit hydrogens. Additionally, an examination of the physical interpretation that can be derived from structure-activity relationships that incorporate the CPSA descriptors is made. Most recently, the CPSA descriptors have been found to be practically useful in the study of acute aquatic toxicity where they appear to provide an alternative to LUMO energy level measures for describing global and local electrophilicity in cases of non-covalent molecular interactions. A second example illustrates the ability of the CPSA descriptors to discriminate agonists and antagonists among compounds that bind strongly at the estrogen receptor. While measures of global and local nucleophilicity and interatomic distances are required to explain receptor binding, volumetric parameters, such as CPSAs, were found to be necessary to provide separation between reactivity patterns for agonists and antagonists, all having high binding affinity to estrogen receptor.

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

acute toxicity
estrogenicity
agonists/antagonists


The structural and electronic properties of CumAgn Cu m Ag n (m+n=6 m + n = 6 ) clusters The structural and electronic properties of CumAgn Cu m Ag n (m+n=6 m + n = 6 ) clusters have been investigated through density functional theory. Our results show that the triangular shape (A) clusters and capped shape (B) clusters are generally stabler than W-shaped (C) clusters. It is shown that the HOMO (highest occupied molecular orbital)LUMO (lowest unoccupied molecular orbital) gaps vary inversely to the average bond length. We also investigated spectra of CumAgn Cu m Ag n (m+n=6 m + n = 6 ) clusters, which shows that the dominant peaks near 3.5eV are contributed from the electrons of Cu3d Cu 3 d , Cu4s Cu 4 s and Ag5s Ag 5 s .

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

cumagn cu m ag n cumagn cu m ag n cumagn cu m ag n cu m ag n


a tv agent system that integrates knowledge and answers users' questions Aiming to close the digital divide in the television viewing environment, we are developing a TV system with an agent that controls the TV and peripherals on behalf of the user and provides information to the user. We propose a TV system function that answers viewers' questions about TV programs by calling upon multiple question-answering agents that search for relevant information.

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


New current-controlled current-mode sinusoidal quadrature oscillators using CDTAs This article presents new current-mode oscillator circuits using CDTAs which is designed from block diagram. The proposed circuits consist of three CDTAs and two grounded capacitors. The condition of oscillation can be adjusted electronically/orthogonally from the oscillation frequency by adjusting bias current of the CDTAs. The proposed quadrature oscillators have high output impedance and use only grounded capacitors without any external resistor which is very appropriate for future development into an integrated circuit. The PSPICE simulation and experimental results are corresponding to the theoretical analysis.

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


Identification of unknown pure component spectra by indirect hard modeling Indirect hard modeling (IHM) is a physically motivated spectral analysis principle. It utilizes nonlinear spectral hard models generated by peak fitting of the pure spectra. This approach allows the consideration of various nonlinear effects such as peak variations or spectral shifts. Compared to established methods, less calibration samples are required and basic calibration transfer is performed inherently. To extend the applicability of IHM, which currently requires knowledge of the pure component spectra, two methods for the identification of pure spectra are presented in this work. These methods work automatically on a mathematically objective basis and do thus not depend on the expertise of the user. As IHM relies on an underlying physical picture of the spectra, the relevant information in the input data is exploited very efficiently especially for selective spectra, and nonideal spectral behavior is captured throughout the identification process. Compared to established SMCR methods the number of required spectra is reduced. The first method, complemental hard modeling (CHM), is introduced for the case that a single pure spectrum is unknown. The method is based on a deconvolution approach and only requires a single mixture spectrum as input data. The second method, hard modeling factor analysis (HMFA), is conceptually related to SMCR methods. It allows the identification of all pure spectra in a completely unknown mixture from a limited set of mixture spectra. As shown in this work, even highly collinear data can be employed. (C) 2008 Elsevier B.V. All rights reserved.

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

peak fitting
hard modeling
factor analysis
identification

spectroscopic analysis
indirect hard modeling (ihm)
self modeling curve resolution (smcr)
nonlinear optimization
collinearity


A multi-parameter regularization model for image restoration Based on total variation and wavelet frame, a multi-parameter regularization model for image restoration is proposed. An effective algorithm based on ADMM is given for solving the new model, i.e., TVframe. Convergence analysis of the new algorithm is given. Numerical experiments show that TVframe outperforms several state-of-the-art image restoration approaches.

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

tv
framelet
denoising
deblurring
multi-parameter regularization


distributed version control in the classroom Modern distributed version control systems offer compelling advantages for teaching students professional software development practices and skills. In this paper, we explore the potential for incorporating Mercurial into introductory, intermediate, and advanced computing courses. By incorporating version control into the entire CS curriculum, instructors create unique opportunities to engage students in collaborative, real-world projects and activities, giving them critical early exposure to the expectations and assumptions prevalent in the software development community. Early introduction to version control provides students with an important foundation in both personal and collaborative development excellence, offering them a competitive edge in the marketplace and a superior understanding of software development best practice.

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

software development process
education
software tools