A theory of visual attention.

A unified theory of visual recognition and attentional selection is developed by integrating the biased-choice model for single-stimulus recognition (Luce, 1963; Shepard, 1957) with a choice model for selection from multielement displays (Bundesen, Pedersen, & Larsen, 1984) in a race model framework. Mathematically, the theory is tractable, and it specifies the computations necessary for selection. The theory is applied to extant findings from a broad range of experimental paradigms. The findings include effects of object integrality in selective report, number and spatial position of targets in divided-attention paradigms, selection criterion and number of distracters in focused-attention paradigms, delay of selection cue in partial report, and consistent practice in search. On the whole, the quantitative fits are encouraging.


Exercise prescription for overhead athletes with shoulder pathology: a systematic review with best evidence synthesis.

OBJECTIVE
To produce a best evidence synthesis of exercise prescription used when treating shoulder pathology in the overhead athlete.

DESIGN
A systematic review of exercises used in overhead athletes including case studies and clinical commentaries.

DATA SOURCES
MEDLINE, PubMed, SPORTDiscus and CINAHL from database inception through July 8, 2016.

METHODS
We examined data from randomised controlled trials and prospective cohort (level I-IV evidence) studies that addressed exercise intervention in the rehabilitation of the overhead athlete with shoulder pathology. Case studies and clinical commentaries (level V evidence) were examined to account for expert opinion-based research. Data were combined using best evidence synthesis and graded (A-F) recommendations (Centre for Evidence-Based Medicine).

RESULTS
There were 33 unique exercises in six level I-IV studies that met our inclusion criteria. Most exercises were single-plane, upper extremity exercises performed below 90o of elevation. There were 102 unique exercises in 33 level V studies that met our inclusion criteria. These exercises emphasised plyometrics, kinetic chain and sport-specific training.

CONCLUSIONS AND RELEVANCE
Overall, evidence for exercise interventions in overhead athletes with shoulder pathology is dominated by expert opinion (grade D). There is great variability between exercise approaches suggested by experts and those investigated in research studies and the overall level of evidence is low. The strongest available evidence (level B) supports the use of single-plane, open chain upper extremity exercises performed below 90° of elevation and closed chain upper extremity exercises. Clinical expert pieces support a more advanced, global treatment approach consistent with the complex, multidimensional nature of sport.


No Free Lunch Theorems: Limitations and Perspectives of Metaheuristics

The No Free Lunch (NFL) theorems for search and optimization are reviewed and their implications for the design of metaheurist ics are discussed. The theorems state that any two search or optimization algorith ms are equivalent when their performance is averaged across all possible problems and even over subsets of problems fulfilling certain constraints. The NFL results show that if there is no assumption regarding the relation between visited and unse en arch points, efficient search and optimization is impossible. There is no wel l performing universal metaheuristic, but the heuristics must be tailored to the pr oblem class at hand using prior knowledge. In practice, it is not likely that the pr econditions of the NFL theorems are fulfilled for a problem class and thus differenc es between algorithms exist. Therefore, tailored algorithms can exploit structu re nderlying the optimization problem. Given full knowledge about the problem class, it i in theory possible to construct an optimal algorithm.


Comparing support vector machines with Gaussian kernels to radial basis function classifiers

The support vector (SV) machine is a novel type of learning machine, based on statistical learning theory, which contains polynomial classifiers, neural networks, and radial basis function (RBF) networks as special cases. In the RBF case, the SV algorithm automatically determines centers, weights, and threshold that minimize an upper bound on the expected test error. The present study is devoted to an experimental comparison of these machines with a classical approach, where the centers are determined byk-means clustering, and the weights are computed using error backpropagation. We consider three machines, namely, a classical RBF machine, an SV machine with Gaussian kernel, and a hybrid system with the centers determined by the SV method and the weights trained by error backpropagation. Our results show that on the United States postal service database of handwritten digits, the SV machine achieves the highest recognition accuracy, followed by the hybrid system. The SV approach is thus not only theoretically wellfounded but also superior in a practical application.


Fundamental Limitations on Search Algorithms: Evolutionary Computing in Perspective

The past twenty years has seen a rapid growth of interest in stochastic search algorithms, particularly those inspired by natural processes in physics and biology. Impressive results have been demonstrated on complex practical optimisation problems and related search applications taken from a variety of fields, but the theoretical understanding of these algorithms remains weak. This results partly from the insufficient attention that has been paid to results showing certain fundamental limitations on universal search algorithms, including the so-called “No Free Lunch” Theorem. This paper extends these results and draws out some of their implications for the design of search algorithms, and for the construction of useful representations. The resulting insights focus attention on tailoring algorithms and representations to particular problem classes by exploiting domain knowledge. This highlights the fundamental importance of gaining a better theoretical grasp of the ways in which such knowledge may be systematically exploited as a major research agenda for the future.


Design and Implementation of an FPGA-Based Real-Time Face Recognition System

Face recognition systems play a vital role in many applications including surveillance, biometrics and security. In this work, we present a {\textit complete} real-time face recognition system consisting of a face detection, a recognition and a down sampling module using an FPGA. Our system provides an end-to-end solution for face recognition, it receives video input from a camera, detects the locations of the face(s) using the Viola-Jones algorithm, subsequently recognizes each face using the Eigenface algorithm, and outputs the results to a display. Experimental results show that our complete face recognition system operates at 45 frames per second on a Virtex-5 FPGA.


The origins and the future of microfluidics

The manipulation of fluids in channels with dimensions of tens of micrometres — microfluidics — has emerged as a distinct new field. Microfluidics has the potential to influence subject areas from chemical synthesis and biological analysis to optics and information technology. But the field is still at an early stage of development. Even as the basic science and technological demonstrations develop, other problems must be addressed: choosing and focusing on initial applications, and developing strategies to complete the cycle of development, including commercialization. The solutions to these problems will require imagination and ingenuity.


Novel Low-Density Signature for Synchronous CDMA Systems Over AWGN Channel

Novel low-density signature (LDS) structure is proposed for transmission and detection of symbol-synchronous communication over memoryless Gaussian channel. Given N as the processing gain, under this new arrangement, users' symbols are spread over N chips but virtually only dv < N chips that contain nonzero-values. The spread symbol is then so uniquely interleaved as the sampled, at chip rate, received signal contains the contribution from only dc < K number of users, where K denotes the total number of users in the system. Furthermore, a near-optimum chip-level iterative soft-in-soft-out (SISO) multiuser decoding (MUD), which is based on message passing algorithm (MPA) technique, is proposed to approximate optimum detection by efficiently exploiting the LDS structure. Given beta = K/N as the system loading, our simulation suggested that the proposed system alongside the proposed detection technique, in AWGN channel, can achieve an overall performance that is close to single-user performance, even when the system has 200% loading, i.e., when beta = 2. Its robustness against near-far effect and its performance behavior that is very similar to optimum detection are demonstrated in this paper. In addition, the complexity required for detection is now exponential to dc instead of K as in conventional code division multiple access (CDMA) structure employing optimum multiuser detector.


Automatic feature extraction for multiview 3D face recognition

Current 2D face recognition systems encounter difficulties in recognizing faces with large pose variations. Utilizing the pose-invariant features of 3D face data has the potential to handle multiview face matching. A feature extractor based on the directional maximum is proposed to estimate the nose tip location and the pose angle simultaneously. A nose profile model represented by subspaces is used to select the best candidates for the nose tip. Assisted by a statistical feature location model, a multimodal scheme is presented to extract eye and mouth corners. Using the automatic feature extractor, a fully automatic 3D face recognition system is developed. The system is evaluated on two databases, the MSU database (300 multiview test scans from 100 subjects) and the UND database (953 near frontal scans from 277 subjects). The automatic system provides recognition accuracy that is comparable to the accuracy of a system with manually labeled feature points


A Survey of Location Prediction on Twitter

Locations, e.g., countries, states, cities, and point-of-interests, are central to news, emergency events, and people's daily lives. Automatic identification of locations associated with or mentioned in documents has been explored for decades. As one of the most popular online social network platforms, Twitter has attracted a large number of users who send millions of tweets on daily basis. Due to the world-wide coverage of its users and real-time freshness of tweets, location prediction on Twitter has gained significant attention in recent years. Research efforts are spent on dealing with new challenges and opportunities brought by the noisy, short, and context-rich nature of tweets. In this survey, we aim at offering an overall picture of location prediction on Twitter. Specifically, we concentrate on the prediction of user home locations, tweet locations, and mentioned locations. We first define the three tasks and review the evaluation metrics. By summarizing Twitter network, tweet content, and tweet context as potential inputs, we then structurally highlight how the problems depend on these inputs. Each dependency is illustrated by a comprehensive review of the corresponding strategies adopted in state-of-the-art approaches. In addition, we also briefly review two related problems, i.e., semantic location prediction and point-of-interest recommendation. Finally, we make a conclusion of the survey and list future research directions.


Sense-Aaware Semantic Analysis: A Multi-Prototype Word Representation Model Using Wikipedia

Human languages are naturally ambiguous, which makes it difficult to automatically understand the semantics of text. Most vector space models (VSM) treat all occurrences of a word as the same and build a single vector to represent the meaning of a word, which fails to capture any ambiguity. We present sense-aware semantic analysis (SaSA), a multi-prototype VSM for word representation based on Wikipedia, which could account for homonymy and polysemy. The “sense-specific” prototypes of a word are produced by clustering Wikipedia pages based on both local and global contexts of the word in Wikipedia. Experimental evaluation on semantic relatedness for both isolated words and words in sentential contexts and word sense induction demonstrate its effectiveness.


