Eliminating Read Barriers through Procrastination and Cleanliness Managed languages typically use read barriers to interpret forwarding pointers introduced to keep track of copied objects. For example, in a multicore environment with thread-local heaps and a global, shared heap, an object initially allocated on a local heap may be copied to a shared heap if it becomes the source of a store operation whose target location resides on the shared heap. As part of the copy operation, a forwarding pointer may be established in the original object to point to the copied object. This level of indirection avoids the need to update all of the references to the object that has been copied. In this paper, we consider the design of a managed runtime that eliminates read barriers. Our design is premised on the availability of a sufficient degree of concurrency to stall operations that would otherwise necessitate the copy. Stalled actions are deferred until the next local collection, avoiding exposing forwarding pointers to the mutator. In certain important cases, procrastination is unnecessary - lightweight runtime techniques can sometimes be used to allow objects to be eagerly copied when their set of incoming references is known, or when it can be determined that having multiple copies would not violate program semantics. We evaluate our techniques on 3 platforms: a 16-core AMD64 machine, a 48-core Intel SCC, and an 864-core Azul Vega 3. Experimental results over a range of parallel benchmarks indicate that our approach leads to notable performance gains (20 - 32% on average) without incurring any additional complexity.

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

algorithms
experimentation
management
measurement
barrier elimination
private heaps
parallel and concurrent collection
concurrent programming
functional languages


The connections between the frustrated chaos and the intermittency chaos in small Hopfield networks In a previous paper we introduced the notion of frustrated chaos occurring in Hopfield networks [Neural Networks 11 (1998) 1017]. It is a dynamical regime which appears in a network when the global structure is such that local connectivity patterns responsible for stable oscillatory behaviors are intertwined, leading to mutually competing attractors and unpredictable itinerancy among brief appearance of these attractors. Frustration destabilizes the network and provokes an erratic wavering among the orbits that characterize the same network when it is connected in a non-frustrated way. In this paper, through a detailed study of the bifurcation diagram given for some connection weights, we will show that this frustrated chaos belongs to the family of intermittency type of chaos, first described by Berge et al. [Order within chaos (1984)] and Pomeau and Manneville [Commun. Math. Phys. 74 (1980) 189]. Indeed, the transition to chaos is a critical one, and all along the bifurcation diagram, in any chaotic window, the duration of the intermittent cycles, between two chaotic bursts, grows as an invert ratio of the connection weight. Specific to this regime are the intermittent cycles easily identifiable as the non-frustrated regimes obtained by altering the values of these same connection weights. We will more specifically show that anywhere in the bifurcation diagram, a chaotic window always lies between two oscillatory regimes, and that the resulting chaos is a merging of, among others, the cycles at both ends. The strength (i.e. the duration of its oscillatory phase before the chaotic burst) of the first cycle decreases while the regime tends to stabilize into the second cycle (with the strength of this second cycle increasing) that will finally get the control. Since in our study, the bifurcation diagram concerns the same connection weights responsible for the learning mechanism of the Hopfield network, we will discuss the relations existing between bifurcation, learning and control of chaos. We will show that, in some cases, the addition of a slower Hebbian learning mechanism onto the Hopfield networks makes the resulting global dynamics to drive the network into a stable oscillatory regime, through a succession of intermittent and quasiperiodic regimes. Finally, we will present a series of possible logical steps to manually construct a frustrated network.

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

bifurcation diagram
intermittency
chaos
learning


Scaling the SIESTA magnetohydrodynamics equilibrium code We report the results of a scaling effort that increases both the speed and resolution of the SIESTA magnetohydrodynamics equilibrium code. SIESTA is capable of computing three-dimensional plasma equilibria with magnetic islands at high spatial resolutions for toroidally confined plasmas. Starting with a small-scale parallel implementation, we identified scale-dependent bottlenecks of the code and developed scalable alternatives for each performance-significant functionality, cumulatively improving both its runtime speed (on the same number of processors) and its scalability (across larger number of processors) by an order of magnitude. The net outcome is an improvement in speed by over 10-fold, utilizing a few thousand processors, enabling SIESTA to simulate high spatial-resolution scenarios in under an hour for the first time. Copyright (c) 2012 John Wiley & Sons, Ltd.

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


Reliability-based inspection optimization of complex structures: a brief retrospective This paper presents a brief retrospective of the development and application of reliability-based techniques for assessment of complex structures with emphasis on inspection optimization of offshore and bridge structures. An optimal reliability-based inspection program is the key to optimize the lifetime maintenance cost while maintaining the safety and serviceability of complex structures at acceptable levels. The experience of the two authors from the two different fields, of offshore structures, first author, and highway bridges, second author, is brought together in this paper, which examines the approaches adopted in each field, and the reasons which influenced the way the methods have been developed and applied. The similarities and differences between inspection optimizations for offshore and bridge structures are also discussed.

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

offshore structures
highway bridges
inspection
optimization


Influence of boundary conditions on the fraction of spanning clusters We use the Hoshen-Kopelman algorithm with the Nakanashi method of recycling redundant labels to measure the fraction of spanning configurations, R(p(c)), at and near p(c), for random site percolation in two and three dimensions with different boundary conditions. For the square and cubic lattices we find that R(p(c)) is 0.50 and 0.28 for free edges and 0.64 (2-d) and 0.56 (3-d) for both helical and periodic boundary conditions. The error bars are of the order of +/-0.01 for these results.

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

percolation
fraction of spanning configurations

hoshen-kopelman and nakanashi algorithms


Observing branching structure through probabilistic contexts Probabilistic automata (PAs) constitute a general framework for modeling and analyzing discrete event systems that exhibit both nondeterministic and probabilistic behavior, such as distributed algorithms and network protocols. The behavior of PAs is commonly defined using schedulers (also called adversaries or strategies), which resolve all nondeterministic choices based on past history. From the resulting purely probabilistic structures, trace distributions can be extracted, whose intent is to capture the observable behavior of a PA. However, when PAs are composed via an (asynchronous) parallel composition operator, a global scheduler may establish strong correlations between the behavior of system components and, for example, resolve nondeterministic choices in one PA based on the outcome of probabilistic choices in the other. It is well known that, as a result of this, the (linear-time) trace distribution precongruence is not compositional for PAs. In his 1995 Ph.D. thesis, Segala has shown that the (branching-time) probabilistic simulation preorder is compositional for PAs. In this paper, we establish that the simulation preorder is, in fact, the coarsest refinement of the trace distribution preorder that is compositional. We prove our characterization result by providing (1) a context of a given PA A, called the tester, which may announce the state of A to the outside world, and (2) a specific global scheduler, called the observer, which ensures that the state information that is announced is actually correct. Now when another PA B is composed with the tester, it may generate the same external behavior as the observer only when it is able to simulate A in the sense that whenever A goes to some state s, B can go to a corresponding state u, from which it may generate the same external behavior. Our result shows that probabilistic contexts together with global schedulers are able to exhibit the branching structure of PAs.

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

probabilistic automata
trace distributions
simulation preorder


