A validation of object-oriented design metrics as qualityindicators

This paper presents the results of a study in which we empirically investigated the suite of object-oriented (OO) design metrics introduced in (Chidamber and Kemerer, 1994). More specifically, our goal is to assess these metrics as predictors of fault-prone classes and, therefore, determine whether they can be used as early quality indicators. This study is complementary to the work described in (Li and Henry, 1993) where the same suite of metrics had been used to assess frequencies of maintenance changes to classes. To perform our validation accurately, we collected data on the development of eight medium-sized information management systems based on identical requirements. All eight projects were developed using a sequential life cycle model, a well-known OO analysis/design method and the C++ programming language. Based on empirical and quantitative analysis, the advantages and drawbacks of these OO metrics are discussed. Several of Chidamber and Kemerer's OO metrics appear to be useful to predict class fault-proneness during the early phases of the life-cycle. Also, on our data set, they are better predictors than “traditional” code metrics, which can only be collected at a later phase of the software development processes     

An adaptive learning approach for 3-D surface reconstruction from point clouds.

In this paper, we propose a multiresolution approach for surface reconstruction from clouds of unorganized points representing an object surface in 3-D space. The proposed method uses a set of mesh operators and simple rules for selective mesh refinement, with a strategy based on Kohonen's self-organizing map (SOM). Basically, a self-adaptive scheme is used for iteratively moving vertices of an initial simple mesh in the direction of the set of points, ideally the object boundary. Successive refinement and motion of vertices are applied leading to a more detailed surface, in a multiresolution, iterative scheme. Reconstruction was experimented on with several point sets, including different shapes and sizes. Results show generated meshes very close to object final shapes. We include measures of performance and discuss robustness.     

A semi-automatic strategy for achieving learning content and practice repurposing

The development of instructional content using Information Technologies is an expensive, time-consuming and complex process that requires new methodologies. It was in this context that the concept of Learning Objects (LOs) was proposed in order to promote reuse. However, this goal is not yet fully attained and new contributions to increase reuse are still welcome. Besides, if content is conveyed in LOs that are easier to reuse, they must be combined and sequenced in order to build more elaborated and complex content. This paper presents a strategy to deal with these problems based on the definition of small LOs here called Component Objects (COs). These COs are structured and combined according to a conceptual metamodel, which is the basis for the definition of conceptual schemas representing the existing material, including not only content but also practice. This strategy for searching, extracting, and sequencing COs, supports a teacher to better control the implementation of complex content, reducing errors in the authoring process. This approach includes a specification language and an algorithm for semi-automatic sequencing learning content and practice. Finally, a case study that shows the proposed approach and some results of using the algorithm are presented.     

Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning

In this paper, we focus on the strategic design of supply chain networks. We propose a mathematical modeling framework that captures many practical aspects of network design problems simultaneously but which have not received adequate attention in the literature. The aspects considered include: dynamic planning horizon, generic supply chain network structure, external supply of materials, inventory opportunities for goods, distribution of commodities, facility configuration, availability of capital for investments, and storage limitations. Moreover, network configuration decisions concerning the gradual relocation of facilities over the planning horizon are considered. To cope with fluctuating demands, capacity expansion and reduction scenarios are also analyzed as well as modular capacity shifts. The relation of the proposed modeling framework with existing models is discussed. For problems of reasonable size, we report on our computational experience with standard mathematical programming software. In particular, useful insights on the impact of various factors on network design decisions are provided.     

Multiple biological sequence alignment in heterogeneous multicore clusters with user-selectable task allocation policies

Multiple Sequence Alignment (MSA) is an important problem in Bioinformatics that aims to align more than two sequences in order to emphasize similarity regions. This problem is known to be NP-Hard, so heuristic methods are used to solve it. DIALIGN-TX is an iterative heuristic method for MSA that generates alignments by concatenating ungapped regions with high similarity. Usually, the first phase of MSA algorithms is parallelized by distributing several independent tasks among the nodes. Even though heterogeneous multicore clusters are becoming very common nowadays, very few task allocation policies were proposed for this type of architecture. This paper proposes an MPI/OpenMP master/slave parallel strategy to run DIALIGN-TX in heterogeneous multicore clusters, with several allocation policies. We show that an appropriate choice of the master node has great impact on the overall system performance. Also, the results obtained in a heterogeneous multicore cluster composed of 4 nodes (30 cores), with real sequence sets show that the execution time can be drastically reduced when the appropriate allocation policy is used.     

Correction to: Simple and efficient pose-based gait recognition method for challenging environments

Pattern Analysis and Applications - In the original publication of the article, the Acknowledgements section was missed unfortunately. The correct Acknowledgements section is given in this correction.     

A stochastic local search algorithm for constrained continuous global optimization

This paper presents a new stochastic local search algorithm known as feasible–infeasible search procedure (FISP) for constrained continuous global optimization. The proposed procedure uses metaheuristic strategies for combinatorial optimization as well as combined strategies for exploring continuous spaces, which are applied to an efficient process in increasingly refined neighborhoods of current points. We show effectiveness and efficiency of the proposed procedure on a standard set of 13 well‐known test problems. Furthermore, we compare the performance of FISP with SNOPT (sparse nonlinear optimizer) and with few successful existing stochastic algorithms on the same set of test problems.     

Querying dynamic communities in online social networks简

Online social networks （OSNs） offer people the opportunity to join communities where they share a common interest or objective. This kind of community is useful for studying the human behavior, diffusion of information, and dynamics of groups. As the members of a community are always changing, an efficient solution is needed to query information in real time. This paper introduces the Follow Model to present the basic relationship between users in OSNs, and combines it with the MapReduce solution to develop new algorithms with parallel paradigms for querying. Two models for reverse relation and high-order relation of the users were implemented in the Hadoop system. Based on 75 GB message data and 26 GB relation network data from Twitter, a case study was realized using two dynamic discussion communities：#musicmonday and #beatcancer. The querying performance demonstrates that the new solution with the implementation in Hadoop significantly improves the ability to find useful information from OSNs.     

Non-Pauli observables for CWS codes

It is known that nonadditive quantum codes can have higher code dimensions than stabilizer codes for the same length and minimum distance. The class of codeword stabilized codes (CWS) provides tools to obtain new nonadditive quantum codes by reducing the problem to finding nonlinear classical codes. In this work, we establish some results on the kind of non-Pauli operators that can be used as observables in the decoding scheme of CWS codes and propose a procedure to obtain those observables.     

A Framework for Integrating Non-Functional Requirements into Conceptual Models

The development of complex information systems calls for conceptual models that describe aspects beyond entities and activities. In particular, recent research has pointed out that conceptual models need to model goals, in order to capture the intentions which underlie complex situations within an organisational context. This paper focuses on one class of goals, namely non-functional requirements (NFR), which need to be captured and analysed from the very early phases of the software development process. The paper presents a framework for integrating NFRs into the ER and OO models. This framework has been validated by two case studies, one of which is very large. The results of the case studies suggest that goal modelling during early phases can lead to a more productive and complete modelling activity.