Timesaving techniques for decision of electron-molecule collisions in Monte Carlo simulation of electrical discharges Techniques to reduce the computational load for determination of electron-molecule collisions in Monte Carlo simulations of electrical discharges have been presented. By enhancing the detection efficiency of the no-collision case in the decision scheme of the collisional events, we can decrease the frequency of access to time-consuming subroutines to calculate the electron collision cross sections of the gas molecules for obtaining the collision probability. A benchmark test and an estimation to evaluate the present techniques have shown a practical timesaving efficiency. (c) 2006 Elsevier Inc. All rights reserved.

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

monte carlo
electron collision
probability

plasma
electrical discharge
time step
timesaving scheme


Design of a wavelet interpolation filter for enhancement of the ST-segment A wavelet interpolation filter (WIF) is designed for the removal of motion artifacts in the ST-segment of stress ECGs. The WIF consists of two parts. One part is a wavelet transform that decomposes the stress ECG signal into several frequency bands using a Haar wavelet. The other part is an interpolation method, such as the spline technique, that is used to enhance the reconstruction performance of the signal decomposed by the wavelet transform. To evaluate the performance of the WIF, three indices are used: signal-to-noise ratio (SNR), reconstruction square error (RSE) and standard deviation (SD). The MIT/BIH arrhythmia database, the European ST-T database and the Triangular wave are used for evaluation. A noisy ECG signal, corrupted by motion artifacts, is simulated by the addition of two types of random noise to the original ECG signal. For comparison, three indices for the other methods are also computed: mean, median and hard thresholding. The performance of the WIF shows that RSE, SNR and SD are 392.7, 18.3 dB and 2.6, respectively, in the case of a noisy signal with an SNR of 7.1 dB, This result is much better than those for the other methods.

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

wavelet interpolation filter
motion artifacts
reconstruction square error
standard deviation


Uniform lazy narrowing Needed narrowing is a complete and optimal operational principle for modern declarative languages which integrate the best features of lazy functional and logic programming. We investigate the formal relation between needed narrowing and another (not so lazy) narrowing strategy which is the basis for popular implementations of lazy function at logic languages. We demonstrate that needed narrowing and lazy narrowing are computationally equivalent over the class of uniform programs. We also introduce a complete refinement of lazy narrowing, called uniform lazy narrowing, which is still equivalent to needed narrowing over the aforementioned class. Since actual implementations of functional logic languages are based on the transformation of the original program into a uniform one-which is then executed using a lazy narrowing strategy-our results can be thought of as a formal basis for the correctness of these implementations.

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

functional logic programming
narrowing strategies


Multicriteria fuzzy assignment method: a useful tool to assist medical diagnosis The aim of this paper is to provide a concise portrayal of medical applications of a new fuzzy classification method called PROAFTN, which uses a multicriteria decision aid approach. The review summarises and discusses medical applications of the proposed method in acute leukemia, astrocytic and bladder tumours. Although still an investigative method, the preliminary results are very encouraging and demonstrate the potential performances of this procedure for solving medical classification problems.

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

multicriteria decision aid
classification
proaftn
medical applications


A meta-predictor framework for prefetching in object-based DSMs Dynamic optimizers modify the binary code of programs at runtime by profiling and optimizing certain aspects of the execution. We present a completely software-based framework that dynamically optimizes programs for object-based distributed shared memory (DSM) systems on clusters. In DSM systems, reducing the number of messages between cluster nodes is crucial. Prefetching transfers data in advance from the storage node to the local node so that communication is minimized. Our framework uses a profiler and a dynamic binary rewriter that monitor the access behavior of the application and place prefetches where they are beneficial to speed up the application. In addition, we use two distinct predictors to handle different types of access patterns. A meta-predictor analyzes the memory access behavior and dynamically enables one of the predictors. Our system also adapts the number of prefetches per request to best fit the application's behavior. The evaluation shows that the performance of our system is better than the manual prefetching. The number of messages sent decreases by up to 90%. Performance gains of up to 80% can be observed on benchmarks. Copyright (C) 2009 John Wiley & Sons, Ltd.

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


Benchmarking FEniCS for mantle convection simulations This paper evaluates the usability of the FEniCS Project for mantle convection simulations by numerical comparison to three established benchmarks. The benchmark problems all concern convection processes in an incompressible fluid induced by temperature or composition variations, and cover three cases: (i) steady-state convection with depth- and temperature-dependent viscosity, (ii) time-dependent convection with constant viscosity and internal heating, and (iii) a RayleighTaylor instability. These problems are modeled by the Stokes equations for the fluid and advectiondiffusion equations for the temperature and composition. The FEniCS Project provides a novel platform for the automated solution of differential equations by finite element methods. In particular, it offers a significant flexibility with regard to modeling and numerical discretization choices; we have here used a discontinuous Galerkin method for the numerical solution of the advectiondiffusion equations. Our numerical results are in agreement with the benchmarks, and demonstrate the applicability of both the discontinuous Galerkin method and FEniCS for such applications.

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

mantle convection
fenics
advectiondiffusion
discontinuous galerkin


An application of the Kalman filtering technique for streamflow forecasting in the Upper Murray Basin In [1], the IHACRES rainfall-runoff model is calibrated for the purpose of predicting streamflow discharge in ten catchments of the Upper Murray Basin using a four-hourly time step. A map and description of the basin can be found in [1,2]. The major aim of the present paper is to describe the subsequent development and testing of a four-hourly time step how forecasting model which exploits the Kalman Filter (KF) algorithm to upgrade the IHACRES models from a simple predictive to a real-time forecasting capability. In [2], the IHACRES model and a self-adaptive filtering approach, based on the autoregressive integrated moving average (ARIMA) representation of the model residuals, were combined and utilized for forecasting daily streamflow in nine catchments of the Upper Murray Basin. Such linear filtering of the model residuals provided a considerable improvement in forecasting both low and high values of streamflow. A KF forecasting algorithm, incorporating the subdaily Upper Murray Basin IHACRES model, has been used in this second stage of the project as a tool for operational streamflow forecasting because it provides a more flexible approach and yields even better results (in terms of Nash-Sutcliffe efficiency statistics [3] and relative errors) than the ARIMA linear filtering approach. (C) 2001 Elsevier Science Ltd. All rights reserved.

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

streamflow forecasting
kalman filtering
the upper murray basin


real world teleconferencing We describe a prototype Augmented Reality conferencing application which uses the overlay of virtual images on the real world to facilitate computer supported collaborative work. Remote collaborators are represented as live video images or virtual avatars which are attached to tangible objects that can be freely positioned about a user in space. The use of augmented reality overcomes some of the limitations associated with traditional video conferencing and allows the user to conference from anywhere in their physical environment.

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


SafeNet: A methodology for integrating general-purpose unsafe devices in safe-robot rehabilitation systems Robot-assisted neurorehabilitation often involves networked systems of sensors (sensory rooms) and powerful devices in physical interaction with weak users. Safety is unquestionably a primary concern. Some lightweight robot platforms and devices designed on purpose include safety properties using redundant sensors or intrinsic safety design (e.g. compliance and backdrivability, limited exchange of energy). Nonetheless, the entire sensory room shall be required to be fail-safe and safely monitored as a system at large. Yet, sensor capabilities and control algorithms used in functional therapies require, in general, frequent updates or re-configurations, making a safety-grade release of such devices hardly sustainable in cost-effectiveness and development time. As such, promising integrated platforms for human-in-the-loop therapies could not find clinical application and manufacturing support because of lacking in the maintenance of global fail-safe properties. Under the general context of cross-machinery safety standards, the paper presents a methodology called SafeNet for helping in extending the safety rate of Human Robot Interaction (HRI) systems using unsafe components, including sensors and controllers. SafeNet considers, in fact, the robotic system as a device at large and applies the principles of functional safety (as in ISO 13489-1) through a set of architectural procedures and implementation rules. The enabled capability of monitoring a network of unsafe devices through redundant computational nodes, allows the usage of any custom sensors and algorithms, usually planned and assembled at therapy planning-time rather than at platform design-time. A case study is presented with an actual implementation of the proposed methodology. A specific architectural solution is applied to an example of robot-assisted upper-limb rehabilitation with online motion tracking.

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

