An innovative method for data and software integration in SaaS Recently the main trend in providing software services has been shifting from an ASP (application service provider)-oriented to a SaaS (software as a service). ASP is a software service model in which the service is provided on a one by one basis according its ownership, while SaaS is a software service model in which the service is provided virtually on a one by one basis, but physically all at once. In a SaaS environment, all users can access the system via Internet without any software installationexamples include Google and Amazon. Now, more companies are shifting their business software service from ASP to SaaS. However effecting the transition of the existing software and data from ASP to SaaS is not an easy task. First, we have to solve the problem of the integration of data for different forms of software, because each data set consists of different data types. Second, the software integration must support a user customizing interface for various users on the Web. Almost all users want customized services, but those require high costs. In this paper we propose a novel method for transferring the existing business software to integrated software that can be used in the SaaS environment. We use a master table and master code to implement the integrated system. The master table is based on the project master table, and other user information tables are connected to collect the necessary information. All information about the project is stored in each column of the project master table. The master table can integrate various software databases. By using this novel methodology, the existing ASP-based software and data can be effectively transferred to the SaaS environment.

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

cloud computing
data integration
master table introduction


Advances in biological time series prediction by neural networks In this paper, we consider some different aspects involved in the prediction of biological time series. This is often a difficult task, which can be accomplished by defining a suited function approximation problem whose inputs are determined using past samples of the sequence to be predicted. We demonstrate that neural networks can be very useful in this regard. For instance, we illustrate how Mixture of Gaussian neural networks can be efficiently used for the prediction of glucose temporal evolution in Diabetes Mellitus Type 2, instead of using the well-known MINMOD model. We also focus on the chaotic nature of biological time series, which can be contaminated by spurious noise. Neural networks represent a powerful tool for the prediction of these sequences, when the past samples to be used for prediction are chosen by suitable embedding techniques. A new embedding approach is proposed in the paper, using a genetic algorithm where each individual represents a possible embedding solution. We demonstrate that the proposed technique yields better prediction accuracies, considering as a particular application the prediction of those biological parameters (glucose, heart rate, and skin conductivity) that are strictly related to road safety, since they may evidence stress conditions or possible loss of consciousness.

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

biological time series
neural networks
prediction
genetic algorithm


architecture-aware optimization targeting multithreaded stream computing Optimizing program execution targeted for Graphics Processing Units (GPUs) can be very challenging. Our ability to efficiently map serial code to a GPU or stream processing platform is a time consuming task and is greatly hampered by a lack of detail about the underlying hardware. Programmers are left to attempt trial and error to produce optimized codes. Recent publication of the underlying instruction set architecture (ISA) of the AMD/ATI GPU has allowed researchers to begin to propose aggressive optimizations. In this work, we present an optimization methodology that utilizes this information to accelerate programs on AMD/ATI GPUs. We start by defining optimization spaces that guide our work. We begin with disassembled machine code and collect program statistics provided by the AMD Graphics Shader Analyzer (GSA) profiling toolset. We explore optimizations targeting three different computing resources: 1) ALUs, 2) fetch bandwidth, and 3) thread usage, and present optimization techniques that consider how to better utilize each resource. We demonstrate the effectiveness of our proposed optimization approach on an AMD Radeon HD3870 GPU using the Brook+ stream programming language. We describe our optimizations using two commonly-used GPGPU applications that present very different program characteristics and optimization spaces: matrix multiplication and back-projection for medical image reconstruction. Our results show that optimized code can improve performance by 1.45x--6.7x as compared to unoptimized code run on the same GPU platform. The speedup obtained with our optimized implementations are 882x (matrix multiply) and 19x (back-projection) faster as compared with serial implementations run on an Intel 2.66 GHz Core 2 Duo with a 2 GB main memory.

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


Publication patterns concerning the role of teams/groups in the information systems literature from 1990 to 1999 By reviewing 28 reputable journals that serve as outlets for information systems and operations management/research, 220 articles relating to information systems and teams/groups were identified over a 10-year period from 1990 through 1999. These articles were classified into 22 topic areas and subsequently cross-tabulated. The data indicate that the number of articles published in this area peaked in the mid 1990s, and that Communications of the ACM, Decision Support Systems, Information & Management, and Journal of Management Information Systems were the primary outlets. Key topic areas intersecting with teams/groups include: decision making, decision support systems, human factors, intra-organization systems, project management, telecommunications, and software. Also, connections between organizational behavior/social psychology and the current teams/groups research in information systems were discovered.

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

dss
information systems research
research methodology


On the complexity of equational problems in CNF ? Equational problems (i.e. first-order formulae with quantifier prefix ???? , whose only predicate symbol is syntactic equality) are an important tool in many areas of automated deduction, e.g. restricting the set of ground instances of a clause via equational constraints allows the definition of stronger redundancy criteria and hence, in general, of more efficient theorem provers. Moreover, the inference rules themselves can be restricted via constraints. In automated model building, equational problems play an important role both in the definition of an appropriate model representation and in the evaluation of clauses in such models. Also, many problems in the area of logic programming can be reduced to equational problem solving. Finally, equational problems over a finite domain correspond to the evaluation of certain queries over relational databases. The goal of this work is a complexity analysis of the satisfiability problem of equational problems. The main results will be a proof of the NP-completeness (and, in particular, the NP-membership) of equational problems in CNF over an infinite domain and of the ?2p-completeness in the case of CNF over a finite domain.

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

equational reasoning
np-completeness
polynomial hierarchy


A simple index rule for efficient traffic splitting over parallel wireless networks with partial information Multi-path communication solutions provide a promising means to improve the network performance in areas covered by multiple wireless access networks. Today, little is known about how to effectively exploit this potential. We study a model where flows are transferred over multiple parallel networks, each of which is modeled as a processor sharing node. The goal is to minimize the expected transfer time of elastic data traffic by smartly dispatching the flows to the networks, based on partial information about the numbers of foreground and background flows in each of the nodes. In the case of full state information, the optimal policy can be derived via standard MDP-techniques, but for models with partial information an optimal solution is hard to obtain. An important requirement is that the splitting algorithm is efficient, yet simple, easy-to-implement, scalable in the number of parallel networks and robust against changes in the parameter settings. We propose a simple index rule for splitting traffic streams based on partial information, and benchmark the results against the optimal solution in the case of full state information. Extensive simulations with real networks show that this method performs extremely well under practical circumstances for a wide range of realistic parameter settings.

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

concurrent access
flow-level performance
partial information model
heuristic


Uncovering Metabolic Objectives Pursued by Changes of Enzyme Levels Expression profiling and proteomic techniques reveal significant variations in the levels of thousands of mRNAs and proteins in response to environmental changes such as substrate depletion, oxidative stress, and hormonal stimulation. However, in most cases the functional implications of these variations remain elusive. One crucial problem complicating the functional interpretation of high-throughput data is that changes of protein levels do not simply translate into equivalent changes in the rate of the associated chemical processes due to various modes of enzyme regulation and the instantaneous effect of changed metabolite concentrations on adjacent flux rates. Here, we outline a theoretical concept to exploit information on (relative) changes in the level of metabolic enzymes for the prediction of (relative) flux changes in the underlying metabolic network. Our approach rests on the assumption that size and direction of fluxes (flux distribution) in the network are determined by an optimization principle in that the production of the physiologically relevant output metabolites is accomplished with minimal total flux. The prediction method comprises two main steps. First, we approximate (unknown) flux changes by a linear combination of so-called minimal flux modes, each representing a specific flux distribution minimally required to accomplish the production of only one of the numerous functionally relevant output metabolites. Second, the unknown coefficients of this decomposition are chosen such that a maximal correlation with observed differential expression data is obtained. Based on simulated enzyme expression scenarios in a metabolic model of the human red blood cell, we demonstrate the predictive capacity of our method.

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