Hypoxia Differently Modulates Gene Expression of Inositol 1,4,5-Trisphosphate Receptors in Mouse Kidney and HEK 293 Cell Line Hypoxia is a state of insufficient oxygen supply of the tissue or cell. Kidney tissue is highly sensitive to oxygen deprivation and easily develops renal ischemic injury. Calcium transporters very sensitively react to oxygen deficiency. We investigated whether hypoxia affects the gene expression of intracellular calcium transporters in the intact kidney, and we compared the response to that of HEK 293 cells. Our results showed that, while in mouse kidney tissue hypoxia elevates mRNA for inositol 1,4,5-trisphosphate receptors (IP3R) type 1 (IP3R1) and ryanodine receptors (RyR) type 2 (RyR2), in culture of HEK 293 cells the gene expression of all IP3Rs decreased without affecting viability of the cells. RyR2 mRNA in HEK 293 cells was not significantly changed, but RyR1 gene expression was significantly increased by hypoxia. The different response of kidney tissue and HEK 293 cells to hypoxia could be due to unequal differentiation state of the cells in intact tissue and cultured embryonic cell line. The physiological relevance of this observation remains to be determined.

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

kidney
hek 293 cell line
hypoxia
calcium transporters


A new taxonomy of conjugate gradient methods In this paper, a framework is proposed for conjugate gradient and conjugate direction algorithms based on an indefinite quadratic form. By the choice of the Hessian G of this form and of another arbitrary matrix K, no fewer than nineteen distinct cg algorithms may be succinctly defined. Four of these are believed to be new. The choice of certain other vectors leads either to a two-term or a three-term recurrence formula and it is shown that to every two-term formula there corresponds a three-term formula, although the converse is not generally true. The two matrices G and K also determine the stability characteristics of the two-term methods.

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

conjugate gradients
biconjugate gradients
biconjugate residuals
linear systems
lanczos methods
hegedus methods


