Integrated approach to modelling human systems as reuseable components of manufacturing workplaces A new approach to modelling human systems as reusable components of manufacturing workplaces is described. Graphical and computer executable models of people competences and behaviours are created which are qualitatively and quantitatively matched to equivalent models of process networks, decomposed into roles and dependencies between roles. To enable model creation and reuse, coherent sets of role, competence and dynamic producer unit (DPU) modelling concepts have been defined and instrumented using enterprise modelling (EM), simulation modelling (SM) and causal loop modelling (CLM) techniques. This paper reports on an application of the modelling approach to create related models of 'process oriented roles' and 'candidate human systems' so as to systemise matching of role requirements to resource systems attributes and to inform aspects of strategic and tactical decision making in an SME making composite bearings.

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

dynamic producer unit
enterprise modelling
simulation modelling

human systems modelling
process modelling


Relationship

between

exciton

recombination

zone

and

applied

voltage

in

organic

light-emitting

diodes

In

this

paper,

the

relationship

between

exciton

recombination

zone

and

applied

voltage

in

organic

light-emitting

diodes

(OLEDs)

ITO/NPB

(40nm)/Alq3(wnm)/rubrene(3nm)/Alq3(50?w)/Al,

in

which

a

rubrene

as

sensing

layer

is

inserted

in

layer

at

different

depth,

is

studied.

By

comparing

the

electroluminescence

(EL)

spectra

of

device

driven

under

different

applied

voltages,

a

conclusion

can

be

drawn

that

the

recombination

zone

shifts

logarithmically

with

increasing

applied

voltages.

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


Modeling the effects of elevation data resolution on the performance of topography-based watershed runoff simulation The spatial uncertainty of a topography based rainfall runoff model (TOPMODEL) is addressed in this study to assess its variability in simulating watershed hydrologic response with regards to the change of digital elevation model (DEM) resolution. Twelve DEM realizations of different grid sizes ranging from 30m to 3000m for each of two case watersheds are used for comparative examinations. The study shows that DEM grid size has significant influence on the topographic index distribution which represents the effect of topography on watershed hydrology in TOPMODEL. The smoothing effect of grid size increase may result in deteriorated topographic index distributions at coarse resolutions as the ratio of grid cell area to watershed area gets larger. The simulated discharges and model efficiencies using a same set of TOPMODEL parameters are sensitive to DEM grid size especially at coarse resolutions. This sensitivity, however, can be moderated by parameter calibrations as the optimization runs show that fairly equal efficiencies can be preserved by the compensation effect of transmissivity parameter T0 within a large extent of DEM resolution for each watershed. The interaction between T0 and the topographic index distribution with respect to TOPMDOEL model performance is also examined. It is found that both study watersheds demonstrate a similar pattern of change in model performance along with the increase of the grid-to-watershed ratio. The analysis reveals that the ratio poses an important factor in controlling the effect of DEM grid size on TOPMODEL performance. A ratio of less than 5% is suggested in DEM resolution selection for TOPMODEL applications based on the results of this study.

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

digital elevation model
grid size
topmodel
topographic index


A differential oligopoly game with differentiated goods and sticky prices We investigate a dynamic oligopoly game where goods are differentiated and prices are sticky. We study the open-loop and the closed-loop memoryless Nash equilibrium, and show that the latter equilibrium entails a larger level of steady state production as compared to the former; both equilibria entail a larger level of production in steady state than the static game. We also study the effects of price stickiness and product differentiation upon the steady state equilibrium allocation and profits. The per-firm equilibrium output is increasing in both product differentiation and price stickiness, while profits are increasing in both product differentiation and the speed of price adjustment. The steady state social welfare monotonically increases in the speed of price adjustment, and the overproduction entailed by dynamic competition has beneficial effect from a social standpoint.

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

price stickiness
product differentiation

game theory
dynamic programming
differential games


animating physically based explosions in real-time We present a framework for real-time animation of explosions that runs completely on the GPU. The simulation allows for arbitrary internal boundaries and is governed by a combustion process, a Stable Fluid solver, which includes thermal expansion, and turbulence modeling. The simulation results are visualised by two particle systems rendered using animated textures. The results are physically based, non-repeating, and dynamic real-time explosions with high visual quality.

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

gpu
explosions
animation
particle systems

fluid dynamics
real-time
natural phenomena
physically based animation


Quantitative Structure-Activity Relationships for Anticancer Activity of 2-Phenylindoles Using Mathematical Molecular Descriptors Calculated atom pairs (APs) and a set of 369 topological indices (TIs) calculated by POLLY, Triplet, and Molconn-Z software were used to develop QSARs for anticancer activity of a group of 2-phenyl indoles. The TIs included both topostructural (TS) and topochemical (TC) indices. Results show that ridge regression using TS indices, TC indices, and atom pairs produced high-quality models for the prediction of anticancer activity of a set of 89 phenylindole derivatives. Quality of QSARs derived in this paper is comparable or superior to both CoMFA and other statistical models reported for 2-phynylindoles in the earlier published literature. Easily calculated molecular descriptors like TIs and APs used in this paper may find application in the QSAR and in silico prediction of bioactivity of new phenylindole derivatives.

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

anticancer activity
phenylindole
mathematical molecular descriptors
ridge regression


Managing change in an information systems development organization: understanding developer transitions from a structured to an object-oriented development environment1 Abstract.? Object-oriented systems development has attracted great interest in the information systems (IS) field because of a belief that using object-oriented development (OD) makes it easier to develop and maintain software plus achieve software reuse. However, the transition from structured to OD may be especially challenging for IS developers. In fact, some argue that structured development (SD) knowledge may interfere with the ability to learn OD approaches because of a form of proactive interference.

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

object-oriented development
shared mental models
longitudinal study


Solving real-world cutting stock-problems in the paper industry: Mathematical approaches, experience and challenges We bridge research in optimization to real world cutting stock problems (CSPs). We develop two advanced column generation algorithms for 1D CSPs. We develop an Exhaustion Method for 1-CSPs with two criteria. We develop a sophisticated solution method for 2D-trim-loss minimization problems. We assemble a benchmark data set of 25 real world 1D cutting stock instances.

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

paper industry
cutting stock
column generation


Further improvement on dynamic programming for optimal bit allocation Dynamic programming algorithms based on Lagrange multiplier method is often used for obtaining an optimal bit allocation strategy to minimize the total distortion given a constrained rate budget in both source and channel coding applications. Due to possible large quantizer set and improper initialization, the algorithm often suffers from heavy computational complexity. There have been many solutions in recent years to the above question. In this paper, a simple but efficient algorithm is presented to further speed up. the convergence of the algorithm.. This, algorithm can be. easily realized and get the final solution much faster. The experimental result shows that our new algorithm can figure out the optimal solution with a speed 5-7 times faster than the original algorithm.

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

bit allocation
lagrange multiplier method
dynamic programming


