MM-UAV: Mobile Manipulating Unmanned Aerial Vehicle Given significant mobility advantages, UAVs have access to many locations that would be impossible for an unmanned ground vehicle to reach, but UAV research has historically focused on avoiding interactions with the environment. Recent advances in UAV size to payload and manipulator weight to payload ratios suggest the possibility of integration in the near future, opening the door to UAVs that can interact with their environment by manipulating objects. Therefore, we seek to investigate and develop the tools that will be necessary to perform manipulation tasks when this becomes a reality. We present our progress and results toward a design and physical system to emulate mobile manipulation by an unmanned aerial vehicle with dexterous arms and end effectors. To emulate the UAV, we utilize a six degree-of-freedom miniature gantry crane that provides the complete range of motion of a rotorcraft as well as ground truth information without the risk associated with free flight. Two four degree-of-freedom manipulators attached to the gantry system perform grasping tasks. Computer vision techniques and force feedback servoing provide target object and manipulator position feedback to the control hardware. To test and simulate our system, we leverage the OpenRAVE virtual environment and ROS software architecture. Because rotorcraft are inherently unstable, introduce ground effects, and experience changing flight dynamics under external loads, we seek to address the difficult task of maintaining a stable UAV platform while interacting with objects using multiple, dexterous arms. As a first step toward that goal, this paper describes the design of a system to emulate a flying, dexterous mobile manipulator.

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

mobile manipulation
unmanned aerial vehicle
dexterous arms


learning recursion as a concept and as a programming technique Two experiments on learning recursion and iteration were carried out. The first studied learning of the mathematical concept of recursion by having subjects compute mathematical functions by analogy to worked out examples. The results suggest that subjects are quite able to induce a computational procedure for both iterative and recursive functions from examples. Furthermore, prior practice with iterative examples does not seem to facilitate subsequent performance on similar recursive problems, nor does prior practice with recursive examples facilitate performance on iterative problems. The second experiment studied novice subjects' comprehension of iterative and recursive Pascal programs. Comprehension of the iterative program was not improved by prior exposure to the recursive version of the program. Comprehension of the recursive version was improved moderately by prior work with the iterative version.

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

program examples recursion performance concept version learning novice comprehension

program comprehension
computation
experience
practical
iter
analog


a pseudo-machine for packet monitoring and statistics This paper concerns the design of a flexible and efficient packet monitoring program for analyzing traffic patterns and gathering statistics on a packet network. This monitor operates in real time, using an analyzer which is an interpretive pseudo-machine driving object-oriented data collection programs. The pseudo-program for the interpreter is compiled from configuration commands written in a monitoring control language.

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

network
program
statistics
data collection
language
design
monitor
paper
traffic
control

efficiency drive interpretation configurability flexibility object-oriented real-time pattern


coordinating views in the infovis toolkit Multidimensional data sets can be visualized in a variety of forms provided by many techniques described in the literature. Depending on specific tasks, users might need to analyze the same data set using different representations. Moreover, they might need to interact with a view and have the results shown also in the others. This paper presents a system to provide multiple coordinated views of multidimensional data. It activates the coordination of techniques provided by InfoVis as well as visualizations we implemented using its basic resources. We allow users to set which visualizations they want to coordinate through a diagram representing the different visualizations. We present the user-driven coordination scheme and extensions we made in InfoVis to allow coordinated views through different interaction tools.

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


Face

detection

and

tracking

in

video

sequences

using

the

modifiedcensus

transformation

We

present

the

combination

of

an

illumination

invariant

approach

to

face

detection

combined

with

a

tracking

mechanism

used

for

improving

speed

and

accuracy

of

the

system.

We

introduce

illumination

invariant

local

structure

features

for

object

detection.

For

an

efficient

computation

we

propose

a

modified

census

transform,

which

enhances

the

original

work

of

Zabih

and

Woodfill

