Towards a global control strategy for induction motor: Speed regulation, flux optimization and power factor correction A great deal of interest has been paid to induction machine control over the last years. However, most previous works have focused on the speed/flux/torque regulation supposing the machine magnetic circuit to be linear and ignoring the machine power conversion equipments. The point is that speed regulation cannot be ensured in optimal efficiency conditions, for a wide range of speed-set-point and load torque, unless the magnetic circuit nonlinearity is explicitly accounted for in the motor model. On the other hand, the negligence of the power conversion equipments makes it impossible to deal properly with the harmonic pollution issue due to motor power supply grid interaction. This paper presents a theoretical framework for a global control strategy of the induction machine and related power equipments. The proposed strategy involves a multi-loop nonlinear adaptive controller designed to meet the three main control objectives, i.e. tight speed regulation for a wide range speed-reference variation, flux optimization for energy consumption and power factor correction (PFC). Tools from the averaging theory are resorted to formally describe the control performances.

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

induction machine
magnetic circuit nonlinearity
speed regulation
power factor correction

ac/dc/ac converters
backstepping technique


Solving fuzzy Fredholm linear integral equations using Sinc method and double exponential transformation In this paper, numerical solution of fuzzy Fredholm linear integral equations is considered by applying Sinc method based on double exponential transformation with dual fuzzy linear systems. For this purpose, we convert the given fuzzy integral equation to a fuzzy linear system of equation. In this case, the Sinc collocation method with double exponential transformation is used. Numerical examples are provided to verify the validity of the proposed algorithm.

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

fuzzy number
fuzzy fredholm integral equations
dual systems
double exponential (de) transformation


Fuzzy-Approximation-Based Adaptive Control of Strict-Feedback Nonlinear Systems With Time Delays This paper focuses on the problem of adaptive control for a class of nonlinear time-delay systems with unknown nonlinearities and strict-feedback structure. Based on the Lyapunov-Krasovskii functional approach, a state-feedback adaptive controller is constructed by backstepping. The proposed adaptive controller guarantees that the system output converges into a small neighborhood of the reference signal, and all the signals of the closed-loop system remain bounded. Compared with the results that exist, the main advantage of the proposed method is that the controller design is independent of the choice of the fuzzy-membership functions; therefore, a priori knowledge of fuzzy approximators is not necessary for control design, and the proposed approach requires only one adaptive law for an nth-order system. Two numerical examples are used to illustrate the effectiveness of the proposed approach.

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

adaptive control
backstepping
nonlinear systems
time delays


Some Results on Greedy Embeddings in Metric Spaces Geographic Routing is a family of routing algorithms that uses geographic point locations as addresses for the purposes of routing. Such routing algorithms have proven to be both simple to implement and heuristically effective when applied to wireless sensor networks. Greedy Routing is a natural abstraction of this model in which nodes are assigned virtual coordinates in a metric space, and these coordinates are used to perform point-to-point routing. Here we resolve a conjecture of Papadimitriou and Ratajczak that every 3-connected planar graph admits a greedy embedding into the Euclidean plane. This immediately implies that all 3-connected graphs that exclude K (3,3) as a minor admit a greedy embedding into the Euclidean plane. We also prove a combinatorial condition that guarantees nonembeddability. We use this result to construct graphs that can be greedily embedded into the Euclidean plane, but for which no spanning tree admits such an embedding.

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

papadimitriou-ratajczak conjecture
christmas cactus graph
excluded minor


Investigating the Effects of Multiple Factors Towards More Accurate 3-D Object Retrieval This paper proposes a novel framework for 3-D object retrieval, taking into account most of the factors that may affect the retrieval performance. Initially, a novel 3-D model alignment method is introduced, which achieves accurate rotation estimation through the combination of two intuitive criteria, plane reflection symmetry and rectilinearity. After the pose normalization stage, a low-level descriptor extraction procedure follows, using three different types of descriptors, which have been proven to be effective. Then, a novel combination procedure of the above descriptors takes place, which achieves higher retrieval performance than each descriptor does separately. The paper provides also an in-depth study of the factors that can further improve the 3-D object retrieval accuracy. These include selection of the appropriate dissimilarity metric, feature selection/dimensionality reduction on the initial low-level descriptors, as well as manifold learning for re-ranking of the search results. Experiments performed on two 3-D model benchmark datasets confirm our assumption that future research in 3-D object retrieval should focus more on the efficient combination of low-level descriptors as well as on the selection of the best features and matching metrics, than on the investigation of the optimal 3-D object descriptor.

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

descriptor extraction
manifold learning
rotation estimation


Nonlinear hydrodynamic models of traffic flow modelling and mathematical problems This paper deals with nonlinear hydrodynamic modelling of traffic flow on roads and with the solution of related nonlinear initial and boundary value problems. The paper is in two parts. The first one provides the general framework of hydrodynamic modelling of traffic flow. Some new models are proposed and related to the ones which are known in the literature. The second one is on mathematical methods related to the solution of initial-boundary value problems. A critical analysis and an overview on research perspectives conclude the paper. (C) 1999 Elsevier Science 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

nonlinear hydrodynamics
traffic models
nonlinear sciences
evolution equations


Skeleton-enhanced line drawings for 3D models ? We present a novel line drawing approach for 3D models by introducing their skeleton information into the rendering process. Based on the silhouettes of the input 3D models, we first extract feature lines in geometric regions by utilizing their curvature, torsion and view-dependent information. Then, the skeletons of the models are extracted by our newly developed skeleton extraction algorithm. After that, we draw the skeleton-guided lines from non-geometric regions through the skeleton information. These lines are combined with the feature lines to render the final line drawing result using the line optimization. Experimental results show that our algorithm can render line drawings more effectively with enhanced skeletons. The resulting artistic effects can capture the local geometries as well as the global skeletons of the input 3D models.

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

non-photorealistic rendering
geometric feature


Low-Complexity Video Coding Based on Two-Dimensional Singular Value Decomposition In this paper, we propose a low-complexity video coding scheme based upon 2-D singular value decomposition (2-D SVD), which exploits basic temporal correlation in visual signals without resorting to motion estimation (ME). By exploring the energy compaction property of 2-D SVD coefficient matrices, high coding efficiency is achieved. The proposed scheme is for the better compromise of computational complexity and temporal redundancy reduction, i.e., compared with the existing video coding methods. In addition, the problems caused by frame decoding dependence in hybrid video coding, such as unavailability of random access, are avoided. The comparison of the proposed 2-D SVD coding scheme with the existing relevant non-ME-based low-complexity codecs shows its advantages and potential in applications.

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

computational complexity
energy compaction

simultaneous low-rank approximation of matrices


Use of OSWALD for analyzing longitudinal data with informative dropout OSWALD (Object-oriented Software for the Analysis of Longitudinal Data) is flexible and powerful software written for S-PLUS for the analysis of longitudinal data with dropout for which there is little other software available in the public domain. The implementation of OSWALD is described through analysis of a psychiatric clinical trial that compares antidepressant effects in an elderly depressed sample and a simulation study. In the simulation study, three different dropout mechanisms: completely random dropout (CRD), random dropout (RD) and informative dropout (ID), are considered and the results from using OSWALD are compared across mechanisms. The parameter estimates for ID-simulated data show less bias with OSWALD under the ID missing data assumption than under the CRD or RD assumptions. Under an ID mechanism, OSWALD does not provide standard error estimates. We supplement OSWALD with a bootstrap procedure to derive the standard errors. This report illustrates the usage of OSWALD for analyzing longitudinal data with dropouts and how to draw appropriate conclusions based on the analytic results under different assumptions regarding the dropout mechanism. (c) 2006 Elsevier Ireland Ltd. All rights reserved.