Innovation in the pharmaceutical industry: New estimates of R&D costs.

The research and development costs of 106 randomly selected new drugs were obtained from a survey of 10 pharmaceutical firms. These data were used to estimate the average pre-tax cost of new drug and biologics development. The costs of compounds abandoned during testing were linked to the costs of compounds that obtained marketing approval. The estimated average out-of-pocket cost per approved new compound is $1395 million (2013 dollars). Capitalizing out-of-pocket costs to the point of marketing approval at a real discount rate of 10.5% yields a total pre-approval cost estimate of $2558 million (2013 dollars). When compared to the results of the previous study in this series, total capitalized costs were shown to have increased at an annual rate of 8.5% above general price inflation. Adding an estimate of post-approval R&D costs increases the cost estimate to $2870 million (2013 dollars).


An Approach for Selecting Software-as-a-Service (SaaS) Product

Software-as-a-Service (SaaS) helps organizations avoid capital expenditure and pay for the functionality as an operational expenditure. Though enterprises are unlikely to use SaaS model for all their information systems needs, certain business functionalities such as Sales Force Automation (SFA), are more seen to be implemented using SaaS model. Such demand has prompted quite a few vendors to offer SFA functionality as SaaS. Enterprises need to adopt an objective approach to ensure they select the most appropriate SaaS product for their needs. This paper presents an approach that makes use of Analytic Hierarchy Process (AHP) technique for prioritizing the product features and also for expert-led scoring of the products.


A Hotel Recommendation System Based on Collaborative Filtering and Rankboost Algorithm

A hotel recommendation system based on collaborative filtering method of clustering and Rankboost algorithm proposed in this paper, which can avoid the cold-start and scalability problems existing in traditional collaborative filtering. One can find a hotel quickly and efficiently when he uses this hotel recommendation system.


Trust management of services in cloud environments: Obstacles and solutions

Trust management is one of the most challenging issues in the emerging cloud computing area. Over the past few years, many studies have proposed different techniques to address trust management issues. However, despite these past efforts, several trust management issues such as identification, privacy, personalization, integration, security, and scalability have been mostly neglected and need to be addressed before cloud computing can be fully embraced. In this article, we present an overview of the cloud service models and we survey the main techniques and research prototypes that efficiently support trust management of services in cloud environments. We present a generic analytical framework that assesses existing trust management research prototypes in cloud computing and relevant areas using a set of assessment criteria. Open research issues for trust management in cloud environments are also discussed.


Massively-Parallel Lossless Data Decompression

Today's exponentially increasing data volumes and the high cost of storage make compression essential for the Big Data industry. Although research has concentrated on efficient compression, fast decompression is critical for analytics queries that repeatedly read compressed data. While decompression can be parallelized somewhat by assigning each data block to a different process, break-through speed-ups require exploiting the massive parallelism of modern multi-core processors and GPUs for data decompression within a block. We propose two new techniques to increase the degree of parallelism during decompression. The first technique exploits the massive parallelism of GPU and SIMD architectures. The second sacrifices some compression efficiency to eliminate data dependencies that limit parallelism during decompression. We evaluate these techniques on the decompressor of the DEFLATE scheme, called Inflate, which is based on LZ77 compression and Huffman encoding. We achieve a 2× speed-up in a head-to-head comparison with several multi core CPU-based libraries, while achieving a 17% energy saving with comparable compression ratios.


A task description language for robot control

Robot systems must achieve high level goals while remaining reactive to contingencies and new opportunities. This typically requires robot systems to coordinate concurrent activities, monitor the environment, and deal with exceptions. We have developed a new language to support such task-level control. The language, TDL, is an extension of C++ that provides syntactic support for task decomposition, synchronization, execution monitoring, and exception handling. A compiler transforms TDL into pure C++ code that utilizes a platform-independent task management library. This paper introduces TDL, describes the task treerepresentation that underlies the language, and presents some aspects of its implementation and use in an autonomous mobile robot.


Contrast masking in human vision.

Contrast masking was studied psychophysically. A two-alternative forced-choice procedure was used to measure contrast thresholds for 2.0 cpd sine-wave gratings in the presence of masking sine-wave gratings. Thresholds were measured for 11 masker contrasts spanning three log units, and seven masker frequencies ranging +/- one octave from the signal frequency. Corresponding measurements were made for gratings with horizontal widths of 0.75 degrees (narrow fields) and 6.0 degrees (wide fields). For high contrast maskers at all frequencies, signal thresholds were related to masking contrast by power functions with exponents near 0.6. For a range of low masking contrasts, signal thresholds were reduced by the masker. For the wide fields, high contrast masking tuning functions peaked at the signal frequency, were slightly asymmetric, and had approximately invariant half-maximum frequencies that lie 3/4 octave below and 1 octave above the signal frequency. The corresponding low contrast tuning functions exhibited peak threshold reduction at the signal frequency, with half-minimum frequencies at roughly +/- 0.25 octaves. For the narrow fields, the masking tuning functions were much broader at both low and high masking contrasts. A masking model is presented that encompasses contrast detection, discrimination, and masking phenomena. Central constructs of the model include a linear spatial frequency filter, a nonlinear transducer, and a process of spatial pooling that acts at low contrasts only.


Stages of embryonic development of the zebrafish.

We describe a series of stages for development of the embryo of the zebrafish, Danio (Brachydanio) rerio. We define seven broad periods of embryogenesis--the zygote, cleavage, blastula, gastrula, segmentation, pharyngula, and hatching periods. These divisions highlight the changing spectrum of major developmental processes that occur during the first 3 days after fertilization, and we review some of what is known about morphogenesis and other significant events that occur during each of the periods. Stages subdivide the periods. Stages are named, not numbered as in most other series, providing for flexibility and continued evolution of the staging series as we learn more about development in this species. The stages, and their names, are based on morphological features, generally readily identified by examination of the live embryo with the dissecting stereomicroscope. The descriptions also fully utilize the optical transparancy of the live embryo, which provides for visibility of even very deep structures when the embryo is examined with the compound microscope and Nomarski interference contrast illumination. Photomicrographs and composite camera lucida line drawings characterize the stages pictorially. Other figures chart the development of distinctive characters used as staging aid signposts.


Large-scale cost function learning for path planning using deep inverse reinforcement learning


HIRL: Hierarchical Inverse Reinforcement Learning for Long-Horizon Tasks with Delayed Rewards


A^2-Nets: Double Attention Networks

Learning to capture long-range relations is fundamental to image/video recognition. Existing CNN models generally rely on increasing depth to model such relations which is highly inefficient. In this work, we propose the “double attention block”, a novel component that aggregates and propagates informative global features from the entire spatio-temporal space of input images/videos, enabling subsequent convolution layers to access features from the entire space efficiently. The component is designed with a double attention mechanism in two steps, where the first step gathers features from the entire space into a compact set through second-order attention pooling and the second step adaptively selects and distributes features to each location via another attention. The proposed double attention block is easy to adopt and can be plugged into existing deep neural networks conveniently. We conduct extensive ablation studies and experiments on both image and video recognition tasks for evaluating its performance. On the image recognition task, a ResNet-50 equipped with our double attention blocks outperforms a much larger ResNet-152 architecture on ImageNet-1k dataset with over 40% less the number of parameters and less FLOPs. On the action recognition task, our proposed model achieves the state-of-the-art results on the Kinetics and UCF-101 datasets with significantly higher efficiency than recent works.


Automating hierarchical document classification for construction management information systems

The widespread use of information technologies for construction is considerably increasing the number of electronic text documents stored in construction management information systems. Consequently, automated methods for organizing and improving the access to the information contained in these types of documents become essential to construction information management. This paper describes a methodology developed to improve information organization and access in construction management information systems based on automatic hierarchical classification of construction project documents according to project components. A prototype system for document classification is presented, as well as the experiments conducted to verify the feasibility of the proposed approach. D 2003 Elsevier Science B.V. All rights reserved.


A SeqGAN for Polyphonic Music Generation

We propose an application of SeqGAN, generative adversarial networks for discrete sequence generation, for creating polyphonic musical sequences. Instead of monophonic melody generation suggested in the original work, we present an efficient representation of polyphony MIDI file that captures chords and melodies with dynamic timings simultaneously. The network can create sequences that are musically coherent. We also report that careful tuning of reinforcement learning signals of the model are crucial for general application.


Multilinear Discriminant Analysis for Higher-Order Tensor Data Classification

In the past decade, great efforts have been made to extend linear discriminant analysis for higher-order data classification, generally referred to as multilinear discriminant analysis (MDA). Existing examples include general tensor discriminant analysis (GTDA) and discriminant analysis with tensor representation (DATER). Both the two methods attempt to resolve the problem of tensor mode dependency by iterative approximation. GTDA is known to be the first MDA method that converges over iterations. However, its performance relies highly on the tuning of the parameter in the scatter difference criterion. Although DATER usually results in better classification performance, it does not converge, yet the number of iterations executed has a direct impact on DATER's performance. In this paper, we propose a closed-form solution to the scatter difference objective in GTDA, namely, direct GTDA (DGTDA) which also gets rid of parameter tuning. We demonstrate that DGTDA outperforms GTDA in terms of both efficiency and accuracy. In addition, we propose constrained multilinear discriminant analysis (CMDA) that learns the optimal tensor subspace by iteratively maximizing the scatter ratio criterion. We prove both theoretically and experimentally that the value of the scatter ratio criterion in CMDA approaches its extreme value, if it exists, with bounded error, leading to superior and more stable performance in comparison to DATER.


