Semantic-associative visual content labelling and retrieval: A multimodal approach A novel framework referred to as collaterally confirmed labelling (CCL) is proposed, aiming at localising the visual semantics to regions of interest in images with textual keywords. Both the primary image and collateral textual modalities are exploited in a mutually co-referencing and complementary fashion. The collateral content and context-based knowledge is used to bias the mapping from the low-level region-based visual primitives to the high-level visual concepts defined in a visual vocabulary. We introduce the notion of collateral context, which is represented as a co-occurrence matrix of the visual keywords. A collaborative mapping scheme is devised using statistical methods like Gaussian distribution or Euclidean distance together with collateral content and context-driven inference mechanism. We introduce a novel high-level visual content descriptor that is devised for performing semantic-based image classification and retrieval. The proposed image feature vector model is fundamentally underpinned by the CCL framework. Two different high-level image feature vector models are developed based on the CCL labelling of results for the purposes of image data clustering and retrieval, respectively. A subset of the Corel image collection has been used for evaluating our proposed method. The experimental results to-date already indicate that the proposed semantic-based visual content descriptors outperform both traditional visual and textual image feature models.

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

semantic-level visual content descriptor


On-line cursive hangul recognition that uses DP matching to detect key segmentation points As a means to perform on-line recognition of cursive Korean characters, called hanguls, we describe a structural analysis type algorithm that searches globally for key points of segmentation on a character unit level and can cope with large variations in stroke shape and position. This segmentation points search is systematically performed by a two-level dynamic programming (DP) matching algorithm in conjunction with syntax control of hangul composition characteristics. Fine discrimination for phonemes and characters is effectively realized using mutual information among strokes. Experiments demonstrate computational feasibility and that the proposed approach provides high recognition and segmentation ability.

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

on-line character recognition
hangul (korean character)
inter-stroke information


Design of a GA-based fuzzy PID controller for non-minimum phase systems In this paper, a fuzzy PID controller, is investigated on the basis of genetic algorithms (GAs) to eliminate the undershoot of a nonminimum-phase (NMP) system and to improve the transient response at the same time. The proposed controller employs a two-stage control structure, where the fuzzy PI controller is reasonably used to cancel out the effect of unstable zeros and the fuzzy PD controller is introduced for the reason of reducing the overshoot. The fuzzy control rules for both controllers are evolved and determined by the GAs. It is demonstrated by computer simulations in which satisfactory performance can be achieved even if the system is under perturbed conditions. (C) 2000 Published by Elsevier Science B.V. All rights reserved.

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

nonminimum-phase system
two-stage fuzzy pid controller


Immunogenicity of a 40kDa Fragment of the 47kDa Recombinant Protein and DNA Vaccine from Karp Strain of Orientia tsutsugamushi In this study, the fragment of 47 kDa gene (301 bp-1428 bp) was cloned into a prokaryotic expression vector pBV220 to construct a recombinant plasmid pBV-47. The E. coli cells were transformed with pBV-47 and the transformants were induced to express the recombinant protein at 42C. The expression product (40 kDa) was detected by SDS-PAGE analysis and the 40kDa protein was recognized by mouse polyclonal antibodies against O. tsutsugamushi Karp strain in western blot analysis. The entire 47 kDa protein gene was inserted into an eukaryotic expression vector pcDNA3.1(+) to construct a recombinant plasmid pcDNA3.1/47 and Balb/c mice were immunized with recombinant pcDNA3.1/47, control vector pcDNA3.1, PBS buffer, 40 kDa protein, and recombinant pcDNA3.1/47 plus 40 kDa protein (pcDNA3.1/47/40), respectively. The results showed that spleen cells from pcDNA3.1/47/40-immunized mice gave higher proliferation than other groups. A significant IgG rise was detected in mice immunized with 40 kDa protein, but it was less strong than that in mice immunized with pcDNA3.1/47/40. The results suggested that immunization with pcDNA3.1/47 and 40 kDa protein simultaneously could induce a strong immune response.

O O O O O O O O B I I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 pose-wise linear illumination manifold model for face recognition using video The objective of this work is to recognize faces using video sequences both for training and novel input, in a realistic, unconstrained setup in which lighting, pose and user motion pattern have a wide variability and face images are of low resolution. There are three major areas of novelty: (i) illumination generalization is achieved by combining coarse histogram correction with fine illumination manifold-based normalization; (ii) pose robustness is achieved by decomposing each appearance manifold into semantic Gaussian pose clusters, comparing the corresponding clusters and fusing the results using an RBF network; (iii) a fully automatic recognition system based on the proposed method is described and extensively evaluated on 600 head motion video sequences with extreme illumination, pose and motion pattern variation. On this challenging data set our system consistently demonstrated a very high recognition rate (95% on average), significantly outperforming state-of-the-art methods from the literature.

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

face recognition
illumination
pose
robustness
video


An application of genetic algorithm method for solving patrol manpower deployment problems through fuzzy goal programming in traffic management system: a case study This article demonstrates a fuzzy goal programming (FGP) approach with the use of genetic algorithm (GA) for proper deployment of patrol manpower to various road-segment areas in urban environment in different shifts of a time period to deterring violation of traffic rules and thereby reducing the accident rates in a traffic control planning horizon. To expound the potential use of the approach, a case example of the city Kolkata, West Bengal, INDIA, is solved.

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

fuzzy goal programming
fgp
genetic algorithm
ga
traffic management


Automatic discovery and aggregation of compound names for the use in knowledge representations Automatic acquisition of information structures like Topic Maps or semantic networks from large document collections is an important issue in knowledge management. An inherent problem with automatic approaches is the treatment of multiword terms as single semantic entities. Taking company names as an example, we present a method for learning multiword terms from large text corpora exploiting their internal structure. Through the iteration of a search step and a verification step the single words typically forming company names are learnt. These name elements are used for recognizing compounds in order to use them for further processing. We give some evaluation of experiments on company name extraction and discuss some applications.

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

semantic relations
text mining
named entity extraction


Empirical assessment of using stereotypes to improve comprehension of UML models: A set of experiments Stereotypes were introduced into the Unified Modeling Language to provide means of customizing this general purpose modeling language for its usage in specific application domains. The primary role of stereotypes is to brand an existing model element with specific semantics, but stereotypes can also be used to provide means of a secondary classification of modeling elements. This paper elaborates on the influence of stereotypes on the comprehension of models. The paper describes a set of controlled experiments performed in academia and industry which were aimed at evaluating the role of stereotypes in improving comprehension of UML models. The results of the experiments show that stereotypes play a significant role in the comprehension of models and the improvement achieved both by students and industry professionals.

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


MSXmin: A modular multicast ATM packet switch with low delay and hardware complexity We propose and analyze the architecture for a large-scale high-speed multicast switch called MSXmin, The hardware complexity of MSXmin is O(N log(2) N) which compares favorably with existing architectures. Further, the internal latency of the MSXmin is O(log(2) N) bits. While it is superior to the existing architectures in terms of the hardware complexity and the internal latency, it is comparable to other multicast switches in terms of the header overhead and translation table complexity. MSXmin is output buffered and based on the group knockout principle. Moreover, MSXmin is a dual-bit-controlled tree-based switch.

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

asynchronous transfer mode
multistage interconnection networks
routing
switching circuits


Knowledge withholding intentions in teams: The roles of normative conformity, affective bonding, rational choice and social cognition We investigate factors that influence team members knowledge withholding intentions (KWI). Perceived organizational support, leader-member and team-member exchange directly reduce KWI. Justice perceptions indirectly influence KWI through meditation of social exchange variables. KWSE mediates the relationship between task interdependence and KWI.

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