ASSESSING BETWEEN-GROUP DIFFERENCES IN INFORMATION SYSTEMS RESEARCH: A COMPARISON OF COVARIANCE- AND COMPONENT-BASED SEM Multigroup or between-group analyses are common in the information systems literature. The ability to detect the presence or absence of between-group differences and accurately estimate the strength of moderating effects is important in studies that attempt to show contingent effects. In the past, IS scholars have used a variety of approaches to examine these effects, with the partial least squares (PLS) pooled significance test for multigroup becoming the most common (e.g., Ahuja and Thatcher 2005; Enns et al. 2003; Zhu et al. 2006). In other areas of social sciences (Epitropaki and Martin 2005) and management (Mayer and Gavin 2005; Song et al. 2005) research, however, there is greater emphasis on the use of covariance-based structural equation modeling multigroup analysis. This paper compares these two methods through Monte Carlo simulation. Our findings demonstrate the conditions under which covariance-based multigroup analysis is more appropriate as well as those under which there either is no difference or the component-based approach is preferable. In particular, we find that when data are normally distributed, with a small sample size and correlated exogenous variables, the component-based approach is more likely to detect differences between-group than is the covariance-based approach. Both approaches will consistently detect differences under conditions of normality with large sample sizes. With non-normally distributed data, neither technique could consistently detect differences across the groups in two of the paths, suggesting that both techniques struggle with the prediction of a highly skewed and kurtotic dependent variable. Both techniques detected the differences in the other paths consistently under conditions of non-normality, with the component-based approach preferable at moderate effect sizes, particularly for smaller samples.

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

multigroup analysis
monte carlo simulation
partial least squares
pooled significance test


Improving the extraction and expansion method for large graph coloring Graph coloring is one of the most studied combinatorial optimization problems. This paper presents an improved extraction and expansion method (IE2COL), initially introduced in Wu and Hao (2012) [44]. IE2COL employs a forward independent set extraction strategy to reduce the initial graph G G . From the reduced graph, IE2COL triggers a backward coloring process which uses extracted independent sets as new color classes for intermediate subgraph coloring. The proposed method is assessed on 20 large benchmark graphs with 900 to 4000 vertices. Computational results show that it provides new upper bounds for 6 graphs and consistently matches the current best-known results for 12 other graphs.

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

graph coloring
independent set extraction

graph k k -coloring k k k k k
memetic coloring
progressive optimization