Blind grasping: Stable robotic grasping using tactile feedback and hand kinematics

We propose a machine learning approach to the perception of a stable robotic grasp based on tactile feedback and hand kinematic data, which we call blind grasping. We first discuss a method for simulating tactile feedback using a soft finger contact model in GraspIt!, which is a robotic grasping simulator [10]. Using this simulation technique, we compute tactile contacts of thousands of grasps with a robotic hand using the Columbia Grasp Database [6]. The tactile contacts along with the hand kinematic data are then input to a Support Vector Machine (SVM) which is trained to estimate the stability of a given grasp based on this tactile feedback and also the robotic hand kinematics. Experimental results indicate that the tactile feedback along with the hand kinematic data carry meaningful information for the prediction of the stability of a blind robotic grasp.


Cortical dynamics of contextually cued attentive visual learning and search: spatial and object evidence accumulation.

How do humans use target-predictive contextual information to facilitate visual search? How are consistently paired scenic objects and positions learned and used to more efficiently guide search in familiar scenes? For example, humans can learn that a certain combination of objects may define a context for a kitchen and trigger a more efficient search for a typical object, such as a sink, in that context. The ARTSCENE Search model is developed to illustrate the neural mechanisms of such memory-based context learning and guidance and to explain challenging behavioral data on positive-negative, spatial-object, and local-distant cueing effects during visual search, as well as related neuroanatomical, neurophysiological, and neuroimaging data. The model proposes how global scene layout at a first glance rapidly forms a hypothesis about the target location. This hypothesis is then incrementally refined as a scene is scanned with saccadic eye movements. The model simulates the interactive dynamics of object and spatial contextual cueing and attention in the cortical What and Where streams starting from early visual areas through medial temporal lobe to prefrontal cortex. After learning, model dorsolateral prefrontal cortex (area 46) primes possible target locations in posterior parietal cortex based on goal-modulated percepts of spatial scene gist that are represented in parahippocampal cortex. Model ventral prefrontal cortex (area 47/12) primes possible target identities in inferior temporal cortex based on the history of viewed objects represented in perirhinal cortex.


Improving bug triage with bug tossing graphs

bug report is typically assigned to a single developer who is then responsible for fixing the bug. In Mozilla and Eclipse, between 37%-44% of bug reports are "tossed" (reassigned) to other developers, for example because the bug has been assigned by accident or another developer with additional expertise is needed. In any case, tossing increases the time-to-correction for a bug.
 In this paper, we introduce a graph model based on Markov chains, which captures bug tossing history. This model has several desirable qualities. First, it reveals developer networks which can be used to discover team structures and to find suitable experts for a new task. Second, it helps to better assign developers to bug reports. In our experiments with 445,000 bug reports, our model reduced tossing events, by up to 72%. In addition, the model increased the prediction accuracy by up to 23 percentage points compared to traditional bug triaging approaches.


Where should the bugs be fixed? More accurate information retrieval-based bug localization based on bug reports

For a large and evolving software system, the project team could receive a large number of bug reports. Locating the source code files that need to be changed in order to fix the bugs is a challenging task. Once a bug report is received, it is desirable to automatically point out to the files that developers should change in order to fix the bug. In this paper, we propose BugLocator, an information retrieval based method for locating the relevant files for fixing a bug. BugLocator ranks all files based on the textual similarity between the initial bug report and the source code using a revised Vector Space Model (rVSM), taking into consideration information about similar bugs that have been fixed before. We perform large-scale experiments on four open source projects to localize more than 3,000 bugs. The results show that BugLocator can effectively locate the files where the bugs should be fixed. For example, relevant buggy files for 62.60% Eclipse 3.1 bugs are ranked in the top ten among 12,863 files. Our experiments also show that BugLocator outperforms existing state-of-the-art bug localization methods.


Automatic Bug Triage using Semi-Supervised Text Classification

In this paper, we propose a semi-supervised text classification approach for bug triage to avoid the deficiency of labeled bug reports in existing supervised approaches. This new approach combines naive Bayes classifier and expectationmaximization to take advantage of both labeled and unlabeled bug reports. This approach trains a classifier with a fraction of labeled bug reports. Then the approach iteratively labels numerous unlabeled bug reports and trains a new classifier with labels of all the bug reports. We also employ a weighted recommendation list to boost the performance by imposing the weights of multiple developers in training the classifier. Experimental results on bug reports of Eclipse show that our new approach outperforms existing supervised approaches in terms of classification accuracy. Keywordsautomatic bug triage; expectation-maximization; semi-supervised text classification; weighted recommendation list


DREX: Developer Recommendation with K-Nearest-Neighbor Search and Expertise Ranking

This paper proposes a new approach called DREX (Developer Recommendation with k-nearest-neighbor search and Expertise ranking) to developer recommendation for bug resolution based on K-Nearest-Neighbor search with bug similarity and expertise ranking with various metrics, including simple frequency and social network metrics. We collect Mozilla Fire fox open bug repository as the experimental data set and compare different ranking metrics on the performance of recommending capable developers for bugs. Our experimental results demonstrate that, when recommending 10 developers for each one of the 250 testing bugs, DREX has produced better performance than traditional methods with multi-labeled text categorization. The best performance obtained by two metrics as Out-Degree and Frequency, is with recall as 0.6 on average. Moreover, other social network metrics such as Degree and Page Rank have produced comparable performance on developer recommendation as Frequency when used for developer expertise ranking.


Assigning bug reports using a vocabulary-based expertise model of developers

For popular software systems, the number of daily submitted bug reports is high. Triaging these incoming reports is a time consuming task. Part of the bug triage is the assignment of a report to a developer with the appropriate expertise. In this paper, we present an approach to automatically suggest developers who have the appropriate expertise for handling a bug report. We model developer expertise using the vocabulary found in their source code contributions and compare this vocabulary to the vocabulary of bug reports. We evaluate our approach by comparing the suggested experts to the persons who eventually worked on the bug. Using eight years of Eclipse development as a case study, we achieve 33.6% top-1 precision and 71.0% top-10 recall.


Understanding the determinants of business intelligence system adoption stages: An empirical study of SMEs

Although business intelligence systems (BIS) adoption research has progressed considerably since its early inceptions, our understanding of the influence of BIS determinants across different adoption stages remains limited. In response, we develop and empirically test a conceptual model for assessing the determinants of BIS diffusion on the evaluation, adoption, and use stages. The model is based on two prominent, firm-level adoption concepts: the diffusion of innovation (DOI) and the technology, organization, environment (TOE) framework, extended with our previous research findings. Drawing on data from 181 small and medium enterprises (SMEs), we identify seven distinct determinants (i.e. cost, BIS is part of ERP, management support, rational decision-making culture, project champion, organizational data environment, organizational readiness) as statistically significant for different adoption stages.


The Stratosphere platform for big data analytics

We present Stratosphere, an open-source software stack for parallel data analysis. Stratosphere brings together a unique set of features that allow the expressive, easy, and efficient programming of analytical applications at very large scale. Stratosphere’s features include “in situ” data processing, a declarative query language, treatment of user-defined functions as first-class citizens, automatic program parallelization and optimization, support for iterative programs, and a scalable and efficient execution engine. Stratosphere covers a variety of “Big Data” use cases, such as data warehousing, information extraction and integration, data cleansing, graph analysis, and statistical analysis applications. In this paper, we present the overall system architecture design decisions, introduce Stratosphere through example queries, and then dive into the internal workings of the system’s components that relate to extensibility, programming model, optimization, and query execution. We experimentally compare Stratosphere against popular open-source alternatives, and we conclude with a research outlook for the next years.


Improving Duckworth lewis method by using machine learning

There has been lot of research has been done in the area of sports with prediction. Machine learning algorithm has been applied on most of the data to predict its outcome. In cricket also there are many research has been done to find out the outcome of the match. But there are a special case in the cricket where statistic plays an important role. When the cricket match is interrupted by the rain and then again it starts during the shortage of the time it is difficult to predict the run and overs remaining in the cricket match.To over come this issue Duck worth lewis method has been introduced. In this paper we are going to discuss the short come of the method of Duck worth lewis method. In this research We are going to improve the model of duck worth lewis method with machine learning models. At end we are going to compare the Duck worth lewis method, Duck worth lewis method with run rate as a variable and Improved version of duck worth lewis method.


Push-Net: Deep Planar Pushing for Objects with Unknown Physical Properties

This paper introduces Push-Net, a deep recurrent neural network model, which enables a robot to push objects of unknown physical properties for re-positioning and re-orientation, using only visual camera images as input. The unknown physical properties is a major challenge for pushing. Push-Net overcomes the challenge by tracking a history of push interactions with an LSTM module and training an auxiliary objective function that estimates an object’s center of mass. We trained Push-Net entirely in simulation and tested it extensively on many different objects in both simulation and on two real robots, a Fetch arm and a Kinova MICO arm. Experiments suggest that Push-Net is robust and efficient. It achieved over 97% success rate in simulation on average and succeeded in all real robot experiments with a small number of pushes.


Big Scholarly Data in CiteSeerX: Information Extraction from the Web

We examine CiteSeerX, an intelligent system designed with the goal of automatically acquiring and organizing large-scale collections of scholarly documents from the world wide web. From the perspective of automatic information extraction and modes of alternative search, we examine various functional aspects of this complex system with an eye towards ongoing and future research developments.


Neural Task Programming: Learning to Generalize Across Hierarchical Tasks