O O B O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O B O O O B O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O 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 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-ignorable missing
longitudinal data analyses


A Survey of NAT Behavior Discovery in VoIP Applications Because of the foreseeing depletion of Internet Protocol (IP) addresses, Network Address Translation (NAT) is ubiquitously deployed to allow hosts to connect to the Internet through a single shared public IP address, which is a popular approach in deploying wireless local area network (WLAN). Although NAT proves to work well with traditional client/server applications, its existence and non-standard behaviors are the major problem which cripples voice over IP (VoIP) applications. In addition to some efforts which attempt to devise complicated protocols to tackle all NAT varieties, there are also efforts in Internet communities trying to standardize the behaviors of NAT. Therefore, it becomes crucial for a network device to discover the existence of NAT in its subnet and to determine the NAT behaviors, so that it can choose the optimal NAT traversal mechanisms to apply. In this paper, we surveyed the divergent NAT behaviors and then proposed a simplified NAT behavior discovery approach which is more suitable for VoIP applications. The proposed approach can reduce the call establishment time of VoIP applications, which is useful in scenarios where VoIP devices are administrated within a specific domain, e.g., 3G cellular networks.

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


An automorphic approach to verification pattern generation for SoC design verification using port-order fault model Embedded cores are being increasingly used in the design of large system-on-a-chip (SoC). Because of the high complexity of SoC, the design verification is a challenge for system integrators. To reduce the verification complexity, the port-order fault (POF) model was proposed. It has been used for verifying core-based designs and the corresponding verification pattern generation has been developed. Here, the authors present an automorphic technique to improve the efficiency of the automatic verification pattern generation (AVPG) for SoC design verification based on the POF model. On average, the size of pattern sets obtained on the ISCAS-85 and MCNC benchmarks are 45 % smaller and the run time decreases 16 % as compared with the previous results of AVPG.

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

automatic verification pattern generation (avpg)


Data page layouts for relational databases on deep memory hierarchies Relational database systems have traditionally optimized for I/O performance and organized records sequentially on disk pages using the N-ary Storage Model (NSM) (a.k.a., slotted pages). Recent research, however, indicates that cache utilization and performance is becoming increasingly important on modern platforms. In this paper, we first demonstrate that in-page data placement is the key to high cache performance and that NSM exhibits low cache utilization on modern platforms. Next, we propose a new data organization model called PAX (Partition Attributes Across), that significantly improves cache performance by grouping together all values of each attribute within each page. Because PAX only affects layout inside the pages, it incurs no storage penalty and does not affect I/O behavior. According to our experimental results (which were obtained without using any indices on the participating relations), when compared to NSM: (a) PAX exhibits superior cache and memory bandwidth utilization, saving at least 75% of NSM's stall time due to data cache accesses; (b) range selection queries and updates on memory-resident relations execute 17-25% faster; and (c) TPC-H queries involving I/O execute 11-48% faster. Finally, we show that PAX performs well across different memory system designs.

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

relational data placement
disk page layout
cache-conscious database systems


A soft computing approach to projecting locational marginal price The increased deregulation of electricity markets in most nations of the world in recent years has made it imperative that electricity utilities design accurate and efficient mechanisms for determining locational marginal price (LMP) in power systems. This paper presents a comparison of two soft computing-based schemes: Artificial neural networks and support vector machines for the projection of LMP. Our system has useful power system parameters as inputs and the LMP as output. Experimental results obtained suggest that although both methods give highly accurate results, support vector machines slightly outperform artificial neural networks and do so with manageable computational time costs.

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

locational marginal price
artificial neural networks
support vector machines

back propagation learning algorithm
radial basis function


Composite Right/Left Handed Artificial Transmission Line Structures in CMOS for Controlled Insertion Phase at 30 GHz Two CMOS integrated circuits are presented that utilize metamaterial composite right/left handed (CRLH) transmission lines (TLs) for zero insertion phase at 30 GHz. Specifically, 2 and 3 unit cell structures are presented with controlled insertion phase that is achieved by cascading lumped element capacitors and spiral inductors in an LC network configuration defining the TL unit cells. Furthermore, the fixed TL structures suggest the possibility of zero, advanced or delayed insertion phases by element variation, or by the use of simple active components. Simulation and measured results are in good agreement with CRLH TL theory. and display a linear insertion phase and flat group delay values that are dependent on the number of unit cells with an insertion loss of similar to 0.8 dB per cell. These findings suggest that such high speed CRLH TLs structures can he implemented for linear array feeding networks and compact antenna designs in CMOS at millimeter wave frequencies. (C) 2008 Wiley Periodicals. Inc. Int J RF and Microwave CAE 19: 163-169 2009.

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

complementary metal oxide semiconductor (cmos)


On the hardness of offline multi-objective optimization It has been empirically established that multiobjective evolutionary algorithms do not scale well with the number of conflicting objectives. This paper shows that the convergence rate of all comparison-based multi-objective algorithms, for the Hausdorff distance, is not much better than the convergence rate of the random search under certain conditions. The number of objectives must be very moderate and the framework should hold the following assumptions: the objectives are conflicting and the computational cost is lower bounded by the number of comparisons is a good model. Our conclusions are: (i) the number of conflicting objectives is relevant (ii) the criteria based on comparisons with random-search for multi-objective optimization is also relevant (iii) having more than 3-objectives optimization is very hard. Furthermore, we provide some insight into cross-over operators.

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

theory
randomized search heuristics
multi-objective optimization


The spatial market of business advice and consultancy to SMEs This paper demonstrates the existence of spatial markets for business advice services. A large sample of 3245 clientadvisor links is investigated using GIS software. Seventy per cent of links are less than 25 km in extent, 93% are to the nearest local business centre, and only a few are with hinterlands or areas peripheral to main centres. The maximum reach of market areas varies by advisor type, averaging only 2540 km for chambers of commerce and public sector advice services such as Business Link. The maximum reach is 48 km for accountants and banks, and increases to 64 km for customers and suppliers and 74 km for consultants. A threshold for regional level services in major centres can be identified, which ranges from 12,000 to 24,000 businesses in size, depending on advisor type. Service sector firms are generally more localised than manufacturing, and local sourcing of advisors generally declines with firm size and size of business centre. Regional differences are relatively small, but Scotland, Yorkshire and Humberside are the most self-contained for advice, whilst London and the South-East are the least self-contained. This is a contrast to earlier findings by OFarrell and others. The paper demonstrates a hierarchical and spatial market structure for business advice services that is similar to that in retailing, with firm size and advisor type being the primary influence on differences in demand, and with regional centres most distinct from local centres of supply. Intense localised sourcing of advice from customers and suppliers does not appear to be frequent.

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

consultancy
gis
business link
chambers of commerce

business services
local networks
agglomeration