kwse knowledge withholding self-efficacy

rmsea root mean square error of approximation

srmr standardized root mean square residual


covering a simple orthogonal polygon with a minimum number of orthogonally convex polygons The problem of covering a polygon with convex polygons has proven to be very difficult, even when restricted to the class of orthogonal polygons using orthogonally convex covers. We develop a method of analysis based on dent diagrams for orthogonal polygons, and are able to show that Keil's &Ogr; ( n 2 ) algorithm for covering horizontally convex polygons is optimal, but can be improved to &Ogr; ( n ) for counting the number of polygons required for a minimal cover. We also give an optimal &Ogr; ( n 2 ) algorithm for covering another subclass of orthogonal polygons. Finally, we develop a method of signatures which can be used to obtain polynomial time algorithms for an even larger class of orthogonal polygons.

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

proven diagrams method polygon algorithm polynomial analysis minimal class


selected ingredients in end-user programming In the area of human computer interaction, over the last twenty years, we have witnessed considerable progress in an ever-increasing bandwidth from the computer to the user. Application screens evolved from static text only screens to interactive GUI screens. These screens contain numerous graphical element or "widgets", supporting multiple data types, such as text, voice, image, and video. The widgets can range from simple ones like a combo box or slider to more complicated OCX's such as interactive graphs or maps.On the other hand, the tools to program this application are still in the domain of programmers. Although there has been much progress in various RAD tools, visual language and 4GL to improve ease of use, they still mostly target programmers. We believe that in order to allow end-users to develop their own advanced UI applications, it is necessary to create higher-level application abstractions or 'algebra' for stating the application in a declarative manner. This can be compared to the relational algebra operators in the data base area. They were created as abstractions for data base queries, enabling end users to express their own queries in a declarative manner. In doing so, bugs are minimized and program modifications and maintenance becomes trivial. In this paper, we will motivate the reader to see the need for these abstractions and classify them into categories, emphasizing areas ripe for further research.

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

wysiwyg programming
declarative programming


AWE: an animated work environment for working with physical and digital tools and artifacts We discuss the design, development, and testing of animated work environment (AWE), a novel, programmable, AWE supporting everyday human activities at work, at home, or at school in an increasingly digital society. A physical example of the emerging genre of "architectural robotics," AWE features a programmable, reconfigurable wall, three horizontal, mobile work-surfaces, and embedded information technologies. AWE is the result of an iterative design process involving surveys, task analyses, virtual and physical prototyping, and usability testing accomplished by a transdisciplinary team of engineers, architects, sociologists, and human factors psychologists. Usability testing has demonstrated AWEs potential to enhance working life: AWE adapts to variations in complex activities involving users working in one physical place with physical and digital tools and artifacts.

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

collaborative work
robotic workstation
interactive environments


Synthesis of Symmetric and Asymmetric Singly Terminated Elliptic Ladder Filters for Multiplexing Applications An extension of the Cauer ladder development for synthesizing singly terminated filters with symmetric and asymmetric responses is presented. Basically, a driving-point immittance including reactive constant elements is carried out in such a way that provides the transmission zeros. The reactive constant elements are introduced into the synthesis for two reasons. The first is to consider the possibility of the asymmetric position of transmission zeros in the real frequency axis. The second one is to obtain canonical forms, i.e. networks with the minimum number of elements in the case of symmetrical responses. To validate the proposed method, a filter with asymmetrical response has been synthesized, comparing different. topologies for its use in multiplexers. This fact is illustrated with a Ku-band elliptic response diplexer designed in H-plane rectangular waveguide. (C) 2009 Wiley Periodicals, Inc. Int J RF aid Microwave CAE 19: 443-452, 2009.

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

filter synthesis
pole removal
zero-shifting


Efficient disparity vector coding for multiview sequences A multiview sequence codec with view scalability was described in a previous paper. To enhance the performance of this codec, an efficient disparity vector coding method for multiview sequences is proposed herein. For higher coding efficiency, we encode the differential vectors acquired by subtracting the original vectors from the predicted ones. To enhance the performance of disparity vector coding, it is essential to predict the disparity vectors accurately. The prediction by this proposed method utilizes the correlation among the multiview images, while conventional methods exploit the correlation among the causal blocks. Experiments were performed for three different 5 view sequences. We were able to confirm that the proposed method predicts disparity vectors accurately by comparing the entropy and the mean absolute values for differential vectors with conventional methods. Its performance is superior to vector coding methods used in MPEG-4 which uses only a spatial correlation. The proposed method increases the coding efficiency by a factor of 3045% while preserving image quality.

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

multiview sequence codec
disparity vector coding


Evolving Fisher Kernels for Biological Sequence Classification Fisher kernels have been successfully applied to many problems in bioinformatics. However, their success depends on the quality of the generative model upon which they are built. For Fisher kernel techniques to be used on novel problems, a mechanism for creating accurate generative models is required. A novel framework is presented for automatically creating domain-specific generative models that can be used to produce Fisher kernels for support vector machines (SVMs) and other kernel methods. The framework enables the capture of prior knowledge and addresses the issue of domain-specific kernels, both of which are current areas that are lacking in many kernel-based methods. To obtain the generative model, genetic algorithms are used to evolve the structure of hidden Markov models (HMMs). A Fisher kernel is subsequently created from the HMM, and used in conjunction with an SVM, to improve the discriminative power. This paper investigates the effectiveness of the proposed method, named GA-SVM. We show that its performance is comparable if not better than other state of the art methods in classifying secretory protein sequences of malaria. More interestingly, it showed better results than the sequence-similarity-based approach, without the need for additional homologous sequence information in protein enzyme family classification. The experiments clearly demonstrate that the GA-SVM is a novel way to find features with good performance from biological sequences, that does not require extensive tuning of a complex model.

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

hidden markov models
genetic algorithms
fisher kernels
support vector machines


Diffusion of innovative behaviour with social responsibility Purpose - Development or existence of human society depends on innovations and the end of one-sidedness of behavior. The complexity of innovative processes has been widely studied, yet the success rate is still low. The purpose of this paper is to identify by the dialectical systems approach how some concepts, important for development of inventions into innovations can better support requisitely holistic innovative behavior. Design/methodology/approach - System theory, theory of innovations and social responsibility are used to understand diffusion of innovations as part of the innovative processes. Findings - Many established theories, methods, procedures and standards support innovation management, but its economic success remains poor. Invention-innovation-diffusion processes (IMP) remain poorly managed, especially the non-technological. The usual approach is too one-sided. Invention and innovation phases received more attention than the requisitely holistic consideration of the diffusion phase. Social responsibility can help. Research limitations/implications - The paper adds to requisite holism of IIDP management. It focuses on diffusion and its link with social responsibility. Practical implications - The new approach to IIDP is widely applicable for requisitely holistic rather than one-sided political or strategic decisions and actions. ISO 26000 can increase success of IMP. Originality/value - The concepts presented here are not detected in literature and offer great value for further research and understanding, designing and managing of IIDP. The selected dialectical system of viewpoints is original.

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

diffusion of innovations
social responsibility

cybernetics
innovative management
dialectical systems theory