In this work, we propose a novel robot learning framework called Neural Task Programming (NTP), which bridges the idea of few-shot learning from demonstration and neural program induction. NTP takes as input a task specification (e.g., video demonstration of a task) and recursively decomposes it into finer sub-task specifications. These specifications are fed to a hierarchical neural program, where bottom-level programs are callable subroutines that interact with the environment. We validate our method in three robot manipulation tasks. NTP achieves strong generalization across sequential tasks that exhibit hierarchal and compositional structures. The experimental results show that NTP learns to generalize well towards unseen tasks with increasing lengths, variable topologies, and changing objectives.stanfordvl.github.io/ntp/.


Functional reactive programming from first principles

Functional Reactive Programming, or FRP, is a general framework for programming hybrid systems in a high-level, declarative manner. The key ideas in FRP are its notions of behaviors and events. Behaviors are time-varying, reactive values, while events are time-ordered sequences of discrete-time event occurrences. FRP is the essence of Fran, a domain-specific language embedded in Haskell for programming reactive animations, but FRP is now also being used in vision, robotics and other control systems applications.
In this paper we explore the formal semantics of FRP and how itrelates to an implementation based on streams that represent (and therefore only approximate) continuous behaviors. We show that, in the limit as the sampling interval goes to zero, the implementation is faithful to the formal, continuous semantics, but only when certain constraints on behaviors are observed. We explore the nature of these constraints, which vary amongst the FRP primitives. Our results show both the power and limitations of this approach to language design and implementation. As an example of a limitation, we show that streams are incapable of representing instantaneous predicate events over behaviors.


A Wide-band Circular Polarization Stacked Patch Antenna for the Wireless Communication Applications

A wide-band ‘corners-truncated rectangular’ stacked patch antenna for use in the circular polarization applications was proposed. The antenna proposed in this paper an axial ratio of less than 3 dB and a VSWR of less than 2 : 1 were shown to be achievable over a 25% bandwidth for use in the wireless communication applications, and this antenna can achieves higher gain, lower side lobes and wider bandwidth compared to the traditional microstrip patch antenna.


An upper limb exoskeleton with an optimized 4R spherical wrist mechanism for the shoulder joint

This paper presents an upper limb rehabilitation exoskeleton with an optimized 4R spherical wrist mechanism for the shoulder joint. Traditional designs of shoulder exoskeletons use 3R mechanisms to replicate the spherical motion of the shoulder. However, due to the exceptionally large range of motion of the human shoulder, the 3R mechanism is required to operate at a singular configuration at some point in the shoulder workspace. In this configuration, the 3R mechanism loses the ability to rotate the shoulder about one DOF. To overcome this problem, the use of a kinematically redundant 4R mechanism is proposed. The 4R mechanism has been optimized in a previous work and is used in the design of the presented exoskeleton prototype. This new shoulder mechanism allows the exoskeleton to achieve the entire human shoulder workspace without mechanical interference and while operating well away from singular configurations. Numerous features have also been included in the exoskeleton design to ensure it is safe, comfortable and easy to use. The shoulder mechanism of the exoskeleton is analyzed to demonstrate the capabilities of the 4R mechanism.


Multi-modal human-machine communication for instructing robot grasping tasks

A major challenge for the realization of intelligent robots is to supply them with cognitive abilities in order to allow ordinary users to program them easily and intuitively. One way of such programming is teaching work tasks by interactive demonstration. To make this effective and convenient for the user, the machine must be capable to establish a common focus of attention and be able to use and integrate spoken instructions, visual perceptions, and non-verbal clues like gestural commands. We report progress in building a hybrid architecture that combines statistical methods, neural networks, and finite state machines into an integrated system for instructing grasping tasks by man-machine interaction. The system combines the GRAVIS-robot for visual attention and gestural instruction with an intelligent interface for speech recognition and linguistic interpretation, and an modality fusion module to allow multi-modal task-oriented man-machine communication with respect to dextrous robot manipulation of objects.


Analogy just looks like high level perception: why a domain-general approach to analogical mapping is right

Hofstadter and his colleagues have criticized current accounts of analogy, claiming that such accounts do not accurately capture interactions between processes of representation construction and processes of mapping. They suggest instead that analogy should be viewed as a form of high level perception that encompasses both representation building and mapping as indivisible operations within a single model. They argue speci® cally against SM E, our model of analogical matching, on the grounds that it is modular, and oŒer instead programs such as Mitchell and Hofstadter’ s Copycat as examples of the high level perception approach. In this paper we argue against this position on two grounds. First, we demonstrate that most of their speci® c arguments involving SM E and Copycat are incorrect. Second, we argue that the claim that analogy is high-level perception, while in some ways an attractive metaphor, is too vague to be useful as a technical proposal. We focus on ® ve issues : (1) how perception relates to analogy, (2) how  ̄ exibility arises in analogical processing, (3) whether analogy is a domain-general process, (4) how micro-worlds should be used in the study of analogy, and (5) how best to assess the psychological plausibility of a model of analogy. W e illustrate our discussion with examples taken from computer models embodying both views.


MICA - A new generation of versatile instruments in robotic surgery

Robotic surgery systems are highly complex and expensive pieces of equipment. Demands for lower cost of care can be met if these systems are employable in a flexible manner for a large variety of procedures. To protect the initial investment the capabilities of a robotic system need to be expandable as new tasks arise.


PEEK biomaterials in trauma, orthopedic, and spinal implants.

Since the 1980s, polyaryletherketones (PAEKs) have been increasingly employed as biomaterials for trauma, orthopedic, and spinal implants. We have synthesized the extensive polymer science literature as it relates to structure, mechanical properties, and chemical resistance of PAEK biomaterials. With this foundation, one can more readily appreciate why this family of polymers will be inherently strong, inert, and biocompatible. Due to its relative inertness, PEEK biomaterials are an attractive platform upon which to develop novel bioactive materials, and some steps have already been taken in that direction, with the blending of HA and TCP into sintered PEEK. However, to date, blended HA-PEEK composites have involved a trade-off in mechanical properties in exchange for their increased bioactivity. PEEK has had the greatest clinical impact in the field of spine implant design, and PEEK is now broadly accepted as a radiolucent alternative to metallic biomaterials in the spine community. For mature fields, such as total joint replacements and fracture fixation implants, radiolucency is an attractive but not necessarily critical material feature.


A new computing environment for collective privacy protection from constrained healthcare devices to IoT cloud services

The Internet of healthcare things is essentially a new model that changes the way of the delivery and management of healthcare services. It utilizes digital sensors and cloud computing to present a quality healthcare service outside of the classical hospital environment. This resulted in the emergence of a new class of online web 4.0 services, which are termed “cloud healthcare services”. Cloud healthcare services offer a straightforward opportunity for patients to communicate with healthcare professionals and utilize their personal IoHT devices to obtain timely and accurate medical guidance and decisions. The personal IoHT devices integrate sensed health data at a central cloud healthcare service to extract useful health insights for wellness and preventive care strategies. However, the present practices for cloud healthcare services rely on a centralized approach, where patients’ health data are collected and stored on servers, located at remote locations, which might be functioning under data privacy laws somewhat different from the ones applied where the service is running. Promoting a privacy respecting cloud services encourages patients to actively participate in these healthcare services and to routinely provide an accurate and precious health data about themselves. With the emergence of fog computing paradigm, privacy protection can now be enforced at the edge of the patient’s network regardless of the location of service providers. In this paper, a framework for cloud healthcare recommender service is presented. We depicted the personal gateways at the patients’ side act as intermediate nodes (called fog nodes) between IoHT devices and cloud healthcare services. A fog-based middleware will be hosted on these fog nodes for an efficient aggregation of patients generated health data while maintaining the privacy and the confidentiality of their health profiles. The proposed middleware executes a two-stage concealment process that utilizes the hierarchical nature of IoHT devices. This will unburden the constrained IoHT devices from performing intensive privacy preserving processes. At that, the patients will be empowered with a tool to control the privacy of their health data by enabling them to release their health data in a concealed form. The further processing at the cloud healthcare service continues over the concealed data by applying the proposed protocols. The proposed solution was integrated into a scenario related to preserving the privacy of the patients’ health data when utilized by a cloud healthcare recommender service to generate health insights. Our approach induces a straightforward solution with accurate results, which are beneficial to both patients and service providers.


Transfer Learning for Text Mining

Over the years, transfer learning has received much attention in machine learning research and practice. Researchers have found that a major bottleneck associated with machine learning and text mining is the lack of high-quality annotated examples to help train a model. In response, transfer learning offers an attractive solution for this problem. Various transfer learning methods are designed to extract the useful knowledge from different but related auxiliary domains. In its connection to text mining, transfer learning has found novel and useful applications. In this chapter, we will review some most recent developments in transfer learning for text mining, explain related algorithms in detail, and project future developments of this field. We focus on two important topics: cross-domain text document classification and heterogeneous transfer learning that uses labeled text documents to help classify images.


Sensorimotor training in virtual reality: a review.

Recent experimental evidence suggests that rapid advancement of virtual reality (VR) technologies has great potential for the development of novel strategies for sensorimotor training in neurorehabilitation. We discuss what the adaptive and engaging virtual environments can provide for massive and intensive sensorimotor stimulation needed to induce brain reorganization.Second, discrepancies between the veridical and virtual feedback can be introduced in VR to facilitate activation of targeted brain networks, which in turn can potentially speed up the recovery process. Here we review the existing experimental evidence regarding the beneficial effects of training in virtual environments on the recovery of function in the areas of gait,upper extremity function and balance, in various patient populations. We also discuss possible mechanisms underlying these effects. We feel that future research in the area of virtual rehabilitation should follow several important paths. Imaging studies to evaluate the effects of sensory manipulation on brain activation patterns and the effect of various training parameters on long term changes in brain function are needed to guide future clinical inquiry. Larger clinical studies are also needed to establish the efficacy of sensorimotor rehabilitation using VR in various clinical populations and most importantly, to identify VR training parameters that are associated with optimal transfer to real-world functional improvements.