robot systems safety
robot-assisted rehabilitation
network controlled system
system engineering
iso 13489-1


Lack of invariant property of the Erlang loss model in case of MAP input The BMAP/PH/N/ model with three different disciplines of admission (partial admission, complete rejection, complete admission) is investigated. Loss probability is calculated. Impact of the admission discipline, variation and correlation coefficients of inter-arrival times distribution, and variation of service times distribution on loss probability is analyzed numerically. As by-product, it is shown by means of numerical results that the invariant property of the famous Erlang M/G/N/0 system, which was proven by B. A. Sevastjanov, is absent in case of the MAP input.

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

bmap/ph/n/0 queueing model
stationary state distribution


Symbolic computation and new families of exact travelling solutions for the Kawahara and modified Kawahara equations In this paper, we consider the nonlinear evolution equations such as Kawahara equation and modified Kawahara equation. By using the tanh method and an exp-function method, the travelling wave solutions for the these equations are presented. New exact travelling solutions are explicitly obtained with the aid of symbolic computation. The obtained solutions include compactons, solitons, solitary patterns and periodic solutions.

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

traveling wave solutions
exponential rational function method
modified kawahara equation


Detection of substitution-based linguistic steganography by relative frequency analysis Linguistic steganography hides information in natural language texts. Because of the increasing in importance and quantity of natural language texts, linguistic steganography plays a more and more important role in Information Security (IS) area today. Substitution-based linguistic steganography is one of the most commonly used linguistic steganography methods, which is of considerable security and favorable simpleness. In this paper, we propose a straightforward method based on Relative Frequency Analysis (RFA), which makes use of the frequency characteristics of the testing texts (the texts being tested), to detect substitution-based linguistic steganography. We formally prove several properties about relative frequency which can be used in the detection process and propose a detection scheme. And then as an example, an existent synonym-substitution system T-Lex is examined and the detection experiment is carried out. In the experiment with pure literature texts, the accuracy, precision and recall of the detection are found to be as high as 98.64%, 97.77% and 99.55%, respectively, when the substitution count is 90, while in the experiment with balanced texts, the highest detection accuracy is 95%, which indicates that the detection scheme is promising.

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

linguistic steganography
relative frequency analysis
detection

information hiding
substitution-based
synonym-substitution


Cognitive mismatches in the cockpit: Will they ever be a thing of the past? Changes in aviation over the last 30 years have dramatically affected the way that flight crews fly aircraft. The implementation and evolution of the glass cockpit, however, has happened in an almost ad hoc fashion, meaning that it does not always properly support the flight crew in carrying out their tasks. In such situations, the crew's mental model of what is happening does not always match the real state of affairs. In other words, there is a cognitive mismatch. An initial taxonomy of cognitive mismatches is defined, and the problem illustrated using an example from an aviation accident. Consideration is then given to how cognitive mismatches can be managed. A call is made for the development of an integrated cockpit architecture that takes better account of human capabilities and allows for new developments to be added to the cockpit in a more seamless manner.

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

flight deck systems
humanmachine interaction


Generalized local and nonlocal master equations for some stochastic processes ? In this paper, we present a study on generalized local and nonlocal equations for some stochastic processes. By considering the net flux change in a region determined by the transition probability, we derive the master equation to describe the evolution of the probability density function. Some examples, such as classical FokkerPlanck equations, models for Lvy process, and stochastic coagulation equations, are provided as illustrations. A particular application is a consistent derivation of coupled dynamical systems for spatially inhomogeneous stochastic coagulation processes.

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

nonlocal flux
smoluchowski equation
conservation law
nonlocal diffusion
fractional diffusion


A fuzzy-neural and multiple-bucket approach for estimating lot cycle time in a wafer fab with dynamic product mix A fuzzy-neural and multiple-bucket approach is proposed in this study for lot cycle time estimation in a wafer fab with dynamic product mix, which was seldom thoroughly investigated in the past studies. The proposed methodology is composed of two parts. In the first part, the multiple-bucket approach is applied to consider the future release plan of the wafer fab. Subsequently, the FCM-FBPN approach is applied to estimate the cycle time of every lot in the wafer fab. The buckets obtained in the first part become additional inputs to the FBPN. In this way, the fluctuation in the product mix since the release of a wafer lot can be considered in estimating the cycle time of the wafer lot. According to experimental results, the estimation accuracy of the proposed methodology was significantly better than those of many existing approaches. Other findings include that a large number of buckets were beneficial to the estimation accuracy, and might not worsen the efficiency of the proposed methodology. (C) 2008 Elsevier Ltd. All rights reserved.

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

dynamic product mix
cycle time
wafer fab

fuzzy back propagation network
fuzzy c-means
bucket


Controller design wfth trajectory sensitivity minimization using LMI To design a controller with block-diagonal structure for trajectory sensitivity minimization, we propose a method based on LMI. In order to reduce the trajectory sensitivity, linear quadratic regulator theory is adopted, and this is solved using LMI optimization technique.

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


Enhanced sampling schemes for MCMC based blind BernoulliGaussian deconvolution This paper proposes and compares two new sampling schemes for sparse deconvolution using a BernoulliGaussian model. To tackle such a deconvolution problem in a blind and unsupervised context, the Markov Chain Monte Carlo (MCMC) framework is usually adopted, and the chosen sampling scheme is most often the Gibbs sampler. However, such a sampling scheme fails to explore the state space efficiently. Our first alternative, the K-tuple Gibbs sampler, is simply a grouped Gibbs sampler. The second one, called partially marginalized sampler, is obtained by integrating the Gaussian amplitudes out of the target distribution. While the mathematical validity of the first scheme is obvious as a particular instance of the Gibbs sampler, a more detailed analysis is provided to prove the validity of the second scheme. For both methods, optimized implementations are proposed in terms of computation and storage cost. Finally, simulation results validate both schemes as more efficient in terms of convergence time compared with the plain Gibbs sampler. Benchmark sequence simulations show that the partially marginalized sampler takes fewer iterations to converge than the K-tuple Gibbs sampler. However, its computation load per iteration grows almost quadratically with respect to the data length, while it only grows linearly for the K-tuple Gibbs sampler.

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

blind deconvolution
markov chain monte carlo methods


texture synthesis by interspersing patches in a chessboard pattern This paper presents a novel parallel algorithm to synthesize textures in patches. It decomposes the synthesis process into two steps by the chessboard pattern, with the first step to place patches in the black grids, and the second step to select suitable patches to fill the white grids, where a grid is in the same size of a patch. This way the placed patches in the first step have very weak constraints between them, and in the second step the selected patches are only dependent on their respective surrounding patches, according to the popularly used MRF model to guide texture synthesis. Thus, our proposed algorithm can run in parallel without a hierarchical structure and iterative computation that are always expensive and required in existing parallel synthesis algorithms. At the same time, we adopt a measure to generate patches that can well reflect the periodic feature variation in the sample texture, so as to have texture features transited consistently between neighboring patches for high-quality synthesis. The results show that our proposed algorithm greatly promotes texture synthesis, being able to real time produce large textures in high quality, e.g., generating a texture in 2048*2048 pixels at over 55 fps on a common personnel computer.

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


