Advanced product planning: a comprehensive process for systemic definition of new product requirements

This paper reports results of research into the definition of requirements for new consumer products––specifically, electro-mechanical products. The research dealt with the derivation of design requirements that are demonstrably aligned with stakeholder needs. The paper describes a comprehensive process that can enable product development teams to deal with statements of product requirements, as originally collected through market research activities, in a systematic and traceable manner from the early, fuzzy front end, stages of the design process. The process described has been based on principles of systems engineering. A case study from its application and evaluation drawn from the power sector is described in this paper. The case study demonstrates how the process can significantly improve product quality planning practices through revision of captured product requirements, analysis of stakeholder requirements and derivation of design requirements. The paper discusses benefits and issues from the use of the process by product development teams, and identifies areas for further research. Finally, the conclusions drawn from the reported research are presented.

Parallel Time and Quantifier Prefixes

We characterize the amount of alternation between blocks of Boolean quantifiers (having both existential and universal), blocks of real existential quantifiers, and blocks of real universal quantifiers that can be decided in parallel polynomial time over the reals. We do so under the assumption that blocks have a uniform bound on their size, both for the case of this bound to be polynomial and constant. On the way towards this characterization we prove a real version of Savitch’s Theorem.     

A backstepping controller for path‐tracking of an underactuated autonomous airship

In this paper we propose a nonlinear control approach for the path‐tracking of an autonomous underactuated airship. A backstepping controller is designed from the airship nonlinear dynamic model including wind disturbances, and further enhanced to consider actuators saturation. Control implementation issues related to airship underactuation are also addressed, namely control allocation and an attitude reference shaping to obtain a faster error correction with smoother input requests. The results obtained demonstrate the capacity of an underactuated unmanned airship to execute a realistic mission including vertical take‐off and landing, stabilization and path‐tracking, in the presence of wind disturbances, with a single robust control law. Copyright © 2008 John Wiley & Sons, Ltd.     

Dynamic Clustering of Interval-Valued Data Based on Adaptive Quadratic Distances

This paper presents partitioning dynamic clustering methods for interval-valued data based on suitable adaptive quadratic distances. These methods furnish a partition and a prototype for each cluster by optimizing an adequacy criterion that measures the fitting between the clusters and their representatives. These adaptive quadratic distances change at each algorithm iteration and can either be the same for all clusters or different from one cluster to another. Moreover, various tools for the partition and cluster interpretation of interval-valued data are also presented. Experiments with real and synthetic interval-valued data sets show the usefulness of these adaptive clustering methods and the merit of the partition and cluster interpretation tools.     

The Influence of the Internet on European Journalism

This study investigates how European journalists evaluate the changes that have occurred in their profession since the Internet has been integrated in newsrooms. How do journalists perceive the features and innovations associated with the Internet? What are the principal changes in the profession? Do practitioners believe that the quality of journalism has been raised or lowered? To answer to these research questions, we carried out a survey across 11 European countries–Cyprus, Estonia, Finland, Greece, Ireland, Italy, Lithuania, United Kingdom, Slovenia, Spain, Sweden–of 239 journalists, working for 40 of the most‐read print/online news outlets in these countries. The survey shows that the opportunity to use the Internet to reinforce the social functions of journalism has not been fully recognised.     

Versioning XML-based office documents

The ability to reliably merge independent updates of a document is a crucial prerequisite to efficient collaboration in office work. However, merge support for common office document standards like OpenDocument or OfficeOpenXML is still in its infancy. In this paper, we present a consistent versioning model for XML documents in general including merge support. This is achieved by using context-aware fingerprints that identify edit operations and allow for a conflict detection. We show how to extract tracked changes from office documents and map them on our delta model. Experimental results indicate that our fingerprinting technique is efficient and reliable.     

A Genre-Aware Approach to Focused Crawling