a critical assessment of hypertext systems Over forty years ago, Vannevar Bush articulated his vision of a Memex machine: associative indexing, whereby any item may be caused at will to select immediately and automatically another [Bush 45]. In the sixties, Engelbart [Engelbart, English 68] built collaborative systems to provide idea structuring and sharing. Nelson [Nelson 81] coined hypertext and proposed world-wide networks for publishing, linking, annotating and indexing multiple versions of documents. With increasing numbers of research projects, papers, panels and conferences, and commercially available systems (e.g. Notecards by Xerox, Guide by Owl and HyperCard by Apple) in recent years, hypertext may be an idea whose time has finally come or at least a phenomenon not to be ignored. The goal of this panel is not to define hypertext or hypermedia (at its simplest: non-linearly arranged and accessed information), debate its uniqueness, explain implementation issues, or survey the many applications and contributions in the field (see [Conklin 87] for an excellent survey of Hypertext, and the Proceedings of Hypertext '87 Workshop at University of North Carolina, Chapel Hill). Rather, we intend to approach it from the perspective of the information user: reader, searcher, author. The panel will address the following issues: Are the processes of authoring and understanding helped or hindered by the non-linear structure of hypertext, for which kinds of tasks and users? What is the difference between a hypertext writer and a knowledge engineer? In searching for information, what is the difference between browsing and querying? What experiments need to be done? What tools, environment or interfaces can improve the process of information creation and access? Can the overhead of creating or interpreting structure be reduced? When will hypertext replace paper, or should it? How do functions of author and reader co-evolve? Could this revolutionize society like the printing press? Why didn't the panelists create a multi-versioned, highly crossreferenced online entry for the proceedings? Is hypertext a technology in search of a problem?

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

assessment hypertext applications hypermedia survey interfaces access knowledge paper online user linking search sharing select printing indexing research structure author systems users workshop implementation process vision tools

network
understandability
addressing
project
experience
browse
timing
informal
technologies
environments
collaboration system
queries
publish
version
critic
documentation


A real-time video transport system for the best-effort Internet It is a challenging problem to design an efficient real-time video transport system for the present best-effort Internet because of the strict bandwidth, loss and time constraints and the lack of quality of service (QoS) guarantees from the present IP networks. This paper presents an end-to-end system architecture based on the MPEG-4 Delivery Multimedia Integration Framework (DMIF) for transporting real-time live video over the Internet. The key features of the system include: (1) MPEG-4 DMIF-based terminal architecture; (2) combination of an end-to-end feedback control mechanism and a rate-adaptive encoding algorithm for the best use of the Internet; (3) a robust and efficient packetization scheme for the MPEG-4 bit-stream by using the resynchronization marker approach specified in the MPEG-4 standard; and (4) efficient error control algorithms adopted at the end systems for visual quality enhancement. Simulation and test results using the actual Internet showed that our system is capable of utilizing the available network resource and achieve good perceptual quality at the application level.

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

mpeg-4
real-time video transport
rate-adaptive encoding


Bad behavior of Godunov mixed methods for strongly anisotropic advectiondispersion equations We study the performance of Godunov mixed methods, which combine a mixed-hybrid finite element solver and a Godunov-like shock-capturing solver, for the numerical treatment of the advectiondispersion equation with strong anisotropic tensor coefficients. It turns out that a mesh locking phenomenon may cause ill-conditioning and reduce the accuracy of the numerical approximation especially on coarse meshes. This problem may be partially alleviated by substituting the mixed-hybrid finite element solver used in the discretization of the dispersive (diffusive) term with a linear Galerkin finite element solver, which does not display such a strong ill conditioning. To illustrate the different mechanisms that come into play, we investigate the spectral properties of such numerical discretizations when applied to a strongly anisotropic diffusive term on a small regular mesh. A thorough comparison of the stiffness matrix eigenvalues reveals that the accuracy loss of the Godunov mixed method is a structural feature of the mixed-hybrid method. In fact, the varied response of the two methods is due to the different way the smallest and largest eigenvalues of the dispersion (diffusion) tensor influence the diagonal and off-diagonal terms of the final stiffness matrix. One and two dimensional test cases support our findings.

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

mesh locking
advectiondispersion equation

mixed hybrid finite element
finite volume
time-splitting
anisotropy


Exponential-time approximation of weighted set cover The SET COVER problem belongs to a group of hard problems which are neither approximable in polynomial time (at least with a constant factor) nor fixed parameter tractable, under widely believed complexity assumptions. In recent years, many researchers design exact exponential-time algorithms for problems of that kind. The goal is getting the time complexity still of order O(c(n)), but with the constant c as small as possible. In this work we extend this line of research and we investigate whether the constant c can be made even smaller when one allows constant factor approximation. In fact, we describe a kind of approximation schemes-trade-offs between approximation factor and the time complexity. We use general transformations from exponential-time exact algorithms to approximations that are faster but still exponential-time. For example, we show that for any reduction rate r, one can transform any O*(c(n))-time(1) algorithm for SET COVER into a (1 + lnr)-approximation algorithm running in time O*(C(n/r)). We believe that results of that kind extend the applicability of exact algorithms for NP-hard problems. (C) 2009 Elsevier B.V. All rights reserved.

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

exponential-time algorithms
approximation algorithms
set-cover
instance reduction
trade-off


Optimal trading of an asset in the open market: A dynamic programming approach Assuming that the asking price of an asset is a random observation from a. known distribution function, we first consider the problem of buying an asset and selling it later within a limited period of time. The optimal strategies, derived by means of a stochastic dynamic programming technique, maximize the present value of the expected profit. We then consider the infinite-stage model where there a no time constraint. As a special case of the optimal selling strategy with finite stages, we also propose an option valuation model for the case where the buyer has the right to purchase a certain asset at a specified exercise price within a specified time. The optimal buying and selling strategies derived in the paper can be extended to various directions such as the serially correlated process and the rank-based trading strategy.

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


Gerris: a tree-based adaptive solver for the incompressible Euler equations in complex geometries An adaptive mesh projection method for the time-dependent incompressible Euler equations is presented. The domain is spatially discretised using quad/octrees and a multilevel Poisson solver is used to obtain the pressure. Complex solid boundaries are represented using a volume-of-fluid approach. Second-order convergence in space and time is demonstrated on regular, statically and dynamically refined grids. The quad/octree discretisation proves to be very flexible and allows accurate and efficient tracking of flow features. The source code of the method implementation is freely available.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 cascade evolutionary algorithm for the bodyguard allocation problem This paper address the bodyguard allocation problem (BAP) through an evolutionary approach. The paper proposes a two-stage cascade evolutionary algorithm that outperforms the state-of-the-art algorithm, known as CBAP, for this problem. The paper presents the computational experiments of the evaluation of both algorithms.

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

bodyguard allocation problem
evolutionary algorithm


Set-theoretical Constructions of Boolean Functions and theirs Applications in Logic Synthesis In this paper a creation of new numerical set-theoretical constructions of Boolean functions with their properties has been presented. The parted conjuncterms and decomposition clones which can be used for realization of different optimization logic synthesis of digital devices and systems have been proposed. Set theoretical operations and procedures with these constructions have been considered. Examples which illustrate simplicity of their practical realization have been presented. Moreover, the paper includes the comparison of new results obtained on the basis of the proposed approach with the results obtained by means of commercial software Quartus II of Altera.

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

boolean function
set-theoretical constructions
parted conjuncterm
decomposition clone


Probabilistic BPRRC: Robust Change Detection against Illumination Changes and Background Movements This paper presents Probabilistic Bi-polar Radial Reach Correlation (PrBPRRC), a change detection method that is robust against illumination changes and background movements. Most of the traditional change detection methods are robust against either illumination changes or background movements; BPRRC is one of the illumination-robust change detection methods. We introduce a probabilistic background texture model into BPRRC and add the robustness against background movements including foreground invasions such as moving cars, walking people, swaying trees, and falling snow. We show the superiority of PrBPRRC in the environment with illumination changes and background movements by using three public datasets and one private dataset: ATON Highway data, Karlsruhe traffic sequence data. PETS 2007 data, and Walking-in-a-room data.

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

change detection
probabilistic bprrc
robust
illumination changes
background movements


Coauthorship dynamics and knowledge capital: The patterns of cross-disciplinary collaboration in information systems research From the social network perspective, this study explores the ontological structure of knowledge sharing activities engaged in by researchers in the field of information systems (IS) over the past three decades. We construct a knowledge network based on coauthorship patterns extracted from four major journals in the IS field in order to analyze the distinctive characteristics of each subfield and to assess the amount of internal and external knowledge exchange that has taken place among IS researchers. This study also tests the role of different types of social capital that influence the academic impact of researchers. Our results indicate that the proportion of coauthored IS articles in the four journals has doubled over the past 25 years, from merely 40 percent in 1978 to over 80 percent in 2002. However, a significant variation exists in terms of the shape, density, and centralization of knowledge exchange networks across the four subfields of IS - namely, behavioral science, organizational science, computer science, and economic science. For example, the behavioral science subgroup, in terms of internal cohesion among researchers, tends to develop the most dense collaborative relationships, whereas the computer science subgroup is the most fragmented. Moreover, external collaboration across these subfields appears to be limited and severely unbalanced. Across the four subfields, on average, less than 20 percent of the research collaboration ties involved researchers from different subdisciplines. Finally, the regression analysis reveals that knowledge capital derived from a network rich in structural holes has a positive influence on an individual researcher's academic performance.

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

coauthorship patterns
knowledge capital
structural holes

ontology of is research
research impact
social networks
ssic index


Approximating the chromatic index of multigraphs It is well known that if G is a multigraph then chi ' (G) >= chi '*(G) := max {Delta(G), Gamma(G)}, where chi '(G) is the chromatic index of G, chi '*(G) is the fractional chromatic index of G, Delta(G) is the maximum degree of G, and Gamma (G) = max{2 vertical bar E(G[U])vertical bar /(vertical bar U vertical bar - 1) : U subset of V (G), vertical bar U vertical bar >= 3, vertical bar U vertical bar is odd}. The conjecture that chi ' (G) 0 there exists D > 0 such that chi ' (G) D. Nishizeki and Kashiwagi proved this conjecture for multigraphs G with chi' (G) > left perpendicular(11 Delta(G) + 8) /10right perpendicular; and Scheide recently improved this bound to chi ' (G) > left perpendicular(15 Delta(G) + 12) / 14right perpendicular. We prove this conjecture for multigraphs G with chi ' (G) > left perpendicular Delta (G) + root Delta(G) / 2right perpendicular, improving the above mentioned results. As a consequence, for multigraphs G with chi ' (G) > Delta (G) + root Delta (G)/2 the answer to a 1964 problem of Vizing is in the affirmative.

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

edge coloring
fractional chromatic index


an evaluation of negative selection algorithm with constraint-based detectors The Negative Selection Algorithm is an immunology-inspired algorithm for anomaly detection application. This algorithm has been implemented with different pattern representations and various matching rules and successfully applied to a broad range of problems. Recent research shows serious problems with this algorithm in terms of both efficiency and effectiveness. In this paper we evaluated the performance of the algorithm constraint-based representation. We argue that the algorithm and problem representations should be considered separately, and that best performance of the algorithm may be obtained by choosing a proper representation.

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


qos based handoff for cdma2000-wlan interworking The interworking of CDMA2000 and WLAN networks has recently become a hot issue. Mobile nodes with multiple interfaces also look promising. However, provision of seamless handoff between heterogeneous networks with QoS guarantee remains a challenge. In this paper we propose a solution for smart seamless handoff with QoS guarantee for CDMA2000 and WLAN interworking. In our proposal, mobile nodes conduct the QoS negotiation with the new network during handoff. Based on the results, on QoS requirements of current sessions and on local policies, mobile nodes could transfer selected sessions to the new interface. Decisions are notified to the network side by mobile IP registration request messages

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

wlan interworking
mobile ip
seamless handoff
qos


Efficient Internet Access Framework for Mobile Ad Hoc Networks The development of the Internet services and applications and the trend in the fourth generation (4G) wireless networks to all-IP networks have led to a growing demand for enabling Mobile Ad hoc NETworks (MANETs) to connect to the Internet and achieving the goal of omnipresence Internet which is accessible anytime and anywhere. However, such integration gives rise to a number of challenges. In this paper, an efficient framework which has considered six main challenges encountered in the MANETInternet integration is proposed. An adaptive distributed multipath internet gateways discovery protocol is proposed, where the gateways advertise their information dynamically to an adaptive limited number of mobile nodes. For mobile nodes that cannot receive this information, an efficient dynamic routing algorithm for MANETsInternet integration derived from the ant colony optimization algorithms is proposed. In addition, an improved Quality of Services based gateway selection mechanism providing load-balancing is proposed. The simulation study confirms that the proposed framework is scalable and able to cope with changes on the number and mobility of active sources connecting to the Internet and outperforms other conventional approaches in terms of end-to-end delay, packet delivery ratio while attaining acceptable overhead and fair load distribution among all gateways.

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

ant colony optimization
manetinternet integration


Fast Cost-Volume Filtering for Visual Correspondence and Beyond Many computer vision tasks can be formulated as labeling problems. The desired solution is often a spatially smooth labeling where label transitions are aligned with color edges of the input image. We show that such solutions can be efficiently achieved by smoothing the label costs with a very fast edge-preserving filter. In this paper, we propose a generic and simple framework comprising three steps: 1) constructing a cost volume, 2) fast cost volume filtering, and 3) Winner-Takes-All label selection. Our main contribution is to show that with such a simple framework state-of-the-art results can be achieved for several computer vision applications. In particular, we achieve 1) disparity maps in real time whose quality exceeds those of all other fast (local) approaches on the Middlebury stereo benchmark, and 2) optical flow fields which contain very fine structures as well as large displacements. To demonstrate robustness, the few parameters of our framework are set to nearly identical values for both applications. Also, competitive results for interactive image segmentation are presented. With this work, we hope to inspire other researchers to leverage this framework to other application areas.

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