Simple current-mode analog multiplier, divider, square-rooter and squarer based on CDTAs In this paper, the design of simple analog current-mode multiplier, divider, square-rooter and squarer circuits using only two current differencing transconductance amplifiers (CDTAs) is proposed. With the selection of the applied input currents, the proposed circuit can perform four-quadrant current multiplication, division and current-controlled current amplification, without changing its configuration. Moreover, the current-mode square-rooter and squarer circuits can easily be obtained with the possibility of electronically transfer gain adjustment by slight modification of the proposed configuration. All the proposed circuits are insensitive to ambient temperature variations. Additionally, the CDTA non-ideality effects on the proposed circuits are also investigated and discussed. The performances of the realized circuits are examined by PSPICE simulations.

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

current differencing transconductance amplifier (cdta)


Expressing Adaptation Strategies Using Adaptation Patterns Today, there is a real challenge to enable personalized access to information. Several systems have been proposed to address this challenge including Adaptive Hypermedia Systems (AHSs). However, the specification of adaptation strategies remains a difficult task for creators of such systems. In this paper, we consider the problem of the definition of adaptation strategies at a high level. We present two main contributions: a typology of elementary adaptation patterns for the adaptive navigation; and a process to generate adaptation strategies based on the use and the semiautomatic combination of patterns. We also describe how the generated adaptation strategies can be integrated into existing AHSs. A prototype has been implemented and an experiment in the e-learning domain has been conducted with a group of volunteers. This experiment shows that our pattern-based approach for defining adaptation strategies is more suitable than those based on "traditional" AH languages.

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


Origins and uses of linear programming methods for treating L1 L 1 and L? L ? regressions: Corrections and comments on Castillo et al. (2008) This note comments on and corrects some of the referrals and comments of Castillo et al. [Castillo, E., Minguez, R., Castillo, C., Confino, A.S., 2008. Dealing with the multiplicity of solutions of the ?1 ? 1 and ?? ? ? regression models. European Journal of Operational Research 188, 460484] concerning the origins and uses of linear programming to estimate L1 L 1 and L? L ? statistical regressions.

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


Compensating effects of GSS on group performance A GSS often fails to aid in providing group consensus and user satisfaction. To understand the reasons behind this lack of impact, we investigated the issue from an influence-process perspective. The independent variables manipulated were support (GSS vs. face-to-face) and task type (intellective vs. preference). The dependent variables measured were three process variables (informational influence, normative influence, and influence distribution) and three outcome variables (group consensus, decision satisfaction, and decision process satisfaction). The findings suggest that the lack of impact of GSS on decision-making groups may be due to their compensating effects. With the preference task, the use of GSS led to a more even influence distribution; this should improve group decision outcomes. But the use of GSS was also found to attenuate normative influence; this should negatively affect group decision outcomes. For an intellective task, the use of GSS resulted in an uneven distribution of influence; this should negatively affect group decision outcomes. But the use of GSS also amplified informational influence; this should enhance group decision outcomes. Collectively, such compensating effects of a GSS may explain why a lack of GSS impact on group decision outcomes has been observed in many studies.

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

group support system
group decision process


polynomial-time algorithm for hilbert series of borel type ideals In this paper, it is shown that the Hilbert series of a Borel type ideal may be computed within a complexity which is polynomial in D n where n + 1 is the number of unknowns and D is the highest degree of a minimal generator of input (monomial) ideal.

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

gr&#246
bner bases
castelnuovo-mumford regularity
satiety


Satisfiability of algebraic circuits over sets of natural numbers We investigate the complexity of satisfiability problems for {?,?,?,+,} { ? , ? , ? , + , } -circuits computing sets of natural numbers. These problems are a natural generalization of membership problems for expressions and circuits studied by Stockmeyer and Meyer (1973) [10] and McKenzie and Wagner (2003) [8]. Our work shows that satisfiability problems capture a wide range of complexity classes such as NL, P, NP, PSPACE, and beyond. We show that in several cases, satisfiability problems are harder than membership problems. In particular, we prove that testing satisfiability for {?,+,} { ? , + , } -circuits is already undecidable. In contrast to this, the satisfiability for {?,+,} { ? , + , } -circuits is decidable in PSPACE.

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

computational complexity
combinatorial integer circuits


Content management in the SYNDIKATE system How technical documents are automatically transformed to text knowledge bases SYNDIKATE is a family of natural language understanding systems for automatically acquiring knowledge from real-world texts (e.g., information technology test reports, medical finding reports), and for transferring their content to formal representation structures which constitute a corresponding text knowledge base. We present a general system architecture which integrates requirements from the analysis of single sentences, as well as those of referentially linked sentences forming cohesive texts. Properly accounting for text cohesion phenomena is a prerequisite for the soundness and validity of the generated text representation structures. It is also crucial for any information system application making use of automatically generated text knowledge bases in a reliable way, e.g., by inferentially supported fact retrieval.

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

natural language processing
text understanding
knowledge acquisition from texts


Dynamic hierarchical triangulation of a clustered data stream ? This paper presents a novel approach to handle large amounts of geometric data. A data stream clustering is used to reduce the amount of data and build a hierarchy of clusters. The data stream concept allows for the processing of very large data sets. The cluster hierarchy is then used in a dynamic triangulation to create a multiresolution model. It allows for the interactive selection of a different level of detail in various parts of the data. A method for removal multiple points from Delaunay triangulation is proposed. It is significantly faster than the traditional approach. The clustering and the triangulation are supplemented by an elliptical metric to handle data with anisotropic properties. Compared to the closest competitive method by Isenburg et al., the presented algorithm requires only a single pass over the data and offers a high flexibility. These advantages culminate in a long running time. The method was tested on several large digital elevation maps. The clustering phase can take up to a few hours. Once the cluster hierarchy is built, the terrains can be efficiently manipulated in real time.

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

large data
data stream
dynamic triangulation
multiresolution
elliptical metric


lambda, the ultimate label or a simple optimizing compiler for scheme Optimizing compilers for higher-order languages need not be terribly complex. The problems created by non-local, non-global variables can be eliminated by allocating all such variables in the heap. Lambda lifting makes this practical by eliminating all non-local variables except for those that would have to be allocated in the heap anyway. The eliminated non-local variables become local variables that can be allocated in registers. Since calls to known procedures are just gotos that pass arguments, lifted lambda expressions are just assembly language labels that have been augmented by a list of symbolic names for the registers that are live at that label.

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

label
live
optimizing compiler
language
practical
scheme

variability order procedure express compilation assemblers complexity argument locality global


weighted finite automata encoding over thai language This research proposes a new method to encode and decode Thai language text with Weighted Finite Automata (WFA). To create a WFA for a Thai text file, the encoding process looks for the relations of every alphabet. Then, the relations of the alphabets are used for the creation of the transitions. The nodes of the automata are from the alphabets in the sentences. The experimental results show that the compression ratios are good for the large text files.

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

text
thai language
weighted finite automata


crash recovery in client-server exodus In this paper, we address the correctness and performance issues that arise when implementing logging and crash recovery in a page-server environment. The issues result from two characteristics of page-server systems: 1) the fact that data is modified and cached in client database buffers that are not accessible by the server, and 2) the performance and cost trade-offs that are inherent in a client-server environment. We describe a recovery system that we have implemented for the client-server version of the EXODUS storage manager. The implementation supports efficient buffer management policies, allows flexibility in the interaction between clients and the server, and reduces the server load by generating log records at clients. We also present a preliminary performance analysis of the implementation.

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