erythrocyte
flux balance analysis
flux minimization
gene expression
minimal flux mode


A VHDL--Forth Core for FPGAs The Forth programming language is typically implemented to run on some particular microprocessor. Several Forth engines have been designed that execute Forth instructions directly, typically in a single clock cycle. With the advent of high density FPGAs it has become feasible to implement a high-performance Forth core in an FPGA. This paper describes the design of a Forth core using VHDL that has been implemented on a Xilinx Spartan II FPGA. Examples are presented of high-level Forth programs that are compiled to VHDL code that implements a ROM embedded in the FPGA. The use of a Forth core in an FPGA allows for rapid prototyping of digital systems. Experiments show that an identical Forth program for the Sieve of Eratosthenes executes nearly 30 times faster on the FPGA Forth core than on a 68HC12 microcontroller at the same clock speed. This same program executes over six times faster on the FPGA Forth core than an equivalent compiled C program run on the same 68HC12. The Forth core is available as an EDIF file at www.tigs.com/fc16, which can be included in a VHDL project and uses approximately 30% of a Spartan II FPGA.

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


Two generalized complex orthogonal space-time block codes of rates 7/11 and 3/5 for 5 and 6 transmit antennas Space-time block codes from orthogonal designs have two advantages, namely, fast maximum-likelihood (ML) decoding and full diversity. Rate 1 real (pulse amplitude modulation-PAM) space-time codes (real orthogonal designs) for multiple transmit antennas have been constructed from the real Hurwitz-Radon families, which also provides the rate 1/2 complex (quadrature amplitude modulation-QAM) space-time codes (complex orthogonal designs) for any number of transmit antennas. Rate 3/4 complex orthogonal designs (space-time codes) for three and four transmit antennas have existed in the literature but no high rate (> 1/2) complex orthogonal designs for other numbers of transmit antennas exist. In this correspondence, we present rate 7/11 and rate 3/5 generalized complex orthogonal designs for five and six transmit antennas, 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 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

(generalized) complex orthogonal designs


Cancer and Pesticides Exposure to pesticides is recognized as an important environmental risk factor associated with development of cancer. Epidemiological studies, although sometimes contradictory, have linked phenoxy acid herbicides with non-Hodgkin's lymphoma (NHL) and Soft Tissue Sarcoma (STS); organochlorine insecticides with STS, NHL, and leukemia; organophosphorous compounds with NHL and leukemia; and triazine herbicides with ovarian cancer. Exposure assessment is a crucial point in studying the association between cancer and pesticides.In order to investigate the association between hematolymphopoietic malignancies and occupational exposures, including pesticides, a population-based casecontrol study was carried out in Italy in 11 areas, 9 of which are agricultural or mixed areas. All newly diagnosed cases of hematolymphopoietic malignancies were collected in a 3-year period (19911993). The control group consisted of a random sample of the population residing in each area. The approach to infer exposures in agriculture was based 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 B O O O O O B O O O O O O B I O O O O O O O O O O O O O O O O O O B I O O O O 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 I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

hematolymphopoietic malignancies
leukemia
pesticides
exposure assessment

non-hodgkin's lymphoma
multiple myeloma
phenoxy herbicides


Penalized partial least square discriminant analysis with ?1-norm ? 1 - norm for multi-label data A new and effective learning method for the multi-label data is proposed. The method exploits the sparse property of the label space fully. The method captures the correlations of the variables by using partial least squares discriminant analysis. Dimension reduction has also applied to the high-dimensional data. The sparse purpose is achieved by performing the l1-norm penalty.

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

partial least squares
discriminant analysis
dimension reduction


Multi-output regularized feature projection Dimensionality reduction by feature projection is widely used in pattern recognition, information retrieval, and statistics. When there are some outputs available (e.g., regression values or classification results), it is often beneficial to consider supervised projection, which is based not only on the inputs, but also on the target values. While this applies to a single-output setting, we are more interested in applications with multiple outputs, where several tasks need to be learned simultaneously. In this paper, we introduce a novel projection approach called Multi-Output Regularized feature Projection (MORP), which preserves the information of input features and, meanwhile, captures the correlations between inputs/outputs and (if applicable) between multiple outputs. This is done by introducing a latent variable model on the joint input-output space and minimizing the reconstruction errors for both inputs and outputs. It turns out that the mappings can be found by solving a generalized eigenvalue problem and are ready to extend to nonlinear mappings. Prediction accuracy can be greatly improved by using the new features since the structure of outputs is explored. We validate our approach in two applications. In the first setting, we predict users' preferences for a set of paintings. The second is concerned with image and text categorization where each image (or document) may belong to multiple categories. The proposed algorithm produces very encouraging results in both settings.

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

dimensionality reduction
supervised projection


Search engine reinforced semi-supervised classification and graph-based summarization of microblogs There is an abundance of information found on microblog services due to their popularity. However the potential of this trove of information is limited by the lack of effective means for users to browse and interpret the numerous messages found on these services. We tackle this problem using a two-step process, first by slicing up the search results of current retrieval systems along multiple possible genres. Then, a summary is generated from the microblog messages attributed to each genre. We believe that this helps users to better understand the possible interpretations of the retrieved results and aid them in finding the information that they need. Our novel approach makes use of automatically acquired information from external search engines in each of these two steps. We first integrate this information with a semi-supervised probabilistic graphical model, and show that this helps us to achieve significantly better classification performance without the need for much training data. Next we incorporate the extra information into graph-based summarization, and demonstrate that superior summaries (up to 30% improvement in ROUGE-1) are obtained.

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

microblog
summarization
probabilistic graphical model

topic classification
semi-supervised
pagerank


Global Optimization of Centroidal Voronoi Tessellation with Monte Carlo Approach Centroidal Voronoi Tessellation (CVT) is a widely used geometric structure in applications including mesh generation, vector quantization and image processing. Global optimization of the CVT function is important in these applications. With numerical evidences, we show that the CVT function is highly nonconvex and has many local minima and therefore the global optimization of the CVT function is nontrivial. We apply the method of Monte Carlo with Minimization (MCM) to optimizing the CVT function globally and demonstrate its efficacy in producing much improved results compared with two other global optimization methods.

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

centroidal voronoi tessellation
global optimization
monte carlo with minimization


PeCAN: An architecture for users' privacy-aware electronic commerce contexts on the semantic web Supporting e-Commerce on the Semantic Web implies more sophisticated integration of Web services, agent interaction, domain ontologies, and data markup languages than is being done on today's Web. We explore user e-commerce, trust, and privacy scenarios and provide a vision for future e-commerce interactions with a more informed and in-control user. We present the Personal Context Agent Networking (PeCAN) knowledge architecture consisting of client-side and web-side architectural data components and services which inform the user of online privacy and trust within e-commerce tasks. A novel organization scheme and the composition of user contexts in this environment are proposed. Client-side ontologics and data structures for representing user contexts are introduced. For proof of concept, we describe a data belief ontology and illustrate PeCAN's compliance to the P3P privacy data schema. We use OWL as an implementation basis for maintaining privacy-aware e-commerce contextual knowledge for effective agent action in the PeCAN environment. Categories and Subject Descriptors: Sematic Web Application Architecture, Web Information Systems Applications, Electronic Privacy, Decision Support System Application (c) 2005 Elsevier B.V. All rights reserved.

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