A calculus for stochastic QoS analysis The issue of Quality of Service (QoS) performance analysis in packet-switched networks has drawn a lot of attention in the networking community. There is a lot of work including an elegant theory under the name of network calculus, which focuses on analysis of deterministic worst case QoS performance bounds. In the meantime, researchers have studied stochastic QoS performance for specific schedulers. However, most previous works on deterministic QoS analysis or stochastic QoS analysis have only considered a server that provides deterministic service, i.e.deterministically bounded rate service. Few have considered the behavior of a stochastic server that provides input flows with variable rate service, for example wireless links. In this paper, we propose a stochastic network calculus to analyze the end-to-end stochastic QoS performance of a system with stochastically bounded input traffic over a series of deterministic and stochastic servers. We also prove that a server serving an aggregate of flows can be regarded as a stochastic server for individual flows within the aggregate. Based on this, the proposed framework is further applied to analyze per-flow stochastic QoS performance under aggregate scheduling.

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

generalized stochastically bounded burstiness (gsbb)


Dynamic consistency for stochastic optimal control problems For a sequence of dynamic optimization problems, we aim at discussing a notion of consistency over time. This notion can be informally introduced as follows. At the very first time stept 0, the decision maker formulates an optimization problem that yields optimal decision rules for all the forthcoming time stepst 0,t 1,,T; at the next time stept 1, he is able to formulate a new optimization problem starting at timet 1 that yields a new sequence of optimal decision rules. This process can be continued until the final timeT is reached. Afamily of optimization problems formulated in this way is said to be dynamically consistent if the optimal strategies obtained when solving the original problem remain optimal for all subsequent problems. The notion of dynamic consistency, well-known in the field of economics, has been recently introduced in the context of risk measures, notably by Artzner et al. (Ann. Oper. Res. 152(1):522, 2007) and studied in the stochastic programming framework by Shapiro (Oper. Res. Lett. 37(3):143147, 2009) and for Markov Decision Processes (MDP) by Ruszczynski (Math. Program. 125(2):235261, 2010). We here link this notion with the concept of state variable in MDP, and show that a significant class of dynamic optimization problems are dynamically consistent, provided that an adequate state variable is chosen.

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

stochastic optimal control
dynamic consistency
risk measures


Multiobjective optimization of expensive-to-evaluate deterministic computer simulator models Many engineering design optimization problems contain multiple objective functions all of which are desired to be minimized, say. This paper proposes a method for identifying the Pareto Front and the Pareto Set of the objective functions when these functions are evaluated by expensive-to-evaluate deterministic computer simulators. The method replaces the expensive function evaluations by a rapidly computable approximator based on a Gaussian process (GP) interpolator. It sequentially selects new input sites guided by values of an improvement function given the current data. The method introduced in this paper provides two advances in the interpolator/improvement framework. First, it proposes an improvement function based on the modified maximin fitness function which is known to identify well-spaced non-dominated outputs when used in multiobjective evolutionary algorithms. Second, it uses a family of GP models that allows for dependence among output function values but which permits zero covariance should the data be consistent with this model. A closed-form expression is derived for the improvement function when there are two objective functions; simulation is used to evaluate it when there are three or more objectives. Examples from the multiobjective optimization literature are presented to show that the proposed procedure can improve substantially previously proposed statistical improvement criteria for the computationally intensive multiobjective optimization setting.

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

computer experiment
kriging
pareto optimization
nonseparable gp model
computer simulator model


Early Activation and Induction of Apoptosis in T Cells Is Independent of c-Fos We used c-Fos-deficient activated T cells from the spleen and c-Fos-deficient thymocytes to address the capacity of these cells to undergo apoptosis in response to various stimuli. To determine the role of c-Fos in apoptosis regulation in thymocytes, we challenged thymocytes from wild-type and c-Fos-deficient mice with either TPA or the glucocorticoid dexamethasone. After various time points cells were stained according to the Nicoletti method and analyzed by FACS. Thymocytes from both genotypes exhibited similar efficiency of apoptosis in response to treatment with TPA or dexamethasone. Our data provide clear evidence that c-Fos is not required for apoptosis regulation in activated T cells as well as in thymocytes.

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

apoptosis
early activation
induction
t cells


A shear-deformable beam element for the analysis of laminated composites A 21 degree-of-freedom element, based on the FSDT, is derived to study the response of unsymmetrically laminated composite structures subject to both static and dynamic problems. In the FSDT model used here we have employed an accurate model to obtain the transverse shear correction factor. The dynamic version of the principle of virtual work for laminated composites is expressed in its nondimensional form and the element tangent stiffness and mass matrices are obtained using analytical integration. The element consists of four equally spaced nodes and a node at the middle. The results for the one-dimensional case are within 5% when compared to equivalent one and two-dimensional problems of static loading, free vibrations and buckling loads.

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

nonlinear finite element
condensation
shear deformation


Identifying potential adverse effects using the web: A new approach to medical hypothesis generation Medical message boards are online resources where users with a particular condition exchange information, some of which they might not otherwise share with medical providers. Many of these boards contain a large number of posts and contain patient opinions and experiences that would be potentially useful to clinicians and researchers. We present an approach that is able to collect a corpus of medical message board posts, de-identify the corpus, and extract information on potential adverse drug effects discussed by users. Using a corpus of posts to breast cancer message boards, we identified drug event pairs using co-occurrence statistics. We then compared the identified drug event pairs with adverse effects listed on the package labels of tamoxifen, anastrozole, exemestane, and letrozole. Of the pairs identified by our system, 7580% were documented on the drug labels. Some of the undocumented pairs may represent previously unidentified adverse drug effects.

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

data mining
information extraction
drug adverse effect


Analytic hierarchy based policy design method (AHPo) for solving societal problems that require a multifaceted approach This paper proposes an AHP based statistical method for the design of a comprehensive policy alternative, AHPo, for solving societal problems that require a multifaceted approach. In the proposed method, criteria relevant to the goal or focus are structured in the same way as in the conventional AHP. However, these two methods are quite different in regard to the method of quantification. The new method predicts or analyses the impact of the policy alternatives on the overall goal. In other words, it predicts or rationalizes the way people appreciate the situation in which an alternative is adopted and implemented. It will serve as a tool for supporting (especially political) decision making.

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

household adoption of seismic hazard adjustments


growing a language environment with editor libraries Large software projects consist of code written in a multitude of different (possibly domain-specific) languages, which are often deeply interspersed even in single files. While many proposals exist on how to integrate languages semantically and syntactically, the question of how to support this scenario in integrated development environments (IDEs) remains open: How can standard IDE services, such as syntax highlighting, outlining, or reference resolving, be provided in an extensible and compositional way, such that an open mix of languages is supported in a single file? Based on our library-based syntactic extension language for Java, SugarJ, we propose to make IDEs extensible by organizing editor services in editor libraries . Editor libraries are libraries written in the object language, SugarJ, and hence activated and composed through regular import statements on a file-by-file basis. We have implemented an IDE for editor libraries on top of SugarJ and the Eclipse-based Spoofax language workbench. We have validated editor libraries by evolving this IDE into a fully-fledged and schema-aware XML editor as well as an extensible Latex editor, which we used for writing this paper.

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

library
dsl embedding
language extensibility


Assessment of the classification capability of prediction and approximation methods for HRV analysis The goal of this paper is to examine the classification capabilities of various prediction and approximation methods and suggest which are most likely to be suitable for the clinical setting. Various prediction and approximation methods are applied in order to detect and extract those which provide the better differentiation between control and patient data, as well as members of different age groups. The prediction methods are local linear prediction, local exponential prediction, the delay times method, autoregressive prediction and neural networks. Approximation is computed with local linear approximation, least squares approximation, neural networks and the wavelet transform. These methods are chosen since each has a different physical basis and thus extracts and uses time series information in a different way.

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

heart rate variability
mean error
cardiogram classification
ecg