recovery log performance flexibility paper buffers management records interaction systems correctness storage implementation data version database server cost

paging
policy
efficiency
addressing
access
client-server
buffer management
environments
performance analysis


Novel fuzzy information proximity measures As a measure of information shared between two fuzzy pattern vectors, the fuzzy information proximity measure (FIPM) plays an important part in fuzzy pattern recognition, fuzzy clustering analysis and fuzzy approximate reasoning. In this paper, two novel FIPMs are set up. Firstly, an axiom theory about the FIPM is given, and different expressions of the FIPM are discussed. A new FIPM is then proposed based on the axiom theory of the FIPM and the concept of fuzzy subsethood function. Two concepts based on the idea of Shannon information entropy, fuzzy joint entropy (FJE) and fuzzy conditional entropy (FCE), are proposed and the basic properties of FJE and FCE are given and proved. Finally, classical similarity measures such as dissimilarity measure (DM) and similarity measure (SM) are studied, and two new measures, fuzzy absolute information measure (FAIM) and fuzzy relative information measure (FRIM), are set up, which can be used as measures of the proximity between fuzzy sets A and B.

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

fuzzy information proximity measure (fipm)

fuzzy absolute information measure (faim)

fuzzy relative information measure (frim)


Experimental and numerical study on onset of inflow in near field of buoyant jet at low Froude number In the present paper, the onset of inflow in the near field of a vertical buoyant jet issuing from a square duct is studied by experimental flow visualization and numerical simulation. The experimental critical condition for the onset of inflow is obtained from the scanning LIF visualization in the near field of the buoyant jet at various combinations of Froude numbers and Reynolds numbers. The experimental result shows that the critical Froude number increases with an increase in Reynolds number of the buoyant jet. The critical condition is also examined by numerical simulation based on the Navier-Stokes equation and energy conservation equation, under the assumption that the flow separation occurs at the duct exit. The main feature of the inflow observed by experiment is well reproduced in the numerical results.

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

flow visualization
buoyant jet
inflow
scanning lif
numerical simulation


Fair End-to-End Session Rates in Multihop Wireless Networks This paper considers a proportional fairness of end-to-end session rates in a multihop wireless network through the rate control framework. In multihop wireless networks, there are two classes of rate control problem. One focuses in optimizing the transmission attempt probabilities at the lower layers, but not the transmit powers while other problem is closely related to jointly optimal congestion control and power control. Proportional fairness is a fundamental concept in flow control problems. In this paper, we give in-depth analysis and show that the optimal solutions of these problems are proportionally fair provided that the objective functions are suitably chosen.

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

multihop
wireless networks
rate control
proportional fairness


Main degradation mechanism in AsTeGeSiN threshold switching devices AsTeGeSiN threshold switching devices which have recently been reported as reliable selectors in 3D memories are investigated in terms of the main degradation mechanism. The trap-limited conduction mechanism is also applicable to AsTeGeSiN threshold switching devices. This is verified by the conduction currents at various temperatures. Using the trap-limited conduction mechanism, it is revealed that the trap generations primarily occur during pulse cycling measurements. This is also verified using low-frequency noise measurements. The increased trap densities are directly related to low-frequency noise densities. Also, the speed of the current degradation is estimated using the number of pulse cycles. An increase in the current level by pulse cycles is harmful to the read margin of a selector in 3D memories. Because of this effect, the block size of the 3D memory architecture is limited by suitable reading operation. For example, the maximum block size after 104 pulse cycles is reduced by almost 1/4 times than that before giving the pulse cycles for reliable operation. This degradation is a limiting factor for high-density 3D memories with AsTeGeSiN threshold switching devices as a selector. 2015 Elsevier Science Ltd. All rights reserved.

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

astegesin threshold switching devices
pulse cycling measurements
3d memory architecture


Numerical solution of hybrid fuzzy differential equation IVPs by a characterization theorem In this paper, we study hybrid fuzzy differential equation initial value problems (IVPs). We consider the problem of finding their numerical solutions by using a recent characterization theorem of Bede for fuzzy differential equations. We prove a corollary to Bedes characterization theorem and give a characterization theorem for hybrid fuzzy differential equation IVPs. Then we prove that any suitable numerical method for ODEs can be applied piecewise to numerically solve hybrid fuzzy differential equation IVPs. Numerical examples are provided which connect the new results with previous findings.

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

initial value problem
hybrid systems
euler method
rungekutta method
improved euler method


Efficient algorithms for spatial configuration information retrieval The problem of spatial configuration information retrieval is a constraint satisfaction problem (CSP), which can be solved using traditional CSP algorithms. But the spatial data can be reorganized using index techniques like R-tree and the spatial data are approximated by their minimum bounding rectangles (MBRs), so the spatial configuration information retrieval is actually based on the MBRs and some special techniques can be studied. This paper studies the mapping relationships among the spatial relations for real spatial objects, the corresponding spatial relations for their MBRs and the corresponding spatial relations between the intermediate nodes and the MBRs in R-tree. Three algorithms are designed and studied, and their performances are compared.

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


Analytic-numerical solution with a priori error bounds for coupled time-dependent telegraph equations: Mixed problems This paper deals with the construction of analytic-numerical approximations with A priori error bounds for coupled telegraph mixed systems of the form u(tt) + C(t)u(t) + B(t)u = A(t)u(xx), 0 0,u(0, t) = u(d,t) = 0, u(x, 0) = f(x),u(t)(x, 0) = g(x), 0 less than or equal to x less than or equal to d. After truncation of an exact series solution and the study of the growth of solutions of certain parametric matrix equations, the following question is addressed: given epsilon > 0 and b > 0, how do we construct an analytic-numerical approximation so that the error with respect to the exact series solution is less than epsilon uniformly in D(b) = ((x, t); 0 less than or equal to x less than or equal to d, 0 less than or equal to t less than or equal to b}. (C) 1999 Elsevier Science Ltd. All rights reserved.

coupled time dependent telegraph system
mixed problem
accurate solution
a priori error bound
matrix equation


virtual reality in kbs tv Numerous TV programs have been produced using the virtual reality (VR) technology in Korean Broadcasting System (KBS). A brief history of VR in KBS TV is introduced, with a few current research issues.

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


Publication activity, citation impact and bi-directional links between publications and patents in biotechnology The study focuses on publication activity, citation impact and citation links between publications and patents in biotechnology. The European Union (EU), US, Japan and China are the most important global players. However, the landscape is changing since the EU and the US are losing ground because of challenges from a group of emerging economies. National profiles differ between the two groups of main players and upcoming countries; the focus on red biotechnology in the US and Europe is contrasted by propensity for white and green technology in Asia. Furthermore, the subject profile of biotechnology papers citing patents and cited by patents as well as the relationship between patent citations and citation impact in scientific literature is explored. Papers that cite patents tend to reflect propensity towards white biotechnology while patent-cited publications have a higher relative share in red biotechnology. No significant difference concerning the citation impact of publications citing patents and not citing patents can be found. This is contrasted by the observation that patent-cited papers perform distinctly better in terms of standard bibliometric indicators than comparable publications that are not linked to technology in this direction.

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

biotechnology
publication activity
citation impact

international collaboration
patent citation
sciencetechnology linkage