Sources of mathematical thinking: behavioral and brain-imaging evidence.

Does the human capacity for mathematical intuition depend on linguistic competence or on visuo-spatial representations? A series of behavioral and brain-imaging experiments provides evidence for both sources. Exact arithmetic is acquired in a language-specific format, transfers poorly to a different language or to novel facts, and recruits networks involved in word-association processes. In contrast, approximate arithmetic shows language independence, relies on a sense of numerical magnitudes, and recruits bilateral areas of the parietal lobes involved in visuo-spatial processing. Mathematical intuition may emerge from the interplay of these brain systems.


NON-UNIFORM TRANSMISSION LINE TRANSFORMERS AND THEIR APPLICATION IN THE DESIGN OF COMPACT MULTI-BAND BAGLEY POWER DIVIDERS WITH HARMONICS SUPPRESSION

In this paper, the application of compact non-uniform transmission line transformers (NTLTs) in suppressing and controlling the odd harmonics of the fundamental frequency is presented. A design example showing the complete suppression of the odd harmonics of the fundamental frequency is given. In addition, several compact NTLTs are designed showing the possibility of controlling the existence of a fundamental frequency’s odd harmonics. Moreover, multi-band operation using NTLTs is investigated. Specifically, a design example of a miniaturized triple-frequency NTLT is introduced. Based on these compact NTLTs, a 3-way triple-frequency modified Bagley power divider (BPD) with a size reduction of 50%, and a 5-way modified BPD with harmonics suppression and size reduction of 34%, are designed. For verification purposes, both dividers are simulated using the two full-wave simulators IE3D and HFSS. Moreover, the modified 5-way BPD with harmonics suppression is fabricated and measured. Both the simulation and measurement results validate the design approach.


Changes in women's choice of dress across the ovulatory cycle: naturalistic and laboratory task-based evidence.

The authors tested the prediction that women prefer clothing that is more revealing and sexy when fertility is highest within the ovulatory cycle. Eighty-eight women reported to the lab twice: once on a low-fertility day of the cycle and once on a high-fertility day (confirmed using hormone tests). In each session, participants posed for full-body photographs in the clothing they wore to the lab, and they drew illustrations to indicate an outfit they would wear to a social event that evening. Although each data source supported the prediction, the authors found the most dramatic changes in clothing choice in the illustrations. Ovulatory shifts in clothing choice were moderated by sociosexuality, attractiveness, relationship status, and relationship satisfaction. Sexually unrestricted women, for example, showed greater shifts in preference for revealing clothing worn to the laboratory near ovulation. The authors suggest that clothing preference shifts could reflect an increase in female-female competition near ovulation.


Generic SPWM technique for multilevel inverter

Multilevel inverters generate stepped AC signals and thus overcome many of the limitations with the classical inverter circuit. Multilevel inverters use many number of switches and generate staircase type output through controlled switching of various switches. The sequence of switching and the duration of each step are very vital in minimizing the THD. The methods of generating gating signals are not unique. Many methods that are proposed in literatures make use of SPWM technique. Sinusoidal Pulse Width Modulation (SPWM) is a popular control method widely used in power electronic inverter circuit. It has advantages like low switching losses, the output has fewer harmonic and method is easy to implement. The different SPWM methods are: (A) Phase Disposition PWM (PDPWM), (B) Phase Opposition Disposition PWM (PODPWM), (C) Alternative Opposition and Disposition PWM (APODPWM), (D) Phase Shift PWM (PSPWM), (E) Carrier Overlapping PWM (COPWM) and (F) Multi Carrier Sinusoidal Pulse Width Modulation with Variable Frequency (MCSPWMVF). All the above methods make use of many triangular signals, that are level shifted or phase shifted, and compare with a single sine wave to generate gating signals for the respective switches. The intersection of the sine signal with the various triangular signals will generate the gating signals for the respective switches. In the present investigation a generalized gating signal generation method is proposed using only one modulating and one carrier signal. The signal so generated is steered into various switches through pulse steering circuit developed in the present work.


Document Page Segmentation and Layout Analysis Using Soft Ordering

A document image is composed of a variety of physical entities or regions such as text blocks, lines, words, figures, tables, and background. We could also assign functional or logical labels such as sentences, titles, captions, author names, and addresses to some of these regions. The process of document structure and layout analysis tries to decompose a given document image into its component regions and understand their functional roles and relationships. The processing is carried out in multiple steps, such as preprocessing, page decomposition, structure understanding, etc. We will look into each of these steps in detail in the following sections. Document images are often generated from physical documents by digitization using scanners or digital cameras. Many documents, such as newspapers, magazines and brochures, contain very complex layout due to the placement of figures, titles, and captions, complex backgrounds, artistic text formatting, etc. (see Figure 1). A human reader uses a variety of additional cues such as context, conventions and information about language/script, along with a complex reasoning process to decipher the contents of a document. Automatic analysis of an arbitrary document with complex layout is an extremely difficult task and is beyond the capabilities of the state-of-the-art document structure and layout analysis systems. This is interesting since documents are designed to be effective and clear to human interpretation unlike natural images.


Learning Dynamic Guidance for Depth Image Enhancement

The depth images acquired by consumer depth sensors (e.g., Kinect and ToF) usually are of low resolution and insufficient quality. One natural solution is to incorporate with high resolution RGB camera for exploiting their statistical correlation. However, most existing methods are intuitive and limited in characterizing the complex and dynamic dependency between intensity and depth images. To address these limitations, we propose a weighted analysis representation model for guided depth image enhancement, which advances the conventional methods in two aspects: (i) task driven learning and (ii) dynamic guidance. First, we generalize the analysis representation model by including a guided weight function for dependency modeling. And the task-driven learning formulation is introduced to obtain the optimized guidance tailored to specific enhancement task. Second, the depth image is gradually enhanced along with the iterations, and thus the guidance should also be dynamically adjusted to account for the updating of depth image. To this end, stage-wise parameters are learned for dynamic guidance. Experiments on guided depth image upsampling and noisy depth image restoration validate the effectiveness of our method.


Intracranial EEG Correlates of Expectancy and Memory Formation in the Human Hippocampus and Nucleus Accumbens

The human brain is adept at anticipating upcoming events, but in a rapidly changing world, it is essential to detect and encode events that violate these expectancies. Unexpected events are more likely to be remembered than predictable events, but the underlying neural mechanisms for these effects remain unclear. We report intracranial EEG recordings from the hippocampus of epilepsy patients, and from the nucleus accumbens of depression patients. We found that unexpected stimuli enhance an early (187 ms) and a late (482 ms) hippocampal potential, and that the late potential is associated with successful memory encoding for these stimuli. Recordings from the nucleus accumbens revealed a late potential (peak at 475 ms), which increases in magnitude during unexpected items, but no subsequent memory effect and no early component. These results are consistent with the hypothesis that activity in a loop involving the hippocampus and the nucleus accumbens promotes encoding of unexpected events.


The plastic surgery hypothesis

Recent work on genetic-programming-based approaches to automatic program patching have relied on the insight that the content of new code can often be assembled out of fragments of code that already exist in the code base. This insight has been dubbed the plastic surgery hypothesis; successful, well-known automatic repair tools such as GenProg rest on this hypothesis, but it has never been validated. We formalize and validate the plastic surgery hypothesis and empirically measure the extent to which raw material for changes actually already exists in projects. In this paper, we mount a large-scale study of several large Java projects, and examine a history of 15,723 commits to determine the extent to which these commits are graftable, i.e., can be reconstituted from existing code, and find an encouraging degree of graftability, surprisingly independent of commit size and type of commit. For example, we find that changes are 43% graftable from the exact version of the software being changed. With a view to investigating the difficulty of finding these grafts, we study the abundance of such grafts in three possible sources: the immediately previous version, prior history, and other projects. We also examine the contiguity or chunking of these grafts, and the degree to which grafts can be found in the same file. Our results are quite promising and suggest an optimistic future for automatic program patching methods that search for raw material in already extant code in the project being patched.


Mining StackOverflow to turn the IDE into a self-confident programming prompter

Developers often require knowledge beyond the one they possess, which often boils down to consulting sources of information like Application Programming Interfaces (API) documentation, forums, Q&A websites, etc. Knowing what to search for and how is non- trivial, and developers spend time and energy to formulate their problems as queries and to peruse and process the results. We propose a novel approach that, given a context in the IDE, automatically retrieves pertinent discussions from Stack Overflow, evaluates their relevance, and, if a given confidence threshold is surpassed, notifies the developer about the available help. We have implemented our approach in Prompter, an Eclipse plug-in. Prompter has been evaluated through two studies. The first was aimed at evaluating the devised ranking model, while the second was conducted to evaluate the usefulness of Prompter.


Gender and Tenure Diversity in GitHub Teams

Software development is usually a collaborative venture. Open Source Software (OSS) projects are no exception; indeed, by design, the OSS approach can accommodate teams that are more open, geographically distributed, and dynamic than commercial teams. This, we find, leads to OSS teams that are quite diverse. Team diversity, predominantly in offline groups, is known to correlate with team output, mostly with positive effects. How about in OSS? Using GitHub, the largest publicly available collection of OSS projects, we studied how gender and tenure diversity relate to team productivity and turnover. Using regression modeling of GitHub data and the results of a survey, we show that both gender and tenure diversity are positive and significant predictors of productivity, together explaining a sizable fraction of the data variability. These results can inform decision making on all levels, leading to better outcomes in recruiting and performance.