hyperspeech Hyperspeech is a speech-only hypermedia application that explores issues of speech user interfaces, navigation, and system architecture in a purely audio environment without a visual display. The system uses speech recognition input and synthetic speech feedback to aid in navigating through a database of digitally recorded speech segments.

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

speech recognition
speech user interfaces
hypermedia

conversational interfaces
speech applications
speech synthesis
speech as data


Outline of a centralised multihop ad hoc wireless network A concept of a multihop ad hoc network and associated algorithms for adaptive clustering in wireless ad hoc networks are presented in this paper. The algorithms take into account the connectivity of the stations as well as the quality of service requirements. The concept of a centralised ad hoc network is adopted, in which a cluster is defined by a Central Controller granting access to the radio interface to all terminals in its cluster. By these means the CC contributes to provide quality of service guarantees to the users. This concept is also used in the HiperLAN/2 (HL/2) Home Environment Extension (HEE), an ad hoc wireless LAN standardised by the European Telecommunications Standardisation Institute (ETSI). The HEE is restricted to one single cluster. It is shown in this article how the network can be extended over several clusters by the introduction of so-called forwarding stations. These forwarders interconnect the clusters and enable multihop connections of users roaming in different clusters. A solution is presented to ensure, as far as possible, an interconnection of clusters by means of the clustering algorithm.

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

routing
hiperlan/2
mobility management
handover


An architecture for security-oriented perfective maintenance of legacy software This work presents an implementation strategy which exploits the separation of concerns and reuse in a multi-tier architecture to improve the security (availability, integrity, and confidentiality) level of an existing application. Functional properties are guaranteed via wrapping of the existing software modules. Security mechanisms are handled by the business logic of the middle-tier: availability and integrity are achieved via replication of the functional modules and the confidentiality is obtained via cryptography. The technique is presented with regard to a case study application. We believe that our experience can be used as a guideline for software practitioners to solve similar problems. We thus describe the conceptual model behind the architecture, discuss implementation issues, and present technical solutions.

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

security
perfective maintenance
legacy software
replication


Current and future models for nursing e-journals: making the most of the webs potential We are presently witnessing an increasing number of nursing, medical and health-related electronic journals (e-journals) being made available on the World Wide Web, a minority of which are specifically devoted to informatics. We would expect, given the potential of interacting multimedia and computer-mediated communications (i.e. telematics), to also see an increasing diversity of models, but this is not currently the case. Following a brief discussion of some of the issues relevant to electronic publications, the authors present a taxonomy of current nursing e-journal models, including discussion of some examples from around the world that fall into categories within this taxonomy. We describe the model and levels of usage of one particular e-journal, Nursing Standard Online. Some of the issues presented may account for the current relative paucity of high quality content and innovative models in the development of Web-based e-journals for nurses and other health professionals. We believe it likely that nursing e-journals using current models will need to be specialist rather than generalist if they are to attract a larger audience. In concluding our paper, we advocate the development of innovative and increasingly interactive nursing e-journals as the way forward, discussing one particular model which holds promise.

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

publishingtrends (td)
medical informaticseducation (ed)
online systems
computer communication networks
peer review


Trust management in vehicular ad hoc network: a systematic review The basis of vehicular ad hoc networks (VANETs) is the exchange of data between entities, and making a decision on received data/event is usually based on information provided by other entities. Many researchers utilize the concept of trust to assess the trustworthiness of the received data. Nevertheless, the lack of a review to sum up the best available research on specific questions on trust management in vehicular ad hoc networks is sensible. This paper presents a systematic literature review to provide comprehensive and unbiased information about various current trust conceptions, proposals, problems, and solutions in VANETs to increase quality of data in transportation. For the purpose of the writing of this paper, a total of 111 articles related to the trust model in VANETs published between 2005 and 2014 were extracted from the most relevant scientific sources (IEEE Computer Society, ACM Digital Library, Springer Link, Science Direct, and Wiley Online Library). Finally, ten articles were eventually analyzed due to several reasons such as relevancy and comprehensiveness of discussion presented in the articles. Using the systematic method of review, this paper succeeds to reveal the main challenges and requirements for trust in VANETs and future research within this scope.

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

systematic literature review
trust management


QSPR study of the Henry's Law constant for hydrocarbons We establish a QSPR inodel between the Henry's Law constant in the air - water system and the molecular structure of 150 aliphatic hydrocarbons. The simultaneous linear regression analyzes on 1086 numerical descriptors reflecting topological, geometrical, and electronic aspects lead to a seven parameter equation that, when compared to previously reported models, exhibits good calibration and cross-validated parameters: R=0.996, R(1 - 10% - o)=0.997. As a realistic application, we employ this relationship to estimate the partition coefficient for 39 non-yet measured chemicals. Crown Copyright (c) 2007 Published by Elsevier B.V. All rights reserved.

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

qspr theory
molecular descriptors
multivariable regression analysis
henry's law constant
replacement method


sleep transistor distribution in row-based mtcmos designs The Multi-Threshold CMOS (MTCMOS) technology has become a popular technique for standby power reduction. This technology utilizes high-Vth sleep transistors to reduce sub threshold leakage currents during the standby mode of CMOS VLSI Circuits. The performance of MTCMOS circuits strongly depends on the size of the sleep transistors and the parasitics on the virtual ground network. Given a placed net list of a row-based MTCMOS design and the number of sleep transistor cells on each standard cell row, this paper introduces an optimal algorithm for linearly placing the allocated sleep transistors on each standard cell row so as to minimize the performance degradation of the MTCMOS circuit, which is in part due to unwanted voltage drops on its virtual ground network. Experimental results show that, compared to existing methods of placing the sleep transistors on cell rows, the proposed technique results in up to 11\% reduction in the critical path delay of the circuit.

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


Learning the mean: A neural network approach One of the key problems in machine learning theory and practice is setting the correct value of the regularization parameter; this is particularly crucial in Kernel Machines such as Support Vector Machines, Regularized Least Square or Neural Networks with Weight Decay terms. Well known methods such as Leave-One-Out (or GCV) and Evidence Maximization offer a way of predicting the regularization parameter. This work points out the failure of these methods for predicting the regularization parameter when coping with the, apparently trivial and here introduced, regularized mean problem; this is the simplest form of Tikhonov regularization, that, in turn, is the primal form of the learning algorithm Regularized Least Squares. This controlled environment gives the possibility to define oracular notions of regularization and to experiment new methodologies for predicting the regularization parameter that can be extended to the more general regression case. The analysis stems from JamesStein theory, shows the equivalence of shrinking and regularization and is carried using multiple kernels learning for regression and SVD analysis; a mean value estimator is built, first via a rational function and secondly via a balanced neural network architecture suitable for estimating statistical quantities and gaining symmetric expectations. The obtained results show that a non-linear analysis of the sample and a non-linear estimation of the mean obtained by neural networks can be profitably used to improve the accuracy of mean value estimations, especially when a small number of realizations is provided.

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

regularization
mean problem
jamesstein theory
svd

model selection
back-propagation
multiple kernel learning
shrinkage