Simulation of automated guided vehicle (AGV) systems based on just-in-time (JIT) philosophy in a job-shop environment Automated Guided Vehicle (AGV) systems have been frequently used as material handling equipment in manufacturing systems since the last two decades. The use of AGV systems has taken attention of practitioners and researchers. Although there are numerous studies concerning with AGV systems in literature, a few of them deal with the adaptation of these systems into JIT systems. Moreover, the facility layouts considered in those studies have flow-shop environment. In this paper, a simulation model of a hypothetical system which has a job shop environment and which is based on JIT philosophy was developed. In addition, a dispatching algorithm for vehicles moving through stations was presented in order to improve transportation efficiency. In given layout, multiple vehicles can move and their bi-directional flow is allowed. After the model had been established, it was mentioned how to perform simulation output analysis. The factors which may be important for the system were determined by output analysis. An experiment plan was prepared by taking into account these factors. In this plan, two levels were selected for each factor and an experimental design was conducted. The effect of each factor on each performance measure and the interaction of these factors were examined.

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

agv systems
jit
simulation
experimental design


Method integration with formal description techniques Formal description techniques (FDTs) such as VDM, Z, LOTOS, etc are powerful to develop safety-critical systems since they have strict semantics and mathematical reasoning basis. However, they have no methods or guides how to construct specifications unlike specification and design methods such as Object-Oriented Modeling and Technique (OMT), and that makes it difficult for practitioners to compose formal specifications. One of the solutions is to connect formal description techniques with some existing methods. This paper discusses a technique how to integrate FDTs with specification and design methods such as OMT so that we can have new methods to support writing formal specifications. The integration mechanism is based on transformation rules of specification documents produced following methods into the descriptions written in formal description techniques. The transformation rules specify the correspondences on two meta models; of methods and of formal description techniques, and are described as graph rewriting rules. As an example, we pick up OMT as a method and LOTOS as a FDT and define the transformation rule on their meta models.

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

method integration
specification and design methods
lotos
omt


design and experimental evaluation of multi-user beamforming in wireless lans Multi-User MIMO promises to increase the spectral efficiency of next generation wireless systems and is currently being incorporated in future industry standards. Although a significant amount of research has focused on theoretical capacity analysis, little is known about the performance of such systems in practice. In this paper, we present the design and implementation of the first multi-user beamforming system and experimental framework for wireless LANs. Using extensive measurements in an indoor environment, we evaluate the impact of receiver separation distance, outdated channel information due to mobility and environmental variation, and the potential for increasing spatial reuse. For the measured indoor environment, our results reveal that two receivers achieve close to maximum performance with a minimum separation distance of a quarter of a wavelength. We also show that the required channel information update rate is dependent on environmental variation and user mobility as well as a per-link SNR requirement. Assuming that a link can tolerate an SNR decrease of 3 dB, the required channel update rate is equal to 100 and 10 ms for non-mobile receivers and mobile receivers with a pedestrian speed of 3 mph respectively. Our results also show that spatial reuse can be increased by efficiently eliminating interference at any desired location; however, this may come at the expense of a significant drop in the quality of the served users.

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

channel information
mobility
beamforming

multi-user mimo
interference suppression
wireless lan


Neuronal nicotinic receptor agonists: a multi-approach development of the pharmacophore Based on the results obtained with different automated computational approaches as applied to the study of eleven high-affinity agonists of the neuronal nicotine acetylcholine receptor (nAChR), belonging to different chemical classes, new relevant features were detected which complement the existing pharmacophores. Convergent results from DISCO Distance Comparison), QXP (Quick Explore), Catalyst/HipHop, and MIPSIM (Molecular Interaction Potential Similarity) allowed us to identify and locate, in a well defined spatial arrangement, three geometrically independent key structural features: (i) a positively charged nitrogen atom for ionic or hydrogen bond interactions, (ii) a lone pair of the pyridine nitrogen or a specific lone pair of a carbonyl oxygen, as a hydrogen bond acceptor, and (iii) a centre of a hydrophobic area generally occupied by aliphatic cycles. The pharmacophore presented herein, along with predictive 2D and 3D QSAR models recently developed in our group, could represent valuable computational tools for the design of new nAChR agonists having therapeutical potential.

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

catalyst
comfa
nicotinic agonists
pharmacophore model


Cooperative radio resource management framework for future IP-based multiple radio access technologies environment Heterogeneity and convergence are two distinctive connotations of future wireless networks emanated from International Telecommunications Union (ITU)s vision of Optimally Connected, Anywhere, Anytime. Multiple access networks, multiple terminals and multiple services are expected to converge in a manner where heterogeneity can be exploited to realize this ultimate goal. This raises the importance of radio resource management (RRM) for a multiple radio access technologies (multi-RAT) environment, where coalitions of heterogeneous access networks are each connected to a common Internet Protocol (IP)-based core network. In this article, we develop a cooperative RRM framework for future IP-based multi-RAT environment to coordinate better utilization of radio resources in an opportunistic yet altruistic manner. We motivate the importance of cooperation which can exploit heterogeneity as an enabler to improve system capacity and quality of service (QoS) of users. We exemplify the proof of concept based on a heterogeneous multiple access points (multi-AP) wireless local area network (WLAN) and argue that our technology agnostic approach is readily applicable to future IP-based multi-RAT environment. We demonstrate that our cooperative RRM framework benefits from the unified actions of joint optimization and results in a QoS-balanced system by enabling different functional entities to form synergies and multiple access networks to interact. We further show that a QoS-balanced system has salient traits of providing statistical QoS guarantee to support demanding multimedia applications while maximizing overall system capacity. Consequently, we advocate the notion of QoS balancing as criterion to quantify the state of balance in future IP-based multi-RAT environment.

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

radio resource management
cooperation
qos balancing
wlan


Some Comments on Big Data and Data Science Based on previous paper titled in Data, DIKW, Big data and Data science presented in ITQM2014 and published in Procedia Computer Science we will make some modifications. We discuss the relationship between data and datainformationknowledgewisdom. Now the big data occupies much attention in some extent for his volume, velocity, and variety. But in practical use the value plays more important role. Finally to judge the value for data not necessary for big, in some cases the small data also may lead to big value. So we appreciate the data science, which may consider more inherent value from data. We will make some comments on the big data and data science from another angle.

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


Enterprise Resource Planning systems: An assessment of applicability to Make-To-Order companies Many vendors of Enterprise Resource Planning (ERP) systems claim their products are widely applicable-configurable to meet the needs of any business, whatever the product or service offering. But Make-To-Order (MTO) companies, which produce high-variety and bespoke products, have particularly challenging decision support requirements and it remains unclear whether ERP systems can meet their needs. This paper takes a contingency-based perspective of ERP adoption, assessing the fit or alignment between ERP functionality and a MTO production strategy. MTO features considered include: decision support requirements at critical Production Planning and Control (PPC) stages, idiosyncratic market-related features, typical company size and supply chain positioning, and shop floor configuration. It finds a substantial gap or misalignment between ERP functionality and MTO requirements; for example, between decision support provided by ERP systems and the decision support required by MTO companies at the customer enquiry and design & engineering stages. A research agenda for improving alignment is outlined, with implications for academics, MTO managers and ERP software developers. This includes: developing decision support tools that reflect the customer enquiry management activities of MTO companies; embedding MTO-relevant PPC concepts within ERP systems; and, conducting an in-depth empirical study into applications of ERP systems in MTO companies, assessing their performance impact. (C) 2012 Published by Elsevier B.V.

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

enterprise resource planning (erp)
make-to-order (mto)
literature review