context-aware
online trust and e-privacy architecture
owl application
e-commerce
private data management
user decision support


The design and evaluation of fair scheduling in wireless mesh networks In this paper we address the problem of scheduling in wireless mesh networks. First, we provide a comparison of existing scheduling algorithms and classify them based on the degree of fairness, the scheduling techniques and their implementation frameworks. Then we propose a fair scheduling approach using multiple gateways. The proposed scheduling approach consists of four important steps, namely, requirement tables, requirement propagation, clique generation and schedule generation. Simulation experiments are conducted to compare the performance of fair scheduling with the method that does not use fair scheduling. The simulation results confirm that the proposed scheduling has better performance with respect to the metrics used for performance-evaluation. (C) 2010 Elsevier Inc. All rights reserved.

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

fair scheduling
gateways
wireless mesh networks
scheduling


An exception handling of rule-based reasoning using case-based reasoning In this paper, we propose the CCAR (Combining Case-based And Rule-based reasoning) model for an exception handling of Rule-based Reasoning using Case-based Reasoning. The central idea of the model proposed in this paper is to represent the exception of a rule as a case, and to utilize the case for a solution to a problem, and then to search the case memory to retrieve a case which violates the conclusion of a rule. If the similarity between a target problem and the selected case is high, the conclusion of a case is applied. Otherwise, the conclusion of rule-based reasoning is applied.

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

case-based reasoning
rule-based reasoning
knowledge acquisition


Proposal for a multilevel university cybermetric analysis model Universities online seats have gradually become complex systems of dynamic information where all their institutions and services are linked and potentially accessible. These online seats now constitute a central node around which universities construct and document their main activities and services. This information can be quantitative measured by cybermetric techniques in order to design university web rankings, taking the university as a global reference unit. However, previous research into web subunits shows that it is possible to carry out systemic web analyses, which open up the possibility of carrying out studies which address university diversity, necessary for both describing the university in greater detail and for establishing comparable ranking units. To address this issue, a multilevel university cybermetric analysis model is proposed, based on parts (core and satellite), levels (institutional and external) and sublevels (contour and internal), providing a deeper analysis of institutions. Finally the model is integrated into another which is independent of the technique used, and applied by analysing Harvard University as an example of use.

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

academic websites
webometrics
multilevel analysis model
web unit analysis
complutense university of madrid


Novel C-IPDM signal format for suppression of polarization mode dispersion A novel chirped intra-bit polarization diversity modulation (C-IPDM) signal format is proposed. The transmission performance of C-IPDM is compared to NRZ, RZ and the common IPDM in terms of the PMD tolerance by simulation in a 40 Gb/s system. The results show that the C-IPDM format can reduce the effects of second-order PMD significantly due to the chirping characteristic and the system Q-factor is increased especially in high PMD systems.

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

chirped intra-bit polarization diversity modulation (c-ipdm)


Probabilistic analysis on mesh network fault tolerance Mesh networks are among the most important interconnection network topologies for large multicomputer systems. Mesh networks perform poorly in tolerating faults in the view of worst-case analysis. On the other hand, such worst cases occur very rarely in realistic situations. In this paper, we study the fault tolerance of 2-D and 3-D mesh networks under a more realistic model in which each network node has an independent failure probability. We first observe that if the node failure probability is fixed, then the connectivity probability of these mesh networks can be arbitrarily small when the network size is sufficiently large. Thus, it is practically important for multicomputer system manufacture to determine the upper bound for node failure probability when the probability of network connectivity and the network size are given. We develop a novel technique to formally derive lower bounds on the connectivity probability for 2-D and 3-D mesh networks. Our study shows that these mesh networks of practical size can tolerate a large number of faulty nodes thus are reliable enough for multicomputer systems. For example, it is formally proved that as long as the node failure probability is bounded by 0.5%, a 3-D mesh network of up to a million nodes remains connected with a probability larger than 99%. (C) 2006 Elsevier Inc. All rights reserved.

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

mesh networks
interconnection network
fault tolerance
probabilistic analysis


Application of three-dimensional orthogonal neural network to craniomaxillary reconstruction The purpose of this investigation is to establish a practical method to predict and create surface a profile of bone defects by a well-trained 3-D orthogonal neural network. First, the coordinates of the skeletal positions around the boundary of bone defects are input into the 3-D orthogonal neural network to train it to learn the scattering characteristic. The 3-D orthogonal neural network avoids local minima and converges rapidly. After the neural network has been well trained, the mathematic model of the bone defect surface is generated, and the pixel positions are derived. Herein, to verify its performance the proposed method is applied on a patient with a craniofacial defect.

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

x-ray computed tomography
rapid prototyping
backpropagation network


Modelling and analysing neural networks using a hybrid process algebra Research involving artificial neural networks has tended to be driven towards efficient computation, especially in the domain of pattern recognition, or towards elucidating biological processes in the brain. Models have become more detailed as our understanding of the biology of the brain has increased, incorporating real-time behaviour of individual neurons interacting within complex system structures and dynamics. There are few examples of abstract and fully formal models of biologically plausible neural networks: in the neural networks literature models are often presented as a mixture of mathematical equations and natural language, supported by simulation code and associated experimental results. The informality often hides or obscures important aspects of a particular model, and leaves a large conceptual gap between the model descriptions and the usually low-level programming code used to simulate them. The main contribution of this paper is formally modelling and analysing a biologically plausible neural network model from the literature that exhibits complex neuron-level behaviour and network-level structure. To achieve this a modelling language Pann is developed, based on the process algebras CSP and Hybrid?. It is designed to be convenient for mixing the behaviour of discrete events (such as a neuron spike) with mutable continuous and discrete variables (representing chemical properties of a neuron, for instance). Its behaviour is defined using an operational semantics, from which a set of general properties of the language is proved. The groundwork for the biological model is laid by first formalising some well-known concepts from the artificial neural networks domain, such as feedforward behaviour, backpropagation, and recurrent neural networks. The Pann model of a feedforward network, comprising a set of communicating processes representing individual neurons, is proved equivalent to the standard one-line calculation of feedforward behaviour.

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


A new generalized residual multiple model adaptive estimator of parameters and states This article develops a modification to the standard Multiple Model Adaptive Estimator (MMAE) which allows the use of a new "generalized residual" in the hypothesis conditional probability calculation. The generalized residual is a linear combination of the traditional Kalman filter residual and the "post-fit" Kalman filter residual which is calculated after measurement incorporation. This new modified MMAE is termed a Generalized Residual Multiple Model Adaptive Estimator (GRMMAE). A derivation is provided for the hypothesis conditional probability formula which the GRMMAE uses to calculate probabilities that each elemental filter contains the correct parameter value. Through appropriate choice of a single scalar GRMMAE design parameter, the GRMMAE can be designed to be equivalent to a traditional MMAE, a post-fit residual modified MMAE, or any linear combination of the two. The original GRMMAE design goal was to choose the GRMMAE design parameter which caused the fastest GRMMAE convergence to the correct hypothesis. However, this article demonstrates that the GRMMAE design parameter can lead to beta-dommance, a negative performance effect in the GRMMAE. That fact is a key result of this research as other researchers have previously suggested that the use of post-fit residuals may be advantageous in certain MMAE applications. This article demonstrates the beta-dominance effect and recommends that post-fit residuals not be used in an MMAE. (c) 2005 Elsevier Ltd. All rights reserved.

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