clustering by pattern similarity in large data sets Clustering is the process of grouping a set of objects into classes of similar objects. Although definitions of similarity vary from one clustering model to another, in most of these models the concept of similarity is based on distances, e.g., Euclidean distance or cosine distance. In other words, similar objects are required to have close values on at least a set of dimensions. In this paper, we explore a more general type of similarity. Under the pCluster model we proposed, two objects are similar if they exhibit a coherent pattern on a subset of dimensions. For instance, in DNA microarray analysis, the expression levels of two genes may rise and fall synchronously in response to a set of environmental stimuli. Although the magnitude of their expression levels may not be close, the patterns they exhibit can be very much alike. Discovery of such clusters of genes is essential in revealing significant connections in gene regulatory networks. E-commerce applications, such as collaborative filtering, can also benefit from the new model, which captures not only the closeness of values of certain leading indicators but also the closeness of (purchasing, browsing, etc.) patterns exhibited by the customers. Our paper introduces an effective algorithm to detect such clusters, and we perform tests on several real and synthetic data sets to show its effectiveness.

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

applications analysis concept general response model paper pattern distance values process data similarity algorithm microarray

collaborative-filtering
definition
express
object
browse
group
gene regulatory network
exploration
coherence
custom
discoveries
connection
effect
class
cluster


Measuring the performance of underplatform dampers for turbine blades by rotating laser Doppler Vibrometer Underplatform friction dampers are commonly used to control the vibration level of turbine blades in order to prevent high-cycle fatigue failures. Experimental validation of highly non-linear response predictions obtained from FEM bladed disk models incorporating underplatform dampers models has proved to be very difficult so as the assessment of the performance of a chosen design. In this paper, the effect of wedge-shaped underplatform dampers on the dynamics of a simple bladed disk under rotating conditions is measured and the effect of the excitation level on the UPDs performances is investigated at different number of the engine order excitation nearby resonance frequencies of the 1st blade bending modes of the system. The measurements are performed with an improved configuration of a rotating test rig, designed with a non-contact magnetic excitation and a non-contact rotating SLDV measurement system.

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

friction damping
laser vibrometry
bladed disks
experimental mechanics
non-linear dynamics


Failure analysis of R/C columns using a triaxial concrete model Inelastic failure analysis of concrete structures has been one of the central issues in concrete mechanics. Especially, the effect of confinement has been of great importance to capture the transition from brittle to ductile fracture of concrete under triaxial loading scenarios. Moreover, it has been a challenge to implement numerically material descriptions, which are susceptible to loss of stability and localization. In this article, a novel triaxial concrete model is presented, which captures the full spectrum of triaxial stress and strain histories in reinforced concrete structures. Thereby, inelastic dilatation is controlled by a non-associated flow rule to attain realistic predictions of inelastic volume change at various confinement levels. Different features of distributed and localized failure of the concrete model are examined under confined compression, uniaxial tension, pure shear, and simple shear. The performance at the structural level is illustrated with the example of a reinforced concrete column subjected to combined axial and transverse loading.

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

r/c column subject to axial loading and shearing


toward sophisticated detection with distributed triggers Recent research has proposed efficient protocols for distributed triggers, which can be used in monitoring infrastructures to maintain system-wide invariants and detect abnormal events with minimal communication overhead. To date, however, this work has been limited to simple thresholds on distributed aggregate functions like sums and counts. In this paper, we present our initial results that show how to use these simple threshold triggers to enable sophisticated anomaly detection in near-real time, with modest communication overheads. We design a distributed protocol to detect "unusual traffic patterns" buried in an Origin-Destination network flow matrix that: a) uses a Principal Components Analysis decomposition technique to detect anomalies via a threshold function on residual signals [10]; and b) efficiently tracks this threshold function in near-real time using a simple distributed protocol. In addition, we speculate that such simple thresholding can be a powerful tool for a variety of monitoring tasks beyond the one presented here, and we propose an agenda to explore additional sophisticated applications.

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


Fully abstract trace semantics for protected module architectures Formalises A+I A + I : an assembly language extended with protected module architectures an isolation mechanism found in emerging processors. Presents two trace semantics for A+I A + I programs and proves that both are fully abstract w.r.t. the operational semantics. Details which problems arise when considering readout and writeout labels in the trace semantics of A+I A + I programs.

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

fully abstract semantics
untyped assembly language
protected modules architectures
formal languages


A new inversion method for (T2, D) 2D NMR logging and fluid typing One-dimensional nuclear magnetic resonance (1D NMR) logging technology has some significant limitations in fluid typing. However, not only can two-dimensional nuclear magnetic resonance (2D NMR) provide some accurate porosity parameters, but it can also identify fluids more accurately than 1D NMR. In this paper, based on the relaxation mechanism of (T2, D) 2D NMR in a gradient magnetic field, a hybrid inversion method that combines least-squares-based QR decomposition (LSQR) and truncated singular value decomposition (TSVD) is examined in the 2D NMR inversion of various fluid models. The forward modeling and inversion tests are performed in detail with different acquisition parameters, such as magnetic field gradients (G) and echo spacing (TE) groups. The simulated results are discussed and described in detail, the influence of the above-mentioned observation parameters on the inversion accuracy is investigated and analyzed, and the observation parameters in multi-TE activation are optimized. Furthermore, the hybrid inversion can be applied to quantitatively determine the fluid saturation. To study the effects of noise level on the hybrid method and inversion results, the numerical simulation experiments are performed using different signal-to-noise-ratios (SNRs), and the effect of different SNRs on fluid typing using three fluid models are discussed and analyzed in detail.

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

two-dimensional nmr (2d nmr) logging
transverse relaxation time (t2)
diffusion coefficient (d)


TESTING COLLABORATIVE STRATEGIES BY COMPUTATIONAL SIMULATION - COGNITIVE AND TASK EFFECTS A theory of communication between autonomous agents should make testable predictions about which communicative behaviors are collaborative, and provide a framework for determining the features of a communicative situation that affect whether a behavior is collaborative. The results presented here are derived from a two-phase empirical method. First, we analyze a corpus of naturally occurring problem-solving dialogues in order to identify potentially collaborative communicative strategies. Second, we experimentally test hypotheses that arise from the corpus analysis in Design-World, an experimental environment for simulating dialogues. The results indicate that collaborative behaviors must be defined relative to the cognitive limitations of the agents and the cognitive demands of the task. The method of computational simulation provides an additional empirical basis for theories of human-computer collaboration.

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


Pedestrian navigation aids: information requirements and design implications Recent years have seen an increased interest in navigational services for pedestrians. To ensure that these services are successful, it is necessary to understand the information requirements of pedestrians when navigating, and in particular, what information they need and how it is used. A requirements study was undertaken to identify these information requirements within an urban navigation context. Results show that landmarks were by far the most predominant navigation cue, that distance information and street names were infrequently used, and that information is used to enable navigation decisions, but also to enhance the pedestrians confidence and trust. The implications for the design of pedestrian navigation aids are highlighted.

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

design navigation pedestrian requirements


Cognitive Representation of a Complex Motor Action Executed by Different Motor Systems The present study evaluates the cognitive representation of a kicking movement performed by a human and a humanoid robot, and how they are represented in experts and novices of soccer and robotics, respectively. To learn about the expertise-dependent development of memory structures, we compared the representation structures of soccer experts and robot experts concerning a human and humanoid robot kicking movement. We found different cognitive representation structures for both expertise groups under two different motor performance conditions (human vs. humanoid robot). In general, the expertise relies on the perceptual-motor knowledge of the human motor system. Thus, the soccer experts cognitive representation of the humanoid robot movement is dominated by their representation of the corresponding human movement. Additionally, our results suggest that robot experts, in contrast to soccer experts, access functional features of the technical system of the humanoid robot in addition to their perceptual-motor knowledge about the human motor system. Thus, their perceptual-motor and neuro-functional machine representation are integrated into a cognitive representation of the humanoid robot movement.

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