mining advisor-advisee relationships from research publication networks Information network contains abundant knowledge about relationships among people or entities. Unfortunately, such kind of knowledge is often hidden in a network where different kinds of relationships are not explicitly categorized. For example, in a research publication network, the advisor-advisee relationships among researchers are hidden in the coauthor network. Discovery of those relationships can benefit many interesting applications such as expert finding and research community analysis. In this paper, we take a computer science bibliographic network as an example, to analyze the roles of authors and to discover the likely advisor-advisee relationships. In particular, we propose a time-constrained probabilistic factor graph model (TPFG), which takes a research publication network as input and models the advisor-advisee relationship mining problem using a jointly likelihood objective function. We further design an efficient learning algorithm to optimize the objective function. Based on that our model suggests and ranks probable advisors for every author. Experimental results show that the proposed approach infer advisor-advisee relationships efficiently and achieves a state-of-the-art accuracy (80-90\%). We also apply the discovered advisor-advisee relationships to bole search, a specific expert finding task and empirical study shows that the search performance can be effectively improved (+4.09\% by NDCG@5).

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

advisor-advisee prediction
time-constrained factor graph


An improved algorithm for the distance constrained p-center location problem with mutual communication on tree networks In a recent article Averbakh and Berman present an O(p(3)root(log log p)(log p) + n(2)) serial algorithm to solve the distance constrained p-center location problem with mutual communication on a tree network with n nodes. In this note we suggest two simple modifications leading to the improved (subquadratic in n), O(p(3)root(log log p)(log p) + p(n + p)log(2)(n + p)) complexity bound. We also present a new O(p(2)n log n log(n + p)) algorithm for the discrete version of this problem. (C) 2004 Wiley Periodicals, Inc.

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


MIXING DOUBLY STOCHASTIC QUANTUM CHANNELS WITH THE COMPLETELY DEPOLARIZING CHANNEL It is proved that every double stochastic quantum channel that is properly averaged with the completely depolarizing channel can be written as a convex combination of unitary channels. It follows that within the space of doubly stochastic quantum channels, there is a ball with positive radius around the completely depolarizing channel within which all channels are convex combinations of unitary channels.

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

random unitary channels
mixed unitary channels
theory of quantum information


Exact Cochran-Armitage trend tests: comparisons under different models Exact methods for small-sample dose-response analyses with binary outcome have been rapidly developed in recent years. For exact conditional approach, nuisance parameters ( e.g . the intercept) are eliminated by conditioning on their reduced sufficient statistics ( e.g . marginal row totals for the intercept under the logit link). For exact unconditional approach, nuisance parameters, on the other hand, are eliminated by using the 'worst-case scenario. For instance, the p -value is the tail probability maximized overall possible values for the nuisance parameters. The performance of exact conditional and unconditional approaches on more general models including logit, probit, one-hit, and extreme-value are investigated here. Comparisons are conducted using the well-known Cochran-Armitage (C-A) trend test under different model specifications. Our simple empirical studies clearly show that the exact conditional approach is generally inferior to the exact unconditional approach with respect to actual significance level and exact power. When sample sizes are small or control group response probabilities are extreme ( i.e . close to 0 or 1), the exact conditional C-A trend test could be significantly conservative and less powerful than the exact unconditional C-A trend test even under the popular logit model. For moderate sample size, we also observe substantial exact power loss for the exact conditional approach under models other than logit model. We demonstrate our findings with a real data set from a toxicological study.

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

exact conditional approach
exact unconditional approach
trend test


Interval-Valued Multiplicative Intuitionistic Fuzzy Preference Relations Inspired by the idea of multiplicative intuitionistic preference relation (Xia MM et al. Preference relations based on intuitionistic multiplicative information, IEEE Transactions on Fuzzy Systems, 2013, 21(1): 113-133), in this paper, a new preference relation called the interval-valued multiplicative intuitionistic preference relation is developed. It is analyzed the basic operations for interval-valued multiplicative intuitionistic preference information and its aggregation techniques. An interval-valued multiplicative intuitionistic group decision making model is presented in which experts provide their preference relation by interval-valued multiplicative intuitionistic fuzzy expressions, and give a real case about talent introduction in Zhejiang University of Finance and Economics to illustrate our methods.

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

preference relation
group decision making

aggregation operator
intuitionistic fuzzy set


Mixed reality web service platform This paper presents a RESTful Web service platform for applications for both Web browsers and mobile clients. Having a common service backend makes creating applications fast, simple, and open to third parties. The paper presents two mixed reality applications that have been built on the platform. It summarizes requirements for a mixed reality platform and defines a mixed reality domain model that the platform and applications share. In addition, it describes how the clients can use the REST interface to perform operations on user-generated content, as well as access real-life commercial geo-content such as street-view panoramas and building models.

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


FETI-based algorithms for modelling of fibrous composite materials with debonding We show how we can exploit our recently proposed algorithms for the solution of contact problem of elasticity to the 2D analysis of the interfacial debonding of samples that consist of several fibres embedded in a homogeneous matrix, aligned in the longitudinal direction. The performance of the algorithm is demonstrated on analysis of deformations of samples of the fibrous composite material. (C) 2007 IMACS. Published by Elsevier B.V. All rights reserved.

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

fibrous composites
domain decomposition
contact problems


Computing transformation matrix for bilinear S-Z transformation Due to its importance in engineering applications, the bilinear transformation has been studied in many literature. In this letter two new algorithms are presented to compute transformation matrix for the bilinear s-z transformation.

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

transformation matrix
bilinear transformation


an analytical model to estimate path duration in manets Mobile Ad Hoc Networks (MANETs) are strongly impacted by the mobility of the ad hoc nodes. Mobility models help engineers to abstract the changes of position in network users. Different mobility models have already been proposed to characterize the behaviors of mobile devices that are greatly correlated to the conditions of the possible scenarios where networks can be deployed. In the context of mobile ad hoc networks, the Random WayPoint model has received significant attention and it has become one of the most employed mobility patterns. However, a formal description of the time during which a generic N -hop path is valid has not been proposed yet for this model. In this paper, the authors provide an analytical model for link duration as well as an analytical study of path duration in multi-hop wireless networks. The predicted results are compared with measured data and good agreement is reported.

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

random waypoint
path duration
link duration


A non-local approach for image super-resolution using intermodality priors ? Image enhancement is of great importance in medical imaging where image resolution remains a crucial point in many image analysis algorithms. In this paper, we investigate brain hallucination (Rousseau, 2008), or generating a high-resolution brain image from an input low-resolution image, with the help of another high-resolution brain image. We propose an approach for image super-resolution by using anatomical intermodality priors from a reference image. Contrary to interpolation techniques, in order to be able to recover fine details in images, the reconstruction process is based on a physical model of image acquisition. Another contribution to this inverse problem is a new regularization approach that uses an example-based framework integrating non-local similarity constraints to handle in a better way repetitive structures and texture. The effectiveness of our approach is demonstrated by experiments on realistic Brainweb Magnetic Resonance images and on clinical images from ADNI, generating automatically high-quality brain images from low-resolution input.

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


On the ergodic capacity of rank-1 Ricean-fading MIMO channels This paper investigates the ergodic capacity of Ricean-fading multiple-input-multiple-output (MIMO) channels with rank-1 mean matrices under the assumption that the channel is unknown at the transmitter and perfectly known at the receiver. After introducing the system model and the concept of ergodic capacity of MIMO channels, we derive the explicit expressions for the expected values of the determinant and log-determinant of complex noncentral Wishart matrices. Subsequently, we obtain new upper and lower bounds on the ergodic capacity of rank-1 Ricean-fading MIMO channels at any signal-to-noise ratio (SNR). We show that our bounds are tighter than previously reported analytical bounds, and discuss the impact of spatial fading correlation and Ricean K-factor with the help of these bounds. Furthermore, we extend the analysis of ergodic capacity to frequency selective spatially correlated Ricean-fading MIMO channels. We demonstrate that the calculation of ergodic capacity of frequency selective fading MIMO channels can be converted to the calculation of the one of equivalent frequency flat-fading MIMO channels. Finally, we present numerical results that confirm the theoretical analysis.

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