kalman filtering
adaptive filters
multiple model adaptive estimation
estimation


Comparisons of weakly compressible and truly incompressible algorithms for the SPH mesh free particle method In the smoothed particle hydrodynamics (SPH) discretisation method for the NavierStokes equations the most widespread method to solve for pressure and mass conservation is the weakly compressible assumption (WCSPH). This includes hydraulics applications and leads to some drawbacks such as severe artificial pressure fluctuations and a limitation to very small time steps related to the WCSPH Mach number and explicit method. This paper presents comparisons of a semi-implicit and truly incompressible SPH (ISPH) algorithm with the classical WCSPH method, showing how some of the problems encountered in WCSPH have been resolved by using ISPH to simulate incompressible flows. Mathematical models are presented before describing SPH formalism. Several standard boundary conditions are introduced and special attention is given to tracking the surface particles. The lid-driven cavity flow (Re=400 and 1000) is performed as a benchmarking test. A bluff body test case (a square cylinder in a closed channel, Red=20 and 100 based on the cylinder diameter) shows that pressure fields extracted from WCSPH are very unreliable whereas ISPH predict pressures and forces in closer agreement with classical finite volume CFD methods. Dam-breaking cases, with dry or wet beds downstream, are then presented to highlight free-surface flow and rapid dynamics effects. The WCSPH and ISPH results are generally verified with reference data from experiment and/or another numerical method. All the comparisons show improvement with ISPH and good agreement in general.

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

pressure poisson equation
lagrangian modelling


Automatic dominant character identification in fables based on verb analysis Empirical study on the impact of anaphora resolution Named entity recognition (NER) is a subtask in information extraction which aims to locate atomic element into predefined types. Various NER techniques and tools have been developed to fit the interest of the applications developed. However, most NER works carried out focus on non-fiction domain. Fiction based domain displays a complex context in locating its NE, specifically whereby its characters could be represented in diverse spectrums, ranging from living things (animals, plants, and person) to non-living things (vehicle, furniture). Motivated by a hypothesis such that there always exists verb specifically describes human being conduct, in this paper, we propose a NER system which aims to identify NEs that perform human activity based on verb analysis (VAHA) in an autonomous manner. More specifically, our approach attempts to identify dominant character (DC) by studying the nature of verb that associates with human activity via TreeTagger, Stanford packages and WordNet. Our experimental results validate our initial hypothesis that NEs can be accurately identified by referring to the associated verbs that associate with human activity. Our empirical study also proves that the approach is applicable to small text size articles. Another significant contribution of our approach is that it does not require training data set and anaphora resolution.

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

named entity recognition
verb analysis
anaphora resolution
character identification


SOFTWARE TASKS - INTELLECTUAL OR CLERICAL There are two conflicting views of the complexity of software development: 'anyone can do it', or 'it is the most complex activity the human mind has ever undertaken'. We address this difference empirically in two exploratory studies that examined the intellectual (non-routine) and clerical (routine) nature of software tasks. The first study sought to determine the proportion of software tasks that can be regarded as intellectual or clerical in nature. Taxonomies of software tasks were classified based on the assessment of highly experienced raters. The second study examined the length of time novice systems analysts spent in carrying out tasks during the information requirements specification phase of the systems development life cycle. The experiment used protocol and videotape analysis. Results show that the numbers of intellectual tasks in software development, and the time spent on those tasks, both predominate over clerical tasks by 4 to 1. These initial results suggest that even simple tasks are more intellectual than the 'anyone can do it' or the 'software development can be automated' viewpoints frequently expressed in the literature.

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

software complexity
management of software development
information systems
information requirements analysis
structured analysis


a new graphy triconnectivity algorithm and its parallelization We present a new algorithm for finding the tri-connected components of an undirected graph. The algorithm is based on ear decomposition and has linear sequential running time. It also has a parallel implementation on a CRCW PRAM with O (log 2 n ) parallel time using a linear number of processors, where n is the number of vertices in the graph. This is the first efficient parallel algorithm for graph tri-connectivity.

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

implementation decomposition graph algorithm parallel

processor
timing
efficiency
connection
parallel algorithm
component


Optimization of printed circuit board manufacturing: Integrated modeling and algorithms This paper focuses on an integrated optimization problem that is designed to improve productivity in printed circuit board (PCB) manufacturing. We examine the problems of allocating the components to feeders and sequencing the placement of these components on the PCBs, populated by a rotary head machine with surface mount technology. While previous research focuses on sequencing the placement and only considers this subproblem as part of an interrelated set of problems, we provide an integrated approach which tackles all subproblems simultaneously as a single problem. Given an ?-approximation algorithm for the vehicle routing problem we present a solution with an ?-error gap for the PCB problem.

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

optimization
modeling
printed circuit board


a closer look at recognition-based graphical passwords on mobile devices Graphical password systems based on the recognition of photographs are candidates to alleviate current over-reliance on alphanumeric passwords and PINs. However, despite being based on a simple concept -- and user evaluations consistently reporting impressive memory retention -- only one commercial example exists and overall take-up is low. Barriers to uptake include a perceived vulnerability to observation attacks; issues regarding deployability; and the impact of innocuous design decisions on security not being formalized. Our contribution is to dissect each of these issues in the context of mobile devices -- a particularly suitable application domain due to their increasing significance, and high potential to attract unauthorized access. This produces: 1) A novel yet simple solution to the intersection attack that permits greater variability in login challenges; 2) Detailed analysis of the shoulder surfing threat that considers both simulated and human testing; 3) A first look at image processing techniques to contribute towards automated photograph filtering. We operationalize our observations and gather data in a field context where decentralized mechanisms of varying entropy were installed on the personal devices of participants. Across two working weeks success rates collected from users of a high entropy version were similar to those of a low entropy version at 77\%, and login durations decreased significantly across the study.

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

shoulder surfing
mobile devices
graphical passwords


multimodal interaction to support multilingualism acquisition and development in young children The aim of our research is to explore new interaction paradigms for the design of multilingual educational software. In this poster, we present some early work on the use of multimodal interaction techniques to facilitate the simultaneous acquisition of more than one language during the period of primary language development. We suggest that multimodality can be used to deal with common multilingual phenomena such as language mixing and language dominance or specialization.

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

multilingualism
language mixing
educational software
multimodal interaction

modality fission
language acquisition and development


An approach to slicing widget-based event-driven programs and its implementation In program slicing, widget-based event-driven programs are different from conventional programs because of their particular features of object construction infrastructure and event-driven mechanism and asynchronous access of global variables. Therefore conventional slicing techniques cannot be applied to widget-based event-driven programs. To solve this problem, this paper first introduces a set of representing schemes including an object construction tree, an object dependence table, a global variable dependence table and an event-driven program dependence graph, then defines a WbEd slicing criterion through combining three kinds of slicing criteria: instruction criterion, event-loop criterion and obj-attr criterion. And a slicing method is developed based on these slicing criteria. Eventually a widget-based event-driven program slicer wbedSlicer is illustrated to verify the efficiency and correctness of the slicing approach.

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

control dependence
data dependence
widget-based event-driven program