CCFinder: A Multilinguistic Token-Based Code Clone Detection System for Large Scale Source Code

ÐA code clone is a code portion in source files that is identical or similar to another. Since code clones are believed to reduce the maintainability of software, several code clone detection techniques and tools have been proposed. This paper proposes a new clone detection technique, which consists of the transformation of input source text and a token-by-token comparison. For its implementation with several useful optimization techniques, we have developed a tool, named CCFinder, which extracts code clones in C, C++, Java, COBOL, and other source files. As well, metrics for the code clones have been developed. In order to evaluate the usefulness of CCFinder and metrics, we conducted several case studies where we applied the new tool to the source code of JDK, FreeBSD, NetBSD, Linux, and many other systems. As a result, CCFinder has effectively found clones and the metrics have been able to effectively identify the characteristics of the systems. In addition, we have compared the proposed technique with other clone detection techniques. Index TermsÐCode clone, duplicated code, CASE tool, metrics, maintenance.


Comparison and evaluation of code clone detection techniques and tools: A qualitative approach

Over the last decade many techniques and tools for software clone detection have been proposed. In this paper, we provide a qualitative comparison and evaluation of the current state-of-the-art in clone detection techniques and tools, and organize the large amount of information into a coherent conceptual framework. We begin with background concepts, a generic clone detection process and an overall taxonomy of current techniques and tools. We then classify, compare and evaluate the techniques and tools in two different dimensions. First, we classify and compare approaches based on a number of facets, each of which has a set of (possibly overlapping) attributes. Second, we qualitatively evaluate the classified techniques and tools with respect to a taxonomy of editing scenarios designed to model the creation of Type-1, Type-2, Type-3 and Type-4 clones. Finally, we provide examples of how one might use the results of this study to choose the most appropriate clone detection tool or technique in the context of a particular set of goals and constraints. The primary contributions of this paper are: (1) a schema for classifying clone detection techniques and tools and a classification of current clone detectors based on this schema, and (2) a taxonomy of editing scenarios that produce different clone types and a qualitative evaluation of current clone detectors based on this taxonomy.


WILDSENSING: Design and deployment of a sustainable sensor network for wildlife monitoring

The increasing adoption of wireless sensor network technology in a variety of applications, from agricultural to volcanic monitoring, has demonstrated their ability to gather data with unprecedented sensing capabilities and deliver it to a remote user. However, a key issue remains how to maintain these sensor network deployments over increasingly prolonged deployments. In this article, we present the challenges that were faced in maintaining continual operation of an automated wildlife monitoring system over a one-year period. This system analyzed the social colocation patterns of European badgers (Meles meles) residing in a dense woodland environment using a hybrid RFID-WSN approach. We describe the stages of the evolutionary development, from implementation, deployment, and testing, to various iterations of software optimization, followed by hardware enhancements, which in turn triggered the need for further software optimization. We highlight the main lessons learned: the need to factor in the maintenance costs while designing the system; to consider carefully software and hardware interactions; the importance of rapid prototyping for initial deployment (this was key to our success); and the need for continuous interaction with domain scientists which allows for unexpected optimizations.


Merging thermal and visual images by a contrast pyramid

J. M. Valeton I nstitute for Perception TNO Kampweg 5 3769 DE Soesterberg, The Netherlands Abstract. Integration of images from different sensing modalities can produce information that cannot be obtained by viewing the sensor outputs separately and consecutively. This paper introduces a hierarchical i mage merging scheme based on a multiresolution contrast decomposition (the ratio of a low-pass pyramid). The composite images produced by this scheme preserve those details from the input images that are most relevant to visual perception. The method is tested by merging parallel registered thermal and visual images. The results show that the fused images present a more detailed representation of the depicted scene. Detection, recognition, and search tasks may therefore benefit from this new image representation.


Fast Eigenspace Approximation using Random Signals

We focus in this work on the estimation of the first k eigenvectors of any graph Laplacian using filtering of Gaussian random signals. We prove that we only need k such signals to be able to exactly recover as many of the smallest eigenvectors, regardless of the number of nodes in the graph. In addition, we address key issues in implementing the theoretical concepts in practice using accurate approximated methods. We also propose fast algorithms both for eigenspace approximation and for the determination of the kth smallest eigenvalue λk. The latter proves to be extremely efficient under the assumption of locally uniform distribution of the eigenvalue over the spectrum. Finally, we present experiments which show the validity of our method in practice and compare it to state-of-the-art methods for clustering and visualization both on synthetic smallscale datasets and larger real-world problems of millions of nodes. We show that our method allows a better scaling with the number of nodes than all previous methods while achieving an almost perfect reconstruction of the eigenspace formed by the first k eigenvectors. Keywords—Graph signal processing, low-rank reconstruction, partitionning, spectral graph theory, spectrum analysis, subspace approximation, visualization


LPV subspace identification of the edgewise vibrational dynamics of a wind turbine rotor

In this paper we apply a state-of-the-art algorithm for subspace identification of linear parameter-varying (LPV) systems to identify the coupled dynamics of the drive-train and the edgewise bending motion of the rotor blades of three-bladed wind turbines. These dynamics are varying with the rotor speed. The identification algorithm uses a factorization which makes it possible to form predictors based on past inputs, outputs, and the known rotor speed. The predictors contain the LPV equivalent of the Markov parameters. Using the predictors, ideas from Predictor Based Subspace IDentification (PBSID) were developed to estimate the state sequence from which the LPV system matrices can be constructed. The algorithm was applied not only to synthetic data generated by a computer simulation of a reference wind turbine, but also to data measured from the CART3 research wind turbine at the National Wind Technology Center of the National Renewable Energy Laboratory (NREL). This paper demonstrates that the linear time-varying behavior of the aeroelastic dynamics of the wind turbine rotor can be captured in an LPV model identified with measured input-output data.


Knowledge management technologies and applications - literature review from 1995 to 2002

This paper surveys knowledge management (KM) development using a literature review and classification of articles from 1995 to 2002 with keyword index in order to explore how KM technologies and applications have developed in this period. Based on the scope of 234 articles of knowledge management applications, this paper surveys and classifies KM technologies using the seven categories as: KM framework, knowledge-based systems, data mining, information and communication technology, artificial intelligence/expert systems, database technology, and modeling, together with their applications for different research and problem domains. Some discussion is presented, indicating future development for knowledge management technologies and applications as the followings: (1) KM technologies tend to develop towards expert orientation, and KM applications development is a problem-oriented domain. (2) Different social studies methodologies, such as statistical method, are suggested to implement in KM as another kind of technology. (3) Integration of qualitative and quantitative methods, and integration of KM technologies studies may broaden our horizon on this subject. (4) The ability to continually change and obtain new understanding is the power of KM technologies and will be the application of future works. q 2003 Elsevier Science Ltd. All rights reserved.


Comparison of NRZ and RZ modulations in laser intersatellite communication systems

Laser intersatellite communication (LIC) is a promising choice for intersatellite communication due to the high data rate that can be achieved with the advantages of light weight, smaller size and lower power consumption. In this paper, we compare the maximum transmission distance with non-return-to-zero (NRZ) and return-to-zero (RZ) modulations for two different LIC scenarios. Simulation results show that for the long-range LIC system with a saturated booster optical amplifier, the RZ modulation scheme can offer a longer transmission distance than the NRZ modulation scheme. For the short-range LIC system without an optical amplifier, the RZ modulation scheme performs almost the same as the NRZ modulation scheme.


An overview of substrate noise reduction techniques

This paper provides an overview of the recent circuit level and physical level substrate noise reduction techniques. Several of these techniques are compared for their advantages and disadvantages in "system-on-chip" applications.


Big Data Analytics for Security

Big data is changing the landscape of security tools for network monitoring, security information and event management, and forensics; however, in the eternal arms race of attack and defense, security researchers must keep exploring novel ways to mitigate and contain sophisticated attackers.


Direct Multisearch for Multiobjective Optimization

In practical applications of optimization it is common to have several conflicting objective functions to optimize. Frequently, these functions are subject to noise or can be of black-box type, preventing the use of derivative-based techniques. We propose a novel multiobjective derivative-free methodology, calling it direct multisearch (DMS), which does not aggregate any of the objective functions. Our framework is inspired by the search/poll paradigm of direct-search methods of directional type and uses the concept of Pareto dominance to maintain a list of nondominated points (from which the new iterates or poll centers are chosen). The aim of our method is to generate as many points in the Pareto front as possible from the polling procedure itself, while keeping the whole framework general enough to accommodate other disseminating strategies, in particular when using the (here also) optional search step. DMS generalizes to multiobjective optimization (MOO) all direct-search methods of directional type. We prove under the common assumptions used in direct search for single optimization that at least one limit point of the sequence of iterates generated by DMS lies in (a stationary form of) the Pareto front. However, extensive computational experience has shown that our methodology has an impressive capability of generating the whole Pareto front, even without using a search step. Two by-products of this paper are (i) the development of a collection of test problems for MOO and (ii) the extension of performance and data profiles to MOO, allowing a comparison of several solvers on a large set of test problems, in terms of their efficiency and robustness to determine Pareto fronts.


PRET DRAM controller: Bank privatization for predictability and temporal isolation