[Ramin

Zabih,

John

Woodfill.

A

non-parametric

approach

to

visual

correspondence.

IEEE

Transactions

on

Pattern

Analysis

and

Machine

Intelligence,

The

tracking

is

performed

by

means

of

continuous

detection.

We

show

that

the

advent

of

new

rapid

detection

algorithms

may

change

the

need

for

traditional

tracking.

Furthermore

the

mentioned

problems

have

a

natural

solution

within

the

presented

tracking

by

continuous

detection

approach.

The

only

assumption

on

the

object

to

track

is

its

maximal

speed

in

the

image

plane,

which

can

be

set

very

generously.

From

this

assumption

we

derive

three

conditions

for

a

valid

state

sequence

in

time.

To

estimate

the

optimal

state

of

a

tracked

face

from

the

detection

results

a

Kalman

filter

is

used.

This

leads

to

an

instant

smoothing

of

the

face

trajectory.

It

can

be

shown

experimentally

that

smoothing

the

face

trajectories

leads

to

a

significant

reduction

of

false

detections

compared

to

the

static

detector

without

the

presented

tracking

extension.

We

further

show

how

to

exploit

the

highly

redundant

information

in

a

natural

video

sequence

to

speed-up

the

execution

of

the

static

detector

by

a

temporal

scanning

procedure

which

we

call

slicing.

A

demo

program

showing

the

outcomes

of

our

work

can

be

found

in

the

internet

under

for

download.

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

face tracking
census transformation
illumination invariance


A hierarchical approach for fast and robust ellipse extraction This paper presents a hierarchical approach for fast and robust ellipse extraction from images. At the lowest level, the image is described as a set of edge pixels, from which line segments are extracted. Then, line segments that are potential candidates of elliptic arcs are linked to form arc segments according to connectivity and curvature conditions. Next, arc segments that belong to the same ellipse are grouped together. Finally, a robust statistical method, namely RANSAC, is applied to fit ellipses to groups of arc segments. Unlike Hough Transform based algorithms, this method does not need a high dimensional parameter space, and so it reduces the computation and storage requirements. Experiments on both synthetic and real images demonstrate that the proposed method has excellent performance in handling occlusion and overlapping ellipses.

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

ellipse extraction
elliptic arcs
arc segments
ransac


a combined pca-mlp model for predicting stock index Predicting stock prices is a challenging and daunting task due to the complexity of the stock market. In this study, a combined model is proposed to explore market tendency. Prediction of daily closing price using the variables daily opening price, high, low and volume of transaction is done. In this approach, the predictor variables are multi collinear in nature which is overcome by using Principal Component Analysis (PCA) which resulted in a new set of independent variables that are taken for predicting the stock prices using Multilayer Layer Perceptron (MLP) model. To evaluate the prediction ability of the model, we compare the performance of models using a common error measure. The empirical results reveal that the proposed approach is a promising alternate to stock market prediction.

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

multicollinearity
multilayer perceptron (mlp)
mape
principal component analysis (pca)


Model order reduction using spline-based dynamic multi-point rational interpolation for passive circuits The efficient modeling of integrated passive components and interconnects is vital for the realization of high performance mixed-signal systems. In this paper, we develop a dynamic multi-point rational interpolation method based on Krylov subspace techniques to generate reduced order models for passive components and interconnects that are accurate across a wide-range of frequencies. We dynamically select interpolation points by applying a cubic spline-based algorithm to detect complex regions in the system's frequency response. The results indicate that our method provides greater accuracy than techniques that apply uniform interpolation points.

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

multi-shift arnoldi
spline interpolation
spiral inductors


Visualizing and characterizing DNS lookup behaviors via log-mining The Domain Name System (DNS) is a critical Internet service, which translates easily memorized domain names to numerical IP addresses for locating computer resources and services. In this paper, we try to explore the behaviors of DNS lookup by mining DNS logs from three primary DNS servers in a large university campus network in China. Our dataset is made up of two parts, namely DNS query logs and messages received or send by DNS servers. Firstly, through analyzing these DNS query logs, we are able to understand the overall trend of users surfing. For dealing with huge DNS dataset, we introduce an algorithm we call DNSReduce, which can be used to dig out top 10 client IP addresses and top 10 destination domain names efficiently. Moreover, we make comparative analysis of lookup behavior between wired and wireless users. Secondly, with messages received or send by DNS servers we can find these DNS servers?behaviors, i.e., TTLs, equivalent answers and are able to accurately identify domain names with dynamic IP addresses. We provide different and specific visualization techniques for presenting these analysis results and show these techniques are very useful for understanding user behaviors, analyzing security events and characterizing overall tendency in campus network management.

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


the character, functions, and styles of instant messaging in the workplace Current perceptions of Instant Messaging (IM) use are based primarily on self-report studies. We logged thousands of (mostly) workplace IM conversations and evaluated their conversational characteristics and functions. Contrary to prior research, we found that the primary use of workplace IM was for complex work discussions. Only 28\% of conversations were simple, single-purpose interactions and only 31\% were about scheduling or coordination. Moreover, people rarely switched from IM to another medium when the conversation got complex. We found evidence of two distinct styles of use. Heavy IM users and frequent IM partners mainly used it to work together: to discuss a broad range of topics via many fast-paced interactions per day, each with many short turns and much threading and multitasking. Light users and infrequent pairs mainly used IM to coordinate: for scheduling, via fewer conversations per day that were shorter, slower-paced with less threading and multitasking.

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

coordination
multitasking
character
scheduling
research
use
users
instant messaging
evidence
conversation

thread
interaction
workplace collaboration
media switching
perception
complexity
lighting
informal communication


IP in nanomedicine Perspective from an IP professional in industry This article provides a review of current and projected IP-related developments in the evolving nanomedicine field. Topics covered include patentability, scope and clarity, transfer of technology, patent drafting skills, trends in innovation, R&D agreements, IP clauses for cooperation and the IP licensing environment.

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

technology transfer
innovation trends
r&d agreements
ip licensing


A robust multimodal approach for emotion recognition Emotion recognition is one of the latest challenges in intelligent human/computer communication. Most of previous work on emotion recognition focused on extracting emotions from visual or audio information separately. A novel approach is presented in this paper, including both visual and audio from video clips, to recognize the human emotion. The Facial Animation Parameters (FAPs) compliant facial feature tracking based on GASM (GPU based Active Shape Model) is performed on the video to generate two vector streams which represent the expression feature and the visual speech one. To extract effective speech features, based on geodesic distance estimation, we develop an enhanced Lipschitz embedding to embed high dimensional acoustic features into low dimensional space. Combined with the visual vectors, the audio vector is extracted in terms of low dimensional features. Then, a tripled Hidden Markov Model is introduced to perform the recognition which allows the state asynchrony of the audio and visual observation sequences while preserving their natural correlation over time. The experimental results show that this approach outperforms the conventional approaches for emotion recognition.

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

emotion recognition
multimodal
lipschitz embedding
tripled hidden markov model


Using intrinsic data skew to improve hash join performance Hash join is used to join large, unordered relations and operates independently of the data distributions of the join relations. Real-world data sets are not uniformly distributed and often contain significant skew. Although partition skew has been studied for hash joins, no prior work has examined how exploiting data skew can improve the performance of hash join. In this paper, we present histojoin, a join algorithm that uses histograms to identify data skew and improve join performance. Experimental results show that for skewed data sets histojoin performs significantly fewer I/O operations and is faster by 1060% than hybrid hash join.

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


120 Hz low cross-talk stereoscopic display with intelligent LED backlight enabled by multi-dimensional controlling IC This paper proposes to employ multi-dimensional controller for driving LED backlight scanning in a 120 Hz LCD for overcoming the hold-type characteristic of an LCD in time-multiplexed stereoscopic displays. A synchronization signal circuit is developed to connect the time scheme of the vertical synchronization for reducing scanning time. The general strategy is to integrate 3D controller and all relatively small-signal electronic functions into one ASIC to minimize the total number of the components. The display panel, LED backlight scanning, and shutter glass signals could be adjusted by vertical synchronization and modulation to obtain stereoscopic images. Each row of LED in a backlight module is controlled by multi-dimensional data registration and synchronization control circuits for LED backlight scanning to flash in bright or dark. LED backlight scanning stereoscopic display incorporated with shutter glasses is provided to realize stereoscopic images even viewed in a liquid crystal display. The eye shutter signal is alternately switched from the left eye to the right eye with 120 Hz of LCD Vertical synchronization (V-sync). This kind of low cross-talk shutter glasses stereoscopic display with an intelligent multiplexing control of LED backlight scanning has low cross-talk below 1% through a liquid crystal shutter glasses. Crown Copyright (C) 2009 Published by Elsevier B.V. All rights reserved.

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

stereoscopic display
led backlight scanning


A taste for practices: Unrepressing style in design thinking The current vogue for design in management discourses results in abstractions of the design process that repress the role of aesthetic judgments. This paper offers an explanation as to why design-as-styling is being neglected or concealed, and then explains what is at stake. It theorizes that a key aspect of the agency of designing, as the creation of artifacts to facilitate activities, lies in this taste literacy of designers. The framework for the argument of this paper is Pierre Bourdieus notion of habitus and the notion of style as proposed by Fernando Flores and his coauthors. The paper argues that designers are hermeneutists of proximal taste regimes, for the possibilities of new styles of action.

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

styling
design activity
aesthetics
user behavior


Integrated test of interacting controllers and datapaths In systems consisting of interacting datapaths and controllers and utilizing built-in self test (BIST), the datapaths and controllers are traditionally tested separately by isolating each component from the environment of the system during test. This work facilitates the testing of datapath/controller pairs in an integrated fashion. The key to the approach is the addition of logic to the system that interacts with the existing controller to push the effects of controller faults into the data flow, so that they can be observed at the datapath registers rather than directly at the controller outputs. The result is to reduce the BIST overhead over what is needed if the datapath and controller are tested independently, and to allow a more complete test of the interface between datapath and controller, including the faults that do not manifest themselves in isolation. Fault coverage and overhead results are given for four example circuits.

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

built-in self-test
register transfer level
synthesis-for-testability


Display calculi for nominal tense logics We define display calculi for nominal tense logics extending the minimal nominal tense logic (MNTL) by addition of primitive axioms. To do so, we use the natural translation of MNTL into the minimal tense logic of inequality (L(not equal)) which is known to be properly displayable by application of Kracht's results. The rules of the display calculus deltaMNTL for MNTL mimic those of the display calculus deltaL(not equal) for L(not equal). We show that every MNTL-valid formula admits a cut-free derivation in deltaMNTL. We also show that a restricted display calculus delta(-) MNTL, is not only complete for MNTL, but that it enjoys cut-elimination for arbitrary sequents. Finally, we give a weak Sahlqvist-type theorem for two semantically defined extensions of MNTL. Using Kracht's techniques we obtain sound and complete display calculi for these two extensions based upon deltaMNTL and delta(-) MNTL respectively The display calculi based upon deltaMNTL enjoy cut-elimination for valid formulae only, but those based upon delta(-) MNTL enjoy cut-elimination for arbitrary sequents.

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

display logic
cut elimination theorem
strong normalisation
sahlqvist tense formulae


Energy-Aware Optimization Model in Chain-Based Routing Sensor networks are deployed in numerous military and civil applications, such as remote target detection, weather monitoring, weather forecast, natural resource exploration and disaster management. Despite having many potential applications, wireless sensor networks still face a number of challenges due to their particular characteristics that other wireless networks, like cellular networks or mobile ad hoc networks do not have. The most difficult challenge of the design of wireless sensor networks is the limited energy resource of the battery of the sensors. This limited resource restricts the operational time that wireless sensor networks can function in their applications. Routing protocols play a major part in the energy efficiency of wireless sensor networks because data communication dissipates most of the energy resource of the networks. The above discussions imply a new family of protocols called chain-based protocols. In the protocols, all sensor nodes sense and gather data in an energy efficient manner by cooperating with their closest neighbors. The gathering process can be done until an elected node calculates the final data and sends the data to the base station. In our works, we have proposed two methods to optimize the lifetime of chain-based protocols using Integer Linear Programming (ILP) formulations. Also, a method to determine the bounds of the lifetime for any energy-efficient routing protocol is presented. Finally, simulation results verify the work in this chapter. Furthermore, previous researches assume that the base station position is randomly placed without optimization. In our works, a non convex optimization model has been developed for solving the base station location optimization problem.

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

sensor
routing
linear programming
non convex optimization


Fast construction of dynamic and multi-resolution 360 panoramas from video sequences This paper presents a unified approach to automatically build dynamic and multi-resolution 360 panoramic (DMP) representations from image sequences captured by hand-held cameras mainly undertaking rotation and zooming for natural scenes with moving targets. A simple (yet stable) rigid motion model and a closed-loop-based mosaicing algorithm are proposed to generate cylindrical mosaics automatically. Multi-resolution representations are built for interesting areas by separating zooming sub-sequences from a pan/zoom sequence. Moving objects are detected and separated from images based on motion information, and then more accurate contours are extracted using a modified active contour algorithm. The DMP construction method is fast, robust, and automatic, achieving five frames per second for image sequences with 384288 color images on a Pentium III 800MHz PC. The construction of the DMP representation can be used in virtual reality, video surveillance, and very low bit-rate video coding.

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

panoramic representation
video mosaicing
multi-resolution
moving object extraction


ShapePalettes: Interactive normal transfer via sketching We present a simple interactive approach to specify 3D shape in a single view using "shape palettes". The interaction is as follows: draw a simple 2D primitive in the 2D view and then specify its 3D orientation by drawing a corresponding primitive on a shape palette. The shape palette is presented as an image of some familiar shape whose local 3D orientation is readily understood and can be easily marked over. The 3D orientation from the shape palette is transferred to the 2D primitive based on the markup. As we will demonstrate, only sparse markup is needed to generate expressive and detailed 3D surfaces. This markup approach can be used to model freehand 3D surfaces drawn in a single view, or combined with image-snapping tools to quickly extract surfaces from images and photographs.

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

human-computer interaction
interactive modeling
image-based modeling


reducing the bandwidth of sparse symmetric matrices The finite element displacement method of analyzing structures involves the solution of large systems of linear algebraic equations with sparse, structured, symmetric coefficient matrices. There is a direct correspondence between the structure of the coefficient matrix, called the stiffness matrix in this case, and the structure of the spatial network delineating the element layout. For the efficient solution of these systems of equations, it is desirable to have an automatic nodal numbering (or renumbering) scheme to ensure that the corresponding coefficient matrix will have a narrow bandwidth. This is the problem considered by R. Rosen 1 . A direct method of obtaining such a numbering scheme is presented. In addition several methods are reviewed and compared.

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

layout
network
spatial
direct
bandwidth
case
structure
method
systems
scheme
finite element


Perls-speaks-NONMEM (PsN) - a Perl module for NONMEM related programming The NONMEM program is the most widely used nonlinear regression software in population pharmacokinetic/pharmacodynamic (PUPD) analyses. In this article we describe a programming library, Perl-speaks-NONMEM (PsN), intended for programmers that aim at using the computational capability of NONMEM in external applications. The library is object oriented and written in the programming language Perl. The classes of the library are built around NONMEM's data, model and output files. The specification of the NONMEM model is easily set or changed through the model and data file classes white the output from a model fit is accessed through the output file class. The classes have methods that help the programmer perform common repetitive tasks, e.g. summarising the output from a NONMEM run, setting the initial estimates of a model based on a previous run or truncating values over a certain threshold in the data file. PsN creates a basis for the development of high-level software using NONMEM as the regression tool. (C) 2004 Elsevier Ireland Ltd. All rights reserved.

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


effective keyword-based selection of relational databases The wide popularity of free-and-easy keyword based searches over World Wide Web has fueled the demand for incorporating keyword-based search over structured databases. However, most of the current research work focuses on keyword-based searching over a single structured data source. With the growing interest in distributed databases and service oriented architecture over the Internet, it is important to extend such a capability over multiple structured data sources. One of the most important problems for enabling such a query facility is to be able to select the most useful data sources relevant to the keyword query. Traditional database summary techniques used for selecting unstructured datasources developed in IR literature are inadequate for our problem, as they do not capture the structure of the data sources. In this paper, we study the database selection problem for relational data sources, and propose a method that effectively summarizes the relationships between keywords in a relational database based on its structure. We develop effective ranking methods based on the keyword relationship summaries in order to select the most useful databases for a given keyword query. We have implemented our system on PlanetLab. In that environment we use extensive experiments with real datasets to demonstrate the effectiveness of our proposed summarization method.

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

summarization
keyword query
database selection


A lack-of-fit test for parametric zero-inflated Poisson models Count data often contain many zeros. In parametric regression analysis of zero-inflated count data, the effect of a covariate of interest is typically modelled via a linear predictor. This approach imposes a restrictive, and potentially questionable, functional form on the relation between the independent and dependent variables. To address the noted restrictions, a flexible parametric procedure is employed to model the covariate effect as a linear combination of fixed-knot cubic basis splines or B-splines. The semiparametric zero-inflated Poisson regression model is fitted by maximizing the likelihood function through an expectation-maximization algorithm. The smooth estimate of the functional form of the covariate effect can enhance modelling flexibility. Within this modelling framework, a log-likelihood ratio test is used to assess the adequacy of the covariate function. Simulation results show that the proposed test has excellent power in detecting the lack of fit of a linear predictor. A real-life data set is used to illustrate the practicality of the methodology.

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

semiparametric zero-inflated poisson regression model


Coping with rapid information technology change in different national cultures Coping with rapid information technology change challenges IT organizations throughout the world. National culture theory based on the GLOBE study suggests that culture affects the coping with such change in China and the United States, but does not cogently suggest that coping mechanisms differ in effectiveness across the two cultures. Analysis of data from 71 IT executives and managers in China and 246 in the United States suggests that Chinese IT organizations employ coping mechanisms of vendor support, education and training, and internal procedures more extensively than do U.S. IT organizations. IT organizations in both countries apply education and training as well as internal procedures to successfully deal with the problems of rapid IT change. Vendor support additionally predicted success in Chinese but not U.S. organizations, whereas in both U.S. and Chinese organizations endurance predicted lack of success. The research thus extends national culture theory by proposing that culture affects successful coping. Implications for research suggest the identification of actions to overcome the impact of cultural differences. Implications for practice suggest that multinational corporations deal with rapid IT change differently in divisions in different cultures, regardless of whether in China, the United States, Europe, or elsewhere. European Journal of Information Systems (2011) 20, 560-573. doi:10.1057/ejis.2011.20; published online 3 May 2011

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

national culture
rapid information technology change

coping mechanisms for rapid information technology change


Evaluation of methods for estimating aquifer hydraulic parameters We proposed an Ant Colony Optimization (ACO) to estimate the aquifer hydraulic properties. ACO is efficient, and reliable for estimating various aquifer hydraulic parameters from the timedrawdown data. ACO provides better estimation of aquifer properties than the graphical and NLP techniques.

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

ant colony optimization (aco)
genetic algorithm (ga)
nonlinear programming (nlp)
pumping test


Taiji variations: Yin and Yang in multiple dimensions This paper briefly describes the historical background and geometric construction of the Taiji diagram, commonly known as the Yin-Yang symbol. Some examples of two- and three-dimensional variations are given based on alternative construction methods, including a simplified baseball curve with shape parameterized by a single variable. This curve is used to describe the standard Taiji ball, and introduce a new style of ball more in keeping with the Taiji's original design principles.

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

taiji diagram
yin and yang
simplified baseball curve


Non-blind deblurring of structured images with geometric deformation Non-blind deconvolution, which is to restore a sharp version of a given blurred image when the blur kernel is known, is a fundamental step in image deblurring. While the problem has been extensively studied, existing methods have conveniently ignored an important fact that deformation can significantly affect the statistical characteristics of an image and introduce additional blurring effect. In this paper, we show how to enhance non-blind deconvolution by recovering and undoing the deformation while deconvolving a given blurred image. We show that this is the case for almost all popular regularizers that have been proposed for image deblurring such as total variation and its variants. We conduct extensive simulations and experiments on real images and verify that the incorporation of geometric deformation in deconvolution can significantly improve the final deblurring results. Combined with existing blur kernel estimation techniques, our method can also be used to enhance blind image deblurring.

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


Channel length assisted symbol synchronization for OFDM systems in multipath fading channels Despite the promising role of orthogonal frequency-division multiplexing (OFDM) technology in communication systems, its synchronization in multipath fading channels remains an important and challenging issue. This work describes a novel synchronization algorithm that exploits channel length information for use in OFDM systems. A timing function that can identify the ISI-free region and subsequently the channel length is also developed based on both the redundancy of the cyclic prefix (CP), and the drastic increase in intersymbol interference (ISI) that rises with symbol timing error in multipath fading channels. Knowledge of the channel length information allows the symbol timing to be safely set in the middle of the ISI-free region, without any ISI. Simulation results indicate that the maximum value of the timing function occurs at the correct timing offset when the signal-to-noise ratio (SNR) is high. From low- to medium SNRs, the correct timing offset is guaranteed when the signal power induced by the channel tap is more significant than the noise power. Furthermore, an efficient search algorithm is derived to reduce the search complexity (search time and computation complexity).

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

orthogonal frequency-division multiplexing (ofdm)


A Recombinant Fragment of Human Surfactant Protein D Reduces Alveolar Macrophage Apoptosis and Pro-Inflammatory Cytokines in Mice Developing Pulmonary Emphysema Rapid removal of apoptotic cells is an important mechanism for immune homeostasis and the resolution of inflammation. Delayed clearance of apoptotic alveolar macrophages may cause activation of healthy bystander macrophages and contribute to high macrophage number and emphysema in surfactant protein D (SP-D) knock-out mice. Using flow cytometry and Annexin V and propidium iodide as markers for apoptosis and necrosis, respectively, SP-D-deficient mice were found to have a 5- to 10-fold increase in the number of apoptotic and necrotic alveolar macrophages in the lungs. SP-D-deficient mice accumulate apoptotic macrophages in the lung, and this accumulation can be reduced by treatment with recombinant SP-D (but not SP-A). The recombinant SP-D binds preferentially to apoptotic cells. The data are consistent with a specific role in vivo for SP-D in promoting apoptotic cell clearance in the lungs to limit macrophage-mediated inflammation and reveal a potential new mechanism for therapeutic targeting in the prevention of emphysema.

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


A generalized interval probability-based optimization method for training generalized hidden Markov model A generalized Jensen inequality and a generalized BaumWelch?s auxiliary function are proposed. A generalized BaumWelch algorithm is used for training generalized hidden Markov model. The performance of generalized BaumWelch algorithm is validated by a case study of cutting processing. The tool wear and cutting states are recognized by generalized hidden Markov model.

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

generalized hidden markov model
generalized jensen inequality
generalized baumwelch algorithm

generalized interval probability
state recognition


Annealing evolutionary stochastic approximation Monte Carlo for global optimization In this paper, we propose a new algorithm, the so-called annealing evolutionary stochastic approximation Monte Carlo (AESAMC) algorithm as a general optimization technique, and study its convergence. AESAMC possesses a self-adjusting mechanism, whose target distribution can be adapted at each iteration according to the current samples. Thus, AESAMC falls into the class of adaptive Monte Carlo methods. This mechanism also makes AESAMC less trapped by local energy minima than nonadaptive MCMC algorithms. Under mild conditions, we show that AESAMC can converge weakly toward a neighboring set of global minima in the space of energy. AESAMC is tested on multiple optimization problems. The numerical results indicate that AESAMC can potentially outperform simulated annealing, the genetic algorithm, annealing stochastic approximation Monte Carlo, and some other metaheuristics in function optimization.

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

convergence
genetic algorithm
global optimization
simulated annealing
stochastic approximation monte carlo


Myocardial Tissue Engineering: Creating a Muscle Patch for a Wounded Heart Cardiac tissue engineering promises to revolutionize the treatment of patients with end-stage heart failure and provide new solutions to the serious problem of heart donor shortage. By its broad definition, tissue engineering involves the construction of tissue equivalents from donor cells seeded within three-dimensional polymeric scaffolds, then culturing and implanting of the cell-seeded scaffolds to induce and direct the growth of new, healthy tissue. Here, we present an up-to-date summary of research studies in cardiac tissue engineering, with an emphasis on the critical design principles.

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

biomaterial
cell
three-dimensional scaffold


examining the relationship between game type, player disposition and aggression As technology advances the need for more comprehensive analyses of the relationship between human aggression and gaming increases. First Person Shooter gaming environments provide realistic opportunities for many interactions between players. Violent and aggressive video games have been blamed for many aggressive acts. Early meta-analyses of gaming and aggression concluded that gaming does increase aggression, although at levels lower than that of television and other media. More recent meta-analyses claim that there is no correlation between gaming and aggression. However, previous studies do not consider the possible effect of a live opponent on player aggression and therefore the current study includes this as a putative factor in gaming and aggression. Results indicate that neither the disposition of the opponent (confederate) nor the aggressive level of the game type affected participant aggression.

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


An efficient profile-based algorithm for scratchpad memory partitioning Focusing on embedded applications, scratchpad memories (SPMs) look like a best-compromise solution when taking into account performance, energy consumption, and die area. The main challenge in SPM design is to optimally map memory locations to scratchpad locations. This paper describes an algorithm to solve such a mapping problem by means of dynamic programming applied to a synthesizable hardware architecture. The algorithm works by mapping segments of external memory to physically partitioned banks of an on-chip SPM; this architecture provides significant energy savings. The algorithm does not require any user-set bound on the number of partitions and takes into account partitioning overhead. Improving on previous solutions, execution time is polynomial in the number of memory locations, even in the most general solving policy. This has the major practical advantage of allowing an arbitrary number of scratchpad segments, something that was impossible with previous methods, whose running time is exponential to this number. Strategies to optimize memory requirements and speed of the algorithm are exploited. Additionally, we integrate this algorithm in a complete and automated design, simulation, and synthesis flow.

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

design automation
embedded design
memory hierarchy
partitioning algorithm
power saving
scratchpad memory (spm)


Time series generation by recurrent neural networks The properties of time series, generated by continuous valued feed-forward networks in which the next input vector is determined from past output values, are studied. Asymptotic solutions developed suggest that the typical stable behavior is ( quasi) periodic with attractor dimension that is limited by the number of hidden units, independent of the details of the weights. The results are robust under additive noise, except for expected noise-induced effects - attractor broadening and loss of phase coherence at large times. These effects, however, are moderated by the size of the network N.

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

recurrent neural networks
time series
attractor dimension

asymptotic properties
non-linear dynamical systems
stochastic processes


Elastic network control: An alternative to active networks Much of the recent work in network control has concentrated on opening up the network, moving away from closed, monolithic control systems. Such work can be placed into two categories: use of generic APIs, giving rise to open control of networks; and allowing packets on the datapath to program the network nodes, leading to the concept of the active network, Drawing on experience in both of these areas, this paper presents the design and implementation of a framework that enables clients to program all aspects of the network in a manageable, controllable manner. By using resource partitioning, clients are allowed to inject code into the various entities of the network's control system, subject to access control restraints. This form of programmable network is termed an elastic network and it is proposed as an alternative to current active networking approaches. The elastic network has two key advantages over open control and active networks, Firstly, the elastic network allow's dynamic customization of all aspects of the network control, management and data processing components. Secondly, all customization takes place in a safe, resource-controlled way. This makes available the flexibility of active networks, and the resource controllability of open control networks, without imposing the attendant costs on all users of the network. Costs still exist, but their imposition is restricted to those places where the available functionality is actually used.

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

programmable networks
open signalling
network architectures


Coefficient bounds for certain subclasses of close-to-convex functions of Janowski type In this work, we aim to determine the coefficient estimates for functions in certain subclasses of close-to-convex functions of Janowski type and related functions of complex order, which are here defined by means of Cauchy-Euler type non-homogeneous differential equation. Several interesting consequences of our results are also observed.

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


PSHO-HF-PM: An Efficient Proactive Spectrum Handover Mechanism in Cognitive Radio Networks In the paper, we develop an efficient proactive spectrum handover mechanism by using packet scheduling algorithm, called PSHO-HF-PM, to reduce unusable channel. It effectively integrates several mechanisms (hole filling and packet migration) to reduce the bandwidth fragment and support QoS. Its basic idea is in that a new packet is scheduled by migrating some packets to other channels if none of holes in any channels can accommodate it; otherwise repeating the above processes after random waiting time. Meanwhile under an effective data structure, such as the balanced binary search tree, its computational complexity will be \(O(2n\log n)\) at most. In the proposed packet scheduling algorithm, packet migration plays a key role in the improvement of bandwidth efficiency and QoS. We also evaluate the performance of total service time for proactive spectrum handover mechanism based on a Preemptive Resume Priority M/G/1 queuing network model. The performance analysis and simulation results show that it performs much better than other proactive and reactive handover mechanism in collision rate, total service time, packet loss probability and bandwidth fragment ratio.

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

cognitive radio networks
spectrum handover
packet scheduling


Frequency-based load shedding over a data stream of tuples Usually the data generation rate of a data stream is unpredictable, and some data elements of the data stream cannot be processed in real time if the generation rate exceeds the capacity of a data stream processing algorithm. In order to overcome this situation gracefully, a load shedding technique is recommended. This paper proposes a frequency-based load shedding technique over a data stream of tuples. In many data stream processing applications, such as mining frequent patterns, data elements having high frequency can be considered more significant than others having low frequency. Based on this observation, in the proposed technique, only frequent elements of a data stream are processed in real time while the others are trimmed. The decision to shed a load from the data stream or not is controlled automatically by the data generation rate of a data stream. Consequently, an unnecessary load shedding operation is not allowed in the proposed technique.

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

frequency-based load shedding
data stream processing


extending the lifetime of fuel cell based hybrid systems Fuel cells are clean power sources that have much higher energy densities and lifetimes compared to batteries. However, fuel cells have limited load following capabilities and cannot be efficiently utilized if used in isolation. In this work, we consider a hybrid system where a fuel cell based hybrid power source is used to provide power to a DVFS processor. The hybrid power source consists of a room temperature fuel cell operating as the primary power source and a Li-ion battery (that has good load following capability) operating as the secondary source. Our goal is to develop polices to extend the lifetime of the fuel cell based hybrid system. First, we develop a charge based optimization framework which minimizes the charge loss of the hybrid system (and not the energy consumption of the DVFS processor). Next, we propose a new algorithm to minimize the charge loss by judiciously scaling the load current. We compare the performance of this algorithm with one that has been optimized for energy, and demonstrate its superiority. Finally, we evaluate the performance of the hybrid system under different system configurations and show how to determine the best combination of fuel cell size and battery capacity for a given embedded application.

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


Numerical simulations of cantilever beam response with saturation control and full modal coupling Numerical simulations of the response of a uniform, cantilever beam subjected to a base excitation are performed. A saturation absorber is implemented to control the beam response. In previous investigations of similar configurations, the inertial and structural properties of the piezoelectric actuators have been neglected, resulting in an analytical model of a uniform beam. This investigation includes the nonuniformities in the beam properties that are introduced when piezoelectric actuators are bonded to the uniform beam. The resulting coupling between uniform, cantilever beam modes is fully included in the analytical model. It is shown that this modal coupling has a significant effect on the beam response, which is not present when modal coupling is neglected.

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

cantilever beam
saturation control
modal coupling

nonuniform beam
active control
piezoelectrics


Undersampled \(K\)-means approach for handling imbalanced distributed data \(K\)-means is a partitional clustering technique that is well known and widely used for its low computational cost. However, the performance of \(K\)-means algorithm tends to be affected by skewed data distributions, i.e., imbalanced data. They often produce clusters of relatively uniform sizes, even if input data have varied cluster size, which is called the uniform effect. In this paper, we analyze the causes of this effect and illustrate that it probably occurs more in the \(K\)-means clustering process. As the minority class decreases in size, the uniform effect becomes evident. To prevent the effect of the uniform effect, we revisit the well-known \(K\)-means algorithm and provide a general method to properly cluster imbalance distributed data. The proposed algorithm consists of a novel undersampling technique implemented by intelligently removing noisy and weak instances from majority class. We conduct experiments using twelve UCI datasets from various application domains using five algorithms for comparison on eight evaluation metrics. Experimental results show the effectiveness of the proposed clustering algorithm in clustering balanced and imbalanced data.

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


Mapping supply chains on risk and customer sensitivity dimensions Purpose - With the emergence of the concepts of lean, agile and leagile paradigms for supply chains, organizations have little idea as to which model suits them based on the their supply chain's ability to counter risks and take on the challenges of the fast changing customer preferences. This paper aims to map supply chains on these two dimensions. Design/methodology/approach - A model is proposed by which suitable supply chain strategy can be selected based on customer sensitivity and risk alleviation competency dimension. Graph theoretic approach is applied to quantify these dimensions for three case supply chains. Findings - The proposed model was tested for three Indian SMEs clusters and suitable supply chain strategy was suggested. Research limitations/implications - It is recommended that the model be tested for those supply chains which have established themselves as lean, agile or leagile entities. Practical implications - Suggested model would help organizations to select suitable supply chain strategy based on customer sensitivity and risk alleviation competency and the transition required in tune with the market requirements in which they operate. Also the areas which need improvements from the perspective of risk alleviation competency or customer sensitivity can be easily delineated. Originality/value - Mapping supply chains based on quantification of customer sensitivity and risk alleviation competency dimension is a novel effort in the area of supply chain management.

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


Memory boosts cooperation The standard spatial formulation of the iterated Prisoner's Dilemma is ahistoric (memoryless): i.e., only the results generated in the last round are taken into account in deciding the next choice. Historic memory can be implemented by featuring players by a summary of their previous winnigs and choices. Here we study the effect of limited trailing memory: only the last three iterations are recorded. The effects of full and discounted memory are assessed. It is concluded that this short-type memory stimulates cooperation.

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


P2PVR: A playback offset aware multicast tree for on-demand video streaming with VCR functions Tree-based peer-to-peer multicast overlays have been widely proposed to provide on-demand video streaming services. However, alleviating the server load in large-scale, dynamic environments such as the Internet remains a major challenge. Accordingly, this paper proposes a new peer-to-peer on-demand video streaming system, designated as peer-to-peer personal video recorder (P2PVR), which facilitates essential VCR functions in an efficient manner. In the proposed architecture, the peers are organized into a playback offset aware tree-based overlay, in which they share streaming data with other peers having a similar playback offset. In addition, a semi-decentralized directory service is developed to assist peers in searching only those parts of the tree known to contain eligible parent nodes, i.e. nodes which possess the expected streaming data. The performance of P2PVR is evaluated by performing a series of experiments on the PlanetLab platform. The results show that P2PVR yields a significant reduction in the server stream stress and achieves a reasonably low playback discontinuity under dynamic network conditions whilst simultaneously granting a low control overhead and startup latency.

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


Bounding models families for performance evaluation in composite Web services One challenge of composite Web service architectures is the guarantee of the Quality of Service (QoS). Performance evaluation of these architectures is essential but complex due to synchronizations inside the orchestration of services. We propose methods to automatically derive from the original model a family of bounding models for the composite Web response time. These models allow to find the appropriate trade-off between accuracy of the bounds and the computational complexity. The numerical results show the interest of our approach w.r.t. complexity and accuracy of the response time bounds.

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

continuous time markov chains
stochastic coupling


Adaptive-Multilevel BDDC and its parallel implementation We combine the adaptive and multilevel approaches to the BDDC and formulate a method which allows an adaptive selection of constraints on each decomposition level. We also present a strategy for the solution of local eigenvalue problems in the adaptive algorithm using the LOBPCG method with a preconditioner based on standard components of the BDDC. The effectiveness of the method is illustrated on several engineering problems. It appears that the Adaptive-Multilevel BDDC algorithm is able to effectively detect troublesome parts on each decomposition level and improve convergence of the method. The developed open-source parallel implementation shows a good scalability as well as applicability to very large problems and core counts.

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


Effective management of information systems function: an exploratory study of Indian organizations Following the economic liberalization in 1990s, several Indian organizations have turned to information systems (IS) for improving their competitiveness and overall business performance. The increased demands on the information technology has made it necessary to design effective IS functions and sound IS management processes. This study seeks to gain an understanding of how Indian organizations are designing their IS functions in order to promote the use of information technology for strategic benefits. It also aims to identify critical parameters that would contribute to effective performance of the IS function in Indian organizations. Based on three case studies from diverse industries, we discuss the importance of five parametersthe role of top management, the CEOCIO relationship, IS department structure, IS planning process and IS implementation that determine the ultimate effectiveness of IS function. Based on the analysis of the case studies, we present several propositions as recommendations for effective design of IS function and IS management processes in Indian firms. The implications for future research and practice are presented.

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

information systems management
is performance
developing country


Defocusing image to pattern contact holes using attenuated phase shift masks The patterning of contact holes by selecting out-of-focus image plane (defocus) using attenuated phase shift masks (APSM) has been studied. Defocus is found to enhance the image modulation at low partial coherence for contact holes with negative local average of mask function. Semi-dense holes up to 130nm in 8% APSM have been printed by 0.5?m defocus at a partial coherence of 0.31 using KrF scanner with highest numerical aperture of 0.68. However, these holes were closed with in-focus imaging. Defocus is also found to be beneficial for patterning the pitches that have extensive side lobes with in-focus imaging.

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

attenuated phase shift mask
diffraction
rayleigh resolution


Updating beliefs about variables given new information on how those variables relate Bayesian techniques specify how to update beliefs about a variable given information on that variable or related variables. In many cases, statistical analyses also provide information about the relationship between variables, but the Borel Paradox prohibits many natural ways of updating beliefs conditioned on information about a relationship. This paper presents a method by which beliefs can be updated without violating the Borel Paradox under certain circumstances. We apply our approach to relationships specified by a statistical model (i.e., regression), and relationships described by statistical simulation.

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

probability updating
modeling
bayesian synthesis
bayesian melding
borels paradox


large program trace analysis and compression with zdds Prior work has shown that reduced, ordered, binary decision diagrams (BDDs) can be a powerful tool for program trace analysis and visualization. Unfortunately, it can take hours or days to encode large traces as BDDs. Further, techniques used to improve BDD performance are inapplicable to large dynamic program traces. This paper explores the use of ZDDs for compressing dynamic trace data. Prior work has show that ZDDs can represent sparse data sets with less memory compared to BDDs. This paper demonstrates that (1) ZDDs do indeed provide greater compression for sets of dynamic traces (25\% smaller than BDDs on average), (2) with proper tuning, ZDDs encode sets of dynamic trace data over 9x faster than BDDs, and (3) ZDDs can be used for all prior applications of BDDs for trace analysis and visualization.

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


Characterising F(0) contour shape in infant- and foreigner-directed speech ? We show IDS F(0) contours are different from those of ADS and FDS in natural speech. F(0) contours in natural speech were not reproducible in simulated interactions. We found no difference between F(0) contours simulated by actresses and students. We triangulated the results using qualitative and quantitative (Eigenshape) analyses. Simulated speech interactions should be used with caution in future studies.

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


Hop ID: A virtual coordinate-based routing for sparse mobile ad hoc networks Routing in wireless communication systems such as ad hoc networks remains a challenging problem given the limited wireless bandwidth, users' mobility, and potentially large scale. Recently, a thrust of research has addressed these problems - the on-demand routing, geographical routing, and virtual coordinates. In this paper, we focus on geographical routing that has been shown to achieve good scalability without flooding; however, this usually requires the availability of location information and can suffer from poor routing performance and severe dead end problems, especially in sparse networks. Specifically, we propose a new Hop ID routing scheme, which is a virtual coordinate-based routing protocol and does not require any location information. This achieves excellent routing performance comparable with that obtained by the shortest path routing schemes. In addition, we design efficient algorithms for setting up the system and adapt to the node mobility quickly and can effectively route out of dead ends. Extensive analysis and simulation show that the Hop ID-based routing achieves efficient routing for mobile ad hoc networks with various density, irregular topologies, and obstacles.

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


SSW: A small-world-based overlay for peer-to-peer search Peer-to-peer (P2P) systems have become a popular platform for sharing and exchanging voluminous information among thousands or even millions of users. The massive amount of information shared in such systems mandates efficient semantic-based search instead of key-based search. The majority of existing proposals can only support simple key-based search rather than semantic-based search. This paper presents the design of an overlay network, namely, semantic small world (SSW), that facilitates efficient semantic-based search in P2P systems. SSW achieves the efficiency based on four ideas: 1) semantic clustering, where peers with similar semantics organize into peer clusters, 2) dimension reduction, where to address the high maintenance overhead associated with capturing high-dimensional data semantics in the overlay, peer clusters are adaptively mapped to a one-dimensional naming space, 3) small world network, where peer clusters form into a one-dimensional small world network, which is search efficient with low maintenance overhead, and 4) efficient search algorithms, where peers perform efficient semantic-based search, including approximate point query and range query in the proposed overlay. Extensive experiments using both synthetic data and real data demonstrate that SSW is superior to the state of the art on various aspects, including scalability, maintenance overhead, adaptivity to distribution of data and locality of interest, resilience to peer failures, load balancing, and efficiency in support of various types of queries on data objects with high dimensions.

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