A new effect of radius of gyration with neural networks In 2006, Deng etal. (Comput Math Appl 51: 11271136, 2006) proposed a method to evaluate DMUs. A radius of gyration was employed to rank fuzzy numbers; however, there were some problems with the ranking method. This paper attempts to reveal the issues of Dengs method and proposes a revised method that can avoid these problems for ranking fuzzy numbers. Since the revised method is based on Dengs method, it is easy to rank fuzzy numbers in a way similar to the original method.

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


The variance quadtree algorithm: Use for spatial sampling design ? Spatial sampling schemes are mainly developed to determine sampling locations that can cover the variation of environmental properties in the area of interest. Here we proposed the variance quadtree algorithm for sampling in an area with prior information represented as ancillary or secondary environmental data, and the covariance structure of the ancillary variable is non-stationary. The algorithm is based on the idea of a quadtree decomposition, where an area is successively divided into strata so each stratum has more-or-less equal variation. An observation point is then placed inside each stratum. This scheme samples sparsely in relatively uniform areas and more intensively where variation is large. It samples in the feature space and also takes into consideration the spread in the geographic space. We describe the algorithm, its software implementation, and present some examples of applications.

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

spatial design
soil survey
geostatistics


The effect of individual neuromuscular properties on performance in sports We present a mathematical formulation of notions used in training science such as sports performance, performance determining factor and performance limiting factor. We give an example of model equations describing the relationship between individual neuromuscular properties and the associated performance in sports. An essential factor in modelling human movements is to determine the values of the subject's properties individually and in vivo. We perform measurements and identify the parameters describing the person's properties in the model equation. Simulations show effects of individual differences in the neuromuscular properties on the performance. Furthermore, we show the influence of changes in movement conditions on the performance.

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


A case for exploiting self-similarity of network traffic in TCP congestion control Analytical and empirical studies have shown that self-similar traffic can have detrimental impact on network performance including amplified queuing delay and packet loss ratio. On the flip side, the ubiquity of scale-invariant burstiness observed across diverse networking contexts can be exploited to better design resource control algorithms. In this paper, we explore the issue of exploiting the self-similar characteristics of network traffic in TCP congestion control. We show that the correlation structure present in long-range dependent traffic can be detected on-line and used to predict the future traffic. We then devise a novel scheme, called TCP with traffic prediction (TCP-TP), that exploits the prediction result to infer, in the context of AIMD steady-state dynamics, the optimal operational point at which a TCP connection should operate. Through analytical reasoning, we show that the impact of prediction errors on fairness is minimal. We also conduct ns-2 simulation and FreeBSD 4.1-based implementation studies to validate the design and to demonstrate the performance improvement in terms of packet loss ratio and throughput attained by connections.

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


All-to-all disjoint multipath routing using cycle embedding ? In this paper, we evaluate the performance of disjoint multipath routing approaches for all-to-all routing in packet-switched networks with respect to packet overhead, path length, and routing table size. We develop a novel approach based on cycle embedding to obtain two node-disjoint paths between all sourcedestination pairs with reduced number of routing table entries maintained at a node (hence the reduced lookup time), small average path length, and less packet overhead. We study the trade-off between the number of routing table entries maintained at a node and the average length of the two disjoint paths by: (a) formulating the cycle-embedding problem as an integer linear program; and (b) developing a heuristic. We show that the number of routing table entries at a node may be reduced to at most two per destination using cycle-embedding approach if the average length of the disjoint paths are allowed to exceed the minimum by 25%.

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

disjoint multipath routing
cycle embedding


The multi-dataflow composer tool: generation of on-the-fly reconfigurable platforms Dataflow specifications are suitable to describe both signal processing applications and the relative specialized hardware architectures, fostering the hardwaresoftware development gap closure. They can be exploited for the development of automatic tools aimed at the integration of multiple applications on the same coarse-grained computational substrate. In this paper, the multi-dataflow composer (MDC) tool, a novel automatic platform builder exploiting dataflow specifications for the creation of run-time reconfigurable multi-application systems, is presented and evaluated. In order to prove the effectiveness of the adopted approach, a coprocessor for still image and video processing acceleration has been assembled and implemented on both FPGA and 90nm ASIC technology. 60% of savings for both area occupancy and power consumption can be achieved with the MDC generated coprocessor compared to an equivalent non-reconfigurable design, without performance losses. Thanks to the generality of high-level dataflow specification approach, this tool can be successfully applied in different application domains.

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


Optimal sequential and parallel algorithms for cut vertices and bridges on trapezoid graphs Let G be a graph. A component of G is a maximal connected subgraph in G. A vertex v is a cut vertex of G if kappa(G-nu) > kappa(G), where kappa(G) is the number of components in G. Similarly, an edge e is a bridge of G if kappa(G- e) > kappa(G). In this paper, we will propose new O(n) algorithms for finding cut vertices and bridges of a trapezoid graph, assuming the trapezoid diagram is given. Our algorithms can be easily parallelized on the EREW PRAM computational model so that cut vertices and bridges can be found in O(log n) time by using O(n/log n) processors.

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


First passage times of reflected Ornstein-Uhlenbeck processes with two-sided jumps In this paper we consider the first passage problem for reflected jump-type Ornstein-Uhlenbeck processes with two-reflecting barriers. We calculate the explicit joint Laplace transform of the first passage time and the corresponding undershoot when the jumps follow a two-sided mixed exponential law. The method of contour integrals proposed by Jacobsen and Jensen (in Stoch. Process. Appl. 117: 1330-1356, 2007) is applied to obtain the explicit joint Laplace transform. Finally, a comparison concerning Laplace transforms between the reflected case and non-reflected case is presented by taking smooth-pasting conditions at reflecting barriers into account.

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

reflected ornstein-uhlenbeck processes
two-sided mixed exponential law
smooth-pasting condition


Prediction of fold defect in barreling formations of cylinder upsetting In this paper, the use of finite element method in conjunction with abductive network is presented for investigating fold defect that may occur in barreling formation during cylinder upsetting with hollow die. Different geometrical conditions combined with various frictional constraints are taken into account as the process parameters in this study. During the upsetting process, several barrels may be successively formed along the lateral free surface of the workpiece and the extrusions of the free surfaces of the billet into the aperture surfaces within the dies are accompanied. In addition, there are two locations where fold defect may occur during upsetting process, one occurs around the equatorial plane of the workpiece and the other takes place around the intersection zone of the barrels. A finite element based code is utilized to investigate the material flow characteristics resulting in the occurrence of fold defect, and the abductive network is then applied to synthesize the data sets obtained from the numerical simulation. Finally, a prediction model is established for fold occurrence judgment around different locations under various combinations of process parameters.

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


Topology authentication for piping isometric drawings ? The topology authentication problem of piping isometric drawings is addressed. A semi-fragile watermarking scheme for the topology authentication is proposed. The proposed scheme is robust against local similarity transformations. The proposed scheme is invariant to the stretching operation on pipes. The proposed scheme provides good tamper localization accuracy.

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

topology authentication
local similarity transformations
watermarking

product and manufacturing information (pmi)