On the choice of a stabilizing subgrid for convectiondiffusion problems SUPG and residual-free bubbles are closely related methods that have been used with success to stabilize a certain number of problems, including advection-dominated flows. In recent times, a slightly different idea has been proposed: to choose a suitable subgrid in each element, and then solving Standard Galerkin on the Augmented Grid. For this, however, the correct location of the subgrid node(s) plays a crucial role. Here, for the model problem of linear advectiondiffusion equations, we propose a simple criterion to choose a single internal node such that the corresponding plain-Galerkin scheme on the augmented grid provides the same a priori error estimates that are typically obtained with SUPG or RFB methods.

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

finite elements
stabilizations
augmented grids


A genetic algorithm for the Zen Puzzle Garden game In this paper we present a novel genetic algorithm (GA) solution to a simple yet challenging commercial puzzle game known as Zen Puzzle Garden (ZPG). We describe the game in detail, before presenting a suitable encoding scheme and fitness function for candidate solutions. By constructing a simulator for the game, we compare the performance of the GA with that of the A* algorithm. We show that the GA is competitive with informed search in terms of solution quality, and significantly out-performs it in terms of computational resource requirements. By highlighting relevant features of the game we hope to stimulate further work on its study, and we conclude by presenting several possible areas for future research.

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


efficient geometry-based similarity search of 3d spatial databases Searching a database of 3D-volume objects for objects which are similar to a given 3D search object is an important problem which arises in number of database applications for example, in Medicine and CAD. In this paper, we present a new geometry-based solution to the problem of searching for similar 3D-volume objects. The problem is motivated from a real application in the medical domain where volume similarity is used as a basis for surgery decisions. Our solution for an efficient similarity search on large databases of 3D volume objects is based on a new geometric index structure. The basic idea of our new approach is to use the concept of hierarchical approximations of the 3D objects to speed up the search process. We formally show the correctness of our new approach and introduce two instantiations of our general idea, which are based on cuboid and octree approximations. We finally provide a performance evaluation of our new index structure revealing significant performance improvements over existing approaches.

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

applications
use
structure
performance
correctness
concept
object
process
similarity search
3d
similarity
general
paper
octree
database
search

indexing
hierarchic
geometry
efficiency
examples
spatial database
performance evaluation


Sensitivity of Wardrop Equilibria We study the sensitivity of equilibria in the well-known game theoretic traffic model due to Wardrop. We mostly consider single-commodity networks. Suppose, given a unit demand flow atWardrop equilibrium, one increases the demand by epsilon or removes an edge carrying only an epsilon-fraction of flow. We study how the equilibrium responds to such an epsilon-change. Our first surprising finding is that, even for linear latency functions, for every epsilon > 0, there are networks in which an epsilon-change causes every agent to change its path in order to recover equilibrium. Nevertheless, we can prove that, for general latency functions, the flow increase or decrease on every edge is at most epsilon. Examining the latency at equilibrium, we concentrate on polynomial latency functions of degree at most p with nonnegative coefficients. We show that, even though the relative increase in the latency of an edge due to an epsilon-change in the demand can be unbounded, the path latency at equilibrium increases at most by a factor of (1 + epsilon)(p). The increase of the price of anarchy is shown to be upper bounded by the same factor. Let us remark that all our bounds are tight. For the multi-commodity case, we present examples showing that neither the change in edge flows nor the change in the path latency can be bounded.

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


efficient algorithms for incremental utility mining Temporal data mining is the activity of finding interesting correlations or patterns in large temporal data sets. On the other hand, utility mining aims at identifying the itemsets with high utilities. In 2006, Tseng et al. introduced the temporal utility mining which is extended from both temporal association rule mining and utility mining. In this study, we investigated the incremental utility mining which can identify all high temporal utility itemsets in a specified time period on an incremental transaction database. Two efficient algorithms, Incremental Utility Mining (IUM) and Fast Incremental Utility Mining (FIUM), were proposed. The experimental results also showed that both algorithms are efficient.

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


Forensic analysis techniques for fragmented flash memory pages in smartphones A mobile phone contains important personal information, and therefore, it should be considered in digital forensic investigations. Recently, the number of smartphone owners has increased drastically. Unlike feature phones, smartphones have high-performance operating systems (e.g., Android, iOS), and users can install and utilize various mobile applications on smartphones. Smartphone forensics has been actively studied because of the importance of smartphone user data acquisition and analysis for digital forensic purposes. In general, there are two logical approaches to smartphone forensics. The first approach is to extract user data using the backup and debugging function of smartphones. The second approach is to get root permission through the rooting or the bootloader method with custom kernel, and acquire an image of the flash memory. In addition, the other way is to acquire an image on a more physical way by using e.g., JTAG or chipoff process. In some cases, it may be possible to reconstruct and analyze the file system. However, existing methods for file system analysis are not suitable for recovering and analyzing data deleted from smartphones depending on the manner in which the flash memory image has to be acquired. This paper proposes new analysis techniques for fragmented flash memory pages in smartphones. In particular, this paper demonstrates analysis techniques on the image that the reconstruction of file system is impossible because the spare area of flash memory pages does not exist or that it is created from the unallocated area of the undamaged file system.

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

smartphone forensics
flash memory
unallocated area


An analytical approach for the modeling of real-time services over IP network The modeling and analysis of system and network performance issues are useful tools in the development and engineering processes. The analytical models have a high value in the early stages to uncover major performance problems which affect the design of the architecture before the cost of rectification is too high. The development of new modeling methods for rapid analysis is also very important for the further fast deployment of new applications and services. In this paper, we develop a modeling method, based on queuing theory, for the solution of network performance problems faced when trying to support real-time services over Internet Protocol (IP) network. Namely, we are modeling signaling network architecture for the real-time services using M/GX/1 queuing system. We evaluate and compute expected waiting time and time in system. Furthermore, we present numerical results of our calculations and provide corresponding curves for them. (C) 2008 IMACS. Published by Elsevier B.V. All rights reserved.

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

analytical modeling
queuing systems
real-time communications


Protecting research and technology from espionage In recent years, governmental and industrial espionage becomes an increased problem for governments and corporations. Especially information about current technology development and research activities are interesting targets for espionage. Thus, we introduce a new and automated methodology that investigates the information leakage risk of projects in research and technology (R&T) processed by an organization concerning governmental or industrial espionage. Latent semantic indexing is applied together with machine based learning and prediction modeling. This identifies semantic textual patterns representing technologies and their corresponding application fields that are of high relevance for the organizations strategy. These patterns are used to estimate organizations costs of an information leakage for each project. Further, a web mining approach is processed to identify worldwide knowledge distribution within the relevant technologies and corresponding application fields. This information is used to estimate the probability that an information leakage occur. A risk assessment methodology calculates the information leakage risk for each project. In a case study, the information leakage risk of defense based R&T projects is investigated. This is because defense based R&T is of particularly interest by espionage agents. Overall, it can be shown that the proposed methodology is successful in calculation the espionage information leakage risk of projects. This supports an organization by processing espionage risk management.

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

latent semantic indexing
espionage
risk assessment


Scheduling control for Markov-modulated single-server multiclass queueing systems in heavy traffic This paper studies a scheduling control problem for a single-server multiclass queueing network in heavy traffic, operating in a changing environment. The changing environment is modeled as a finite-state Markov process that modulates the arrival and service rates in the system. Various cases are considered: fast changing environment, fixed environment, and slowly changing environment. In all cases, the arrival rates are environment dependent, whereas the service rates are environment dependent when the environment Markov process is changing fast, and are assumed to be constant in the other two cases. In each of the cases, using weak convergence analysis, in particular functional limit theorems for Poisson processes and ergodic Markov processes, it is shown that an appropriate averaged version of the classical \(c\mu \)-policy (the priority policy that favors classes with higher values of the product of holding cost \(c\) and service rate \(\mu \)) is asymptotically optimal for an infinite horizon discounted cost criterion.

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