expertise
motor system
humanoid robot
human movement

neuro-functional machine representation
perceptual-motor representation


Postmarketing surveillance based on electronic patient records: The IPCI project Researchers claim that data in electronic patient records can be used for a variety of purposes including individual patient care, management, and resource planning for scientific research. Our objective in the project Integrated Primary Care Information (IPCI) was to assess whether the electronic patient records of Dutch general practitioners contain sufficient data to perform studies in the area of postmarketing surveillance studies, We determined the data requirements for postmarketing surveillance studies, implemented additional software in the electronic patient records of the general practitioner, developed an organization to monitor the use of data, and performed validation studies to test the quality of the data. Analysis of the data requirements showed that additional software had to be installed to collect data that is not recorded in routine practice. To avoid having to obtain informed consent from each enrolled patient, we developed IPCI as a semianonymous system: both patients and participating general practitioners are anonymous for the researchers. Under specific circumstances, the researcher can contact indirectly (through a trusted third party) the physician that made the data available. Only the treating general practitioner is able to decode the identity of his patients. A Board of Supervisors predominantly consisting of participating general practitioners monitors the use of data. Validation studies show the data can be used for postmarketing surveillance. With additional software to collect data not normally recorded in routine practice, data from electronic patient record of general practitioners can be used for postmarketing surveillance.

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

postmarketing surveillance
electronic patient record
general practitioner
validation


Efficient algorithms for multichromosomal genome rearrangements Hannenhalli and Pevzner (36th Annual Symposium on Foundations of Computer Science, Milwaukee, WI, IEEE Computer Soc. Press, Los Alamitos, CA, 1995, p. 581) gave a polynomial time algorithm for computing the minimum number of reversals, translocations, fissions, and fusions, that would transform one multichromosomal genome to another when both have the same set of genes without repeats. We fixed some problems with the construction: (1) They claim it can exhibit such a sequence of steps, but there was a gap in the construction. (2) Their construction had an asymmetry in the number of chromosomes in the two genomes, whereby forward scenarios could have fissions but not fusions. We also improved the speed by combining the algorithm with the algorithm of Bader et al. (J. Comput. Biol. 8 (5) (2001) 483) that computes reversal distances for permutations in linear time.

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

genome rearrangements
reversal
genes
chromosomes

fusion
fission
translocation
inversion
breakpoint graph
homology


eye-gaze interfaces using electro-oculography (eog) Using electro-oculography (EOG), two types of eye-gaze interfaces have been developed; "EOG Pointer" and "EOG Switch". The former enables a user to move a computer cursor or to control a machine using only eye-gaze, regardless of drifting signal and blinking artifacts. In contrast, the latter output an ON/OFF signal only. Although it has the least simple function, it enables every user easily to turn ON/OFF a nurse-call device or to send one bit signal to a personal computer with high stability and reliability. Since the EOG Switch was commercialized in 2003, it has been widely used among amyotrophic lateral sclerosis (ALS) patients in Japan.

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

electro-oculography (eog)
dc amplifier
ac amplifier
eye-gaze interface


Creational Object-oriented Design Pattern Applied to the Development of Software Tools for Electric Power Systems Dynamic Simulations The development of software for dynamic simulation of electrical power systems requires a comprehensive range of complex studies, which encompasses many areas of electrical engineering as well as software engineering. This study aims at to develop an efficient strategy applied to the development of software tools for dynamic power systems simulations studies. The proposed strategy is based on the object-oriented creational pattern. This approach has the advantage of makes easy the application development process, by performing a mapping between block diagram model representation and the corresponding specialized classes. Firstly, a conceptual mapping between block diagram and the object-oriented paradigm, based on the Factory Method, is carried out. After that, some flexible strategies are presented in order to obtain an improved efficiency for the numerical routines, based on the Builder standard. This allows for the parameterization of the selected numerical integration techniques. The proposed strategy was evaluated by using a 4-generator multi-machine power system. The simulation results shown that the proposed strategy was able to provides a good power system dynamic performance.

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

factory method
mapping
builder
dynamic simulation
numerical routines
power systems


Algorithm for faster computation of non-zero graph based invariants This paper presents a detailed study of the graph based algorithm used to generate geometric moment invariant functions. The graph based algorithm has been found to suffer from high computational complexity. One major cause of this problem is that the algorithm generates too many graphs that produce zero moment invariant functions. Hence, we propose an algorithm to determine and eliminate the zero moment invariant generating graphs and thereby generate non-zero moment invariant functions with reduced computational complexity. The correctness of the algorithm has been verified and discussed with suitable induction proofs and sample graphs. Asymptotic analysis has been presented to clearly illustrate the reduction in computational complexity achieved by the proposed algorithm. It has been found and illustrated with examples that the computational time for identifying non-zero invariants could be largely reduced with the help of our proposed algorithm.

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

geometric moments
image transforms
orthogonal moments
moment invariants


Removing photography artifacts using gradient projection and flash-exposure sampling Flash images are known to suffer from several problems: saturation of nearby objects, poor illumination of distant objects, reflections of objects strongly lit by the flash and strong highlights due to the reflection of flash itself by glossy surfaces. We propose to use a flash and no-flash (ambient) image pair to produce better flash images. We present a novel gradient projection scheme based on a gradient coherence model that allows removal of reflections and highlights from flash images. We also present a brightness-ratio based algorithm that allows us to compensate for the falloff in the flash image brightness due to depth. In several practical scenarios, the quality of flash/no-flash images may be limited in terms of dynamic range. In such cases, we advocate using several images taken under different flash intensities and exposures. We analyze the flash intensity-exposure space and propose a method for adaptively sampling this space so as to minimize the number of captured images for any given scene. We present several experimental results that demonstrate the ability of our algorithms to produce improved flash images.

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

reflection removal
flash-exposure sampling
high dynamic range (hdr) imaging


A stable 3D energetic Galerkin BEM approach for wave propagation interior problems We consider 3D interior wave propagation problems with vanishing initial and mixed boundary conditions, reformulated as a system of two boundary integral equations with retarded potentials. These latter are then set in a weak form, based on a natural energy identity satisfied by the solution of the differential problem, and discretized by the energetic Galerkin boundary element method. Numerical results are presented and discussed in order to show the stability and accuracy of the proposed technique.

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

energetic galerkin boundary element method


a differential notion of place for local search For extracting the characteristics a specific geographic entity, and notably a place, we propose to use dynamic Extreme Tagging Systems in combination with the classic approach of static KR models like ontologies, thesauri and gazetteers. Indeed, we argue that in local search , the what that is queried is implicitly about places. However existing knowledge representation (KR) models, such as ontologies based on logical theories, conceptual spaces, affordance or other, cannot capture in isolation all aspects of the meaning of a place. Therefore we propose to use a combination of them based on the underlying notion of differences , linked elements of meaning without commitment to any KR model. Mapping to elements of different KR models can be made later to follow the requirements of a given task, supported by a KR representation of the elements that support this task. We show the usefulness of the approach for local search by applying it to the notion of place defined as a location that supports a homogeneous affordance field , i.e. the spatial area which allows me the do a particular thing, while allowing the homogeneity of movement , meaning that the previous field is not interrupted by any boundaries.

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

local search
knowledge representation
conceptual spaces
differences
extreme tagging