ergodic capacity
spatial fading correlation

bartlett's decomposition
multiple-input-multiple-output (mimo)
ricean fading


B-spline backstepping control with derivative matrix estimation and its applications A B-spline backstepping controller is proposed for a class of multiple-input multiple-output (MIMO) nonlinear systems. The control scheme incorporates the backstepping design technique with a B-spline neural network which is utilized to estimate the system dynamics. The B-spline neural network has the advantage of locally controlling its output behavior compared with other neural networks; therefore, it is very suitable to online estimate the system dynamics by tuning its interior parameters, including control points and knot points. Based on the mean-value theorem, the derivative of B-spline basis functions in relation to parameters can be estimated to online adjust these parameters. In addition, the validity of the proposed scheme is verified through an experiment on a servo motor system which is controlled by the output voltage of the Buck DCDC converter.

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


Query indexing with containment-encoded intervals for efficient stream processing Many continual range queries can be issued against data streams. To efficiently evaluate continual queries against a stream, a main memory-based query index with a small storage cost and a fast search time is needed, especially if the stream is rapid. In this paper, we study a CEI-based query index that meets both criteria for efficient processing of continual interval queries. This new query index is an indirect indexing approach. It centres around a set of predefined virtual containment-encoded intervals, or CEIs. The CEIs are used to first decompose query intervals and then perform efficient search operations. The CEIs are defined and labeled such that containment relationships among them are encoded in their IDs. The containment encoding makes decomposition and search operations efficient; from the encoding of the smallest CEI containing a data point, the encodings of other containing CEIs can be easily derived. Closed-form formulae for the bounds of the average index storage cost are derived. Simulations are conducted to evaluate the effectiveness of the CEI-based query index and to compare it with alternative approaches. The results show that the CEI-based query index significantly outperforms existing approaches in terms of both storage cost and search time.

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

continual queries
data streams
query indexing
range queries
stream processing


Effects of 15-Deoxy-?12,14-prostaglandin J2 on the Expression of p53 in MCF-7 Cells Cyclopentenone prostaglandins (cyPGs) exert diverse cellular functions, such as anti-inflammatory and cytoprotective effects, via multiple mechanisms. CyPGs, especially those of the A and J series, are characterized by the presence of a chemically reactive ?,?-unsaturated carbonyl group. 15-Deoxy-?12,14-prostaglandin J2 (15d-PGJ2), a representative cyPG of the J series, has been reported to directly inhibit the activity of redox-sensitive transcription factors, such as activator protein-1 and nuclear factor-?B. In the present study, we examined the effects of 15d-PGJ2 on activation of p53 tumor suppressor in human breast cancer (MCF-7) cells. MCF-7 cells treated with 15d-PGJ2 exhibited elevated p53 protein expression in time- and concentration-related manners, whereas prostaglandin A2 (PGA2) and the nonprostaglandin derivative 2-cyclopenten-1-one exerted an effect to a lesser extent than did 15d-PGJ2. In addition, MCF-7 cells exposed to 15d-PGJ2 significantly accumulated p53 in both cytosolic and nuclear fractions. Despite the elevated levels of p53, its DNA-binding activity was reduced in 15d-PGJ2-treated MCF-7 cells. Moreover, isolated MCF-7 nuclear extracts directly treated with 15d-PGJ2 exhibite diminished DNA-binding ability of p53, while the same concentration of PGA2 or 2-cyclopenten-1-one was much less inhibitory. Thus, the electrophilic carbon center located in the ?,?-unsaturated carbonyl moiety of the cyclopentenone ring might be critical for the control of DNA-binding activity as well as cellular levels of p53 by 15d-PGJ2.

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

15-deoxy-?12
14-prostaglandin j2
human breast cancer cells
mcf-7 cells


operational specification languages The operational approach to software development is based on separation of problem-oriented and implementation-oriented concerns, and features executable specifications and transformational implementation. Operational specification languages are executable specification languages designed to fit the goals, assumptions, and strategies of the operational approach. This paper defines the operational approach and surveys the existing operational specification languages, viz., the graphic notation of the Jackson System Development method, PAISLey, Gist, and modern applicative languages.

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

fit
strategies
method
goals
software development
implementation
paper
system development

survey
language
specification language
graphics
feature


Existence and global exponential stability of equilibrium for discrete-time fuzzy BAM neural networks with variable delays and impulses In this paper, we study a class of discrete-time fuzzy BAM neural networks with variable delays and impulses. Based on M-matrix theory and analytic methods, some sufficient conditions are established for the existence and global exponential stability of a unique equilibrium. Moreover, the exponential convergence rate index is estimated. A numerical example is given to show the effectiveness of the obtained results. In particular, the simulation figures establish that fuzzy systems do have more advantages than non-fuzzy systems. (C) 2012 Elsevier B.V. All rights reserved.

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

discrete-time fuzzy bam neural networks
equilibrium point


Probabilistic and other neural nets in multi-hole probe calibration and flow angularity pattern recognition The use of probabilistic (PNN) and multilayer feedforward (MLFNN) neural networks is investigated for the calibration of multi-hole pressure probes and the prediction of associated flow angularity patterns in test flow fields. Both types of network are studied in detail for their calibration and prediction characteristics. The current formalism can be applied to any multi hole probe, however the test results for the most commonly used five-hole Cone and Prism probe types alone are reported in 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

calibration wind tunnel
fluid dynamics
multi-hole probes
numerical simulation
probabilistic neural nets


does cognitive style affect student performance on a web-based course? A lot of research has been carried out to assess web-based courses. In many studies the concern has been the students' satisfaction and achievement in web-based courses and traditional face-to-face courses, and the comparison between the two. Other studies have focused on the development of web-based courses to meet the requirements of educational institutes. Studies about students' cognitive styles may be important for the designers of web-based courses because of the potential to enhance learning. However, the relationship between the students' cognitive styles and their satisfaction and achievement has not been researched fully and the implications are inconclusive. The aim of this study is to investigate the relationship between students' cognitive styles, their satisfaction, achievement, and their way of using a web-based course. Cognitive Styles Analysis (CSA) by Riding and Rayner [11] was selected as the instrument to determine whether students were field-dependent or field-independent. Students' attitudes toward using WebCT (Web Course Tools) were measured by a questionnaire specially designed for this intention. Students' activities on WebCT were observed through the tracking system which provided information about students' use of every tool and page on WebCT. The study does not provide data to support a relation between students' cognitive style and their use of online learning environments such as WebCT. However cognitive style seems to have an effect on student achievements.

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

web-based learning
students' performance


User acceptance of multi-criteria decision support systems: The impact of preference elicitation techniques Previous research indicates that decision makers are often reluctant to use potentially beneficial multi-criteria decision support systems (MCDSS). Prior research has not examined the specific impact of preference elicitation techniques on user acceptance of MCDSS. The present research begins to fill this gap by examining the effect on users MCDSS evaluations of two commonly used preference elicitation techniques, absolute measurement and pairwise comparisons, while holding constant all other aspects of the MCDSS and decision making task. Experimental results (N=153) indicate that users consider MCDSS with pairwise comparisons to be higher in decisional conflict, more effortful, less accurate, and overall less desirable to use than MCDSS with absolute measurements. Thus, any potential normative superiority of a preference elicitation technique must be balanced against its potentially adverse effects on user acceptance of the MCDSS within which it is employed. We present a research agenda for exploring the tradeoffs between objective validity and user acceptance in the design of decision analysis tools.

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