optical flow
interactive image segmentation


applicability issues of the real-valued negative selection algorithms The paper examines various applicability issues of the negative selection algorithms (NSA). Recently, concerns were raised on the use of NSAs, especially those using real-valued representation. In this paper, we argued that many reported issues are either due to improper usage of the method or general difficulties which are not specific to negative selection algorithms. On the contrary, the experiments with synthetic data and well-known real-world data show that NSAs have great flexibility to balance between efficiency and robustness, and to accommodate domain-oriented elements in the method, e.g. various distance measures. It is to be noted that all methods are not suitable for all datasets and data representation plays a major role.

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


shoe-shaped interface for inducing a walking cycle We propose a shoe-shaped interface designed to induce a specific walking cycle, and investigate stimulation techniques for effective induction of the walking cycle. The proposed interface is useful for walking navigation system, which enables the wearer's locomotion without paying attention to surrounding circumstances. The interface consists of a vibration motor for stimulation and pressure sensors for measuring walking cycle. Using sensory-motor synchronization of human body, this interface can induce a walking cycle effectively without mechanical constraint. The results of our experiments indicate that vibration stimuli at heel grounding timing enable effective induction and that wearers can smoothly shift their walking cycles to the indicated cycle, if the shift of the stimulation cycle is within the range of -100 and +150 ms from their walking cycle.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 hybridized finite element method for the Stokes problem A locally conservative hybridized finite element method for Stokes equations is presented and analyzed. The hybridized approach reduces a lot of degrees of freedom, especially for pressure approximation. In our approach the pressure is determined locally up to a constant, therefore, the global stiffness system contains only the average of pressure variable on each cell as unknowns.

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


Railway operating procedures: regulating a safety-critical enterprise Most railway systems throughout the world base the safety of their operation on strict regulation through (standard) operating procedures. The drawing up of those as well as their effect on the overall efficiency and safety of the system can be greatly enhanced by viewing the railway as an enterprise and the operating procedures as a model enacted by human resources. The paper examines the characteristics of those models and gives examples based on the author's experience in Attiko Metro, the new Athens metro system, currently under construction. (C) 1999 Elsevier Science B.V. All rights reserved.

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

enterprise models
regulated enterprises
business processes
metro systems operations
rulebooks


Multiple criteria linear regression The unknown parameters in multiple linear regression models may be estimated using any one of a number of criteria such as the minimization of the sum of squared errors MSSE, the minimization of the sum of absolute errors MSAE, and the minimization of the maximum absolute error MMAE. At present, the MSSE or the least squares criterion continues to be the most popular. However, at times the choice of a criterion is not clear from statistical, practical or other considerations. Under such circumstances, it may be more appropriate to use multiple criteria rather than a single criterion to estimate the unknown parameters in a multiple linear regression model. We motivate the use of multiple criteria estimation in linear regression models with an example, propose a few models, and outline a solution procedure.

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

minimum sum of absolute errors regression


towards a theory model for product search With the growing pervasiveness of the Internet, online search for products and services is constantly increasing. Most product search engines are based on adaptations of theoretical models devised for information retrieval. However, the decision mechanism that underlies the process of buying a product is different than the process of locating relevant documents or objects . We propose a theory model for product search based on expected utility theory from economics. Specifically, we propose a ranking technique in which we rank highest the products that generate the highest surplus , after the purchase. In a sense, the top ranked products are the " best value for money " for a specific user. Our approach builds on research on "demand estimation" from economics and presents a solid theoretical foundation on which further research can build on. We build algorithms that take into account consumer demographics, heterogeneity of consumer preferences, and also account for the varying price of the products. We show how to achieve this without knowing the demographics or purchasing histories of individual consumers but by using aggregate demand data. We evaluate our work, by applying the techniques on hotel search. Our extensive user studies, using more than 15,000 user-provided ranking comparisons, demonstrate an overwhelming preference for the rankings generated by our techniques, compared to a large number of existing strong state-of-the-art baselines.

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

product search
utility theory
ranking
economics

user-generated content
consumer surplus
text mining


Data-driven grasp synthesis using shape matching and task-based pruning Human grasps, especially whole-hand grasps, are difficult to animate because of the high number of degrees of freedom of the hand and the need for the hand to conform naturally to the object surface. Captured human motion data provides us with a rich source of examples of natural grasps. However, for each new object, we are faced with the problem of selecting the best grasp from the database and adapting it to that object. This paper presents a data-driven approach to grasp synthesis. We begin with a database of captured human grasps. To identify candidate grasps for a new object, we introduce a novel shape matching algorithm that matches hand shape to object shape by identifying collections of features having similar relative placements and surface normals. This step returns many grasp candidates, which Eire clustered and pruned by choosing the grasp best suited for the intended task. For pruning undesirable grasps, we develop an anatomically-based grasp quality measure specific to the human hand. Examples of grasp synthesis are shown for a variety of objects not present in the original database. This algorithm should be useful both as an animator tool for posing the hand and for automatic grasp synthesis in virtual environments.

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

grasp synthesis
shape matching
grasp quality


Study of DNA base-Li doped SiC nanotubes in aqueous solutions: a computer simulation study Due to the importance of soluble nanotubes in biological systems, computational research on DNA base functionalized nanotubes is of interest. This study presents the quantitative results of Monte Carlo simulations of Li-doped silicon carbide nanotubes and its nucleic acid base complexes in water. Each species was first modeled by quantum mechanical calculations and then Monte Carlo simulations were applied to study their properties in aqueous solution. Solvation free energies were computed to indicate the solvation behavior of these compounds. The computations show that solvation free energies of the complexes of DNA bases with Li-doped SiC nanotubes are in the order: thymine > cytosine > adenine > guanine. The results of complexation free energies were also used to study the stability of related structures, which indicate that thymine-Li-doped SiC nanotubes produce the most stable compound among the four DNA base complexes.

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

monte carlo simulations
solvation
dna base


Developing an early warning system to predict currency crises This study proposes an early warning system (EWS) to predict currency crises. The case study is exemplified via Turkish economy. The results are very promising in terms of high prediction accuracy. The proposed EWS is a generic approach and therefore can be used in other economies. Leading factors for financial crises were ranked via a novel method.

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