Analytic network process in risk assessment and decision analysis ? In risk assessment and decision analysis, the analytical network process (ANP) is widely used to assess the key factors of risks and analyze the impacts and preferences of decision alternatives. There are lots of comparison matrices for a complicated risk assessment problem, but a decision has to be made rapidly in emergency cases. However, in the ANP, the reciprocal pairwise comparison matrices (RPCM) are more complicated and difficult than AHP. The consistency test and the inconsistent elements identification need to be simplified. In this paper, a maximum eigenvalue threshold is proposed as the consistency index for the ANP in risk assessment and decision analysis. The proposed threshold is mathematically equivalent to the consistency ratio (CR). To reduce the times of consistency test, a block diagonal matrix is introduced for the RPCM to conduct consistency tests simultaneously for all comparison matrices. Besides, the inconsistent elements can be identified and adjusted by an induced bias block diagonal comparison matrix. The effectiveness and the simplicity of the proposed maximum eigenvalue threshold consistency test method and the inconsistency identification and adjustment method are shown by two illustrative examples of emergent situations.

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

analytical network process (anp)
induced block diagonal matrix


Video Behaviour Mining Using a Dynamic Topic Model This paper addresses the problem of fully automated mining of public space video data, a highly desirable capability under contemporary commercial and security considerations. This task is especially challenging due to the complexity of the object behaviors to be profiled, the difficulty of analysis under the visual occlusions and ambiguities common in public space video, and the computational challenge of doing so in real-time. We address these issues by introducing a new dynamic topic model, termed a Markov Clustering Topic Model (MCTM). The MCTM builds on existing dynamic Bayesian network models and Bayesian topic models, and overcomes their drawbacks on sensitivity, robustness and efficiency. Specifically, our model profiles complex dynamic scenes by robustly clustering visual events into activities and these activities into global behaviours with temporal dynamics. A Gibbs sampler is derived for offline learning with unlabeled training data and a new approximation to online Bayesian inference is formulated to enable dynamic scene understanding and behaviour mining in new video data online in real-time. The strength of this model is demonstrated by unsupervised learning of dynamic scene models for four complex and crowded public scenes, and successful mining of behaviors and detection of salient events in each.

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

behaviour profiling
learning for vision
bayesian methods
probabilistic modelling


Error correction method for Navier-Stokes equations at high Reynolds numbers In this paper, we present a new iterative method for solving the stationary Navier-Stokes equations (NSEs) at high Reynolds numbers. The method consists of first solving the NSEs by the Oseen iterative scheme and then an error correction strategy is implemented to control the error arising from the linearization of the nonlinear NSEs. The new method retains the advantage of the classical Oseen scheme, but it leads to a rapid rate of convergence and also enhances the capability for solving problems with higher Reynolds numbers. It will be shown that, under the uniqueness condition, the proposed method accelerates up to a factor of three in the convergence rate. The stability analysis and error estimate are presented. Furthermore, numerical simulations using the new method and other classical schemes are reported to verify the superior performance of the proposed method. (c) 2013 Elsevier Inc. All rights reserved.

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

navier-stokes equations
high reynolds number problem
finite element method


The complexity of unique k-SAT: An Isolation Lemma for k-CNFs We provide some evidence that Unique k-SAT is as hard to solve as general k-SAT, where k-SAT denotes the satisfiability problem for k-CNFs with at most k literals in each clause and Unique k-SAT is the promise version where the given formula has 0 or 1 solutions. Namely, defining for each k >= 1, s(k) = inf{delta >= 0 vertical bar there exists a O(2(delta n))-time randomized algorithm for k-SAT} and, similarly. sigma(k) = inf{delta >= 0 vertical bar there exists a O(2(delta n))-time randomized algorithm for Unique k-SAT}, we show that lim(k ->infinity) s(k) = lim(k ->infinity)sigma(k). a corollary, we prove that, if Unique 3-SAT can be solved in time 2(epsilon n) for every epsilon > 0, then so can k-SAT for all k >= 3. Our main technical result is an Isolation Lemma for k-CNFs, which shows that a given satisfiable k-CNF can be efficiently probabilistically reduced to a uniquely satisfiable k-CNF, with non-trivial, albeit exponentially small, success probability. (c) 2007 Elsevier Inc. All rights reserved.

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

unique satisfiability
k-sat
subexponential time reduction


A hybrid genetic algorithm with solution archive for the discrete \((r|p)\)-centroid problem In this article we propose a hybrid genetic algorithm for the discrete \((r|p)\)-centroid problem. We consider the competitive facility location problem where two non-cooperating companies enter a market sequentially and compete for market share. The first decision maker, called the leader, wants to maximize his market share knowing that a follower will enter the same market. Thus, for evaluating a leaders candidate solution, a corresponding followers subproblem needs to be solved, and the overall problem therefore is a bi-level optimization problem. This problem is \(\Sigma _2^P\)-hard, i.e., harder than any problem in NP (if \(\hbox {P}\not =\hbox {NP}\)). A heuristic approach is employed which is based on a genetic algorithm with tabu search as local improvement procedure and a complete solution archive. The archive is used to store and convert already visited solutions in order to avoid costly unnecessary re-evaluations. Different solution evaluation methods are combined into an effective multi-level evaluation scheme. The algorithm is tested on well-known benchmark sets of both Euclidean and non-Euclidean instances as well as on larger newly created instances. Especially on the Euclidean instances our algorithm is able to exceed previous state-of-the-art heuristic approaches in solution quality and running time in most cases.

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

competitive facility location
solution archive

combinatorial optimization
discrete \((r|p)\)-centroid problem
metaheuristics
bi-level optimization


Exponentially fitted spline in compression for the numerical solution of singular perturbation problems Some exponentially fitted difference schemes for singularly perturbed two point boundary value problems are derived using spline in compression. These schemes are second-order accurate. Numerical examples are given in support of the theoretical results. (C) 2003 Elsevier Ltd. All rights reserved.

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

singular perturbation
boundary value problems
spline in compression


An Educational Computer Tool for Simulating Long-Term Soil Erosion on Agricultural Landscapes Due to its economic and environmental impacts, soil erosion has been a major concern to farmers, engineers and policy makers in recent years. Water and tilling are two of the main agents responsible for this phenomenon and considerable efforts have been made to model them in previous work but not with educational purposes. A computer tool for facilitating any user's simulation of long-term landscape evolution in a plot due to the combined action of water and tillage erosion is presented here. It integrates a graphic user interface with two well-verified erosion models, each one independently devoted to reproduce the effects of water and tilling. This computer tool permits to the student the consideration of the erosivity index and the presence of a crop in the plot, when simulating water erosion, as well as the planning of a different type of tilling each year. Each kind of tilling corresponds to a different combination of tillage tools with their own date, tillage depth and tillage direction. A handy ASCII (XYZ) file is generated containing the long-term soil erosion spatial pattern as result. From this information, the student can derive other results that will help to understand soil erosion. An example is presented here with the aim of showing how to use this computer tool to simulate this phenomenon on an agricultural landscape with a complex topography. (C) 2009 Wiley Periodicals, Inc. Comput Appl Eng Educ 17: 253-262. 2009; Published online in Wiley InterScience (www.interscicnce.wiley.com); DOI 10.1002/cae.20193

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

simulation
soil erosion
agricultural landscape


Influence of indoor and outdoor temperatures on the fingertip blood flow rate A building's air conditioning system could mitigate extremely high blood flow rates. In a comfortable environment, blood flow fluctuates between 15TPU and 40TPU. When outdoor weather is below 3C, warm indoor air can increase microcirculation. Remaining calm for a long time indoors could reduce the level of angiogenesis.

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

thermal comfort
thermal adaptation behaviour