distributed systems
distributed indexing
internet content sharing
peer-to-peer systems


From Algol to polymorphic linear lambda-calculus In a linearly-typed functional language, one can define functions that consume their arguments in the process of computing their results. This is reminiscent of state transformations in imperative languages, where execution of an assignment statement alters the contents of the store. We explore this connection by translating two variations on Algol 60 into a purely functional language with polymorphic linear types. On the one hand, the translations lead to a semantic analysis of Algol-like programs, in terms of a model of the linear language. On the other hand, they demonstrate that a linearly-typed functional language can be at least as expressive as Algol.

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

linear logic
local state
logical relations
parametric polymorphism


Artificial immune system for multi-objective design optimization of composite structures We present a new, generic method/model for multi-objective design optimization of laminated composite components using a novel multi-objective optimization algorithm developed on the basis of the artificial immune system (AIS) paradigm. A co-variant of the popular clonal selection principle called as the Objective Switching Clonal Selection Algorithm (OSCSA) has been developed and implemented successfully for the multi-objective design optimization of composites. The problem is formulated with multiple objectives of minimizing weight and the total cost of the composite component to achieve a specified strength. The primary optimization variables arethe number of layers, its stacking sequence (the orientation of the layers) and thickness of each layer. The classical lamination theory is utilized to determine the stresses in the component and the design is evaluated based on three failure criteria; failure-mechanism-based failure criteria, maximum stress failure criteria and the Tsai-Wu failure criteria. The optimization method is validated for a number of different loading configurationsuniaxial, biaxial and bending loads. The design optimization has been carried for both variable stacking sequences as well as fixed standard stacking schemes and a comparative study of the different design configurations evolved has been presented.

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