markov-modulated queueing networks
multiscale queueing systems
diffusion approximations
scaling limits
asymptotic optimality
\(c\mu \) rule
brownian control problem (bcp)
primary 60k25
90b22
90b35
90b36
secondary 60j70
60f05


Evaluation of the junction delineation accuracy and reproducibility with the SSRM technique Within this work, we have studied ultrathin n- and p-type extension implants in order to evaluate the junction delineation accuracy and reproducibility of the SSRM technique on ultra-shallow implants. This is a challenging task since it needs a technique that has simultaneously good sensitivity (<10%), high spatial resolution (13nm) and high dopant gradient resolution (12nm/dec). For every device, two different samples were prepared and measured separately. Unparallel reproducibility capabilities of the technique have been demonstrated as well as a sub-nanometer reproducibility for the lateral diffusion analysis. Regarding junction depths, reproducibility is 13nm where the main uncertainty is the varying silicide thickness.

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

afm
microscopy
two-dimensional
carrier-profile
quantification
spreading resistance


Risk curve and fuzzy portfolio selection In stochastic environment, variance, semivariance and probability of a bad outcome are three popular definitions of risk for portfolio selection. In fuzzy environment, variance is carried on as the definition of risk. However, in real life, risk is understood in many different ways. In this paper we propose a new definition of risk for portfolio selection in fuzzy environment. Based on this new definition, a new type of model is provided. To give a general solution to the new model problem, a hybrid intelligent algorithm is designed. One numerical example is also presented to illustrate the optimization idea and the effectiveness of the designed algorithm.

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

fuzzy portfolio selection
risk
optimization


an interactive out-of-core rendering framework for visualizing massively complex models With the tremendous advances in both hardware capabilities and rendering algorithms, rendering performance is steadily increasing. Even consumer graphics hardware can render many million triangles per second. However, scene complexity seems to be rising even faster than rendering performance, with no end to even more complex models in sight.In this paper, we are targeting the interactive visualization of the "Boeing 777" model, a highly complex model of 350 million individual triangles, which - due to its sheer size and complex internal structure - simply cannot be handled satisfactorily by today's techniques. To render this model, we use a combination of real-time ray tracing, a low-level out of core caching and demand loading strategy, and a hierarchical, hybrid volumetric/lightfield-like approximation scheme for representing not-yet-loaded geometry. With this approach, we are able to render the full 777 model at several frames per second even on a single commodity desktop PC.

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

real-time rendering
out-of-core rendering
distributed computing


Multi-conformation 3D QSAR study of benzenesulfonyl-pyrazol-ester compounds and their analogs as cathepsin B inhibitors Cathepsin B has been found being responsible for many human diseases. Inhibitors of cathepsin B, a ubiquitous lysosomal cysteine protease, have been developed as a promising treatment for human diseases resulting from malfunction and over-expression of this enzyme. Through a high throughput screening assay, a set of compounds were found able to inhibit the enzymatic activity of cathepsin B. The binding structures of these active compounds were modeled through docking simulation. Three-dimensional (3D) quantitative structureactivity relationship (QSAR) models were constructed using comparative molecular field analysis (CoMFA) and comparative molecular similarity indices analysis (CoMSIA) based on the docked structures of the compounds. Strong correlations were obtained for both CoMFA and CoMSIA models with cross-validated correlation coefficients (q2) of 0.605 and 0.605 and the regression correlation coefficients (r2) of 0.999 and 0.997, respectively. The robustness of these models was further validated using leave-one-out (LOO) method and training-test set method. The activities of eight (8) randomly selected compounds were predicted using models built from training set of compounds with prediction errors of less than 1 unit for most compounds in CoMFA and CoMSIA models. Structural features for compounds with improved activity are suggested based on the analysis of the CoMFA and CoMSIA contour maps and the property map of the protein ligand binding site. These results may help to provide better understanding of the structureactivity relationship of cathepsin B inhibitors and to facilitate lead optimization and novel inhibitor design. The multi-conformation method to build 3D QSAR is very effective approach to obtain satisfactory models with high correlation with experimental results and high prediction power for unknown compounds.

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

docking
comfa
comsia
cathepsin b
inhibitors
regression

multi-conformation qsar
4d qsar
partial least squares
pubchem


Statically safe speculative execution for real-time systems Deterministic worst-case execution for satisfying hard-real-time constraints, and speculative execution with rollback for improving average-case throughput, appear to lie on opposite ends of a spectrum of performance requirements and strategies. Nonetheless, we show that there are situations in which speculative execution can improve the performance of a hard real-time system, either by enhancing average performance while not affecting the worst-case, or by actually decreasing the worst-case execution time. The paper proposes a set of compiler transformation rules to identify opportunities for speculative execution and transform the code. Moreover, we have conducted an extensive experiment using simulation of randomly generated real-time programs to evaluate applicability and profitability of speculative execution. The simulation results indicate that speculative execution improves average execution time and program timeliness. Finally, a prototype implementation is described in which these transformations have been evaluated for realistic applications.

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

real-time systems
shadow execution
compiler transformations
static analysis
distributed computation


Analysis of restart mechanisms in software systems Restarts or retries are a common phenomenon in computing systems, for instance, in preventive maintenance, software rejuvenation, or when a failure is suspected. Typically, one sets a time-out to trigger the restart. We analyze and optimize time-out strategies for scenarios in which the expected required remaining time of a task is not always decreasing with the time invested in it. Examples of such tasks include the download of Web pages, randomized algorithms, distributed queries, and jobs subject to network or other failures. Assuming the independence of the completion time of successive tries, we derive computationally attractive expressions for the moments of the completion time, as well as for the probability that a task is able to meet a deadline. These expressions facilitate efficient algorithms to compute optimal restart strategies and are promising candidates for pragmatic online optimization of restart timers.

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

restart
software rejuvenation
completion time

time-out
fault-tolerant systems
performance and reliability modeling
adaptive systems
self-management


Near lossless compression of hyperspectral images based on distributed source coding Effective compression technique of on-board hyperspectral images has been an active topic in the field of hyperspectral remote sensintg. In order to solve the effective compression of on-board hyperspectral images, a new distributed near lossless compression algorithm based on multilevel coset codes is proposed. Due to the diverse importance of each band, a new adaptive rate allocation algorithm is proposed, which allocates rational rate for each band according to the size of weight factor defined for hyperspectral images subject to the target rate constraints. Multiband prediction is introduced for Slepian-Wolf lossless coding and an optimal quantization algorithm is presented under the correct reconstruction of Slepian-Wolf decoder, which minimizes the distortion of reconstructed hyperspectral images under the target rate. Then Slepian-Wolf encoder exploits the correlation of the quantized values to generate the final bit streams. Experimental results show that the proposed algorithm has both higher compression efficiency and lower encoder complexity than several existing classical algorithms.

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

hyperspectral images
near lossless compression
distributed source coding


Adaptive neuro-fuzzy inference systems with k-fold cross-validation for energy expenditure predictions based on heart rate We present a practical approach based on neuro-fuzzy systems to estimate energy expenditure using heart rate monitoring. The proposed approach improves the standard Flex-HR method in that it does not require individual calibration. The proposed approach treats the uncertainty in human physiological systems and in various workplaces by using fuzzy logic.

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