currency crisis
perfect signal
artificial neural networks (ann)
decision tree
logistic regression


real-time communication over switched ethernet for military applications Full-Duplex Switched Ethernet is a forecasted new technology for advanced military aircraft system interconnection. However, it was not originally developed to meet the requirements of real-time communications. Therefore, in this paper, we analyze traffic shaping and a priority handling approach over switched Ethernet to achieve reliable transmission with bounded delays that conform to the real-time constraints, required by military applications.

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

full-duplex switched ethernet
delay bounds


Molecular dynamics simulations with many-body potentials on multiple GPUsThe implementation, package and performance Molecular dynamics (MD) is an important research tool extensively applied in materials science. Running MD on a graphics processing unit (GPU) is an attractive new approach for accelerating MD simulations. Currently, GPU implementations of MD usually run in a one-host-process-one-GPU (OHPOG) scheme. This scheme may pose a limitation on the system size that an implementation can handle due to the small device memory relative to the host memory. In this paper, we present a one-host-process-multiple-GPU (OHPMG) implementation of MD with embedded-atom-model or semi-empirical tight-binding many-body potentials. Because more device memory is available in an OHPMG process, the system size that can be handled is increased to a few million or more atoms. In comparison with the serial CPU implementation, in which Newtons third law is applied to improve the computational efficiency, our OHPMG implementation has achieved a 28.9x86.0x speedup in double precision, depending on the system size, the cut-off ranges and the number of GPUs. The implementation can also handle a group of small simulation boxes in one run by combining the small boxes into a large box. This approach greatly improves the GPU computing efficiency when a large number of MD simulations for small boxes are needed for statistical purposes.

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

cuda
semi-empirical tight-binding
embedded-atom-model


multimedia document authoring based on identification and filling of recurrent structures The increasing demand for multimedia applications, such as imprint Interactive Digital TV, requires mechanisms to reduce development time of new applications. One of ways to reduce this time is to use the author-oriented archetypes as a basis for rapid construction of applications. Such archetypes are incomplete documents consisting of gaps, shares that are subject to change editable by the author of a new application. This paper proposes a declarative scheme annotations in multimedia documents to identify structures and facilitate applicants to fill the gaps. An archetypes processor was implemented to allow generating an instance of an archetype based on data provided by the author.

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

ncl
documentos multim&iacute
dia
arqu&eacute
tipos


Energy-efficient Joint Control of Epidemic Routing in Delay Tolerant Networks Due to the uncertain of connections in Delay Tolerant Networks (DTNs), most routing algorithms in DTNs need nodes to forward the message to others based on the opportunistic contact. The contact is related with the beaconing rate. In particular, nodes have more chances to encounter with each other with bigger beaconing rate, but more energy will be used. On the other hand, if the nodes forward the message to every node all the time, the efficiency of the routing algorithm is better, but it needs more energy, too. This paper tries to exploit the optimal beaconing rate and forwarding rate when the total energy is constraint. First, a theoretical framework is proposed, which can be used to evaluate the performance with different forwarding rate and beaconing rate. Then, this paper formulates a joint optimization problem based on the framework. Through Pontryagin's Maximal Principle, this paper obtains the optimal policy and proves that both the optimal forwarding and beaconing rates conform to threshold form. Simulation results show the accuracy of the theoretical framework. Extensive numerical results show that the optimal policy obtained in this paper is the best.

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

delay tolerant networks
joint control
epidemic routing


New developments with design and construction of a thermal/vacuum qualified photogrammetric system In the frame of the development of a photogrammetric system to be used in thermal/vacuum chambers at the European Space Research and Technology Centre (ESTEC) of European Space Agency (ESA) and other sites across Europe, the design of a network using micro-cameras was specified by ESA-ESTEC. A thermal/vacuum qualified photogrammetric system, which is able to work and acquire images in vacuum and at cryo-temperatures, was constructed by ESA-ESTEC Test Centre Division. The current system uses four space qualified one-mega pixel cameras and is able to measure large space structures in vacuum and at temperatures down to ?170?C with a global accuracy better than 1 part per 100,000 in object space. Several tests aiming at the qualification of the sensors and system in terms of operation and accuracy have been carried out. Special measures have been developed and special attention has been taken into account specifically for the first application of the photogrammetric system. It is to verify the ESAs Herschel Telescope Flight Model alignment positioning.

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


Prediction of enantiomeric selectivity in chromatography: Application of conformation-dependent and conformation-independent descriptors of molecular chirality In order to process molecular chirality by computational methods and to obtain predictions for properties that are influenced by chirality, a fixed-length conformation-dependent chirality code is introduced. The code consists of a set of molecular descriptors representing the chirality of a 3D molecular structure. It includes information about molecular geometry and atomic properties, and can distinguish between enantiomers, even if chirality does not result from chiral centers. The new molecular transform was applied to two datasets of chiral compounds, each of them containing pairs of enantiomers that had been separated by chiral chromatography. The elution order within each pair of isomers was predicted by means of Kohonen neural networks (NN) using the chirality codes as input. A previously described conformation-independent chirality code was also applied and the results were compared. In both applications clustering of the two classes of enantiomers (first eluted and last eluted enantiomers) could be successfully achieved by NN and accurate predictions could be obtained for independent test sets. The chirality code described here has a potential for a broad range of applications from stereoselective reactions to analytical chemistry and to the study of biological activity of chiral compounds.

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

chirality
molecular descriptors
chiral chromatography
neural networks

enantioselectivity
hplc
chirality code
conformation
structureproperty relationships


Using weighted scan enable signals to improve test effectiveness of scan-based BIST The conventional test-per-scan built-in self-test (BIST) scheme needs a number of shift cycles followed by one capture cycle. Fault effects received by the scan flip-flops are shifted out while shifting in the next test vector, like scan testing. Unlike deterministic testing, it is unnecessary to apply a complete test vector to the scan chains. A new scan-based BIST scheme is proposed by properly controlling the scan enable signals of the scan chains. Different weighted values are assigned to the scan enable signals of scan flip-flops in separate scan chains. Capture cycles can be inserted at any clock cycle if necessary. A new testability estimation procedure according to the proposed testing scheme is presented. A greedy procedure is proposed to select a weight for each scan chain. Experimental results show that the proposed method can improve test effectiveness of scan-based BIST greatly and most circuits can obtain complete fault coverage or very close to complete fault coverage.

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

random testability
scan-based bist
scan enable signal
weighted random testing


A 10 bit current-mode CMOS A/D converter with a current predictor and a modular current reference This paper describes a 10 bit CMOS current-mode A/D converter with a current predictor and a modular current reference circuit. A current predictor and a modular current reference circuit are employed to reduce the number of comparator and reference current mirrors and consequently to decrease a power dissipation. The 10 bit current-mode A/D converter is fabricated by the 0.6 mu m n-well double poly/triple metal CMOS technology. The measurement results show the input current range of 16 mu A to 528 mu A, DNL and INL of +/-0.5 LSB and +/-1.0 LSB, conversion rate of 10 Msamples, and power dissipation of 94.4mW with a power supply of 5 V. The effective chip area excluding the pads is 1.8 mm x 2.4 mm.

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

current predictor
modular current reference circuit