natural computing
structural optimization
multi-objective optimization


ESTDD: Expert system for thyroid diseases diagnosis Expert or knowledge-based systems are the most common type of AIM (artificial intelligence in medicine) system in routine clinical use. They contain medical knowledge, usually about a very specifically defined task, and are able to reason with data from individual patients to come up with reasoned conclusions. Although there are many variations, the knowledge within an expert system is typically represented in the form of a set of rules. The thyroid gland is one of the most important organs in the body as thyroid hormones are responsible for controlling metabolism. As a result, thyroid function impacts on every essential organ in the body. When the thyroid produces too much hormone, the body uses energy faster than it should. This condition is called hyperthyroidism. When the thyroid does not produce enough hormone, the body uses energy slower than it should. This condition is called hypothyroidism. Thyroid disease can be difficult to diagnose because symptoms are easily confused with other conditions. When thyroid disease is caught early, treatment can control the disorder even before the onset of symptoms. This study aims at diagnosing thyroid diseases with a expert system that we called as a ESTDD (expert system for thyroid disease diagnosis). We found fuzzy rules by using neuro fuzzy method, which will be emplaced in ESTDD system. ESTDD could diagnose with 95.33% accuracy thyroid diseases. Beside it can be benefited from this system for training of students in medicine.

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

expert system
neuro fuzzy
thyroid diseases