image schemata
ai
multi-representation
similarity
affordances
wordnet


Innovation outsourcing: Risks and quality issues Innovation is the creation of new idea, practice, object, or even product by an individual or company. A competitive organization needs to continuously offer new line of products and services to the market for their customers. In order to cut down their R&D costs, companies seek external or even global vendors to pursue their research and development (R&D) tasks. This paper discusses the issues related to innovation outsourcing, including uncertainty, risks, productivity and quality issues.

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

innovation outsourcing quality productivity risks


Firm orientation, community of practice, and Internet-enabled interfirm communication: Evidence from Chinese firms What motivates firms to develop Internet-enabled interfirm communication? We draw upon the work of Alavi et al. (2005-2006) and propose that the use of the Internet in interfirm communication is influenced by a firm's firm orientation and its internal communities of practice. Based on data collected from 307 international trade firms in the Beijing area, we find that Internet-enabled interfirm communication is directly driven by internal community of practices and customer orientation, and indirectly by competitor orientation and learning orientation. The internal community of practice is affected by learning orientation and competitor orientation, but not by customer orientation. The present study contributes to the literature by providing empirical investigation on firm's strategic communications from the perspective of firm orientations, delineating how different firm orientations vary in impacting firm's strategic communications, and exploring the bridging effect of communities of practices on the influences of firm orientations on knowledge management initiatives. (C) 2012 Elsevier By. All rights reserved.

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

firm orientation
learning orientation
customer orientation
competitor orientation
community of practice


Index of a point of 3-D digital binary image and algorithm for computing its Euler characteristic In this work a concept of index of a point of a 3-D (26, 6) digital image is defined. Basing on this concept a new characterization of the so-called simple points [1] as well as an algorithm for computing Euler characteristics of 3-D (26, 6) digital pictures is proposed. (C) 1999 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.

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

digital picture
euler number
invariant transformation


Fluxing botnet command and control channels with URL shortening services URL shortening services (USSes), which provide short aliases to registered long URLs, have become popular owing to Twitter. Despite their popularity, researchers do not carefully consider their security problems. in this paper, we explore botnet models based on USSes to prepare for new security threats before they evolve. Specifically, we consider using USSes for alias flux to hide botnet command and control (C&C) channels. In alias flux, a botmaster obfuscates the IP addresses of his C&C servers, encodes them as URLs, and then registers them to USSes with custom aliases generated by an alias generation algorithm. Later, each bot obtains the encoded IP addresses by contacting USSes using the same algorithm. For USSes that do not support custom aliases, the botmaster can use shared alias lists instead of the shared algorithm. DNS-based botnet detection schemes cannot detect an alias flux botnet, and network-level detection and blacklisting of the fluxed aliases are difficult. We also discuss possible countermeasures to cope with these new threats and investigate operating USSes. (C) 2012 Elsevier B.V. All rights reserved.

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


a generation model to unify topic relevance and lexicon-based sentiment for opinion retrieval Opinion retrieval is a task of growing interest in social life and academic research, which is to find relevant and opinionate documents according to a user's query. One of the key issues is how to combine a document's opinionate score (the ranking score of to what extent it is subjective or objective) and topic relevance score. Current solutions to document ranking in opinion retrieval are generally ad-hoc linear combination, which is short of theoretical foundation and careful analysis. In this paper, we focus on lexicon-based opinion retrieval. A novel generation model that unifies topic-relevance and opinion generation by a quadratic combination is proposed in this paper. With this model, the relevance-based ranking serves as the weighting factor of the lexicon-based sentiment ranking function, which is essentially different from the popular heuristic linear combination approaches. The effect of different sentiment dictionaries is also discussed. Experimental results on TREC blog datasets show the significant effectiveness of the proposed unified model. Improvements of 28.1\% and 40.3\% have been obtained in terms of MAP and p@10 respectively. The conclusion is not limited to blog environment. Besides the unified generation model, another contribution is that our work demonstrates that in the opinion retrieval task, a Bayesian approach to combining multiple ranking functions is superior to using a linear combination. It is also applicable to other result re-ranking applications in similar scenario.

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

generation model
opinion retrieval
topic relevance

opinion generation model
sentiment analysis


Anomalous behavior of the pulse transfer characteristic of a selectively doped AlxGa1?xAs/GaAs heterostructure containing deep traps The pulse transfer characteristic of a normal selectively doped AlxGa1?xAs/GaAs heterostructure containing deep traps in the AlxGa1?xAs layer is considered. It is shown that these deep traps are responsible for an undershoot in the drain-source current at the end of a positive voltage pulse applied to the gate (the pulse voltage is measured from the initial gate bias) and the trap depth can be determined from this undershoot.

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

selectively doped heterostucture
high electron mobility transistor
deep trap


Wireless image sensor networks: event acquisition in attack-prone and uncertain environments Wireless Image Sensor Networks (WISNs) consisting of untethered camera nodes and sensors may be deployed in a variety of unattended and possibly hostile environments to obtain surveillance data. In such settings, the WISN nodes must perform reliable event acquisition to limit the energy, computation and delay drains associated with forwarding large volumes of image data wirelessly to a sink node. In this work we investigate the event acquisition properties of WISNs that employ various techniques at the camera nodes to distinguish between event and non-event frames in uncertain environments that may include attacks. These techniques include lightweight image processing, decisions from n sensors with/without cluster head fault and attack detection, and a combination approach relying on both lightweight image processing and sensor decisions. We analyze the relative merits and limitations of each approach in terms of the resulting probability of event detection and false alarm in the face of occasional errors, attacks and stealthy attacks.

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

lightweight event acquisition
sensor network security


Constructing Comprehensive Summaries of Large Event Sequences Event sequences capture system and user activity over time. Prior research on sequence mining has mostly focused on discovering local patterns appearing in a sequence. While interesting, these patterns do not give a comprehensive summary of the entire event sequence. Moreover, the number of patterns discovered can be large. In this article, we take an alternative approach and build short summaries that describe an entire sequence, and discover local dependencies between event types. We formally define the summarization problem as an optimization problem that balances shortness of the summary with accuracy of the data description. We show that this problem can be solved optimally in polynomial time by using a combination of two dynamic-programming algorithms. We also explore more efficient greedy alternatives and demonstrate that they work well on large datasets. Experiments on both synthetic and real datasets illustrate that our algorithms are efficient and produce high-quality results, and reveal interesting local structures in the data.

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

algorithms
event sequences
summarization


Combining data remapping and voltage/frequency scaling of second level memory for energy reduction in embedded systems In this paper we show that the energy reductions obtained from using two techniques, data remapping (DR) and voltage/frequency scaling of off-chip bus and memory, combine to provide interesting trade offs between energy, execution time and power. Both methods aim to reduce the energy consumed by the memory subsystem. DR is a fully automatic compile time technique applicable to pointer-intensive dynamic applications. Voltage/frequency scaling of off-chip memory is a technique applied at the hardware level. When combined together, energy reductions can be as high as 49.45%. The improvements are verified in the context of three OLDEN pointer-centric benchmarks, namely Perimeter, Health and TSP.

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

low power
energy model
voltage/frequency scaling
compiler optimizations


Benefits and Barriers of User Evaluation in Software Engineering Research In this paper, we identify trends about, benefits from, and barriers to performing user evaluations in software engineering research. From a corpus of over 3,000 papers spanning ten years, we report on various subtypes of user evaluations (e.g., coding tasks vs. questionnaires) and relate user evaluations to paper topics (e.g., debugging vs. technology transfer). We identify the external measures of impact, such as best paper awards and citation counts, that are correlated with the presence of user evaluations. We complement this with a survey of over 100 researchers from over 40 different universities and labs in which we identify a set of perceived barriers to performing user evaluations.

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