Permuting Streaming Data Using RAMs This article presents a method for constructing hardware structures that perform a fixed permutation on streaming data. The method applies to permutations that can be represented as linear mappings on the bit-level representation of the data locations. This subclass includes many important permutations such as stride permutations (corner turn, perfect shuffle, etc.), the bit reversal, the Hadamard reordering, and the Gray code reordering. The datapath for performing the streaming permutation consists of several independent banks of memory and two interconnection networks. These structures are built for a given streaming width (i.e., number of inputs and outputs per cycle) and operate at full throughput for this streaming width. We provide an algorithm that completely specifies the datapath and control logic given the desired permutation and streaming width. Further, we provide lower bounds on the achievable cost of a solution and show that for an important subclass of permutations our solution is optimal. We apply our algorithm to derive datapaths for several important permutations, including a detailed example that carefully illustrates each aspect of the design process. Lastly, we compare our permutation structures to those of Jarvinen et al. [2004], which are specialized for stride permutations.

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

algorithms
theory
performance
ram
streaming datapath
stride permutation
matrix transposition
data reordering
linear bit mapping
connection network
switch


Layered manufacturing of surfaces with open contours using localized wall thickening Sheet surfaces are commonly used in design to represent thin-walled surfaces. A method of manufacturing these surfaces via layered manufacturing (LM) using local wall thickening is presented. By considering the accuracy of only one side of the surface important, the need for support structured can be removed by thickened regions on the unimportant side. This preserves the accuracy of the accurate side while reducing the total material used and build time during manufacture. A method of selecting an orientation to maximize the accuracy of the important side while minimizing the amount of wall thickening is presented. Also, algorithms for locally thickening the surface and generating slices for manufacturing on a LM machine are developed. Finally, several examples are manufactured using the proposed method to compare material and build time savings over conventional support methods.

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

layered manufacturing of surfaces
open contours
localized wall thickening


Development of an adaptive Discontinuous-Galerkin finite element method for advectionreaction equations This paper presents an adaptive Discontinuous-Galerkin finite element method to solve linear advectionreaction equations. The method was developed for the prediction of hemolysis in prosthetic devices, where the flow may include recirculation zones. To ensure the well-posedness of the problem, we solve the transient form of the PDE. Time discretization is achieved with an implicit Euler scheme in order to obtain the steady-state solution rapidly. Linear interpolation functions are used to approximate the hemolysis field. The a posteriori estimation of the error is obtained by solving an advectionreaction equation for the error, which is approximated with quadratic interpolation functions. Then, elementary estimations of the error are computed using a semi-norm developed to achieve the best possible results, even in the presence of recirculation. Code verification to assess the convergence and conservation properties of the method is performed with the method of manufactured solutions and with a conservation test using a sharp gaussian function as a reaction term. Excellent results are obtained in both cases. Predictions of hemolysis in a dialysis cannula are presented as an engineering application of our method.

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

advectionreaction
finite element
recirculation zones
verification

galerkin discontinuous
adaptive remeshing
error norm
asymptotic convergence


A recursive padding technique on nondeterministic cellular automata We present a tight time-hierarchy theorem for nondeterministic cellular automata by using a recursive padding argument. It is shown that, if t(2)(n) is a time-constructible function and t2(n) grows faster than t(1)(n + 1), then there exists a language which can be accepted by a t(2)(n)-time nondeterministic cellular automaton but not by any t(1)(n)-time nondeterministic cellular automaton.

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

computational complexity
hierarchy theorem


Colorless Two Different Gigabit Data Access Transmissions Using Optical Double Sideband Suppressed Carrier and Optical Sideband Slicing A wavelength division multiplexed (WDM) radio over fiber access network architecture, capable of simultaneously transmitting both 63 GHz wireless and 2.5 Gb/s wired data, is proposed in this paper. An optical carrier suppression effect and multiplexing of a 50 GHz spaced arrayed waveguide grating are employed to generate a 63 GHz millimeter-wave signal based on WDM. These techniques allow the proposed scheme to simultaneously transmit both wireless and wired data. For full colorless operation, a reflective semiconductor optical amplifier is used at the central office and base station. Error-free simultaneous transmissions [wired data: bit error rate (BER) of 10(-12), wireless data: BER of 10(-9)] of 2.5 Gb/s wired data and 1.25 Gb/s wireless data are achieved. Various impacts of the downlink transmission on the performance of uplink data are investigated with the proposed scheme.

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

optical carrier suppression
radio over fiber

millimeter-wave
wavelength division multiplexing


Robust profile verification scheme based on ear reference coordinate system In this paper, a novel profile verification scheme based on the ear, contour lines and feature points from head profile images is proposed. From the side image of a human head taken by a CCD camera, the contour line of the image is extracted by the simple filling method and morphological filtering. Based on the reference coordinate set by using ear images enrolled in the database a priori, the features of the contour line such as the tip of the nose, bottom of the nose, eye point and so on are extracted. The contour of the given image is divided into segments by utilizing the extracted feature points. The directional code of each segment is proposed and the length of the segment is computed for generating the feature vector. The verification of the given profile is performed by matching these feature vectors with those of the enrolled database. The experimental results show validity of the developed method for feature extraction and profile verification.

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


exploiting the tradeoff between fast wakeup and long standby in event-monitoring wsn In an event-monitoring wireless sensor network (WSN), the sensors must be waked up fast to engage in active and high-rate sensing when events of interest occur. However, to prolong the lifetime of the network, the sensors should be put into the standby mode as long as possible. There is thus a tradeoff between the standby duration and the wakeup latency. Though the tradeoff is important, what is more important is a flexible transmission schedule that allows the tradeoff to be exploited. In this research, we use debris flow monitoring as a case study to illustrate how the tradeoff between long standby and fast wakeup can be exploited systematically with a flexible transmission schedule.

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

duty cycle
wireless sensor networks
response time
low power
standby time


Ontological functional modeling of technology for reusability Technology reuse is important in that it dramatically reduces lead-time, efforts and costs in R&D activities coping with market drivers. In this perspective, understanding technologies from a functional viewpoint helps us search reusable technologies from various technology domains and reuse them. Function is the concept to abstract intention and ways of a technology from a technological standpoint, and reusable function as the core function is representative of the technology. Functional model which formalizes function is represented as an affecting action and one or more affected objects. If technologies and their reusable functional models are stored together in a knowledge base, it is possible to develop a foundation of the environment that allows us to find out reusable technologies by function-based search without regard to technology domains. In this environment, therefore, identifying reusable functionalities from a technology and representing their meanings clearly are the basis to stimulate technology reuse. As a part of constructing the environment for technology reuse, this paper suggests an ontological functional modeling methodology of technology which is composed of a procedure for extracting reusable functionalities and a WordNet-based representation to define ontological functional models. (C) 2011 Elsevier Ltd. All rights reserved.

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

functional models
ontological functional modeling
technology reuse


field evaluation of a protocol for data transmission through the distribution lines of the low voltage grid The main characteristics of "PowerBus" 1 , a protocol for data transmission over the power lines in a low voltage distribution grid, are described. They were verified through the field evaluation of a small master/slave network applied to the reading of meters of the electrical power consumption. Some conclusions and results, framed in the context of automatic reading of meters "AMR", are settled down. Se describen las principales caractersticas del protocolo "PowerBus" 1 , para transmisin de datos por las lneas de distribucin de baja tensin, verificadas a travs de la evaluacin de campo de una pequea red maestro/esclavo aplicada a la lectura de medidores del consumo de energa elctrica. Se establecen algunas conclusiones y resultados enmarcados en el contexto de lectura automtica de medidores "AMR".

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