Hard real-time embedded systems employ high-capacity memories such as Dynamic RAMs (DRAMs) to cope with increasing data and code sizes of modern designs. However, memory controller design has so far largely focused on improving average-case performance. As a consequence, the latency of memory accesses is unpredictable, which complicates the worst-case execution time analysis necessary for hard real-time embedded systems.
 Our work introduces a novel DRAM controller design that is predictable and that significantly reduces worst-case access latencies. Instead of viewing the DRAM device as one resource that can only be shared as a whole, our approach views it as multiple resources that can be shared between one or more clients individually. We partition the physical address space following the internal structure of the DRAM device, i.e., its ranks and banks, and interleave ac- cesses to the blocks of this partition. This eliminates contention for shared resources within the device, making accesses temporally predictable and temporally isolated. This paper describes our DRAM controller design and its integration with a precision-timed (PRET) architecture called PTARM. We present analytical bounds on the latency and throughput of the proposed controller, and confirm these via simulation.


Meta-cognitive extreme learning machine for regression problems

In this paper, we present an efficient fast learning algorithm for regression problems using meta-cognitive extreme learning machine(McELM). The proposed algorithm has two components, namely the cognitive component and meta-cognitive component. The cognitive component is an extreme learning machine (ELM) while the meta-cognitive component which controls the cognitive component employs a self-regulating learning mechanism to decide what to learn, when to learn and how to learn. The meta-cognitive component chooses suitable learning method based on the samples presented namely, delete sample, reserve sample and network update. The use of ELM improves the network speed and reduces computational cost. Unlike traditional ELM, the number of hidden layers is not fixed priori in McELM, instead, the network is built during the learning phase. This algorithm is evaluated on a set of benchmark regression and approximation problems and also on a real-world wind force and moment coefficient prediction problem. Performance results in this study highlight that McELM can achieve better results compared with conventional ELM, support vector regression (SVR).


ERP evidence for conceptual mappings and comparison processes during the comprehension of conventional and novel metaphors

Cognitive linguists suggest that understanding metaphors requires activation of conceptual mappings between the involved concepts. We tested whether mappings are indeed in use during metaphor comprehension, and what mapping means as a cognitive process with Event-Related Potentials. Participants read literal, conventional metaphorical, novel metaphorical, and anomalous target sentences preceded by primes with related or unrelated mappings. Experiment 1 used sentence-primes to activate related mappings, and Experiment 2 used simile-primes to induce comparison thinking. In the unprimed conditions of both experiments, metaphors elicited N400s more negative than the literals. In Experiment 1, related sentence-primes reduced the metaphor-literal N400 difference in conventional, but not in novel metaphors. In Experiment 2, related simile-primes reduced the metaphor-literal N400 difference in novel, but not clearly in conventional metaphors. We suggest that mapping as a process occurs in metaphors, and the ways in which it can be facilitated by comparison differ between conventional and novel metaphors.


Design for auto-tuning PID controller based on genetic algorithms

This paper presents a method of designing proportional-integral-derivative (PID) controller based on genetic algorithms (GA). Ziegler-Nichols tuning formula has been used for predicting the range of gain coefficients of GA-PID controller. The use of GA for optimizing the gain coefficients of PID controller has considerably improved the performance of PID controller. Simulation studies on a second-order and a third-order control system demonstrate that the proposed controller provides high performance of dynamic and static characteristics.


Suppression by Selecting Wavelets for Feature Compression in Distributed Speech Recognition

Distributed speech recognition DSR splits the processing of data between a mobile device and a network server. In the front-end, features are extracted and compressed to transmit over a wireless channel to a back-end server, where the incoming stream is received and reconstructed for recognition tasks. In this paper, we propose a feature compression algorithm termed suppression by selecting wavelets SSW to achieve the two main goals of DSR: Minimizing memory and device requirements while also maintaining or even improving the recognition performance. The SSW approach first applies the discrete wavelet transform DWT to filter the incoming speech feature sequence into two temporal subsequences at the client terminal. Feature compression is achieved by keeping the low modulation frequency subsequence while discarding the high frequency counterpart. The low-frequency subsequence is then transmitted across the remote network for specific feature statistics normalization. Wavelets are favorable for resolving the temporal properties of the feature sequence, and the down-sampling process in DWT achieves data compression by reducing the amount of data at the terminal prior to transmission across the network. Once the compressed features have arrived at the server, the feature sequence can be enhanced by statistics normalization, reconstructed with inverse DWT, and compensated with a simple post filter to alleviate any over-smoothing effects from the compression stage. Results on a standard robustness task Aurora-4 and on a Mandarin Chinese news corpus showed SSW outperforms conventional noise-robustness techniques while also providing nearly a 50% compression rate during the transmission stage of DSR systems.


Additive Logistic Regression : a Statistical

Boosting (Freund & Schapire 1996, Schapire & Singer 1998) is one of the most important recent developments in classiication methodology. The performance of many classiication algorithms can often be dramatically improved by sequentially applying them to reweighted versions of the input data, and taking a weighted majority vote of the sequence of classiiers thereby produced. We show that this seemingly mysterious phenomenon can be understood in terms of well known statistical principles, namely additive modeling and maximum likelihood. For the two-class problem, boosting can be viewed as an approximation to additive modeling on the logistic scale using maximum Bernoulli likelihood as a criterion. We develop more direct approximations and show that they exhibit nearly identical results to boosting. Direct multi-class generalizations based on multinomial likelihood are derived that exhibit performance comparable to other recently proposed multi-class generalizations of boosting in most situations, and far superior in some. We suggest a minor modiication to boosting that can reduce computation, often by factors of 10 to 50. Finally, we apply these insights to produce an alternative formulation of boosting decision trees. This approach, based on best-rst truncated tree induction , often leads to better performance, and can provide interpretable descriptions of the aggregate decision rule. It is also much faster com-putationally making it more suitable to large scale data mining applications .


CzEngVallex: a Bilingual Czech-English Valency Lexicon

This paper introduces a new bilingual Czech-English verbal valency lexicon (called CzEngVallex) representing a relatively large empirical database. It includes 20,835 aligned valency frame pairs (i.e., verb senses which are translations of each other) and their aligned arguments. This new lexicon uses data from the Prague Czech-English Dependency Treebank and also takes advantage of the existing valency lexicons for both languages: the PDT-Vallex for Czech and the EngVallex for English. The CzEngVallex is available for browsing as well as for download in the LINDAT/CLARIN repository. The CzEngVallex is meant to be used not only by traditional linguists, lexicographers, translators but also by computational linguists both for the purposes of enriching theoretical linguistic accounts of verbal valency from a cross-linguistic perspective and for an innovative use in various NLP tasks.


Cartoon-recognition using video & audio descriptors

We present a new approach for classifying mpeg-2 video sequences as `cartoon' or `non-cartoon' by analyzing specific video and audio features of consecutive frames in real-time. This is part of the well-known video-genre-classification problem, where popular TV-broadcast genres like cartoon, commercial, music, news and sports are studied. Such applications have also been discussed in the context of MPEG-7 [12]. In our method the extracted features from the visual descriptors are non-linearly combined using a multilayered perceptron and then considered together with the output of the audio-descriptor to produce a reliable recognition. The results demonstrate a high identification rate based on a large collection of 100 representative video sequences (20 cartoons and 4*20 non-cartoons) gathered from free digital TV-broadcasting.


Space and space-time modeling using process convolutions

A continuous spatial model can be constructed by convolving a very simple, perhaps independent, process with a kernel or point spread function. This approach for constructing a spatial process offers a number of advantages over specification through a spatial covariogram. In particular, this process convolution specification leads to compuational simplifications and easily extends beyond simple stationary models. This paper uses process convolution models to build space and space-time models that are flexible and able to accomodate large amounts of data. Data from environmental monitoring is considered.


The age of gossip: spatial mean field regime

Disseminating a piece of information, or updates for a piece of information, has been shown to benefit greatly from simple randomized procedures, sometimes referred to as gossiping, or epidemic algorithms. Similarly, in a network where mobile nodes occasionally receive updated content from a base station, gossiping using opportunistic contacts allows for recent updates to be efficiently maintained, for a large number of nodes. In this case, however, gossiping depends on node mobility. For this reason, we introduce a new gossip model, with mobile nodes moving between different classes that can represent locations or states, which determine gossiping behavior of the nodes. Here we prove that, when the number of mobile nodes becomes large, the age of the latest updates received by mobile nodes approaches a deterministic mean-field regime. More precisely, we show that the occupancy measure of the process constructed, with the ages defined above, converges to a deterministic limit that can be entirely characterized by differential equations. This major simplification allows us to characterize how mobility, source inputs and gossiping influence the age distribution for low and high ages. It also leads to a scalable numerical evaluation of the performance of mobile update systems, which we validate (using a trace of 500 taxicabs) and use to propose infrastructure deployment.


An Ethernet-Based Fronthaul Implementation with MAC/PHY Split LTE Processing

A testbed implementation for an Ethernet fronthaul transporting signals arising from a long-term evolution (LTE) functional subdivision ("split") at the media-access control (MAC)/physical layer (PHY) interface is presented. Based on open LTE base station software, the testbed demonstrates significant data rate reductions compared to current fronthaul implementations that rely on In- phase and Quadrature radio sample transportation and data rates that scale with cell load. All generated traffic flows are clearly distinguishable using appropriate packet headers. A selection of test cases and their corresponding results are presented to demonstrate the operation of the fronthaul and the performance of individual flows in terms of data rates and overheads.


Patient factors influencing dermal filler complications: prevention, assessment, and treatment