self-identifying sensor data Public-use sensor datasets are a useful scientific resource with the unfortunate feature that their provenance is easily disconnected from their content. To address this we introduce a technique to directly associate provenance information with sensor datasets. Our technique is similar to traditional watermarking but is intended for application to unstructured datasets. Our approach is potentially imperceptible given sufficient margins of error in datasets, and is robust to a number of benign but likely transformations including truncation, rounding, bit-flipping, sampling, and reordering. We provide algorithms for both one-bit and blind mark checking. Our algorithms are probabilistic in nature and are characterized by a combinatorial analysis.

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


Dynamic simulation of start-up procedures of reactive distillation columns Dynamic simulation is presented as a tool to; asses operational and control issues for reactive distillation systems. READYS is applied to three examples showing interesting behavior during start-up. It can be seen, through the examination of the cases studied in this work, how a given start-up policy can be better or worse for the overall process. Sometimes, it can send the column to a completely inappropriate operating condition. The transient responses of a reactive distillation column with multiplicity of solutions yielding different steady states during start-up operation are presented. (C) 1998 Elsevier Science Ltd. All rights reserved.

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

reactive distillation
dynamic simulation


Hybrid Method of Engineering Analysis: Combining Meshfree Method with Distance Fields and Collocation Technique This paper describes a numerical technique for solving engineering analysis problems that combine radial basis functions and collocation technique with meshfree method with distance fields, also known as solution structure method. The proposed hybrid technique enables exact treatment of all prescribed boundary conditions at every point on the geometric boundary and can be efficiently implemented for both structured and unstructured grids of basis functions. Ability to use unstructured grids empowers the meshfree method with distance fields with higher level of geometric flexibility. By providing exact treatment of the boundary conditions, the new approach makes it possible to exclude boundary conditions from the collocation equations. This reduces the size of the algebraic system, which results in faster solutions. At the same time, the boundary collocation points can be used to enforce the governing equation of the problem, which enhances the solution's accuracy. Application of the proposed method to solution of heat transfer problems is illustrated on a number of benchmark problems. Modeling results are compared with those obtained by the traditional collocation technique and meshfree method with distance fields. [DOI: 10.1115/1.3572035]

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