adaptive neuro-fuzzy inference system (anfis)


Non-negative matrix factorization with alpha-divergence Non-negative matrix factorization (NMF) is a popular technique for pattern recognition, data analysis, and dimensionality reduction, the goal of which is to decompose non-negative data matrix X into a product of basis matrix A and encoding variable matrix S with both A and S allowed to have only non-negative elements. In this paper, we consider Amari's alpha-divergence as a discrepancy measure and rigorously derive a multiplicative updating algorithm (proposed in our recent work) which iteratively minimizes the alpha-divergence between X and AS. We analyze and prove the monotonic convergence of the algorithm using auxiliary functions. In addition, we show that the same algorithm can be also derived using Karush-Kuhn-Tucker (KKT) conditions as well as the projected gradient. We provide two empirical study for image denoising and EEG classification, showing the interesting and useful behavior of the algorithm in cases where different values of alpha (alpha = 0.5,1,2) are used. (C) 2008 Elsevier B.V. All rights reserved.

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

alpha-divergence
multiplicative updates
non-negative matrix factorization


Theory and Methodology A bicriteria approach to the two-machine flow shop scheduling problem In this paper we address the problem of minimizing makespan and sum of completion times simultaneously in a two-machine flow shop environment. We formulate the problem as a bicriteria scheduling problem, and develop a branch-and-bound procedure that iteratively solves restricted single objective scheduling problems until the set of efficient solutions is completely enumerated. We report computational results, and explore certain properties of the set of efficient solutions. We then discuss their implications for the Decision Maker.

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

multiple criteria decision making
efficient set


Neural network for nonsmooth pseudoconvex optimization with general constraints ? In this paper, a one-layer recurrent projection neural network is proposed for solving pseudoconvex optimization problems with general convex constraints. The proposed network in this paper deals with the constraints into two parts, which brings the network simpler structure and better properties. By the Tikhonov-like regularization method, the proposed network need not estimate the exact penalty parameter in advance. Moreover, comparing with some existing neural networks, the proposed network can solve more general constrained pseudoconvex optimization problems. When the solution of the proposed network is bounded, it converges to the optimal solution set of considered optimization problem, which may be nonsmooth and nonconvex. Meantime, some sufficient conditions are presented to guarantee the boundedness of the solution of the proposed network. Numerical examples with simulation results are given to illustrate the effectiveness and good characteristics of the proposed network for solving constrained pseudoconvex optimization.

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

nonsmooth optimization
pseudoconvex function
differential inclusion


Iterative Galerkin-enriched multiscale finite-volume method The multiscale finite volume (MSFV) method was designed to efficiently compute approximate numerical solutions of elliptic and parabolic problems with highly heterogeneous coefficients. For a wide range of test cases, it has been demonstrated that MSFV solutions are in excellent agreement with reference data obtained with a standard fine-scale finite-volume method. However, for some problems involving large coherent structures with strong contrasts (e.g., channels and shale layers), the MSFV method produces unsatisfactory results due to the dwindling validity of the localization assumption. Recently, the iterative MSFV (i-MSFV) method was introduced to iteratively improve the localization assumption, and it was shown that the method converges to the fine-scale reference solution. In this work, it is explained how the convergence rate of the i-MSFV method can be enhanced by consistent enrichment of the initial coarse space spanned by nodal basis functions. A new set of enrichment basis functions associated with additional coarse-scale degrees of freedom (DoF) is introduced. By construction, the sum of all nodal and enrichment basis functions is one in the entire computational domain. Further, a hybrid finite-volume/Galerkin formulation for the coarse-scale problem and a generic placement strategy for the additional DoF are devised. The resulting iterative Galerkin-enriched MSFV (i-Ge-MSFV) method has all features of the i-MSFV method, but is more robust and has improved convergence properties.

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

multiscale methods
multiscale finite-volume
subsurface flow
elliptic problems
enriched coarse-space


Stochastic processes for computer network traffic modeling Computer networks such as local area and wide area networks possess complex characteristics due to the heterogeneous nature of the supported traffic. The network traffic exhibits highly irregular fractal-like structure and long term correlations. Various stochastic processes such as fractional Gaussian noise, multiplicative cascades, linear fractional stable motion have been proposed to model network traffic. These stochastic processes are relatively unheard of in the networking community, until recently. This paper provides a thorough review of these stochastic processes and their application to wireless traffic modeling. (c) 2005 Elsevier B.V. All rights reserved.

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

fractional stable motion
traffic modeling

self-similarity
long-range dependence
fractals
multifractals
1/f process
point process
infinitely divisible cascade


Task interruptability and duration as measures of visual distraction Tasks that are easily interrupted under intermittent viewing conditions may be less distracting while driving because they allow drivers greater control over task sharing decisions. This paper investigates the reliability and sensitivity of the occlusion paradigm as a potential means of measuring task interruptability and distraction. Twenty-four participants, between the ages of 21 and 34, completed two separate experimental sessions. In one session they performed three in-vehicle tasks (a radio-tuning task and two simulated visual search tasks) under occlusion and while unoccluded. In another session, participants completed the same in-vehicle tasks while driving in a simulator, without occlusion. The tasks did not differ in terms of total task time, yet significant differences were found using the occlusion paradigm and subjective workload ratings. Task interruptability and task duration both need to be considered when assessing the suitability of tasks for time-sharing with driving.

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


A non-parametric data-based approach for probabilistic flood forecasting in support of uncertainty communication In addition to structural measures, governmental authorities have set up flood forecasting systems to be used as early warning systems, to minimize the damage of future floods. These flood forecasting systems make use of hydrological and hydrodynamic models and input time series (measured and predicted rainfall, evapotranspiration, water levels and discharges). The uncertainty of these models and time series, certainly the predicted rainfall, is high and not always known. Consequently the prediction power of the flood forecasting systems is often unclear. To calculate the predictive uncertainty in the forecasts, a method has been set up, which involves computation of the exceedance probability of alert and alarm levels. The uncertainty results allow far more complete information to be provided to decision makers (incomparison with deterministic model-based forecasts). The uncertainty estimation is based on the statistical analysis of historical flood forecasting results. The forecast residuals (differences between predictions and measurements at river gauging stations) have been analysed using a non parametric technique. Because the residuals are correlated with the value of the simulated water level and time horizon, the residuals are split up into discrete classes of simulated water levels and time horizons. For each class, percentile values of the residuals are calculated and stored in a so called three dimensional error matrix. Based on 3D interpolation in the error matrix, confidence intervals on forecasted water levels are calculated and visualised. The method is implemented in software for post processing of the forecast results, and is connected to the database of a river flood forecasting system in Belgium. Hereby it is possible to update the error matrix in real time, based on new simulations.

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

probabilistic forecasting
operational flood forecasting
non parametric approach


how to identify binary relations for domain models Many approaches to requirements engineering include building a model of the domain. Those using entity relationship modeling or deriving from it employ the concept of relations between entities, but identifying the relations is still more of an art than science or engineering. We deal with this problem primarily in the context of object oriented analysis (OOA), where relations between object classes are to be identified. Our new approach uses natural language definitions of object classes and looks for names of other object classes in these definitions, since such a reference indicates a relation. Based on this idea, we identify most binary relations for domain models in a new way. We also provide tool support for this method, which shows that a high degree of automation is possible. Both a case study using the well known ATM (automated teller machine) example and real world experience with our approach suggest its usefulness.

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

domain models
requirements engineering
ooa
automated teller machine
binary relations
entity relationship modeling
natural language definitions
object classes
object oriented analysis
real world experience
atm