Gravitation based classification Classification is one of the key issues in the fields of decision sciences and knowledge discovery. In this paper, we present a new classification method based on gravitational potential energy between particles. The basic principle of gravitation based classification (GBC) algorithm is to find the equilibrium condition of the classifier, which is modeled as a classifier line between two groups of fixed particles. In the proposed approach, the input data is a collection of masses, which interact with each other based on Newtons universal law of gravitation and the laws of motion. We present a convex formulation for this problem that always converges to a global optimum solution. The proposed method has been compared with some well-known classification approaches, and the results confirm the high performance of the proposed method.

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

classification
gravitational potential energy


Isolated word recognition with the Liquid State Machine: a case study The Liquid State Machine (LSM) is a recently developed computational model with interesting properties. It can be used for pattern classification, function approximation and other complex tasks. Contrary to most common computational models, the LSM does not require information to be stored in some stable state of the system: the inherent dynamics of the system are used by a memoryless readout function to compute the output. In this paper we present a case study of the performance of the Liquid State Machine based on a recurrent spiking neural network by applying it to a well known and well studied problem: speech recognition of isolated digits. We evaluate different ways of coding the speech into spike trains. In its optimal configuration, the performance of the LSM approximates that of a state-of-the-art recognition system. Another interesting conclusion is the fact that the biologically most realistic encoding performs far better than more conventional methods. (c) 2005 Elsevier B.V. All rights reserved.

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

spiking neural networks
parallel processing


Optimization of a cylindrical shell housing a belt-conveyor bridge A belt-conveyor bridge is built inside a ring-stiffened cylindrical shell, the belt-conveyor supports being independent of the stiffeners. Reliability-based and deterministic optimization results are compared. The design variables are the shell thickness as well as the thickness and the number of flat rings. Optimum solutions are evaluated for different bridge lengths in view of finding the most effective cost/span ratios. The design constraints relate to the local shell buckling strength, to the panel ring buckling and to the deflection of the bridge. The cost function includes the material and fabrication costs. A level II reliability method (FORM) is used to find the probability of failure. The overall structural reliability is obtained by using Ditlevsen method of conditional bounding. The costs of the plate designed to ensure a stipulated probability of failure will be compared with the solutions obtained for a code based method, which employs partial safety factors. A branch and bound strategy coupled with a entropy-based algorithm is used to provide discrete 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O B O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

structural optimization
welded joints
reliability-based design


Differentiation advantages in the on-line brokerage industry Research across a variety of industries shows that the lowest-priced on-line sellers do not have the highest market share. This makes it important to identify the sources of differentiation advantage that can result in higher market share. Insights from the resource-based view are utilized to identify on-line brokerage services that may create value for consumers and result in higher market share for on-line brokerage firms. Ownership of process patents for on-line brokerage activities is positively correlated with differentiation advantage. Direct access to the trading floor, unlimited free real-time quotes, and 24/7 live customer service are also correlated with differentiation advantages. The identification of specific services associated with higher market share sheds light on how on-line firms differentiate themselves from their competitors.

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

business differentiation
on-line brokerage
resource-based view


Collaborative learning in postgraduate level courses Pedagogical experiences in postgraduate level courses are presented. Students use computational tools and repositories in collaborative learning. Problems in medical environments, pollutants, and concept lattices are tackled. The enhancement of teaching-learning processes by collaborative learning is shown.

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

collaborative learning
postgraduate level courses

mobile learning
mobile networks
social networks


Three-Dimensional Microwave Breast Imaging: Dispersive Dielectric Properties Estimation Using Patient-Specific Basis Functions Breast imaging via microwave tomography involves estimating the distribution of dielectric properties within the patient's breast on a discrete mesh. The number of unknowns in the discrete mesh can be very large for 3-D imaging, and this results in computational challenges. We propose a new approach where the discrete mesh is replaced with a relatively small number of smooth basis functions. The dimension of the tomography problem is reduced by estimating the coefficients of the basis functions instead of the dielectric properties at each element in the discrete mesh. The basis functions are constructed using knowledge of the location of the breast surface. The number of functions used in the basis can be varied to balance resolution and computational complexity. The reduced dimension of the inverse problem enables application of a computationally efficient, multiple-frequency inverse scattering algorithm in 3-D. The efficacy of the proposed approach is verified using two 3-D anatomically realistic numerical breast phantoms. It is shown for the case of single-frequency microwave tomography that the imaging accuracy is comparable to that obtained when the original discrete mesh is used, despite the reduction of the dimension of the inverse problem. Results are also shown for a multiple-frequency algorithm where it is computationally challenging to use the original discrete mesh.

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

finite-difference time-domain (fdtd) methods


Interactive visualization of marine pollution monitoring and forecasting data via a Web-based GIS This work implements a Web-based Geographic Information System (Web GIS) for an existing oil spill monitoring and forecasting service, developed in the framework of the MARCOAST project. This is achieved by remotely presenting the results of the oil spill forecasting module via a dedicated Web GIS, which allows authenticated end users to view the simulation results in a geographical context. A number of Web GIS technologies for presentation of dissimilar types of semi-dynamic geographic data are applied and their respective capabilities for publishing and remote presentation of interactive geospatial information, such as oil spill spread animation overlaid on background data (terrain elevation data, satellite imagery, etc.), are described. More specifically, technologies like ESRI ArcIMS (Arc Internet Map Server) and Open Source GeoServer with OpenLayers client library are implemented. The capabilities of the system for visualization and mapping are illustrated by specific applications concerning the spreading scenarios of oil spills in two selected areas of the Aegean Sea, Greece. The presented Web GIS offers added value in the form of providing the end user with comprehensive and synthetic, both spatial and temporal, environmental information through a remotely customizable user-friendly graphical interface. In this context, its integration to a marine pollution monitoring and forecasting system could result in an enhanced pollution awareness and emergency management tool.

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

oil spill prediction
operational system
environmental management


Improvement of borrowing channel assignment for patterned traffic load by online cellular probabilistic self-organizing map This paper describes an improvement of borrowing channel assignment (BCA) for patterned traffic load by using the short-term traffic prediction ability of cellular probabilistic self-organizing map (CPSOM). The fast growing cellular mobile systems demand more efficient and faster channel allocation techniques today. In case of patterned traffic load, the traditional BCA methods are not efficient to further enhance the performance because heavy-traffic cells cannot borrow channels from their neighboring cells with light or medium traffic that may have unused nominal channels. The performance can be increased if the short-term traffic load can be predicted. The predicted results can then be used for channel re-assignment. Therefore, the unused nominal channels of the light-or-medium-traffic cells can be transferred to the heavy-traffic cells that need more nominal channels. In this paper, CPSOM is used online for traffic prediction. In this sense, the proposed CPSOM-based BCA method is able to enhance the performance for patterned traffic load compared with the traditional BCA methods. Simulation results corroborate that the proposed method enables the system to work with better performance for patterned traffic load than the traditional BCA methods.

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

borrowing channel assignment (bca)
cellular probabilistic som (cpsom)
dynamic channel allocation (dca)
fixed channel allocation (fca)
self-organizing map (som)


Understanding continuance usage intention of mobile internet sites Due to the high acquisition costs and low switching costs, retaining users and facilitating their continuance usage are crucial for mobile service providers. Integrating both perspectives of perceived utility and flow experience, this research identifies the factors affecting continuance usage intention of mobile internet sites. Data were collected through a survey, and data analysis was then conducted with structural equation modeling. The results indicated that system quality and information quality affect perceived usefulness, satisfaction and flow. And these three factors determine continuance usage intention. Among them, flow has the largest effect on continuance usage intention. The results imply that service providers need to improve users experience in order to facilitate their continuance usage of mobile internet sites.

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