radial basis functions
meshfree method
solution structure

approximate distance field
collocation method


UCC: Update-conscious compilation for energy efficiency in wireless sensor networks Wireless sensor networks (WSN), composed of a large number of low-cost, battery-powered sensors, have recently emerged as promising computing platforms for many non-traditional applications. The preloaded code on remote sensors often needs to be updated after deployment in order for the WSN to adapt to the changing demands from the users. Post-deployment code dissemination is challenging as the data are transmitted via battery-powered wireless communication. Recent studies show that the energy for sending a single bit is about the same as executing 1000 instructions in a WSN. Therefore it is important to achieve energy efficiency in code dissemination. In this paper, we propose novel update-conscious compilation (UCC) techniques for energy-efficient code dissemination in WSNs. An update-conscious compiler, when compiling the modified code, includes the compilation decisions that were made when generating the old binary. The compiler employs a detailed energy model and strives to match the old decisions for a more energy-efficient result. In most cases, matching the previous decisions improves the binary code similarity, reduces the amount of data to be transmitted to remote sensors, and thus, consumes less energy. In this paper, we develop update-conscious register allocation and data layout algorithms. Our experimental results show that they can achieve great improvements over the traditional, update-oblivious approaches.

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

register allocation
sensor networks
code dissemination


On the NBC-complexes and ? ? -invariants of abstract convex geometries An (abstract) convex geometry is a combinatorial abstraction of convexity which is a Moore family with the closure operator satisfying the anti-exchange property. A number of results of matroids on the NBC-complexes (or broken circuit complexes) happen to have some exact analogues in convex geometries: for instance, the Whitney-Rotas formula of the characteristic function of a matroid, Brylawskis decomposition of the NBC-complexes, etc. A ? ? -invariant of a convex geometry is derived from the characteristic function in the same way as that of a matroid. We introduce a merging of two convex geometries, which is called a 1-sum, and exhibit the resultant value of the ? ? -invariant of a 1-sum.

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