power line carrier
automatic meter reading
plc
embedded system


A level set method for structural topology optimization and its applications The level set method for structural topology optimization has been proposed and studied recently, which is basically a steepest descent method by combining the shape sensitivity analysis with the HamiltonJacobi equation for moving the level-set function, for doing topology design of structures. The paper considers the multi-material and multi-constraint problems, and investigates the topology optimization algorithm by using the different material representation models, and broadens its application from stiff structure designs and compliant mechanism designs to material designs by a number of benchmark examples. Meanwhile in order to further improve computational efficiency and overcome the difficulty that the level set method cannot generate new material interfaces during the optimization process, the multi-material topological derivative analysis is incorporated into the level set method for topological optimization.

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

structure topology optimization
gradient projection
mean curvature flow


Ancient and new algorithms for load balancing in the l(p) norm We consider the on-line load balancing problem where there are in identical machines (servers) and a sequence of jobs. The jobs arrive one by one and should be assigned to one of the machines in an on-line fashion. The goal is to minimize the sum (over all machines) of the squares of the loads, instead of the traditional maximum load. We show that for the sum of the squares the greedy algorithm performs within 4/3 of the optimum, and no on-line algorithm achieves a better competitive ratio. Interestingly, we show that the performance of Greedy is not monotone in the number of machines. More specifically, the competitive ratio is 4/3 for any number of machines divisible by 3 but strictly less than 4/3 in all the other cases (although it approaches 4/3 for a large number of machines). To prove that Greedy is optimal, we show a lower bound of 4/3 for any algorithm for three machines. Surprisingly, we provide a new on-line algorithm that performs within 4/3 - delta of the optimum, for some fixed delta > 0, for any sufficiently large number of machines. This implies that the asymptotic competitive ratio of our new algorithm is strictly better than the competitive ratio of any possible on-line algorithm. Such phenomena is not known to occur for the classic maximum load problem. Minimizing the sum of the squares is equivalent to minimizing the load vector with respect to the l(2) norm. We extend our techniques and analyze the exact competitive ratio of Greedy with respect to the l(p) norm. This ratio turns out to be 2 - Theta((ln p)/p). We show that Greedy is optimal for two machines but design an algorithm whose asymptotic competitive ratio is better than the ratio of Greedy.

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


a tool and methodology for ac-stability analysis of continuous-time closed-loop systems Presented are a methodology and a DFII-based tool for AC-stability analysis of a wide variety of closed-loop continuous-time (operational amplifiers and other linear circuits). The methodology used allows for easy identification and diagnostics of ac-stability problems including not only main-loop effects but also local-instability loops in current mirrors, bias circuits and emitter or source followers without breaking the loop. The results of the analysis are easy to interpret. Estimated phase margin is readily available. Instability nodes and loops along with their respective oscillation frequencies are immediately identified and mapped to the existing circuit nodes thus offering significant advantages compared to traditional "black-box" methods of stability analysis (Transient Overshoot, Bode and Phase margin plots etc.). The tool for AC-Stability analysis is written in SKILL and is fully integrated in DFII environment. Its "push-button" graphical user interface (GUI) is easy to use and understand. The tool can be invoked directly from Composer schematic and does not require active Analog Artist session. The tool is not dependent on the use of a specific fabrication technology or Process Design Kit customization. It requires OCEAN, Spectre and Waveform calculator capabilities to run.

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

frequency instability
small-signal circuit stability
closed loop system stability
ac stability


A new hybrid approach for mining breast cancer pattern using discrete particle swarm optimization and statistical method Breast cancer is one of the leading causes of death among the women in many parts of the world. In 2007, approximately 178,480 women in the United States have been found to have invasive breast cancer. In this paper, we have developed an efficient hybrid data mining approach to separate from a population of patients who have and who do not have breast cancer. The proposed data mining approach has consists of two phases. In first phase, the statistical method will be used to pre-process the data which can eliminate the insignificant features. It can reduce the computational complexity and speed up the data mining process. In second phase, we proposed a new data mining methodology which based on the fundamental concept of the standard particle swarm optimization (PSO) namely discrete PSO. This phase aimed at creating a novel PSO in which each particle was coded in positive integer numbers and has a feasible system structure. Based on the obtained results, our proposed DPSO can improve the accuracy to 98.71%, sensitivity to 100% and specificity to 98.21%. When compared with the previous research, the proposed hybrid approach shows the improvement in both accuracy and robustness. According to the high quality of our research results, the proposed DPSO data mining algorithm can be used as the reference for making decision in hospital and provide the reference for the researchers. (C) 2008 Published by Elsevier Ltd.

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

breast cancer
statistical method
discrete particle swarm optimization


Efficient detection and resolution of OR deadlocks in distributed systems This paper proposes a distributed algorithm for resolving deadlocks under the OR request model. The algorithm builds a distributed spanning tree by propagating probes. An encoding scheme is devised to deduce the ancestordescendant relationship between tree nodes, so that the initiator of the algorithm collects only non-tree edge information to detect deadlock, whereas the current algorithms require all the edge information for deadlock detection. The proposed algorithm resolves all deadlocks reachable from the initiator. Its performance in terms of number of messages and execution time is better than or comparable to that of the existing algorithms. We further showed through analytic evaluation that the suggested algorithm substantially shortens deadlock detection time.

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

deadlock detection
distributed systems
or request model

distributed algorithms
knot detection
wait-for graph


Bioinspired sparse spectro-temporal representation of speech for robust classification ? In this work, a first approach to a robust phoneme recognition task by means of a biologically inspired feature extraction method is presented. The proposed technique provides an approximation to the speech signal representation at the auditory cortical level. It is based on an optimal dictionary of atoms, estimated from auditory spectrograms, and the Matching Pursuit algorithm to approximate the cortical activations. This provides a sparse coding with intrinsic noise robustness, which can be therefore exploited when using the system in adverse environments. The recognition task consisted in the classification of a set of 5 easily confused English phonemes, in both clean and noisy conditions. Multilayer perceptrons were trained as classifiers and the performance was compared to other classic and robust parameterizations: the auditory spectrogram, a probabilistic optimum filtering on Mel frequency cepstral coefficients and the perceptual linear prediction coefficients. Results showed a significant improvement in the recognition rate of clean and noisy phonemes by the cortical representation over these other parameterizations.

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

robust phoneme recognition
sparse coding

approximated auditory cortical representation


Prediction of protein binding to DNA in the presence of water-mediated hydrogen bonds We extend our previous analysis of binding specificity of DNA-protein complexes to complexes containing water-mediated bridges. Inclusion of water bridges between phosphate and base, phosphate and sugar, as well as proteins and DNA, improves the prediction of specificity; six data sets studied in this paper yield correct predictions for all base pairs that have two or more hydrogen-bonds. Beside massive computation, our approach relies highly on experimental data. After deriving protein structures from DNA-protein complexes in which coordinates were established by X-ray diffraction techniques, we analysed all possible DNA sequences to which these proteins might bind, ranking them in terms of Lennard-Jones potential for the optimal docking configuration. Our prediction algorithm rests on the following assumptions: (1) specificity comes mainly from direct hydrogen bonding; (2) electrostatic forces stabilise DNA-protein complexes and contribute only weakly to specificity since they occur at the charged phosphate groups; (3) Van der Waals forces and electrostatic interactions between positively charged groups on the protein and phosphates on DNA can be neglected as they contribute primarily to the free energy of stabilisation as opposed to specificity.

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