decision support systems
preference elicitation techniques
decisional conflict

multiple criteria analysis
effort-accuracy framework


an intelligent technique to detect file formats and e-mail spam With the everyday increasing importance of privacy, security, and wise use of computational resources, the corresponding technologies are increasingly being faced with the problem of file type detection. In digital forensic, there are numerous file formats in use. Criminals have started using either non-standard file formats or changing extensions of files while storing or transmitting them over a network. This makes recovering data out of these files difficult. An extension to the file name with the file type is stored in the disk directory, but when a file is deleted, the entry for the file in the directory may be overwritten and hence quite difficult to identify its type which is serious issue in computer forensics. But if the fragment of file has its header information containing type identifying information the mentioned problem may be solved. But it is difficult to identify the type of fragment from the middle or if the header information is deleted or unavailable the identification becomes more complex. This paper focuses on identifying the file types addressing the various scenarios of file type being changed by the malicious user to send some confidential or sensitive information by changing the file type (say.exe banned by Gmail can be converted to any acceptable format and sent across). E-mail spam has become an epidemic problem that can negatively affect the usability of electronic mail as a communication means. Besides wasting users' time and effort to scan and delete the massive amount of junk e-mails received, it consumes network bandwidth and storage space, slows down email servers, and provides a medium to distribute harmful and/or offensive content. Inspired by the success of fuzzy similarity in text classification and document retrieval, the approach investigates its effectiveness in filtering spam based on the textual content of e-mail messages.

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

membership degree
digital forensics
fileprints
file structure
validation
signature


Vulnerability analysis of RFID protocols for tag ownership transfer In RFIDSec08, Song proposed an ownership transfer scheme, which consists of an ownership transfer protocol and a secret update protocol [7]. The ownership transfer protocol is completely based on a mutual authentication protocol proposed in WiSec08 [8]. In Rizomiliotis et al. (2009) [6], van Deursen and Radomirovic (2008), the first weaknesses to be identified (tag and server impersonation) were addressed and this paper completes the consideration of them all. We find that the mutual authentication protocol, and therefore the ownership transfer protocol, possesses certain weaknesses related to most of the security properties initially required in protocol design: tag information leakage, tag location tracking, and forward traceability. Moreover, the secret update protocol is not immune to de-synchronization attacks.

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


Shape functions for velocity interpolation in general hexahedral cells Numerical methods for grids with irregular cells require discrete shape functions to approximate the distribution of quantities across cells. For control-volume mixed finite-element (CVMFE) methods, vector shape functions approximate velocities and vector test functions enforce a discrete form of Darcy's law. In this paper, a new vector shape function is developed for use with irregular, hexahedral cells (trilinear images of cubes). It interpolates velocities and fluxes quadratically, because as shown here, the usual Piola-transformed shape functions, which interpolate linearly, cannot match uniform flow on general hexahedral cells. Truncation-error estimates for the shape function are demonstrated. CVMFE simulations of uniform and non-uniform flow with irregular meshes show first- and second-order convergence of fluxes in the L-2 norm in the presence and absence of singularities, respectively.

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

control-volume method
cvmfe method
distorted grid
hexahedral grid
local darcy law
local mass conservation
mixed method
piola transformation
3-d


A novel method for real parameter optimization based on Gene Expression Programming ? Gene Expression Programming (GEP) is a new technique of evolutionary algorithm that implements genome/phoneme representation in computing programs. Due to its power in global search, it is widely applied in symbolic regression. However, little work has been done to apply it to real parameter optimization yet. This paper proposes a real parameter optimization method named Uniform-Constants based GEP (UC-GEP). In UC-GEP, the constant domain directly participates in the evolution. Our research conducted extensive experiments over nine benchmark functions from the IEEE Congress on Evolutionary Computation 2005 and compared the results to three other algorithms namely Meta-Constants based GEP (MC-GEP), Meta-Uniform-Constants based GEP (MUC-GEP), and the Floating Point Genetic Algorithm (FP-GA). For simplicity, all GEP methods adopt a one-tier index gene structure. The results demonstrate the optimal performance of our UC-GEP in solving multimodal problems and show that at least one GEP method outperforms FP-GA on all test functions with higher computational complexity.

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

gene expression programming
real parameter optimization


The geometric stiffness of triangular composite-materials shell elements This paper is concerned with the development of the geometric stiffness matrix for Newton type large rotation analysis of composite thin shell structures. The geometric stiffness matrix is derived from load perturbation of the discrete equilibrium equations of a given linear finite element formulation. The geometric stiffness matrix is extracted from the gradient, in global coordinates, of the element nodal force vector when stresses are kept fixed. In order to overcome the difficulties in taking derivatives of the rotation matrix with respect to the nodal coordinates, gradient evaluations are performed in the local coordinate system to result in an in-plane geometric stiffness matrix. An out-of-plane geometric stiffness matrix is then introduced to account for the effect of rigid body rotations on member forces. A unique procedure is used for the removal of rigid body displacements and rotations that enables stress recovery via linear, kinematic and constitutive, relationships. The geometric stiffness matrix derived was used to study several examples whose results compare well with the literature.

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

geometric stiffness matrix
large rotation

nonlinear analysis
composite shells
snap-through
lamina


Region-Based Image Retrieval using Probabilistic Feature Relevance Learning Region-Based Image Retrieval (RBIR), a specialisation of content-based image retrieval, is a promising and important research area. RBIR usually requires good segmentation, which is often difficult ru achieve in practice for several reasons, such as varying environmental conditions and occlusion. It is, therefore, imperative to develop effective mechanisms for interactive, region-based visual query in order to provide confident retrieval performance. In this paper, we present a novel RBIR system, Finding Region In the Pictures (FRIP), chat uses human-centric relevance: feedback to create similarity metric on-the-fly in order to overcome some of the limitations associated with RBIR systems. We use features such as colour, texture, normalised area, shape and location, extracted from each region of a segmented image, to represent image content. For each given query, we estimate local feature relevance using probabilistic relevance model, from which to create a flexible metric that is highly adaptive to query location. As a result, local data densities can he sufficiently exploited, whereby rapid performance improvement can he achieved. The efficacy of our method is validated and compared against other competing techniques using real world image data.

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

cbir
feature extraction
image segmentation
mrs
probabilistic relevance learning


Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times A scheduling problem with unrelated parallel machines, sequence and machine-dependent setup times, due dates and weighted jobs is considered in this work. A branch-and-bound algorithm (B&B) is developed and a solution provided by the metaheuristic GRASP is used as an upper bound. We also propose a set of instances for this type of problem. The results are compared to the solutions provided by two mixed integer programming models (MIP) with the solver CPLEX 9.0. We carry out computational experiments and the algorithm performs extremely well on instances with up to 30 jobs.

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

branch-and-bound
sequence-dependent setups
machine-dependent setups


A time finite element method for dynamic analysis of elastic mechanisms in link coordinate systems A time finite element method is developed for the steady-state solutions of vibrating elastic mechanisms. The governing equations of motion for each individual link are described in a link (local) coordinate system with constant coefficients. The set of second order differential equations for all links are then coupled by a set of constitutive equations of elastic joint models describing the link interconnections. In utilizing time finite elements which discretize the forcing time period into a number of time intervals, the elastic motion is approximated by a set of temporal nodes of all spatial degrees of freedom of the mechanism system. The result is a set of linear algebraic system with a sparse structure that can be solved effectively. A scotch yoke mechanism and a four-bar linkage are included as examples to illustrate the modeling and solution procedures applied.

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

time finite elements
elastic mechanisms
dynamic analysis