abstract data types
automatic teller machines
formal specification
bank data processing
natural languages
object-oriented methods


Neural network-particle swarm modeling to predict thermal properties Seven thermal properties: melting point temperature, boiling point temperature, critical temperature, autoignition temperature, flash point temperature, lower flammability limit temperature and upper flammability limit temperature, were estimated using a hybrid method that includes an artificial neural network (ANN) with particle swarm optimization (PSO). A database of 530 substances was used in the training of this hybrid algorithm. To discriminate the different substances the molecular structures were given as input parameters. Different topologies of the neural network were studied and the best architecture was determined. The optimal condition of the network was obtained adjusting the PSO parameters by trial-and-error. The results show that the proposed ANN + PSO method represent an excellent alternative for the estimation of thermophysic properties with acceptable accuracy. (C) 2012 Elsevier Ltd. All rights reserved.

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

particle swarm optimization
thermal properties
molecular structures

artificial neural networks
biological algorithms


using reified contextual information for safe run-time adaptation of software product lines Software product lines (SPLs) is a paradigm to implement software products based on features. Contemporary SPL implementation techniques provide support for compile-time composition of features. Many approaches have been suggested for run-time adaptation of product lines which do not consider safe composition properties. This paper presents FeatureJ which enables safe compile-time and run-time composition of multiple product lines. We identify four compilation techniques necessary to achieve safe run-time adaptation of product lines in FeatureJ: (a) type checking of feature modules, (b) availability of contextual information at runtime, (c) resolving class-loading issues for multiple updated variants, and (d) an application container for executing and updating multiple variants. Accordingly, we show how an existing approach can be integrated with FeatureJ to support safe run-time adaptation.

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


Application of a two-stage fuzzy neural network to a prostate cancer prognosis system Propose a two-stage fuzzy neural network (FNN) for prediction. The results for three benchmark functions show that the proposed FNN has better performance. The proposed algorithm is applied to prostate cancer prognosis.

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

fuzzy neural network
prostate cancer
prognosis

optimization version of an artificial immune network


Hybrid algorithm for discrete event simulation based supply chain optimization Supply chain optimization, as a key determinant of strategic resources mobility along the value-added chain, allows each participant in the global network to capitalize on its particular strategic competency. Simulation is widely used to test the impact on supply chain performance for the strategic level decisions, such as the number of plants, the modes of transport, or the relocation of warehouses. However, the complexity of supply chain optimization problem and the stochastic nature of simulation cause the unaffordable computational load; the evaluation of a large number of alternatives for supply chain optimization is in a class of NP-hard problem and the number of simulation replications is required for accurately evaluating the performance of each alternative. The objective of the present work is to propose hybrid algorithm with the application of the nested partitioning (NP) method and the optimal computing budget allocation (OCBA) method to reduce the computational load, hence, to improve the efficiency of supply chain optimization via discrete event simulation. The NP method is a global sampling strategy that is continuously adapted via a partitioning of the feasible solution region. The number of candidate alternatives to be evaluated can be reduced by the application of NP. The OCBA method minimizes the number of samples (simulation replications) required to evaluate a particular alternative by allocating computing resources to potentially critical alternative. Carefully designed experiments show extensive numerical result to illustrate the benefits of the proposed approach.

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

supply chain optimization
simulation
nested partitioning
optimal computing budget allocation


Robust histogram construction from color invariants for object recognition An effective object recognition scheme is to represent and match images on the basis of histograms derived from photometric color invariants. A drawback, however, is that certain color invariant values become very unstable in The presence of sensor noise. To suppress the effect of noise for unstable color invariant values, in this paper, histograms are computed by variable kernel density estimators. To apply variable kernel density estimation in a principled way, models are proposed for the propagation of sensor noise through color invariant variables. As a result, the associated uncertainty is obtained for each color invariant value. The associated uncertainty is used to derive the parameterization of the variable kernel for the purpose of robust histogram construction. It is empirically verified that the proposed density estimator compares favorably to traditional histogram schemes for the purpose of object recognition.

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

object recognition
color invariants
histogram construction
kernel density estimation

noise robustness
noise propagation
matching


CMOS PULSE GENERATOR FOR BPSK, OOK, PAM, AND PPM MODULATIONS This work presents a single chip integrated pulse generator-modulator to be utilized in a short range wireless radio sensors remote control applications. The circuit, which can generate single pulses, modulated in BPSK, OOK, PAM, and also PPM, has been developed in a standard CMOS technology (AMS 0.35 mu m). Typical pulse duration is about 1 ns while pulse repetition frequency is until 200 MHz (5 ns "chip" time). The operating supply voltage is +/- 2.5V, while the whole power consumption is about 15 mW. Post-layout parametric and corner analyses have confirmed the theoretical expectations.

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

pulse generation
cmos integrated circuits
ppm modulators


Source coding algorithms using the randomness of a past sequence We propose source coding algorithms that use the randomness of a past sequence. The proposed algorithms solve the problems of multi-terminal source coding, rate-distortion source coding, and source coding with partial side information at the decoder. We analyze the encoding rate and the decoding error rate in terms of almost-sure convergence.

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

bits-back coding
lossy source coding
random coding
simulated random coding algorithm


An improved articulated model of the human hand We present an improved anatomically based approach to modeling the human hand for use in the animation of the American Sign Language. The joint rotations in the model are based on the bone and muscle configurations of the hand, and a forward kinematic solution is used to position the hand. In particular, we investigate the rotations of the base joint of the thumb. This joint is a saddle joint with nontrivial rotational axes and centers, and must be treated with care in such a model. We take advantage of several correlations between joint rotations in the hand to reduce the number of degrees of freedom in the model and to provide a simple, natural, and interactive interface for American Sign Language handshape transcription.

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

modeling
animation
american sign language


Autonomous collaborative environment for project-based learning The importance of integrating different disciplines of information science and technology is growing for the realization of an information system which works robustly in the real world. Such a system should be achieved by integrating different disciplines, since it is difficult to cover all areas in information science and technology by only one person or group. In order to support collaboration, the autonomous collaborative environment for project- based learning was developed. The environment comprises the workshop A Hundred Hour Workshop and the community site WS100H.NET. Novel interdisciplinary technology, fusion of recognition and parallel computation was successfully developed whose collaboration process was autonomous.

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

computer supported collaborative learning


Coupled compressed sensing inspired sparse spatial-spectral LSSVM for hyperspectral image classification Inspired by the recently developed Compressed Sensing (CS) theory, this study advances a sparse Spatial-Spectral Least Square Support Vector Machine (SS-LSSVM) for Hyperspectral Image Classification (HIC). In our work, hyperspectral pixels are redefined in both the spectral domain and spatial domain by adaptively selecting their spatial neighbors according to the edge-map. The weighted sum of spectral and spatial features is utilized to construct an SS-LSSVM model. The SS-LSSVM is regarded as a topology comprised of a large number of support vectors, and a sparse SS-LSSVM is derived from a Coupled Compressed Sensing (CCS) of this topology. The sparsity of our proposed CCS inspired Sparse SS-LSSVM (CCS4-LSSVM) improves the classification accuracy of SS-LSSVM for HIC. Furthermore, by combining spectral information and adaptively extracted spatial information together, CCS4-LSSVM cannot only avoid the speckle-like misclassification of original LS-SVM but also reduce the influence of noisy pixels. The performance of our proposed method is evaluated on some hyperspectral image data, and the results show that it can achieve higher classification accuracy than the Spatial-Spectral SVM (SS-SVM) and Spatial-Spectral LSSVM (SS-LSSVM).

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