While rare, complications do occur with the esthetic use of dermal fillers. Careful attention to patient factors and technique can do much to avoid these complications, and a well-informed practitioner can mitigate problems when they do occur. Since cosmetic surgery is usually an elective process, requested by the patient, clinical trials are complex to organize and run. For this reason, an international group of practicing physicians in the field of esthetics came together to share knowledge and to try and produce some informed guidance for their colleagues, considering the literature and also pooling their own extensive clinical experience. This manuscript aims to summarize the crucial aspects of patient selection, including absolute contraindications as well as situations that warrant caution, and also covers important considerations for the pre- and posttreatment periods as well as during the procedure itself. Guidance is given on both immediate and long-term management of adverse reactions. The majority of complications are related to accepting patients inappropriate for treatment or issues of sterility, placement, volume, and injection technique. It is clear that esthetic practitioners need an in-depth knowledge of all aspects of treatment with dermal fillers to achieve optimal outcomes for their patients.


Stabilizing function of the diaphragm: dynamic MRI and synchronized spirometric assessment.

The aim was to describe diaphragmatic behavior during postural limb activities and examine the ventilatory and stabilizing functions of the diaphragm. Thirty healthy subjects were examined in the supine position using a dynamic MRI system assessed simultaneously with specialized spirometric readings. The diaphragmatic excursions (DEs) were measured at three diaphragmatic points in the sagittal plane; the diaphragm positions (DPs) as related to a reference horizontal baseline were determined. Measurements were taken during tidal breathing (TB) and isometric flexion of upper or lower extremities against external resistance together with TB. Mean DE in both upper and lower postural limb activities was greater compared with the TB condition (P < 0.05), with the effect greater for lower limb activities. Inspiratory DPs in the upper and lower extremity activities were lower compared with TB alone (P < 0.01). Expiratory DP was lower only for lower extremity activities (P < 0.01). DP was most affected at the apex of the crescent and crural (posterior) portion of the diaphragm. DEs correlated strongly with tidal volume (Vt) in all conditions. Changes in DEs relative to the initial value were minimal for upper and lower extremities but were related to lower values of Vt (P < 0.03). Significant involvement of the diaphragm in the limb postural activities was found. Resulting DEs and DPs differed from the TB conditions, especially in lower extremity activities. The differences between the percent changes of DEs vs. Vt found for lower extremity activities were confirmed by both ventilatory and postural diaphragm recruitment in response to postural demands.


A Q-band (40–45 GHz) 16-element phased-array transmitter in 0.18-μm SiGe BiCMOS technology

A 16-element phased-array transmitter based on 4-bit RF phase shifters is designed in 0.18-mum SiGe BiCMOS technology for Q-band applications. The phased-array shows 12.5plusmn1.5 dB of power gain per channel at 42.5 GHz for all phase states and the 3-dB gain bandwidth is 40-45.6 GHz. The input and output return loss is less than -10 dB at 37.5-50 GHz. The transmitter also results in les8.8deg of RMS phase error and les1.2 dB of RMS gain error for all phase states at 30-50 GHz. The maximum saturated output power is -2.5plusmn1.5 dBm per channel at 42.5 GHz. The RMS gain variation and RMS phase mismatch between all 16 channels is les0.5 dB and les4.5deg, respectively. The chip consumes 720 mA from a 5 V supply voltage and overall chip size is 2.6times3.2 mm2. To our knowledge, this is the first implementation of a 16-element phased array on a silicon chip with the RF phase shifting architecture at any frequency.


Millimeter-wave CMOS design

This paper describes the design and modeling of CMOS transistors, integrated passives, and circuit blocks at millimeter-wave (mm-wave) frequencies. The effects of parasitics on the high-frequency performance of 130-nm CMOS transistors are investigated, and a peak f/sub max/ of 135 GHz has been achieved with optimal device layout. The inductive quality factor (Q/sub L/) is proposed as a more representative metric for transmission lines, and for a standard CMOS back-end process, coplanar waveguide (CPW) lines are determined to possess a higher Q/sub L/ than microstrip lines. Techniques for accurate modeling of active and passive components at mm-wave frequencies are presented. The proposed methodology was used to design two wideband mm-wave CMOS amplifiers operating at 40 GHz and 60 GHz. The 40-GHz amplifier achieves a peak |S/sub 21/| = 19 dB, output P/sub 1dB/ = -0.9 dBm, IIP3 = -7.4 dBm, and consumes 24 mA from a 1.5-V supply. The 60-GHz amplifier achieves a peak |S/sub 21/| = 12 dB, output P/sub 1dB/ = +2.0 dBm, NF = 8.8 dB, and consumes 36 mA from a 1.5-V supply. The amplifiers were fabricated in a standard 130-nm 6-metal layer bulk-CMOS process, demonstrating that complex mm-wave circuits are possible in today's mainstream CMOS technologies.


Fully integrated CMOS power amplifier design using the distributed active-transformer architecture

A novel on-chip impedance matching and powercombining method, the distributed active transformer is presented. It combines several low-voltage push–pull amplifiers efficiently with their outputs in series to produce a larger output power while maintaining a 50match. It also uses virtual ac grounds and magnetic couplings extensively to eliminate the need for any offchip component, such as tuned bonding wires or external inductors. Furthermore, it desensitizes the operation of the amplifier to the inductance of bonding wires making the design more reproducible. To demonstrate the feasibility of this concept, a 2.4-GHz 2-W 2-V truly fully integrated power amplifier with 50input and output matching has been fabricated using 0.35m CMOS transistors. It achieves a power added efficiency (PAE) of 41% at this power level. It can also produce 450 mW using a 1-V supply. Harmonic suppression is 64 dBc or better. This new topology makes possible a truly fully integrated watt-level gigahertz range low-voltage CMOS power amplifier for the first time.


A SiGe BiCMOS 16-element phased-array transmitter for 60GHz communications

The demonstration of multi-Gb/s links in the 60GHz band has created new opportunities for wireless communications [1,2]. Due to the directional nature of millimeter-wave (mm-Wave) propagation, beam steering enables longer-range non-line-of-sight (NLOS) links at these frequencies. A phased-array architecture is attractive for an integrated 60GHz transmitter (Tx) since it can attain both beam steering and higher EIRP through spatial combining. An all-RF 16-element 40-to-45GHz Tx for satellite applications [3], a 6-element 60GHz Tx with IF-path phase-shift [4], and a bi-directional 4-element 60GHz Tx/Rx with RF phase shifters [5] have been recently demonstrated in silicon. This work presents a fully-integrated phased-array Tx which supports multi-Gb/s NLOS IEEE 802.15.3c links. In addition to beamsteering, the IC has the following major features: an on-chip power sensor at each element, 3 temperature sensors, LO leakage and I/Q phase and amplitude adjustment, front-end OP1dB programmability, and an integrated modulator for pi/2-BPSK/MSK signaling (common mode in 802.15.3c). The IC integrates 2240 NPNs, 323,000 FETs and hundreds of transmission lines and is fabricated in the IBM 8HP 0.12µm SiGe BiCMOS process (fT = 200GHz).


On (Commercial) Benefits of Automatic Text Summarization Systems in the News Domain: A Case of Media Monitoring and Media Response Analysis

In this work, we present the results of a systematic study to investigate the (commercial) benefits of automatic text summarization systems in a real world scenario. More specifically, we define a use case in the context of media monitoring and media response analysis and claim that even using a simple query-based extractive approach can dramatically save the processing time of the employees without significantly reducing the quality of their work.


Prediction of Hard Drive Failures via Rule Discovery from AutoSupport Data

The ability to accurately predict an impending hard disk failure is important for reliable storage system design. The facility provided by most hard drive manufacturers, called S.M.A.R.T. (selfmonitoring, analysis and reporting technology), has been shown by current research to have poor predictive value. The problem of finding alternatives to S.M.A.R.T. for predicting disk failure is an area of active research. In this paper, we present a rule discovery methodology, and show that it is possible to construct decision support systems that can detect such failures using information recorded in the AutoSupport database. We demonstrate the effectiveness of our system by evaluating it on disks that were returned to NetApp from the field. Our evaluation shows that our system can be tuned either to have a high failure detection rate (i.e., classify a bad disk as bad) or to have a low false alarm rate (i.e., not classify a good disk as bad). Further, our rule-based classifier generates rules that are intuitive and easy to understand, unlike black box techniques.


Modeling urban dynamics through GIS-based cellular automata

In urban systems modeling, there are many elaborate dynamic models based on intricate decision processes whose simulation must be based on customized software if their space±time properties are to be explored eectively. In this paper we present a class of urban models whose dynamics are based on theories of development associated with cellular automata (CA), whose data is ®ne-grained, and whose simulation requires software which can handle an enormous array of spatial and temporal model outputs. We ®rst introduce the generic problem of modeling within GIS, noting relevant CA models before outlining a generalized model based on Xie's (1996, A general model for cellular urban dynamics. Geographical Analysis, 28, 350±373) ``dynamic urban evolutionary modeling'' (DUEM) approach. We present ways in which land uses are structured through their life cycles, and ways in which existing urban activities spawn locations for new activities. We de®ne various decision rules that embed distance and direction, density thresholds, and transition or mutation probabilities into the model's dynamics, and we then outline the software designed to generate eective urban simulations consistent with GIS data inputs, outputs and related functionality. Finally, we present a range of hypothetical urban simulations that illustrate the diversity of model types that can be handled within the framework as a prelude to more realistic applications which will be reported in later papers. # 1999 Published by Elsevier Science Ltd. All