Focused crawlers have as their main goal to crawl Web pages that are relevant to a specific topic or user interest, playing an important role for a great variety of applications. In general, they work by trying to find and crawl all kinds of pages deemed as related to an implicitly declared topic. However, users are often not simply interested in any document about a topic, but instead they may want only documents of a given type or genre on that topic to be retrieved. In this article, we describe an approach to focused crawling that exploits not only content-related information but also genre information present in Web pages to guide the crawling process. This approach has been designed to address situations in which the specific topic of interest can be expressed by specifying two sets of terms, the first describing genre aspects of the desired pages and the second related to the subject or content of these pages, thus requiring no training or any kind of preprocessing. The effectiveness, efficiency and scalability of the proposed approach are demonstrated by a set of experiments involving the crawling of pages related to syllabi of computer science courses, job offers in the computer science field and sale offers of computer equipments. These experiments show that focused crawlers constructed according to our genre-aware approach achieve levels of F1 superior to 88%, requiring the analysis of no more than 65% of the visited pages in order to find 90% of the relevant pages. In addition, we experimentally analyze the impact of term selection on our approach and evaluate a proposed strategy for semi-automatic generation of such terms. This analysis shows that a small set of terms selected by an expert or a set of terms specified by a typical user familiar with the topic is usually enough to produce good results and that such a semi-automatic strategy is very effective in supporting the task of selecting the sets of terms required to guide a crawling process.     

Primary and secondary diagnosis of multi-agent plan execution

Diagnosis of plan failures is an important subject in both single- and multi-agent planning. Plan diagnosis can be used to deal with plan failures in three ways: (i) to provide information necessary for the adjustment of the current plan or for the development of a new plan, (ii) to point out which equipment and/or agents should be repaired or adjusted to avoid further violation of the plan execution, and (iii) to identify the agents responsible for plan-execution failures. We introduce two general types of plan diagnosis: primary plan diagnosis identifying the incorrect or failed execution of actions, and secondary plan diagnosis that identifies the underlying causes of the faulty actions. Furthermore, three special cases of secondary plan diagnosis are distinguished, namely agent diagnosis, equipment diagnosis and environment diagnosis.     

Finite-source M/M/S retrial queue with search for balking and impatient customers from the orbit

The present paper deals with a generalization of the homogeneous multi-server finite-source retrial queue with search for customers in the orbit. The novelty of the investigation is the introduction of balking and impatience for requests who arrive at the service facility with a limited capacity and FIFO queue. Arriving customers may balk, i.e., they either join the queue or go to the orbit. Moreover, the requests are impatient and abandon the buffer after a random time and enter the orbit, too. In case of an empty buffer, each server searches for a customer in the orbit after finishing service. All random variables involved in the model construction are supposed to be exponentially distributed and independent of each other. The primary aim of this analysis is to show the effect of balking, impatience, and buffer size on the steady-state performance measures. Concentrating on the mean response time, several numerical examples are investigated by the help of the MOSEL-2 tool used for creating the model and calculating the stationary characteristics.     

A multi-scale template method for shape detection with bio-medical applications

In this paper we present a novel methodology based on non-parametric deformable prototype templates for reconstructing the outline of a shape from a degraded image. Our method is versatile and fast and has the potential to provide an automatic procedure for classifying pathologies. We test our approach on synthetic and real data from a variety of medical and biological applications. In these studies it is important to reconstruct accurately the shape of the object under investigation from very noisy data. Here we assume that we have some prior knowledge about the object outline represented by a prototype shape. Our procedure deforms this shape by means of non-affine transformations and the contour is reconstructed by minimizing a newly developed objective function that depends on the transformation parameters. We introduce an iterative template deformation procedure in which the scale of the deformation decreases as the algorithm proceeds. We compare our results with those from a Gaussian Mixture Model segmentation and two state-of-the-art Level Set methods. This comparison shows that the proposed procedure performs consistently well on both real and simulated data. As a by-product we develop a new filter that recovers the connectivity of a shape.