image classification
support vector machine
compressed sensing

sparse representation
multiple measurement vectors


An old-fashioned connectionist approach to a Cajun chord change problem In this paper, the problem of changing chords when playing Cajun music is introduced. A number of connectionist network simulations are then described, in which the networks attempted to learn to predict chord changes correctly in a particular Cajun song, 'Bayou Pompon'. In the various sets of simulations, the amount of information provided to the network was varied. While the network had difficulty in solving the problem with six one-eighths of a bar of melody information, performance radically improved when the network was provided with seven one-eighths of a bar of melody information. A post-training analysis of a trained network revealed a 'rule'for solving the problem. In addition to providing useful insight for scholars interested in traditional Cajun music, the results described here also illustrate how a traditional connectionist network, trained with the familiar backpropagation learning algorithm, can be used to generate a theory of the task.

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


Conceptual foundations for understanding smart tourism ecosystems Using digital ecosystems and smart business networks as conceptual building blocks, this paper defines, describes and illustrates the idea of a smart tourism ecosystem (STE). It further draws on conceptualizations of smart technologies, smart cities and smart tourism to envision new ways in which value is created, exchanged and consumed in the STE. Technologies essential to the functioning of an STE are described and it is argued that data emerging from these technologies are the driver for new business models, interaction paradigms and even new species. Critical questions regarding the need for regulatory intervention and innovative research are raised.

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

value creation
open innovation
sharing economy
tourism experience


Fitting single and mixture of generalized lambda distributions to data via discretized and miximum likelihood methods: GLDEX in R This paper describes the use of GLDEX in R to fit distributions to empirical data using the discretized and maximum likelihood methods. The GLDEX package also provides diagnostic tests to examine the quality of fit through the resample Kolmogorov-Smirnoff test, quantile plots and comparison of the mean, variance, skewness and kurtosis between the empirical data and the fitted distribution.

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

mixtures
maximum likelihood estimation
smoothing


Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs We introduce a new framework for designing fixed-parameter algorithms with subexponential running time-2(O(root k))n(O(1)). Our results apply to a broad family of graph problems, called bidimensional problems, which includes many domination and problems such as vertex cover, feedback vertex set, minimum maximal matching, dominating set, edge dominating set, disk dimension, and many others restricted to bounded-genus graphs (phrased as bipartite-graph problem). Furthermore, it is fairly straightforward to prove that a problem is bidimensional. In particular, our framework includes, as special cases, all previously known problems to have such subexponential algorithms. Previously, these algorithms applied to planar graphs, single-crossing-minor-free graphs, and/or map graphs; we extend these results to apply to bounded-genus graphs as well. In a parallel development of combinatorial results, we establish an upper bound on the treewidth (or branchwidth) of a bounded-genus graph that excludes some planar graph H as a minor. This bound depends linearly on the size vertical bar V(H)vertical bar of the excluded graph H and the genus g(G) of the graph G, and applies and extends the graph-minors work of Robertson and Seymour. Building on these results, we develop subexponential fixed-parameter algorithms for dominating set, vertex cover, and set cover in any class of graphs excluding a fixed graph H as a minor. In particular, this general category of graphs includes planar graphs, bounded-genus graphs, single-crossing-minor-free graphs, and any class of graphs that is closed under taking minors. Specifically, the running time is 2(O(root k))n(h), where h is a constant depending only on H, which is polynomial for k = O(log(2) n). We introduce a general approach for developing algorithms on H-minor-free graphs, based on structural results about H-minor-free graphs at the heart of Robertson and Seymour's graph-minors work. We believe this approach opens the way to further development on problems in H-minor-free graphs.

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

design
theory
(k, r)-center
fixed-parameter algorithms
map graph


EXPERTISE TRANSFER, KNOWLEDGE ELICITATION, AND DELAYED RECALL IN A DESIGN CONTEXT This paper describes a new method for knowledge elicitation that may contribute to effective expertise transfer from human experts to knowledge-based systems. The method was applied to knowledge transfer in an aerospace design context. Knowledge was transferred directly from an expert designer to both expert and novice ''receivers'' of information. Transfer occurred in a natural way, without intervention from a knowledge engineer. To evaluate the process, the information receivers were required to recall the transmitted knowledge after a seven week delay. Results suggest that this method can be effective for expertise transfer and can indicate desirable characteristics for knowledge-based systems which aim to be adaptable to users' differing levels of competence.

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

knowledge elicitation
expertise transfer
delayed recall


Stability ordinates of Adams predictor-corrector methods How far the stability domain of a numerical method for approximating solutions to differential equations extends along the imaginary axis indicates how useful the method is for approximating solutions to wave equations; this maximum extent is termed the imaginary stability boundary, also known as the stability ordinate. It has previously been shown that exactly half of Adams-Bashforth (AB), Adams-Moulton (AM), and staggered Adams-Bashforth methods have nonzero stability ordinates. In this paper, we consider two categories of Adams predictor-corrector methods and prove that they follow a similar pattern. In particular, if \(p\) is the order of the method, AB\(p\)-AM\(p\) methods have nonzero stability ordinate only for \(p = 1, 2, \ 5, 6,\ 9, 10, \ldots \), and AB(\(p-\)1)-AM\(p\) methods have nonzero stability ordinates only for \(p = 3, 4, \ 7, 8, \ 11, 12, \ldots \).

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

imaginary stability boundary
stability ordinate


Identifying loops in almost linear time Loop identification is an essential step in performing various loop optimizations and transformations. The classical algorithm for identifying loops is Tarjan's interval-finding algorithm, which is restricted to reducible graphs. More recently, several people have proposed extensions to Tarjan's algorithm to deal with irreducible graphs. Havlak presents one such extension, which constructs a loop-nesting forest for an arbitrary flow graph. We show that the running time of this algorithm is quadratic in the worst-case, and not almost linear as claimed. We then show how to modify the algorithm to make it run in almost linear time. We next consider the quadratic algorithm presented by Sreedhar et al. which constructs a loop-nesting forest different from the one constructed by the Havlak algorithm. We show that this algorithm too can be adapted to run in almost linear time. We finally consider an algorithm due to Steensgaard, which constructs yet another loop-nesting forest. We show how this algorithm can be made more efficient by borrowing ideas from the other algorithms discussed earlier.

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


The Anatomy of a Large Mobile Massively Multiplayer Online Game We describe a large-scale and long-term measurement study of a popular mobile Massively Multiplayer Online Role Playing Game (MMORPG) called Parallel Kingdom, which has over 600,000 unique users distributed across more than 100 countries. Our study covers important aspects of the game including (i) characteristics of its population, (ii) players' game usage behavior, and (iii) correlation between players' interest and the money spent by them in the game. Our measurement study spans almost the entire life of the game staring from its inception on October 31, 2008 to November 10, 2011 (1104 days in total). To perform this study, we instrumented the game's client software (iOS and Android) to interact with our measurement server. The rich dataset gathered allowed us to analyze various characteristics of this highly popular mobile MMORPG.

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

mobile games
mobile applications
characterization