experimentation
human factors
human study


Quasi-one-dimensional approximation in the HMO model of polymethine dyes In the framework of the Hueckel molecular orbital (HMO) model, an analytical method has been elaborated which enables calculation of energy levels and wave functions for polymethine dye molecules with arbitrary end groups characterized by two effective additive parameters. The method represents a generalization of the known long-chain approximation (LCA) manipulating only frontier pi-MOs and yields analytical relations for molecular characteristics based on all occupied dye pi-MOs.

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

polymethine compounds
long-chain approximation
quasi-one-dimensional approximation
green's functions
atomic charges
bond orders


Ontology Combined Structural and Operational Semantics for Resource-Oriented Service Composition Resource-oriented Services recently become an enabling technology to integrate and configure information from different heterogeneous systems so as to meet ever-changing environment which not only need the concepts for entities but also require the semantics for operations. By the aim of combining structural and operational semantics agilely, a Semantic Resource Service Model (SRSM) is proposed. Firstly, SRSM describes Entity-Oriented and Transition-Oriented Resource by semantic meta-model which contains data structures and operation semantics. Secondly, by describing structural semantics for Entity-Oriented Resource, heterogonous inputs/outputs of a service can be automatically matched. Thirdly, by describing operational semantics for Transition-Oriented Resource, the service composition sequence can be inferred after ontology reasoning. Then, both Entity-Oriented and Transition-Oriented Resources are encapsulated into composited RESTful service. At last, a case study and several comparisons are applied in a prototype system. The result shows that the proposed approach provides a flexible way for resource-oriented service composition.

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

structural semantic
operational semantic
resource-oriented architecture
entity-oriented resource
transition-oriented resource


Analysis of sidewall quality in through-wafer deep reactive-ion etching The quality of channel sidewalls resulting from through-wafer deep reactive-ion etching is analysed using scanning electron microscopy, atomic-force microscopy and interferometry. Sidewall quality and profile are highly dependent on the width of the etched channel. Channels narrower than 100 ?m show generally good sidewall smoothness, though with a bowed profile. This profile leads to ion-induced damage towards the bottom of the channel sidewall. Wider channels, in contrast, exhibit overpassivation of the sidewalls with a region of thick polymer build-up followed by vertical striations and a very rough surface, but with an overall vertical profile. Redeposition of the passivation from the trench bottom to the sidewalls as suggested by other researchers is supported by our observations.

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

deep reactive-ion etching
mems
fluorocarbon redeposition
sidewall morphology


Design, modelling and analysis of a six component force balance for hypervelocity wind tunnel testing A combination of modelling and analysis techniques was used to design a six component force balance. The balance was designed specifically for the measurement of impulsive aerodynamic forces and moments characteristic of hypervelocity shock tunnel testing using the stress wave force measurement technique. Aerodynamic modelling was used to estimate the magnitude and distribution of forces and finite element modelling to determine the mechanical response of proposed balance designs. Simulation of balance performance was based on aerodynamic loads and mechanical responses using convolution techniques. Deconvolution was then used to assess balance performance and to guide further design modifications leading to the final balance design.

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

force measurement
finite element modelling
deconvolution
shock tunnel


Towards a pivotal-based approach for business process alignment This article focuses on business process engineering, especially on alignment between business analysis and implementation. Through a business process management approach, different transformations interfere with process models in order to make them executable. To keep the consistency of process model from business model to IT model, we propose a pivotal metamodel-centric methodology. It aims at keeping or giving all requisite structural and semantic data needed to perform such transformations without loss of information. Through this we can ensure the alignment between business and IT. This article describes the concept of pivotal metamodel and proposes a methodology using such an approach. In addition, we present an example and the resulting benefits.

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


Ensembles of relational classifiers Relational classification aims at including relations among entities into the classification process, for example taking relations among documents such as common authors or citations into account. However, considering more than one relation can further improve classification accuracy. Here we introduce a new approach to make use of several relations as well as both, relations and local attributes for classification using ensemble methods. To accomplish this, we present a generic relational ensemble model that can use different relational and local classifiers as components. Furthermore, we discuss solutions for several problems concerning relational data such as heterogeneity, sparsity, and multiple relations. Especially the sparsity problem will be discussed in more detail. We introduce a new method called PRNMultiHop that tries to handle this problem. Furthermore we categorize relational methods in a systematic way. Finally, we provide empirical evidence, that our relational ensemble methods outperform existing relational classification methods, even rather complex models such as relational probability trees (RPTs), relational dependency networks (RDNs) and relational Bayesian classifiers (RBCs).

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

relational data mining
ensemble classification
sparse graphs
relational autocorrelation


3D feature surface properties and their application in geovisualization New acquisition methods have increased the availability of surface property data that capture location-dependent data on feature surfaces. However, these data are not supported as fully in the geovisualization of the Digital City as established data categories such as feature attributes, 2D rasters, or geometry. Consequently, 3D surface properties are largely excluded from the information extraction and knowledge creation process of geovisualization despite their potential for being an effective tool in many such tasks. To overcome this situation, this paper examines the benefits of a better integration into geovisualization systems in terms of two examples and discusses technological foundations for surface property support. The main contribution is the identification of computer graphics techniques as a suitable basis for such support. This way, the processing of surface property data fits well into existing visualization systems. This finding is demonstrated through an interactive prototypic visualization system that extends an existing system with surface property support. While this prototype concentrates on technology and neglects user-related and task-related aspects, the paper includes a discussion on challenges for making surface properties accessible to a wider audience.

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

geovisualization
3d surface properties
computer graphics


An optimization of the icosahedral grid modified by spring dynamics We have investigated an optimum form of the modified icosahedral grid that is generated by applying the spring dynamics to the standard icosahedral grid System. The spring dynamics can generate a more homogeneous grid system than the standard icosahedral grid system by tuning the natural spring lenght: as the natural spring length becomes longer, the ratio of maximum grid interval to minimum one becomes closer to unit. When the natural spring length is larger than a critical value, however, the spring dynamic system does not have a stable equilibrium. By setting the natural spring length to be the marginally critical value, we can obtain the most homogeneous grid system, which is most efficient in terms of the CFL condition. We have analyzed eigenmodes involved in the initial error of the geostrophic balance problem [test case 2 of D. L. Williamson et al. (1992, J. Comput. Phys. 102, 211)]. Since the balance state in the discrete system differs slightly from the exact solution of the analytic system, the initial error field includes both the gravity wave mode and the Rossby wave mode. As the results of the analysis are based on Hough harmonics decompositions, we detected Rossby and gravity wave modes with zonal wavenumber 5, which are asymmetric against the equator. These errors are associated with icosahedral grid structure. The symmetric gravity wave mode with zonal wavenumber 0 also appears in the error field. To clarify the evolution of Rossby waves, we introduce divergence damping to reduce the gravity wave mode. From the simulated results of the geostrophic problem with various grid systems, we found that the spuriously generated Rossby wave mode is eliminated most effectively when the most homogeneously distributed grid system is used. It is therefore, concluded that the most homogeneous grid system is the best choice from the viewpoint of numerical accuracy as well as computational efficiency. (C) 2002 Elsevier Science (USA).

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