continuance usage
mobile internet sites
perceived usefulness
flow


Analysis of Erlang capacity for the multimedia DS-CDMA systems In this paper, we focus on the evaluation of the Erlang capacity for multimedia DS-CDMA systems supporting the multi-class services with different transmission rates, bit error rates, traffic activity factors in the reverse link. The number of concurrent users of the corresponding service group is modeled as a K-dimension Markov chain. Then, the Erlang capacity for the multimedia system can be found based on a K-dimension M/M/m loss system. For an IS-95 type DS-CDMA system, supporting voice/data services, the capacity bounds are depicted in conjunction with the 2-dimensional Markov chain. Furthermore, it is observed that the Erlang capacity with respect to the each service group should be balanced to enhance the total system Erlang capacity. Finally, the channel reservation scheme is considered to increase the total system Erlang capacity.

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


Sub-module component developed in CBuilder for MMC control and protection test in RTDS The rtds_SM component, considering the bypass switch, is established by using CBuilder in RTDS. It is a flexible and available model to test the control and protection devices for MMC system. The memory usage and the simulation precision of the proposed model are analyzed in detail. Numerical results show that it meets the requirement of various operating conditions.

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

modular multilevel converter
sub-module
real time digital simulator


a platform-based design environment for synthetic biological systems Genomics has reached the stage at which the amount of DNA sequence information in existing databases is quite large. Synthetic biology is now using these databases to catalog sequences according to their functionality thus creating a system of standard biological parts. Flexible tools are needed which both permit access and modification to that data and also allow one to perform meaningful, intelligent manipulation. A Platform-Based Design approach views genetic information as having a particular functionality and assembles platforms (collections of DNA elements) to perform this functionality. Specifically this paper presents the Clotho toolset which uses these concepts to create a complete design environment for standardized biological parts.

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


Statistical relationships between journal use and research output at academic institutions in South Korea In this study, we analysed the statistical association between e-journal use and research output at the institution level in South Korea by performing comparative and diachronic analyses, as well as the analysis by field. The datasets were compiled from four different sources: national reports on research output indicators in science fields, two statistics databases on higher education institutions open to the public, and e-journal usage statistics generated by 47 major publishers. Due to the different data sources utilized, a considerable number of missing values appeared in our datasets and various mapping issues required corrections prior to the analysis. Two techniques for handling missing data were applied and the impact of each technique was discussed. In order to compile the institutional data by field, journals were first mapped, and then the statistics were summarized according to subject field. We observed that e-journal use exhibited stronger correlations with the number of publications and the times cited, in contrast to the number of undergraduates, graduates, faculty members and the amount of research funds, and this was the case regardless of the NA handling method or author type. The difference between the maximum correlation for the amount of external research funding with two average indicators and that of the correlation for e-journal use were not significant. Statistically, the accountability of e-journal use for the average times cited per article and the average JIF was quite similar with external research funds. It was found that the number of e-journal articles used had a strong positive correlation (Pearsons correlation coefficients of r>0.9, p<0.05) with the number of articles published in SCI(E) journals and the times cited regardless of the author type, NA handling method or time period. We also observed that the top-five institutions in South Korea, with respect to the number of publications in SCI(E) journals, were generally across a balanced range of academic activities, while producing significant research output and using published material. Finally, we confirmed that the association of e-journal use with the two quantitative research indicators is strongly positive, even for the analyses by field, with the exception of the Arts and Humanities.

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

correlation analysis
comparative analysis
diachronic analysis
e-journal use


An

Informatics

benchmarking

statement

Objectives:

Benchmarking

statements

provide

a

mechanism

for

making

academic

standards

explicit

within

a

subject

area.

They

allow

comparisons

between

courses

to

be

based

on

learning

outcomes

rather

than

by

defining

a

curriculum.

No

such

statement

has

been

produced

for

informatics.

In

the

absence

of

any

established

benchmarking

statements

for

informatics

a

new

biomedical

informatics

course

at

St.

George's

has

developed

a

first

benchmarking

statement

which

defines

the

skills

knowledge

and

understanding

a

biomedical

informatics

student

should

acquire

by

the

time

they

complete

the

course.

Methods:

Review

of

national

biomedical

science

and

computing

subject

benchmarking

statements

and

academic

educational

objectives

and

national

occupational

competencies

in

informatics.

Results.

We

have

developed

a

twenty-item

benchmarking

statement

and

this

is

available

on-line

at:

This

benchmarking

statement

includes

a

definition

and

justification

for

all

twenty

statements.

We

found

international

educational

objectives

and

national

informatics

competencies

useful

and

these

are

mapped

to

each

one.

National

subject

benchmarks

for

computing

and

biomedical

science

were

less

useful

and

have

not

been

systematically

mapped.

Conclusions:

Benchmarking

the

skills,

knowledge

and

understanding

that

a

student

should

acquire

during

their

course

of

study

may

be

more

useful

than

setting

a

standard

curriculum.

This

benchmarking

statement

is

a

first

step

towards

defining

the

learning

outcomes

and

competencies

a

student

of

this

discipline

should

acquire.

The

international

informatics

community

should

consider

moving

from

a

standard

curriculum

to

an

agreed

subject

benchmarking

statement

for

medical,

health

and

biomedical

informatics.

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


An adaptive boundary-element approach to 3D transient free-surface flow of viscous fluids An adaptive (Lagrangian) boundary-element approach is proposed for the general three-dimensional simulation of confined free-surface flow of viscous incompressible fluids. The method is stable as it includes remeshing capabilities of the deforming free surface, and thus can handle large deformations. A simple algorithm is developed for mesh refinement of the deforming free surface mesh. Smooth transition between large and small elements is achieved without significant degradation of the aspect ratio of the elements in the mesh. Several flow problems are presented to illustrate the utility of the approach.

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

adaptive boundary-element approach
3d transient free-surface flow


understanding the impact of computing and information technology on critical challenges facing 21st century financial market regulators This poster reports on the preliminary results of a research project designed to systematically identify the most critical computing and information technology-related challenges facing financial market regulators. Drawing on in-depth interviews with professionals from the financial market regulation community, this study asks the question "what are the most critical computing and information technology-related challenges facing 21 st century financial market regulators?" Drawing on the results, the poster presents a set of directions for future research.

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

cti 21st century challenges
financial market regulators


Modeling the acceptance of clinical information systems among hospital medical staff: An extended TAM model Recent empirical research has utilized the Technology Acceptance Model (TAM) to advance the understanding of doctors and nurses technology acceptance in the workplace. However, the majority of the reported studies are either qualitative in nature or use small convenience samples of medical staff. Additionally, in very few studies moderators are either used or assessed despite their importance in TAM based research. The present study focuses on the application of TAM in order to explain the intention to use clinical information systems, in a random sample of 604 medical staff (534 physicians) working in 14 hospitals in Greece. We introduce physicians specialty as a moderator in TAM and test medical staffs information and communication technology (ICT) knowledge and ICT feature demands, as external variables. The results show that TAM predicts a substantial proportion of the intention to use clinical information systems. Findings make a contribution to the literature by replicating, explaining and advancing the TAM, whereas theory is benefited by the addition of external variables and medical specialty as a moderator. Recommendations for further research are discussed.

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

greece
hospital
technology acceptance model

computer use
structural equation modeling