Optimal actuation of nonlinear resonant systems In this study, we examine a new approach for actuation of dynamical systems with minimum work and maximum amplitude while maintaining constraints on the actuation force. Two methodology issues are addressed in the paper: sensitivity analysis about the nonlinear transient response and exploration of the strongly nonlinear relationship between the two objectives and the actuation design variables. The optimization analysis is carried out on lightly damped Duffing systems. The formulation of the optimization problem is found ideally suited to resolve the difficulty of dependence of response on initial conditions. The tradeoff curve of work and amplitude is computed. The optimal actuation strove to compensate for the limited force amplitude by an abrupt change in the force in time. Finally the optimization procedure is demonstrated on the kinematic design of hovering insect flight. The optimal design gives 50% reduction in power consumption, with a larger cutback for an actuation with high acceleration.

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

dynamic response optimization
spectral element
time periodic
path optimization
adjoint sensitivity
trajectory optimization
optimal periodic control


Forecasting with a noncausal VAR model Forecasting methods for a noncausal VAR model are proposed. Due to the nonlinearity of the prediction problem, simulation methods are required. Monte Carlo simulations are used to illustrate the methods. An empirical application to inflation forecasting is presented.

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

noncausal vector autoregression
importance sampling


Constructing road safety performance indicators using Fuzzy Delphi Method and Grey Delphi Method The main goal of this paper is to construct three sets of road safety performance indicators, which are regional road safety performance indicators, urban road safety performance indicators and highway safety performance indicators, respectively. Fuzzy Delphi Method and Grey Delphi Method are applied to quantify experts attitudes to regional road safety, urban road safety and highway safety. Comparing the results of two methods, the different results of two methods are analyzed, and then the final safety performance indicators are obtained by taking the intersection of results of two methods. Finally, three sets of performance indicators are constructed, which can be described and evaluated the safety level of region, urban road and highway, respectively. The research findings show that the method used in this paper is feasible and practical and can be provided as a reference for the administrative authority of road safety.

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

fuzzy delphi method
grey delphi method
regional road safety
urban road safety
highway safety


Building Legitimacy for IT Innovations: The Case of Computerized Physician Order Entry Systems Research on IT innovations has largely relied on economic-rationalistic models and focused on individuals or organizations as the unit of analysis. The intent of this paper is to advance an alternative research agenda that explores the institutional underpinnings of IT innovation diffusion at the inter-organizational level. Through a multi-stage research study, we examine the legitimation function of organizing visions for IT innovations and develop a taxonomy of legitimation strategies employed by the proponents of an IT innovation. We first built a preliminary theoretical framework that synthesizes key arguments on legitimacy drawn from the organization theory and IS literatures. Next, we conducted an exploratory case study of institutional entrepreneurship surrounding computerized physician order entry (CPOE) systems. We examined the discursive actions of CPOE vendors by content analyzing 165 press releases issued between 1998 and 2006. We then combined the findings of the literature analysis and the case study to create a taxonomy of discursive strategies for building IT innovation legitimacy. A post-hoc analysis of the case study data reveals a number of interesting patterns in the CPOE vendors' use of the legitimation strategies and helps us formulate a set of research questions to guide future investigations. The work reported in this paper lays a foundation for a deeper understanding of the role of legitimacy and legitimation in shaping diffusion of IT innovations. It also contributes to the conceptual and methodological elaboration of the organizing vision framework.

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

it innovation
legitimacy
organizing visions


Characterizations of regular ordered semigroups by generalized fuzzy ideals Let S be an ordered semigroup. In this paper we first introduce the concepts of (is an element of, is an element of Vq(k))-fuzzy ideals, (is an element of, is an element of Vq(k))-fuzzy bi-ideals and (is an element of, is an element of Vq(k))-fuzzy generalized bi-ideals of an ordered semigroup S by the ordered fuzzy points of S, and investigate their related properties. Furthermore, characterizations of regular ordered semigroups by the properties of (is an element of, is an element of Vq(k))-fuzzy left ideals, (is an element of, is an element of Vq(k))-fuzzy right ideals and (is an element of, is an element of Vq(k))-fuzzy (generalized) bi-ideals are given.

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

(is an element of, is an element of vq(k))-fuzzy left (right) ideal

(is an element of, is an element of vq(k))-fuzzy (generalized) bi-ideal


Real-time coordination of secondary voltage control and power system stabilizer This paper is devoted to the coordination of secondary voltage control and adaptive parameters resetting of the power system stabilizer, in order to increase stability margins in real time operation. Secondary voltage control and the power system stabilizer are two control loops, which affect the same system parameter on different bases that parameter is the voltage set-point of the automatic voltage regulator. It was found that their effects were complementary. In that way, through the proper coordination of actions of these two control loops open up a wide range of possibilities for ensuring the stability of bulk power systems in real time. For the establishment of this coordination, an on-line sequential algorithm is proposed which is based on adaptive resetting of the voltage set-point of the automatic voltage regulator and the PSS parameters. The efficiency of the proposed algorithm is confirmed through simulations on a real-life multi-machine bulk power system.

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


domain-independent entity extraction from web search query logs Query logs of a Web search engine have been increasingly used as a vital source for data mining. This paper presents a study on large-scale domain-independent entity extraction from search query logs . We present a completely unsupervised method to extract entities by applying pattern-based heuristics and statistical measures. We compare against existing techniques that use Web documents as well as search logs, and show that we improve over the state of the art. We also provide an in-depth qualitative analysis outlining differences and commonalities between these methods.

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

query logs
entity extraction
data mining


Two-dimensional numerical approach for the vibration isolation analysis of thin walled wave barriers in poroelastic soils This paper is concerned with the vibration isolation efficiency analysis of total or partially buried thin walled wave barriers in poroelastic soils. A two-dimensional time harmonic model that treats soils and structures in a direct way by combining appropriately the conventional Boundary Element Method (BEM), the Dual BEM (DBEM) and the Finite Element Method (FEM) is developed to this aim. The wave barriers are impinged by Rayleigh waves obtained from Biots poroelasticity equations assuming a permeable free-surface. The suitability of the proposed model is justified by comparison with available previous results. The vibration isolation efficiency of three kinds of wave barriers (open trench, simple wall, open trench-wall) in poroelastic soils is studied by varying their geometry, the soil properties and the frequency. It is found that the efficiency of these wave barriers behaves similarly to these in elastic soils, except for high porosities and small dissipation coefficients. The efficiency of open trench-wall barriers can be evaluated neglecting their walls if they are typical sheet piles. This does not happen with walls of bigger cross-sections, leading in general to efficiency losses. Likewise, increasing the burial depth to trench depth ratio has a negative impact on the efficiency.

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

vibration isolation
poroelasticity
rayleigh waves

thin structures
dual boundary element method
bemfem coupling


high-level debugging in parasight Debugging parallel programs with time critical dependencies is difficult due to subtle race conditions that may cause deadlock, starvation, and other errors. These errors can be detected by multiple instrumentation points triggered by logical assertions. Although some advanced debuggers provide a programmer with the ability to define complex logical assertions, they are inadequate for debugging parallel programs due to the high overhead of monitoring these assertions. This paper describes the facilities for high-level debugging in Parasight a parallel programming environment. In Parasight, high-level debugging facilities are implemented as separate programs that are linked dynamically to a target program. The target program is controlled by attaching these debugging programs to light-weight instrumentation points that are dynamically inserted and deleted. Different facilities of arbitrary complexity may be created to support high-level debugging. Parasight has been implemented on Multimax a shared-memory multiprocessor. It has been used for debugging and profiling C programs.

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

deadlock
program
dependencies
parallel programming
support
complexity
paper
errors
debugging
programmer

point
environments
shared memory multiprocessors
timing
race condition
instrument
monitor
profiles
critic
lighting
assert