A BSP Bareiss algorithm for Toeplitz systems In this paper, a BSP (bulk synchronous parallel) Bareiss algorithm for Toeplitz system is described. We investigate various data distribution and scheduling strategies for mapping a typical class of systolic array algorithms onto BSP machines. Load balance, both in communication and computation, as well as linear speedup have been achieved for the Toeplitz system solver and at the same time the minimum memory requirement is achieved. An implementation has been tested on Sun workstations, an SGI Power Challenge, and an IBM SP?, using the Oxford BSPlib (Hill et al., 1997. (C) 1999 Academic Press.

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

bulk synchronous parallel
bareiss algorithm
toeplitz system


Lengths of semigraphoid inferences A subset l of a semigraphoid K over n elements is constructed in such a way that starting from l it is necessary to apply semigraphoid axioms recursively 2(n-2)-1 times to arrive at K. This is first known example of exponentially long semigraphoid inference. A comparison is made between local and global inferences. Graphoids and their duals are discussed as well.

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

semigraphoids
inference length
regular graphs
edge-coloring


authorizations in relational database management systems This paper proposes two major extensions to the authorization model for System R relational database management system. The first extension concerns the revoke operation. The revised model provides for a new type of revoke operation, called noncascading revoke, in addition to the System R cascading revoke operation. Unlike cascading revoke, noncascading revoke operation does not recursively remove privileges from users. The second extension concerns negative authorization. The details related to its application are specified in the paper.

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

model
paper
systems
users
relational database
management


Neuro-fuzzy approach to processing inputs with missing values in pattern recognition problems An approach to dealing with missing data, both during the design and normal operation of a neuro-fuzzy classifier is presented in this paper. Missing values are processed within a general fuzzy min-max neural network architecture utilising hyperbox fuzzy sets as input data cluster prototypes. An emphasis is put on ways of quantifying the uncertainty which missing data might have caused. This takes a form of classification procedure whose primary objective is the reduction of a number of viable alternatives rather than attempting to produce one winning class without supporting evidence. If required, the ways of selecting the most probable class among the viable alternatives found during the primary classification step, which are based on utilising the data frequency information, are also proposed. The reliability of the classification and the completeness of information is communicated by producing upper and lower classification membership values similar in essence to plausibility and belief measures to be found in the theory of evidence or possibility and necessity values to be found in the fuzzy sets theory. Similarities and differences between the proposed method and various fuzzy, neuro-fuzzy and probabilistic algorithms are also discussed. A number of simulation results for well-known data sets are provided in order to illustrate the properties and performance of the proposed approach. (C) 2002 Elsevier Science Inc. All rights reserved.

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


Whats coming next? Epistemic curiosity and lurking behavior in online communities Prior research has repeatedly found that lurkers, the passive members of online communities, dominate such communities in terms of membership. Yet lurking in online communities reflects a phenomenon largely neglected by contemporary information systems theory and research. This study starts by reviewing existing literature on lurking behavior in online communities and identifies an unexplored opportunity related to the nature and origins of lurkers behavior, the individual propensity to de-lurk, and the dynamic interplay between lurking and de-lurking behavior. A theoretical process-based framework linking epistemic curiosity to lurking and de-lurking behavior in online communities is presented. This framework links prior academic work on epistemic curiosity as personality trait and emotionalmotivational state to lurkers contribution behavior in online communities. The article concludes by proposing that the psychology of curiosity in general holds great promise for research on online communities in information systems.

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

epistemic curiosity
online communities
lurking
contribution behavior


Anonymity and one-way authentication in key exchange protocols Key establishment is a crucial cryptographic primitive for building secure communication channels between two parties in a network. It has been studied extensively in theory and widely deployed in practice. In the research literature a typical protocol in the public-key setting aims for key secrecy and mutual authentication. However, there are many important practical scenarios where mutual authentication is undesirable, such as in anonymity networks like Tor, or is difficult to achieve due to insufficient public-key infrastructure at the user level, as is the case on the Internet today. In this work we are concerned with the scenario where two parties establish a private shared session key, but only one party authenticates to the other; in fact, the unauthenticated party may wish to have strong anonymity guarantees. We present a desirable set of security, authentication, and anonymity goals for this setting and develop a model which captures these properties. Our approach allows for clients to choose among different levels of authentication. We also describe an attack on a previous protocol of verlier and Syverson, and present a new, efficient key exchange protocol that provides one-way authentication and anonymity.

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

one-way authentication
tor network
security models


Numerical simulations of oblique penetration into reinforced concrete targets A dynamic constitutive model based on the tensile and the compressive damage models for concrete was developed and implemented into the three-dimensional finite element code, LS-DYNA. Numerical simulations of oblique penetration into reinforced concrete targets were performed using LS-DYNA. On the basis of the proposed model, the tensile and compressive damages of reinforced concrete after oblique penetration were observed and the deformation of reinforcing steel bars was obtained. Moreover, the depths of penetration for different oblique angles were obtained. The numerical results for the depth of penetration are in good agreement with existing experimental data.

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

dynamic damage model
numerical simulation


Hawks and Doves in a Dynamic Framework We revisit, in this paper, the well-studied Hawk and Dove game within a dynamic framework. A non-standard evolutionary game approach is taken, in which the starting point of the modeling is the dynamic evolution of the population as a function of the strategies used, instead of a fitness-based model (in which the fitness functions determine the evolution). This work is motivated by the discussion in the book of Thomas L. Vincent co-authored with J. Brown (Evolutionary game theory, natural selection and Darwinian dynamics) in which they raise (on p. 73) the puzzling question of whom should one consider to be the players: the individuals or the populations?

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


Pretty printing with lazy dequeues There are several purely functional libraries for converting tree structured data into indented text, but they all make use of some backtracking. Over twenty years ago, Oppen published a more efficient imperative implementation of a pretty printer. This article shows that the same efficiency is also obtainable without destructive updates by developing a similar but purely functional Haskell implementation with the same complexity bounds. At its heart lie two lazy double ended queues.

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


Integration of sensing and computing in an intelligent decision support system for homeland security defense We propose an intelligent decision support system based on sensor and computer networks that incorporates various component techniques for sensor deployment, data routing, distributed computing, and information fusion. The integrated system is deployed in a distributed environment composed of both wireless sensor networks for data collection and wired computer networks for data processing in support of homeland security defense. We present the system framework and formulate the analytical problems and develop approximate or exact solutions for the subtasks: (i) sensor deployment strategy based on a two-dimensional genetic algorithm to achieve maximum coverage with cost constraints; (ii) data routing scheme to achieve maximum signal strength with minimum path loss, high energy efficiency, and effective fault tolerance; (iii) network mapping method to assign computing modules to network nodes for high-performance distributed data processing; and (iv) binary decision fusion rule that derive threshold bounds to improve system hit rate and false alarm rate. These component solutions are implemented and evaluated through either experiments or simulations in various application scenarios. The extensive results demonstrate that these component solutions imbue the integrated system with the desirable and useful quality of intelligence in decision making.

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

intelligent decision support system
sensor deployment
data routing
distributed computing


Steam tables for pure water as an ActiveX component in Visual Basic 6.0 The IAPWS-95 formulation for the thermodynamic properties of pure water was implemented as an ActiveX component (SteamTables) in Visual Basic 6.0. For input parameters as temperature (T = 190-2000K) and pressure (P = 3.23 x 10(-8)-10,000 MPa) the program SteamTables calculates the following properties: volume (V), density (D), compressibility factor (Z(0)), internal energy (U), enthalpy (H), Gibbs free energy (G), Helmholtz free energy (A), entropy (S), heat capacity at constant pressure (C-p), heat capacity at constant volume (C-v), coefficient of thermal expansion (CTE), isothermal compressibility (Z(iso)), velocity of sound (VelS), partial derivative of P with T at constant V (dPdT), partial derivative of T with Vat constant P (dTdV), partial derivative of V with P at constant T (dVdP), Joule-Thomson coefficient (JTC), isothermal throttling coefficient (IJTC), viscosity (Vis), thermal conductivity (ThrmCond), surface tension (SurfTen), Prandtl number (PrdNum) and dielectric constant (DielCons) for the liquid and vapor phases of pure water. It also calculates T as a function of P (or P as a function of T) along the sublimation, saturation and critical isochor curves, depending on the values of P (or T). The SteamTables can be incorporated in a program in any computer language, which supports object link embedding (OLE) in the Windows environment. An application of SteamTables is illustrated in a program in Visual Basic 6.0 to tabulate the values of the thermodynamic properties of water and vapor. Similarly, four functions, Temperature(Press), Pressure(Temp), State(Temp, Press) and WtrStmTbls(Temp, Press, Nphs, Nprop), where Temp, Press, Nphs and Nprop are temperature, pressure, phase number and property number, respectively, are written in Visual Basic for Applications (VBA) to use the SteamTables in a workbook in MS-Excel. (C) 2003 Elsevier Ltd. All rights reserved.

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

pvt characteristics
object-oriented programming
visual basic 6.0
iapws-95 formulation
ms-excel


the research of government collaboration patterns based on the government information resource interchange framework This paper puts forward an information resource interchange framework which supports government collaboration. With the investigation of the government collaboration requirements in Beijing in the past five years, the authors established a generic information interchange framework. The framework has been reused in Beijing municipal government and its six subordinate governments. Through supporting over 80 inter-departmental affairs by the end of 2008, the authors explored 5 government collaboration patterns. The framework and patterns can be reused in the other government environments to resolve the government collaboration problems.

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

government collaboration
information interchange
information resource


Assimilation, dissimilation, and surface correspondence in Sundanese Much recent work has approached long-distance agreement effects using the notion of correspondence between surface segments, driven by relative phonological similarity. This theory of correspondence also has consequences for dissimilatory interactions. Sundanese exhibits a complex [r]?[l] alternation, which may arise by assimilation or dissimilation. This alternation is analyzed as the result of constraints on surface correspondence, which give rise to both assimilation and dissimilation in complementary distribution, with the choice between them determined by the structural configuration of the interacting liquids. Harmony occurs where surface correspondence between liquids is permitted; dissimilation occurs where such correspondence is prohibited. Dissimilation is argued to emerge from the interaction of constraints that require similar consonants to correspond, and constraints that limit this correspondence, rather than being an effect of anti-similarity constraints.

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

sundanese dissimilation assimilation correspondence

consonant harmony
long-distance agreement


An ExPosition of multivariate analysis with the singular value decomposition in R ? ExPosition is a new comprehensive R package providing crisp graphics and implementing multivariate analysis methods based on the singular value decomposition (svd). The core techniques implemented in ExPosition are: principal components analysis, (metric) multidimensional scaling, correspondence analysis, and several of their recent extensions such as barycentric discriminant analyses (e.g., discriminant correspondence analysis), multi-table analyses (e.g.,multiple factor analysis, Statis, and distatis), and non-parametric resampling techniques (e.g., permutation and bootstrap). Several examples highlight the major differences between ExPosition and similar packages. Finally, the future directions of ExPosition are discussed.

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

singular value decomposition
r
principal components analysis
correspondence analysis
bootstrap


Generalized processor sharing: Characterization of the admissible region and selection of optimal weights ? We consider a two-class Generalized Processor Sharing (GPS) queueing system, in which each class has its specific traffic characteristics and quality-of-service (QoS) requirements. Traffic of both classes is assumed to be Gaussian (a versatile family of models that covers both long-range dependent and short-range dependent traffic). In this paper we address the question how to select the GPS weight values. To do so, we first characterize the admissible region of the system for fixed weights. Then we obtain the realizable region by taking the union of the admissible regions over all possible weight values. The results indicate that, under a broad variety of traffic characteristics and QoS requirements, nearly the entire realizable region can be obtained by strict priority scheduling disciplines. In addition, we indicate how the buffer thresholds, QoS requirements and the traffic characteristics of the two classes determine which class should get high priority.

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

generalized processor sharing
priority scheduling
admissible region

gaussian traffic
loss probabilities
weight setting


C-CBPM: collective context based privacy model Existing research on developing privacy models, although seem persuasive, are essentially based on user, role or service identification. Such models are incapable of automatically adjusting privacy needs of consumers or organizations to the context in which the data is accessed. In this work we present a context based privacy model (CBPM) that leverages the context in which the information content is accessed. We introduce the concepts of donation and adoption for privacy configuration by extending CBPM to collective-CBPM (C-CBPM), bearing the analysis upon the notions of collective intelligence and trust computation. The efficacy of the proposed C-CBPM model is demonstrated by implementing it in various application domains such as, humanitarian assistance and disaster relief operations. CBPM is also implemented as a framework that assists in the comparison and extension of existing role or service based privacy and access control models.

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

context-based
role based
information flow
collective cbpm
community based
context aware privacy
collective wisdom
hadr
social media
crowdsourcing


Candidate one-way functions on non-supersingular elliptic curves This paper proposes new candidate one-way functions constructed with a certain type of endomorphisms on non-supersingular elliptic curves. We can show that the one-wayness of our proposed functions is equivalent to some special cases of the co-Diffie-Hellman assumption. Also a digital signature scheme is explicitly described using our proposed functions.

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

one-way function
pairing-based cryptosystem
distortion map
the weil and the tate pairings
co-diffie-hellman problem


Towards large-scale multi-socket, multicore parallel simulations: Performance of an MPI-only semiconductor device simulator ? This preliminary study considers the scaling and performance of a finite element (FE) semiconductor device simulator on a set of multi-socket, multicore architectures with nonuniform memory access (NUMA) compute nodes. These multicore architectures include two linux clusters with multicore processors: a quad-socket, quad-core AMD Opteron platform and a dual-socket, quad-core Intel Xeon Nehalem platform; and a dual-socket, six-core AMD Opteron workstation. These platforms have complex memory hierarchies that include local core-based cache, local socket-based memory, access to memory on the same mainboard from another socket, and then memory across network links to different nodes. The specific semiconductor device simulator used in this study employs a fully-coupled NewtonKrylov solver with domain decomposition and multilevel preconditioners. Scaling results presented include a large-scale problem of 100+ million unknowns on 4096 cores and a comparison with the Cray XT3/4 Red Storm capability platform. Although the MPI-only device simulator employed for this work can take advantage of all the cores of quad-core and six-core CPUs, the efficiency of the linear system solve is decreasing with increased core count and eventually a different programming paradigm will be needed.

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

multicore
multilevel preconditioners
newtonkrylov

multicore efficiency
mpi-only
driftdiffusion
semiconductor devices


On physical and numerical resonances for water wave problems using the dual boundary element method Scattering problems of water waves impinging on bottom-mounted vertical cylinders are solved by using the dual boundary element method (DBEM). Both resonances due to near-trapped mode (physics) and fictitious frequency (mathematics) are examined. It is found that the near-trapped mode is a physical phenomenon and the fictitious frequency stems from the numerical instability. A trapped mode is associated with a singularity that lies on the real axis of complex wave number. A near-trapped mode means a localized behavior that energy is trapped in a truncated periodical structure. Critical wave number for the near-trapped mode and fictitious frequency of numerical instability are detected in this work. Numerical oscillation of the resultant force near the fictitious frequency is also observed by using the DBEM. Fictitious frequencies depend on the formulation instead of the specified boundary condition. Both the Burton and Miller approach and the CHIEF method are employed to alleviate the problem of irregular frequencies. Highly rank-deficiency matrices for four identical cylinders are numerically examined and the rank is promoted by adding valid CHIEF constraints. Parameter study of spacing and radius of cylinders on the near-trapped mode and fictitious frequency is also addressed. Several examples of water wave interaction by circular and square cylinders are demonstrated to see the validity of the present formulation.

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

scattering
water wave
dual boundary element method
fictitious frequency


A guideline-based decision support for pharmacological treatment can improve the quality of hyperlipidemia management The Institute of Medicine has identified both Computerized Physician Order Entry (CPOE) and Electronic Prescription (EP) as key in reducing medication errors and improving safety. Many computerized clinical decision support systems (CDSSs) improve practitioner performance. However, the development of CDSSs involves a long cycle time that makes it difficult to apply in a wider scope. In this study, we integrated the hyperlipidemia treatment guideline ATP III (Adult Treatment Panel III) in a CPOE of a medical center. The first 200 consecutive patients followed up more than 1 year were recorded for analysis. Our study revealed that 130 (65%) patients reached the LDL-C (low density lipoprotein-cholesterol) goal in 1 year. For those who with CDSS finished, 74% reached the LDL-C goal. For those who with CDSS exited, 57% reached the LDL-C goal. The odds ratio is 2.1 (1.2, 3.8) (p=0.022), which means for those who with CDSS finished can have 2 times of chance to reach the LDL-C goal. The mean of days to attain the LDL-C goal level after initiation of antihyperlipidemia therapy was 17598 days. 11,806 prescribing records from 8023 patients were collected for analyzing the reasons of prematurely exiting the CDSS. The most frequent reason for exiting the system is too busy to use. We conclude that a CPOE with CDSS integrated may let more hyperlipidemia patients reach the LDL-C goal. However, data also showed the total prescribing time may increase. The results of a preliminary evaluation are presented to illustrate that the CDSSs can improve the quality of hyperlipidemia management.

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

computerized physician order entry
hyperlipidemia

clinical decision support system
medical order entry system
clinical practice guideline
evidence-based medicine
quality indicators


Fault-free cycles in folded hypercubes with more faulty elements Let FFv (respectively, FFe) be the set of faulty vertices (respectively, faulty edges) in an n-dimensional folded hypercube FQ(n). In this paper, we show that FQ(n) - FFv - FFe contains a fault-free cycle with length at least 2(n) - 2 vertical bar FFv vertical bar if vertical bar FFe vertical bar + vertical bar FFv vertical bar = 3. Our result improves the previously known result of [S.-Y. Hsieh, A note on cycle embedding in folded hypercubes with faulty elements, Information Processing Letters (2008), in press, doi:10.1016/j.ipl.2008.04.003] where vertical bar FFe vertical bar + vertical bar FFv vertical bar = 4. (c) 2008 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 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

fault tolerant embedding
folded hypercube
interconnection network


Dealing with metadata quality: The legacy of digital library efforts A characterization of metadata quality. A discussion on the role of metadata quality in data infrastructures. A survey of metadata quality frameworks to assess metadata quality. An array of solutions to mitigate the effects of metadata quality issues. Directions for future works related to metadata quality in data infrastructures.

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

digital libraries
metadata quality frameworks


Collecting information on the quality of prescribing in primary care using semi-automatic data extraction from GPs' electronic medical records Objectives: To evaluate a semi-automatic data extraction from the electronic medical record (EMR) of general practitioners (GPs) through a comparison with a paper sheets data collection simultaneously used in a primary care research project on the quality of prescribing for osteoarthritis in the elderly. Subjects: One hundred and fifty-two GPs using five different EMR-software systems participated with the semi-automatic data extraction from the EMR and 233 GPs collected data with paper registration sheets. Methods: The proportion of patients with respectively a drug prescription, paracetamol, a non-steroidal anti-inflammatory drug (NSAID) and ibuprofen were compared between the semi-automatic extraction and the paper data collection and among the EMR-software systems. Results: Using the semi-automatic data extraction, a significantly lower proportion of patients on drugs was obtained compared to the paper data collection (adjusted OR: 0.31; 95% CI 0.25-0.39). However, the proportion of patients on a specific type of drug was comparable. Within the results from the semi-automatic extraction, the results were heterogeneous among the different EMR-software systems. Conclusions: The semi-automatic data extraction with multiple EMR-software systems proposed in this study seems suitable for quality of prescribing assessment in primary care. However, it may be less reliable when only a single EMR-software is used. (c) 2005 Elsevier Ireland Ltd. All rights reserved.

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

information systems
primary health care
medical records systems
computerized
quality assurance
health care
prescriptions


Characterization of structural effects from above-ground explosion using coupled numerical simulation The response of a building structure to a nearby explosion is complicated by the drastic spatial and time variation of the blast load. Existing studies on the structural responses to explosion effects often employ simplified structural model with assumed loading patterns, such as element-based (beam-column, slab) models, single degree of freedom or lumped mass systems. The validity of a simplified approach depends on whether the governing response and failure mechanisms are well represented in the simplified scheme. For such validation more sophisticated models are required. This paper presents a numerical simulation study aiming to characterize the various structural effects of above-ground explosions. A coupled numerical approach with combined Lagrangian and Eulerian methods is adopted to allow for the incorporation of the essential processes, namely the explosion, shock wave propagation, shock wave-structure interaction and structural response, in the same model. The computational domain extends to the soil around the base of the structure, allowing also for an evaluation of the significance of the ground vibration effect. Results show that for a typical above-ground explosion scenario, the critical structural damage is dominated by air shock loading, while the ground shock induces only some additional vibration whose structural effect is minor. The distribution of structural damage tends to be governed by member level effects on the front face of the structure, whereas the global dynamic response of the system appears to be insignificant. Similar modeling approach may be applied to explore other blast-induced complex response phenomena.

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

structural effects
numerical simulation
ground vibration

above-ground explosion
coupled model
air shock wave


Discriminative cue integration for medical image annotation Automatic annotation of medical images is an increasingly important tool for physicians in their daily activity. Hospitals nowadays produce an increasing amount of data. Manual annotation is very costly and prone to human mistakes. This paper proposes a multi-cue approach to automatic medical image annotation. We represent images using global and local features. These cues are then combined using three alternative approaches, all based on the support vector machine algorithm. We tested our methods on the IRMA database, and with two of the three approaches proposed here we participated in the 2007 ImageCLEFmed benchmark evaluation, in the medical image annotation track. These algorithms ranked first and fifth, respectively among all submission. Experiments using the third approach also confirm the power of cue integration for this task. (C) 2008 Elsevier B.V. All rights reserved.

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

medical image annotation
cue integration
support vector machine


Visualization of two-dimensional vortex flows in thin oscillating liquid films A possibility of visualizing flows using random inhomogeneities of film thicknesses of different colors as particles for visualization is shown on an example of a vortex flow structure in an oscillating thin liquid film. Formation of vortex flows in a thin liquid film containing surface-active substances is investigated in experiments. The film is fixed horizontally along the edges of the cell vibrating in the vertical direction. Spatially homogeneous oscillations of the liquid film can excite different types of waves that generate two-dimensional vortex flows due to nonlinearity, We present results of experimental investigation of the structure of vortex flows in a thin film (0.5-10 mum) with rectangular boundaries. It has been revealed that, if the horizontal size of an inhomogeneous region is much smaller than the size of vortices, the inhomogeneities are transported by vortices and their interference pattern can be used for visualization of vortex flows.

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

visualization
vortex flows
liquid film
inhomogeneities


Quality evaluation of long duration AV contentan extended analysis using a novel assessment methodology This paper is an extension of our previous work describing a novel methodology for quality assessment of long duration audiovisual content. In this article we focus on data analysis of results obtained from two experiments conducted using the new methodology. In the first study, we found that the time dimension does not influence participants expectations with respect to perceived video quality and that a possible increase or decrease in acceptable quality level is rather directly related to the presented material itself. Moreover, we found that participants are less sensitive to quality changes when the process is controlled externally than when they are in charge of the quality adjustment. A second experiment (study 2) was performed to evaluate the effect of simultaneous quality changes in the two modalities (audio and video) which confirmed the previous results.

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

subjective audiovisual quality evaluation


The dialogically extended mind: Language as skilful intersubjective engagement Language is conceived as an intersubjective engagement enabling shared cognition. Experimental studies highlight ways in which language enables intersubjective informational and behavioural synergies. We therefore argue for language as skilful joint activity leading to dialogically extended minds.

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

language and cognition
language usage
dialogue
distributed cognition
social interactions


Design optimization of rocket nozzles in chemically reacting flows The objective of this study is to develop a reliable and efficient design tool that can be used in chemically reacting flows. The flow analysis is based on the axisymmetric Euler and the finite rate chemical reaction equations. The finite rate chemistry model includes eight species and eleven reaction equations. These coupled equations are solved by using Newton's method. Both the numerical and the analytical methods are used to calculate the Jacobian matrices. Sensitivities are evaluated by using the adjoint method. The performance of the optimization method is demonstrated for rocket motor nozzle design. (c) 2012 Elsevier Ltd. All rights reserved.

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

reacting flows
design optimization
adjoint method


Addressing the requirements of QoS management for wireless ad hoc networks Quality of Service (QoS) provisioning and management in ad hoc networks remains a challenging task. Existing research focuses either on providing QoS or on network management, in ad hoc networks. However, a comprehensive approach to QoS management in ad hoc networks, i.e. network management in support of service differentiation, QoS robustness, and network survivability is still lacking. In this paper, we survey the existing literature on ad hoc network management from a QoS perspective. We identify policy-based management as a promising approach for QoS provisioning and management in ad hoc networks, and describe the components that we believe are crucial for effective functioning of such a policy-based framework. Our initial experimental results in assessing signaling overhead and response time for network management in ad hoc networks support the choice of a hybrid policy architecture that combines outsourcing and provisioning policy distribution models. (C) 2002 Elsevier Science B.V. All rights reserved.

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

network management
quality of service
ad hoc networks


a novel simple secure internet voting protocol A wide number of Internet voting systems have been implemented over the years for voluntary and mandatory purposes with mixed results. In 2002, Wu and Sankaranarayana [] proposed a simple protocol for Internet voting. However, their protocol does not satisfy all properties of an ideal Internet voting protocol. In this paper, we propose an improved Internet voting protocol like anonymity, third party verification and avoidance of double voting. To make it more secure and computationally faster, the proposed protocol has been developed using elliptic curve cryptosystem.

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

internet voting
elliptic curve cryptosystem


construction of the child as a user We describe thoughts on three different parties, the child, the designer and the researcher, involved in child computer interaction and how they perceive the child as a user. Their perception is part of their construction of the child. The project's goal is to study how these constructions relate to and affect each other.

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

children constructivism research everyday design


A multi-objective mathematical model for the industrial hazardous waste location-routing problem Industrial hazardous waste management involves the collection, transportation, treatment, recycling and disposal of industrial hazardous materials that pose risk to their surroundings. In this paper, a new multi-objective location-routing model is developed, and implemented in the Marmara region of Turkey. The aim of the model is to help decision makers decide on locations of treatment centers utilizing different technologies, routing different types of industrial hazardous wastes to compatible treatment centers, locations of recycling centers and routing hazardous waste and waste residues to those centers, and locations of disposal centers and routing waste residues there. In the mathematical model, three criteria are considered: minimizing total cost, which includes total transportation cost of hazardous materials and waste residues and fixed cost of establishing treatment, disposal and recycling centers; minimizing total transportation risk related to the population exposure along transportation routes of hazardous materials and waste residues; and minimizing total risk for the population around treatment and disposal centers, also called site risk. A lexicographic weighted Tchebycheff formulation is developed and computed with CPLEX software to find representative efficient solutions to the problem. Data related to the Marmara region is obtained by utilizing Arcview 9.3 GIS software and Marmara region geographical database.

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

routing
industrial hazardous waste management

multiple objective programming
location-routing problem
pareto optimization
multi-objective model


Timeliness Multi-Agent Coordination Technology in Autonomous Decentralized Database Systems The turn of the century is witnessing radical changes in the way information services are spreading due to the progress of IT and the constantly increase in the number of users of the WWW. Therefore, the business market is changing its strategy for a modern online business environment. Autonomous Decentralized Database System (ADDS), based on autonomous coordinating subsystems, has been proposed as a system architecture in order to meet the innovative e-business requirements for consistency and high response among distributed database systems. Autonomy and decentralization of subsystems help achieving high response time in highly competitive situation and autonomous Mobile Agent based coordination has been proposed to achieve flexibility in a highly dynamic environment. In this paper, it is analyzed the case in which the system size increases; and a multi agent coordination, the same number of mobile agents and sites coexist in the system, is proposed for achieving the timeliness property. The response time in the system is conformed by those transactions that require coordination and those that can be satisfied immediately. In accordance, the distribution of the data in the system for coordination is a medullar issue for the improvement of the response time. A trade-off exits between these two kind of transactions depending on the coordination of the Mobile Agents, the capacity of allocating data among the sites, and as well as the distribution of the data and user requests in the system. In this sense, since the system requires high response time, a data allocation technology in which each mobile agent autonomously determine its own capacity for adjusting data among the sites is proposed. Thus, the system will adapt itself to the dynamic environment. The effectiveness of the proposed architecture and technologies are evaluated by simulation.

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

autonomy
decentralized
database systems
coordination
timeliness


Numerical simulation of hydrogen dispersion behaviour in a partially open space by a stabilized balancing domain decomposition method The dispersion behaviour of leaking hydrogen in a partially open space is simulated numerically by a balancing domain decomposition method in this work. An analogy of the thermal convection problems is applied. The linear systems of NavierStokes equations and the convection diffusion equation are symmetrized by a pressure stabilized domain decomposition method. The interface problem after domain decomposition is solved by a balancing preconditioned conjugate gradient method. Numerical results are validated by comparing with the experimental data and available numerical results. The transient behaviour of hydrogen dispersion and accumulation in the partially open space is discussed; the mechanism of air influence is investigated and safe region inside this partially open space is classified.

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

hydrogen dispersion
pressure stabilized
balancing domain decomposition
thermal convection


Gammatone Cepstral Coefficients: Biologically Inspired Features for Non-Speech Audio Classification In the context of non-speech audio recognition and classification for multimedia applications, it becomes essential to have a set of features able to accurately represent and discriminate among audio signals. Mel frequency cepstral coefficients (MFCC) have become a de facto standard for audio parameterization. Taking as a basis the MFCC computation scheme, the Gammatone cepstral coefficients (GTCCs) are a biologically inspired modification employing Gammatone filters with equivalent rectangular bandwidth bands. In this letter, the GTCCs, which have been previously employed in the field of speech research, are adapted for non-speech audio classification purposes. Their performance is evaluated on two audio corpora of 4 h each (general sounds and audio scenes), following two cross-validation schemes and four machine learning methods. According to the results, classification accuracies are significantly higher when employing GTCC rather than other state-of-the-art audio features. As a detailed analysis shows, with a similar computational cost, the GTCC are more effective than MFCC in representing the spectral characteristics of non-speech audio signals, especially at low frequencies.

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

audio classification
gammatone cepstral coefficients

audio scene recognition
environmental sound
feature extraction


search-based failure discovery using testability transformations to generate pseudo-oracles Testability transformations are source-to-source program transformations that are designed to improve the testability of a program. This paper introduces a novel approach in which transformations are used to improve testability of a program by generating a pseudo-oracle. A pseudo-oracle is an alternative version of a program under test whose output can be compared with the original. Differences in output between the two programs may indicate a fault in the original program. Two transformations are presented. The first can highlight numerical inaccuracies in programs and cumulative roundoff errors, whilst the second may detect the presence of race conditions in multi-threaded code. Once a pseudo-oracle is generated, techniques are applied from the field of search-based testing to automatically find differences in output between the two versions of the program. The results of an experimental study presented in the paper show that both random testing and genetic algorithms are capable of utilizing the pseudo-oracles to automatically find program failures. Using genetic algorithms it is possible to explicitly maximize the discrepancies between the original programs and their pseudo-oracles. This allows for the production of test cases where the observable failure is highly pronounced, enabling the tester to establish the seriousness of the underlying fault.

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

non-testable program
pseudo-oracle
oracle
program transformation
search-based software testing
testability transformation


Reducing working memory load in spoken dialogue systems We evaluated two strategies for alleviating working memory load for users of voice interfaces: presenting fewer options per turn and providing confirmations. Forty-eight users booked appointments using nine different dialogue systems, which varied in the number of options presented and the confirmation strategy used. Participants also performed four cognitive tests and rated the usability of each dialogue system on a standardised questionnaire. When systems presented more options per turn and avoided explicit confirmation subdialogues, both older and younger users booked appointments more quickly without compromising task success. Users with lower information processing speed were less likely to remember all relevant aspects of the appointment. Working memory span did not affect appointment recall. Older users were slightly less satisfied with the dialogue systems than younger users. We conclude that the number of options is less important than an accurate assessment of the actual cognitive demands of the task at hand. (C) 2009 Elsevier B.V. All rights reserved.

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

spoken dialogue systems
working memory
processing speed
usability


Appearance characterization of linear Lambertian objects, generalized photometric stereo, and illumination-invariant face recognition Traditional photometric stereo algorithms employ a Lambertian reflectance model with a varying albedo field and involve the appearance of only one object. In this paper, we generalize photometric stereo algorithms to handle all appearances of all objects in a class, in particular the human face class, by making use of the linear Lambertian property. A linear Lambertian object is one which is linearly spanned by a set of basis objects and has a Lambertian surface. The linear property leads to a rank constraint and, consequently, a factorization of an observation matrix that consists of exemplar images of different objects (e.g., faces of different subjects) under different, unknown illuminations. Integrability and symmetry constraints are used to fully recover the subspace bases using a novel linearized algorithm that takes the varying albedo field into account. The effectiveness of the linear Lambertian property is further investigated by using it for the problem of illumination-invariant face recognition using just one image. Attached shadows are incorporated in the model by a careful treatment of the inherent nonlinearity in Lambert's law. This enables us to extend our algorithm to perform face recognition in the presence of multiple illumination sources. Experimental results using standard data sets are presented.

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

linear lambertian object
generalized photometric stereo
multiple illumination sources
rank constraint
integrability

illumination-invariant face recognition
bilinear analysis
face symmetry


object-oriented programming for linear algebra Many numerical analysts and Lisp/Smalltalk programmers share the assumption that languages like Fortran are more appropriate for traditional, quantitative scientific programming than object-oriented languages. To show how straightforward application of object-oriented design to standard algorithms in numerical linear algebra improves clarity and expressiveness, without sacrificing speed or accuracy, I describe parts of Cactus, a system for numerical linear algebra and constrained optimization, implemented in Common Lisp and CLOS.

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

accuracy
lisp
linear algebra
constrained optimization

sharing
program
object-oriented programming
applications
systems
object-oriented design
language
smalltalk
express
standardization
algorithm
programmer
object oriented language


Reaction dynamics of Ni(n) (n=19 and 20) with D(2): Dependence on cluster size, temperature and initial rovibrational states of the molecule The Ni(n)(n = 19, 20) + D2(v, j) collision systems have been studied to investigate the dependence of cluster reactivity on the cluster temperature and the initial rovibrational states of the molecule using quasiclassical molecular dynamics simulations. The clusters are described by an embedded atom potential, whereas the interaction between the molecule and the cluster is modeled by a LEPS (London-Eyring-Polani-Sato) potential energy function. Reaction (dissociative adsorption) cross-sections are computed as functions of the collision energy for different initial rovibrational states of the molecule and for different temperatures of the clusters. Rovibrational, temperature and size-dependent rate constants are also presented, and the results are compared with earlier studies. Initial vibrational excitation of the molecule increases the reaction cross-section more efficiently than the initial rotational excitation. The reaction cross-sections strongly depend on the collision energies below 0.1 eV.

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

nickel clusters
structure
md simulations
deuterium molecule
chemisorption
dissociation


A grid generator for 3-D explosion simulations using the staircase boundary approach in Cartesian coordinates based on STL models An automatic grid generator based on STL models is proposed. The staircase boundary treatment is implemented to handle irregular geometries. Slicing algorithm and scan line filling technique are used to generate grids. The example shows that the grid generator can provide practical grids for the simulation of explosions with complicated entries.

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

staircase boundary treatment
scan line filling

numerical simulation
cartesian grid
grid generation
stl model


A further step forward in measuring journals scientific prestige: The SJR2 indicator A new size-independent indicator of scientific journal prestige, the SJR2 indicator, is proposed. This indicator takes into account not only the prestige of the citing scientific journal but also its closeness to the cited journal using the cosine of the angle between the vectors of the two journals cocitation profiles. To eliminate the size effect, the accumulated prestige is divided by the fraction of the journal's citable documents, thus eliminating the decreasing tendency of this type of indicator and giving meaning to the scores. Its method of computation is described, and the results of its implementation on the Scopus 2008 dataset is compared with those of an ad hoc Journal Impact Factor, JIF(3y), and SNIP, the comparison being made both overall and within specific scientific areas. All three, the SJR2 indicator, the SNIP indicator and the JIF distributions, were found to fit well to a logarithmic law. Although the three metrics were strongly correlated, there were major changes in rank. In addition, the SJR2 was distributed more equalized than the JIF by Subject Area and almost as equalized as the SNIP, and better than both at the lower level of Specific Subject Areas. The incorporation of the cosine increased the values of the flows of prestige between thematically close journals.

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

academic journals
eigenvector centrality
citation networks


effective self adaptation by integrating adaptive framework with architectural patterns As software development becomes large-scale, the major focus of the developers has shifted from algorithms and data structures to architectures of the software systems. Architecture provides a bridge between requirements and implementation. Until recently, mechanism for self adaptation is largely in the form of programming language features embedded in code, thus prohibiting reusability and modifiability. This paper advocates the use of an external mechanism which monitors the running system and updates the architectural properties based on the changes in the system. Haphazard changes made in the architecture might make the system unstable. In order to address this issue, this paper proposes an approach for dynamic self adaptation by integrating the adaptive framework with architectural patterns. Since the architectural patterns have some predefined and proven structure, they make the system amenable for easy adoption. The changes in the architecture are mapped back to the running system. The external mechanism thus monitors and makes changes to the running system dynamically. The proposed approach has been tested by applying it to a sample e-Shopping application case study.

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

architecture description language
external control mechanism
software architecture


Implicit finite element discretizations based on the flux-corrected transport algorithm The flux-corrected transport (FCT) methodology is generalized to implicit finite element schemes and applied to the Euler equations of gas dynamics. For scalar equations, a local extremum diminishing scheme is constructed by adding artificial diffusion so as to eliminate negative off-diagonal entries from the high-order transport operator. To obtain a nonoscillatory low-order method in the case of hyperbolic systems, the artificial viscosity tensor is designed so that all off-diagonal blocks of the discrete Jacobians are rendered positive semi-definite. Compensating antidiffusion is applied within a fixed-point defect correction loop so as to recover the high accuracy of the Galerkin discretization in regions of smooth solutions. All conservative matrix manipulations are performed edge-by-edge which leads to an efficient algorithm for the matrix assembly. Copyright (c) 2005 John Wiley T Sons, Ltd.

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

high-resolution schemes
flux limiters
finite elements
compressible flows


Where Does Pattees How Does a Molecule Become a Message? Belong in the History of Biosemiotics? Recalling the title of Yoxens classical paper on the influence of Schrdingers book, I analyze the role that the work of H. Pattee might have played, if any, in the development of Biosemiotics. I take his 1969 paper How does a molecule become a message? (Developmental Biology Supplement) as a first target due to several circumstances that make it especially salient. On the one hand, even if Pattee has obviously developed further his ideas on later papers, the significance of this one springs out right from the title, the journal and date of publication and, of course, its content. On the other, this paper in particular has been somehow rediscovered recently and not only within the frame of biosemiotics (eg, in history and philosophy of biology by E.F. Keller). Following the parallelism with Yoxens perspective, I contend that Pattees work was relatively influential with respect to a good amount of attempts to rethink living systems within theoretical biology around the 70s. This influence diminished together with the decay or even collapse of those attempts under the impact of molecular biology as it was being developed those years. Eventually, Pattees work has been taken up again. Notwithstanding, it is quite clear that Pattee himself was not intending to contribute specifically to Biosemiotics and that he was probably unaware of any such discipline, at least until recently. Then, we should as well ask (as Yoxen wonders with respect to Schrdinger) to which extent Pattees influence has been a direct one or rather an indication of the relevance of his ideas and the resonance of his hypotheses with those of biosemiotics. For this task I will sketch a few points of convergence and divergence and examine the work of some authors who either address directly this issue or have contributed significantly to build up the history of Biosemiotics.

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

semantic closure
epistemic cut
semiotic
complementarity
code
control
dynamics


Markov random field processing for color demosaicing ? In digital color imaging, color filter arrays (CFAs) are obtained from single-chip cameras in the form of sampled spectral components (red, green and blue) in an interleaved fashion. Color demosaicing is the process of interpolating these CFAs into dense pixel maps for each spectral component. There are different interpolation techniques for color demosaicing operations. These approaches have their limitations regarding the improvement of the quality of the images. Particularly, they perform poorly in recovering the edges of the images. In this work we have applied Markov random field (MRF) processing over these roughly interpolated images obtained by the existing techniques to improve the quality of the reconstruction. We have observed that the processing improves the image quality in many cases. Particularly, the edges of the reconstructed images are significantly enhanced using MRF processing.

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

color interpolation
color filter array (cfa)
markov random field (mrf)
gibbs distribution
simulated annealing
stochastic relaxation


Cooperator selection and industry assignment in supply chain network with line balancing technology Losses from cooperator delivery delay may greatly undermine the supply chain network performance leading to losses in the increased business cost. This paper mainly discusses and explores how to create the optimized cooperators and industry sets intelligently in the supply chain network. A mathematical model and a genetic algorithm solving model for cooperator selection and industry assignment in supply chain network are presented to minimize the total delivery delay loss. The mathematical model based on the line balancing technology since the supply chain network can be treated as the extension of assembly production line can be used as a foundation for further practical development in the design of supply chain network. The genetic algorithm solving model is adopted to get a satisfactory near-optimal solution with great speed. The application results in real cases show that the solving model presented by this research can quickly and effectively plan the most suitable type of the cooperators and industry sets in supply chain network.

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

cooperator selection
industry assignment
supply chain network
line balancing
genetic algorithm


Under what conditions will social commerce business models survive? This study provides a model that captures the essential features of the social commerce business. The model focuses on the relationship between key decision issues, such as marketing expenditures and the revenue streams that are created. As more social commerce businesses enter the marketplace, they are faced with fierce competition, which may lead to sharp increases in marketing and advertising expenditures. This type of competition may lead the industry away from its optimal development path, and at worst, toward a disruption of the entire industry. Another goal of this study is to examine the possibility that the tragedy of commons may occur in the industry. The basic analysis presents Nash equilibrium results with homogeneous and heterogeneous players. The analysis further specifies the conditions that the tragedy of commons can occur. I discuss the strategic implications and policy directions that may be able to overcome the shortcomings of current business model, and help the industry to achieve more sustainable development. (C) 2013 Elsevier B. V. All rights reserved.

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

economic analysis
game theory
regulation
social networks
tragedy of the commons


Empower service directories with knowledge Service-oriented architecture (SOA) is an important, flexible, and widely used software architecture. Web service technology (WST) is an SOA implementation framework that has attracted much attention. In WST, consumers find required services by means of service directories. Current service directories are mainly based on UDDI and suffer from a lack of knowledge that limits the power of them. Service directories work as simple stateless search machines that use service descriptions to find similar services in response to a consumers query. Because of the small amount of information that service directories store about web services, they cannot be used effectively. Service directories with more information operate with more power and lower cost. In this paper, to empower service directories, directories are augmented with knowledge about web services that is encoded by a semantic interlinked graph of WST entities. Different operations offered by the resulting service directory and an analysis of their costs are shown through experiments.

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

service publishing
semantic relationship
knowledge management


Group support systems and productivity: A laboratory experiment In electronic brainstorming (EBS) the use of a public screen has often been justified as a tool for sharing ideas in an anonymous setting. Rarely, if ever, has any attention been given to how such a tool influences the productivity in an EBS environment This paper describes a laboratory experiment that examines the impact of the public screen on productivity in EBS. Three different treatment conditions were used : no public screen, public screen presented at the end of the session, and public screen provided throughout 274 subjects participated in this study. The task used was a simple brainstorming task The Group Decision Support System (GDSS) used was GroupSystem V. The results indicate that the groups using the GDSS with the public screen at the end performed the best in terms of the number of unique (non-redundant) ideas generated. These groups performed better because of the self-evaluation potential. Also, we found that there is a significant difference in variance between groups who had the public screen at the end and those who used the public screw throughout As an explanation of these results, one may conclude that the social matching effect took place during the sessions with the public screen throughout Some participants exerted more effort, others loafed in order to match the group members' performance. Overall, these findings suggest several mediating factors that may account for these performance differences : The self-evaluation potential, the motivating potential of group comparison, and social matching by interactive group members. Implications for these findings are discussed.

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

gdss
public screen
productivity
social matching


automatic image annotation by using relevant keywords extracted from auxiliary text documents In this paper, a novel algorithm is developed to enable automatic image annotation by aligning web images with their most relevant auxiliary text terms. First, large-scale web pages are crawled and automatic web page segmentation is performed to extract informative images and their most relevant auxiliary text blocks. Second, image clustering is performed to partition the web images into a set of image clusters according to their visual similarity contexts. By grouping the web images according to their common visual properties, the uncertainty of the relatedness between the web images and their auxiliary text terms is significantly reduced. Finally, a relevance re-ranking algorithm is developed to achieve more precise alignment between the web images with their most relevant auxiliary text terms. Our experiments on large-scale web pages have provided very positive results.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 image-text alignment
relevance re-ranking


Market segmentation based on hierarchical self-organizing map for markets of multimedia on demand Customer relationship management (CRM) aims at understanding and measuring the true value of customers. Market segmentation is a general method for successful CRM. This paper focuses on approaches that provide a human manager with a visualized decision making tool for market segmentation. We propose a novel market segmentation approach, namely the hierarchical self-organizing segmentation model (HSOS), for dealing with a real-world data set for market segmentation of multimedia on demand in Taiwan. HSOS is able to give a human manager a general idea of market segmentation step by step, which can be considered as a potential alternative approach to other hierarchical cluster approaches for market segmentation.

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

customer relationship management
market segmentation


Evaluation of the evidential value of physicochemical data by a Bayesian network approach The growing interest in applications of Bayesian networks (BNs) in forensic science raises the question of whether BN could be used in forensic practice for the evaluation of results from physicochemical analysis of a limited number of observations from flammable liquids (weathered kerosene and diesel fuel) by automated thermal desorption gas chromatography mass spectrometry (ATD-GC/MS), car paints by pyrolysis gas chromatography mass spectrometry (Py-GC/MS) and fibres by microspectrophotometry (MSP) in the visible (VIS) range. Therefore, various simple BN models, which allow the evaluation of both discrete and continuous types of data, were studied in order to address questions raised by the representatives of the administration of justice, concerning the identification and classification of objects into certain categories and/or the association between two items. The results of the evaluation performed by BN models were expressed in the form of a likelihood ratio, which is a well-documented measure of evidential value in the forensic field. From the results obtained, it can be concluded that BN models seem to be promising tool for evaluating physicochemical data. Copyright (C) 2010 John Wiley & Sons, Ltd.

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

physicochemical data
flammable liquids
fibres

evaluation of forensic evidence by bayesian networks


Full-chip multilevel routing for power and signal integrity Conventional physical design flow separates the design of power network and signal network. Such a separated approach results in slow design convergence for wire-limited deep sub-micron designs. In this paper, we present a novel design methodology that simultaneously considers global signal routing and power network design under integrity constraints. The key part to this approach is a simple yet accurate power net estimation formula that decides the minimum number of power nets needed to satisfy both power and signal integrity constraints prior to detailed layout. The proposed design methodology is a one-pass solution to the co-design of power and signal networks in the sense that no iteration between them is required in order to meet design closure. Experiment results using large industrial benchmarks show that compared to the state-of-the-art alternative design approach, the proposed method can reduce the power network area by 19.4% on average under the same signal and power integrity constraints with better routing quality, yet use less runtime. (c) 2006 Elsevier B.V. All rights reserved.

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

extended global routing
power and signal network co-design


Evaluating industry performance using extracted RGR rules based on feature selection and rough sets classifier In strategy of investment, an important thing for investors is to correctly predict firms revenue growth rate (RGR), which is an effective evaluation indicator for them to see how big the potential power of future development is and measure how about the growth of future development for a target firm that may be selected to investment portfolios. However, conventional methods of forecasting RGR have some shortcomings such as statistical methods based on strict assumptions of linearity and/or normality limit applications in real world. Additionally, due to rapid changing of information technology (IT) today, some techniques (i.e. rough sets and data mining tools) have become important research trends to both practitioners and academicians. With these reasons above, a new procedure, using the feature selection method and rough sets classifier, is proposed to extract decision rules and improve accuracy rate for classifying RGR. In empirical study, an actual RGR dataset collected from publicly traded company of stock markets is employed to illustrate the proposed procedure. The experimental results of RGR dataset analyses indicate that the proposed procedure surpasses the listing methods in terms of both higher accuracy and fewer attributes, and the output of proposed procedure is to generate a set of easily understandable decision rules that are readily applied in knowledge-based investment systems by investors.

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

revenue growth rate (rgr)
fundamental analysis
data mining techniques


Collaborative spectrum sensing in the presence of secondary user interferences for lognormal shadowing The performance of collaborative spectrum sensing is examined for lognormal shadowing channels when secondary user interferences (SUIs) occur. Both soft decision rule and hard decision rule are considered. Computer simulation shows that the SUIs can be ignored in some cases, depending on the signal-to-noise ratio (SNR), the signal-to-interference ratio, the number of secondary users, the sample correlation, and the decision rule. Thus, by choosing appropriate system parameters, one may conduct collaborative spectrum sensing at the same time as secondary data transmission to save overheads. Copyright (c) 2010 John Wiley & Sons, Ltd.

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

collaborative spectrum sensing
interferences


A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization We introduce an algorithm to minimize a function of several variables with no convexity nor smoothness assumptions. The main peculiarity of our approach is the use of an objective function model which is the difference of two piecewise affine convex functions. Bundling and trust region concepts are embedded into the algorithm. Convergence of the algorithm to a stationary point is proved and some numerical results are reported.

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

nonsmooth optimization
cutting planes
bundle methods
dc functions