The large rotations theory of elasto-viscoplastic shells subjected to the dynamic and thermal loads In this paper, the problem of the elasto-viscoplastic dynamic and thermal behaviour of geometrically non-linear plates and shells is studied under the assumption of small strains and large rotations. The first-order shear deformation shell theory and the Chaboche constitutive viscoplastic model taking the temperature fields into account are used for computations. An effective procedure using the central difference method of solving the equations of motion is applied The trapezoidal method is used to integrate the constitutive viscoplastic law. A nine node isoparametric shell element has been utilised for the finite element algorithm. Finally, some examples are presented and compared with the results obtained by moderate rotation theory.

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


adapting appearance models of semantic concepts to particular videos via transductive learning The detection of high-level concepts in video data is an essential processing step of a video retrieval system. The meaning and the appearance of certain events or concepts are strongly related to contextual information. For example, the appearance of semantic concepts, such as e.g. entertainment or news anchors, is determined by the used editing layout which usually is typical for a certain broadcasting station. In recent years, supervised machine learning approaches have been extensively used to learn and detect high-level concepts in video shots. The class of semi-supervised learning methods incorporates unlabeled data in the learning process. Transductive learning is a subclass of semi-supervised learning: In the transductive setting, all training samples are labeled, but the unlabeled test samples are considered in the learning process as well. Up to now, transductive learning has not been applied for the purpose of video indexing and retrieval. In this paper, we propose transductive learning, realized by transductive support vector machines (TSVM), for the detection of those high-level concepts whose appearance is strongly related to a particular video. For each video and each concept, a transductive model is learned separately and adapted to the appearance of a specific concept in the particular test video. Experimental results on TRECVID 2005 video data demonstrate the feasibility of the proposed transductive learning approach for several high-level concepts.

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

semantic video retrieval
high-level features
semi-supervised learning
concept detection
transductive svm
context


A Monte Carlo evaluation of three methods to detect local dependence in binary data latent class models Binary data latent class analysis is a form of model-based clustering applied in a wide range of fields. A central assumption of this model is that of conditional independence of responses given latent class membership, often referred to as the local independence assumption. The results of latent class analysis may be severely biased when this crucial assumption is violated; investigating the degree to which bivariate relationships between observed variables fit this hypothesis therefore provides vital information. This article evaluates three methods of doing so. The first is the commonly applied method of referring the so-called bivariate residuals to a Chi-square distribution. We also introduce two alternative methods that are novel to the investigation of local dependence in latent class analysis: bootstrapping the bivariate residuals, and the asymptotic score test or modification index. Our Monte Carlo simulation indicates that the latter two methods perform adequately, while the first method does not perform as intended.

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

score test
modification index
bivariate residuals


A survey on interference management techniques in femtocell self-organizing networks The femtocell concept is an emerging technology for deploying the next generation of the wireless networks, aiming at indoor coverage enhancement, increasing capacity, and offloading the overlay macrocell traffic. Nevertheless, one of the most critical issues in femtocells is the potential interference between nearby femtocells and from femtocells to macrocells or to mobile handsets, thus mitigating the overall system capacity. In this paper, we have discussed mechanisms which can be deployed to lessen the interference and increase the user capacity. Therefore, we provide a survey on the different interference and resource management techniques in Self-Organizing Network according to specifics classification criteria. These techniques derive from the following approaches: power control, proper cell planning, frequency reuse, OFDMA, self-configuration and self-optimization, conventional TDD, etc. These techniques can be applied separately and can be used as hybrid. A qualitative comparison among the different approaches and techniques is provided at the end of this paper.

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


automatic load balanced paritioning strategies for pde computations In this paper we study the partitioning and allocation of computations associated with the numerical solution of partial differential equations (PDEs). Strategies for the mapping of such computations to parallel MIMD architectures can be applied to different levels of the solution process. We introduce and study heuristic approaches defined on the associated geometric data structures ( meshes ). Specifically, we study methods for decomposing finite element and finite difference meshes into balanced, nonoverlapping subdomains which guarantee minimum communication and synchronization among the underlying associated subcomputations. Two types of algorithms are considered: clustering techniques based on sequential orderings of the discrete geometric data and optimization based techniques involving geometric or graphical metric criteria. These algorithms support the automatic mode of a geometry decomposition tool developed in the parallel ELLPACK environment which is implemented under X11-window systems. A brief description of this tool is presented.

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

communication
geometry
synchronization
data structures
tool
paper
decomposition
strategies
systems
parallel
types
process
data
support
allocation
finite element

mesh order association metrication map graphics partition method environments optimality architecture windows heuristics algorithm cluster


Synthesizing mood-affected signed messages: Modifications to the parametric synthesis This paper describes the first approach in synthesizing mood-affected signed contents. The research focuses on the modifications applied to a parametric sign language synthesizer (based on phonetic descriptions of the signs). We propose some modifications that will allow for the synthesis of different perceived frames of mind within synthetic signed messages. Three of these proposals focus on modifications to three different signs' phonologic parameters (the hand shape, the movement and the non-hand parameter). The other two proposals focus on the temporal aspect of the synthesis (sign speed and transition duration) and the representation of muscular tension through inverse kinematics procedures. These resulting variations have been evaluated by Spanish deaf signers, who have concluded that our system can generate the same signed message with three different frames of mind, which are correctly identified by Spanish Sign Language signers.

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

sign language synthesis
frame of mind synthesis
graphical interface
deaf people


Global dynamics of an HIV-1 infection model with distributed intracellular delays In this paper, an HIV-1 infection model with distributed intracellular delays is investigated, where the intracellular delays account for the time the target cells are contacted by the virus particles and the time the contacted cells become actively infected meaning that the contacting virions enter cells and the time the virus has penetrated into a cell and the time the new virions are created within the cell and are released from the cell, respectively. By analyzing the characteristic equations, the local stability of an infection-free equilibrium and a chronic-infection equilibrium of the model is established. By using suitable Lyapunov functionals and LaSalles invariance principle, it is proved that if the basic reproduction ratio is less than unity, the infection-free equilibrium is globally asymptotically stable; and if the basic reproduction ratio is greater than unity, the chronic-infection equilibrium is globally asymptotically stable.

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


Distributed anonymous mobile robots: Formation of geometric patterns (vol 28, pg 1347, 1999) In this note we make a minor correction to a scheme for robots to broadcast their private information. All major results of the paper [ I. Suzuki and M. Yamashita, SIAM J. Comput., 28 ( 1999), pp. 1347 - 1363] hold with this correction.

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


Tissue deformation and shape models in image-guided interventions: a discussion paper This paper promotes the concept of active models in image-guided interventions. We outline the limitations of the rigid body assumption in image-guided interventions and describe how intraoperative imaging provides a rich source of information on spatial location of anatomical structures and therapy devices, allowing a preoperative plan to be updated during an intervention. Soft tissue deformation and variation from an atlas to a particular individual can both be determined using non-rigid registration. Established methods using free-form deformations have a very large number of degrees of freedom. Three examples of deformable models motion models, biomechanical models and statistical shape models are used to illustrate how prior information can be used to restrict the number of degrees of freedom of the registration algorithm and thus provide active models for image-guided interventions. We provide preliminary results from applications for each type of model.

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

image registration
statistical shape modeling
motion modeling
biomechanical modeling
image-guided interventions