rooted circuit
characteristic polynomial
broken circuit complex


answer garden: a tool for growing organizational memory Answer Garden allows organizations to develop databases of commonly asked questions that grow organically as new questions arise and are answered. It is designed to help in situations (such as field service organizations and customer hot lines) where there is a continuing stream of questions, many of which occur over and over, but some of which the organization has never seen before. The system includes a branching network of diagnostic questions that helps users find the answers they want. If the answer is not present, the system automatically sends the question to the appropriate expert, and the answer is returned to the user as well as inserted into the branching network. Experts can also modify this network in response to users' problems. Our initial Answer Garden database contains questions and answers about how to use the X Window System.

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

network help organization use users tool response database user

situated
streams
systems
custom
windows
organizational memories


An enhanced Customer Relationship Management classification framework with Partial Focus Feature Reduction Effective data mining solutions have for long been anticipated in Customer Relationship Management (CRM) to accurately predict customer behavior, but from various industry research and case studies we have observed sub-optimal CRM classification models due to inferior data quality inherent to CRM data set. In this paper, one type of CRM data with a distinctive distribution pattern of Reduced Dimensionality is discussed. A new classification framework termed Partial Focus Feature Reduction is proposed to resolve CRM data set with Reduced Dimensionality using a collection of efficient data mining techniques characterizing a specially tailored modality grouping method to significantly improve data quality and feature relevancy after preprocessing, eventually achieving excellent classification performance with the right combination of classification algorithms.

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

customer relationship management
classification

feature selection
imbalanced classification
ensemble classification


SMIS Members: A Membership Analysis This article discusses the results of a survey of SMIS members. Members were asked to respond to questions regarding demographics, their satisfaction with SMIS services, and the importance of eighteen management issues which MIS management might address. The article presents percentage results of individual questions and interprets the results of those questions. No attempt is made to use any bivariate statistics in this article. All questions asked on the survey are presented in this article.

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


user guided audio selection from complex sound mixtures In this paper we present a novel interface for selecting sounds in audio mixtures. Traditional interfaces in audio editors provide a graphical representation of sounds which is either a waveform, or some variation of a time/frequency transform. Although with these representations a user might be able to visually identify elements of sounds in a mixture, they do not facilitate object-specific editing (e.g. selecting only the voice of a singer in a song). This interface uses audio guidance from a user in order to select a target sound within a mixture. The user is asked to vocalize (or otherwise sonically represent) the desired target sound, and an automatic process identifies and isolates the elements of the mixture that best relate to the user's input. This way of pointing to specific parts of an audio stream allows a user to perform audio selections which would have been infeasible otherwise.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 efficient solution of the input impedance of a half-wave dipole near a human head This article combines the Galerkin method of moments with the complex image technique to find the current distribution, input impedance, return loss, and frequency bandwidth of a half-wave dipole near a human head. It also finds the specific absorption rate distribution inside the human head which is modeled as three planar layers of lossy dielectrics. Comparisons with IE3D commercial simulator verify the accuracy and speed of the proposed method. It is found that the input resistance of the dipole is significantly reduced as the dipole is brought closer to the human head causing a reduction in the frequency bandwidth. The proposed method can be modified to solve other types of antennas on different human head planar geometries. 2011 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2012.

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


A novel image enhancement algorithm for a small target detection of panoramic infrared imagery A novel image enhancement algorithm that can efficiently detect a small target of panoramic infrared (IR) imagery is proposed. Image enhancement is the first step for detecting and recognizing a small target in the IR imagery. The essence of the proposed algorithm is to utilize the independent histogram equalization (HE) separately over two sub-images obtained by decomposing the given image through the statistical hypothesis testing (SHT). Experimental results show that the proposed algorithm has better discrimination and lower false alarm rate than the conventional algorithms.

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

panoramic infrared imagery
small target detection
statistical hypothesis testing
histogram equalization


Efficient clustering-based source code plagiarism detection using PIY Vast amounts of information available online make plagiarism increasingly easy to commit, and this is particularly true of source code. The traditional approach of detecting copied work in a course setting is manual inspection. This is not only tedious but also typically misses code plagiarized from outside sources or even from an earlier offering of the course. Systems to automatically detect source code plagiarism exist but tend to focus on small submission sets. One such system that has become the standard in automated source code plagiarism detection is measure of software similarity (MOSS) Schleimer et al. in proceedings of the 2003 ACM SIGMOD international conference on management of data, ACM, San Diego, 2003. In this work, we present an approach called program it yourself (PIY) which is empirically shown to outperform MOSS in detection accuracy. By utilizing parallel processing and data clustering, PIY is also capable of maintaining detection accuracy and reasonable runtimes even when using extremely large data repositories.

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


A Gaussian-3 theoretical study of the alkylthio radicals and their anions: structures, thermochemistry, and electron affinities The optimized geometries, electron affinities, and dissociation energies of the alkylthio radicals have been determined with the higher level of the Gaussian-3(G3) theory. The geometries are fully optimized and discussed. The reliable adiabatic electron affinities with ZPVE correction have been predicted to be 1.860 eV for the methylthio radical, 1.960 eV for the ethylthio radical, 1.980 and 2.074 eV for the two isomers (n-C3H7S and i-C3H7S) of the propylthio radical, 1.991, 2.133 and 2.013 eV for the three isomers (n-C4H9S, t-C4H9S, and i-C4H9S) of the butylthio radical, and 1.999, 2.147, 2.164, and 2.059 eV for the four isomers (n-C5H11S, b-C5H11S, c-C5H11S, and d-C5H11S) of the pentylthio radical, respectively. These corrected EA(ad) values for the alkylthio radicals are in good agreement with available experiments, and the average absolute error of the G3 method is 0.041 eV. The dissociation energies of S atom from neutral CnH2n+1S (n = 1-5) and S- from corresponding anions CnH2n+1S- species have also been estimated respectively to examine their relative stabilities.

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

alkylthio radicals
dissociation energies
electron affinities
geometries