Using model transformation to refactor use case models based on antipatterns

Use Case modeling is a popular technique for documenting functional requirements of software systems. Refactoring is the process of enhancing the structure of a software artifact without changing its intended behavior. Refactoring, which was first introduced for source code, has been extended for use case models. Antipatterns are low quality solutions to commonly occurring design problems. The presence of antipatterns in a use case model is likely to propagate defects to other software artifacts. Therefore, detection and refactoring of antipatterns in use case models is crucial for ensuring the overall quality of a software system. Model transformation can greatly ease several software development activities including model refactoring. In this paper, a model transformation approach is proposed for improving the quality of use case models. Model transformations which can detect antipattern instances in a given use case model, and refactor them appropriately are defined and implemented. The practicability of the approach is demonstrated by applying it on a case study that pertains to biodiversity database system. The results show that model transformations can efficiently improve quality of use case models by saving time and effort.     

Fuzzy clustering with learnable cluster-dependent kernels

We propose a new relational clustering approach, called Fuzzy clustering with Learnable Cluster-dependent Kernels (FLeCK), that learns the underlying cluster-dependent dissimilarity measure while seeking compact clusters. The learned dissimilarity is based on a Gaussian kernel function with cluster-dependent parameters. Each cluster’s parameter learned by FLeCK reflects the relative intra-cluster and inter-cluster characteristics. These parameters are learned by optimizing both the intra-cluster and the inter-cluster distances. This optimization is achieved iteratively by dynamically updating the partition and the local kernel. This makes the kernel learning task takes advantages of the available unlabeled data and reciprocally, the categorization task takes advantages of the learned local kernels. Another key advantage of FLeCK is that it is formulated to work on relational data. This makes it applicable to data where objects cannot be represented by vectors or when clusters of similar objects cannot be represented efficiently by a single prototype. Using synthetic and real data sets, we show that FLeCK learns meaningful parameters and outperforms several other algorithms. In particular, we show that when data include clusters with various inter- and intra-cluster distances, learning cluster-dependent parameters is crucial in obtaining a good partition.     

A Measurement‐Based Approach for Designing Fixed‐Order Controllers for Unknown Closed‐Loop Architecture

This paper presents a new technique to design fixed‐structure controllers for linear unknown systems using a set of measurements. In model‐based approaches, the measured data are used to identify a model of the plant for which a suitable controller can be designed. Due to the fact that real processes cannot be described perfectly by mathematical models, designing controllers using such models to guarantee some desired closed‐loop performance is a challenging task. Hence, a possible alternative to model‐based methods is to directly utilize the measured data in the design process. We propose an approach to designing structured controllers using a set of closed‐loop frequency‐domain data. The principle of such an approach is based on computing the parameters of a fixed‐order controller for which the closed‐loop frequency response fits a desired frequency response that describes some desired performance indices. This problem is formulated as an error minimization problem, which can be solved to find suitable values of the controller parameters. The main feature of the proposed control methodology is that it can be applied to stable and unstable plants. Additionally, the design process depends on a pre‐selected controller structure, which allows for the selection of low‐order controllers. An application of the proposed method to a DC servomotor system is presented to experimentally validate and demonstrate its efficacy.     

A rule triggering system for automatic text-to-sign translation

The topic of this paper is machine translation (MT) from French text into French sign language (LSF). After arguing in favour of a rule-based method, it presents the architecture of an original MT system, built on two distinct efforts: formalising LSF production rules and triggering them with text processing. The former is made without any concern for text or translation and involves corpus analysis to link LSF form features to linguistic functions. It produces a set of production rules which may constitute a full LSF production grammar. The latter is an information extraction task from text, broken down in as many subtasks as there are rules in the grammar. After discussing this architecture, comparing it to the traditional methods and presenting the methodology for each task, the paper present the set of production rules found to govern event precedence and duration in LSF and gives a progress report on the implementation of the rule triggering system. With this proposal, it is also hoped to show how MT can benefit today from sign language processing.     

Target point‐based path‐following controller for a car‐type vehicle using bounded controls

In this paper, we have studied the control problem of target point‐based path following for car‐type vehicles. This special path‐following task arises from the needs of vision‐based guidance systems, where a given target point located ahead of the vehicle, in the visual range of the camera, must follow a specified path. A solution to this problem is developed through a nonlinear transformation of the path‐following problem into a reference trajectory tracking problem, by modeling the target point as a virtual vehicle. The use of target point complicates the control problem, as the development produces a first‐order nonlinear nonglobally Lipschitz differential equation with finite escape time. This problem is solved by using small control signals. Bounded feedback laws are designed to control the real vehicle's angular acceleration and the virtual vehicle's velocity, to achieve stability. The resulting controller is globally asymptotically stable with respect to the origin, the proof of which is derived from Lyapunov‐based arguments and a bootstrap argument. It is also shown that the use of exponentially convergent observers/differentiators does not affect the stability of the closed‐loop system. The effectiveness of this controller has been illustrated through simulations. Copyright © 2014 John Wiley & Sons, Ltd.     

A new fast motion estimation algorithm using fast mode decision for high-efficiency video coding standard

High-efficiency video coding is the latest standardization effort of the International Organization for Standardization and the International Telecommunication Union. This new standard adopts an exhaustive algorithm of decision based on a recursive quad-tree structured coding unit, prediction unit, and transform unit. Consequently, an important coding efficiency may be achieved. However, a significant computational complexity is resulted. To speed up the encoding process, efficient algorithms based on fast mode decision and optimized motion estimation were adopted in this paper. The aim was to reduce the complexity of the motion estimation algorithm by modifying its search pattern. Then, it was combined with a new fast mode decision algorithm to further improve the coding efficiency. Experimental results show a significant speedup in terms of encoding time and bit-rate saving with tolerable quality degradation. In fact, the proposed algorithm permits a main reduction that can reach up to 75 % in encoding time. This improvement is accompanied with an average PSNR loss of 0.12 dB and a decrease by 0.5 % in terms of bit-rate.     

Opening web applications for third-party development: a service-oriented solution

Web applications are nowadays prevalent software systems in our everyday’s life. A lot of these applications have been developed for end users only. Thus, they are not designed by considering future extensions that would be developed by third parties. One possible and interesting solution for opening these applications for such kind of extension development is to create and deploy Web services starting from these applications. In this paper, we present a method and a tool for semiautomatically creating Web service implementations from applications having Web interfaces. The proposed method generates operations that are published in Web services for each functionality provided by a Web application. In addition, it generates new operations starting from Web interfaces. Our approach goes further in the creation of services by generating executable orchestrations, as BPEL processes, starting from navigations in the Web interfaces of these applications and by providing BPMN choreography specifications starting from the collaborations between the generated Web services. We implemented and experimented our solution in the migration of three real-world Web applications toward Web service-oriented systems.     

Multi-objective topology optimization of multi-component continuum structures via a Kriging-interpolated level set approach

This paper explores a framework for topology optimization of multi-component sheet metal structures, such as those often used in the automotive industry. The primary reason for having multiple components in a structure is to reduce the manufacturing cost, which can become prohibitively expensive otherwise. Having a multi-component structure necessitates re-joining, which often comes at sacrifices in the assembly cost, weight and structural performance. The problem of designing a multi-component structure is thus posed in a multi-objective framework. Approaches to solve the problem may be classified into single and two stage approaches. Two-stage approaches start by focusing solely on structural performance in order to obtain optimal monolithic (single piece) designs, and then the decomposition into multiple components is considered without changing the base topology (identical to the monolithic design). Single-stage approaches simultaneously attempt to optimize both the base topology and its decomposition. Decomposition is an inherently discrete problem, and as such, non-gradient methods are needed for single-stage and second stage of two-stage approaches. This paper adopts an implicit formulation (level-sets) of the design variables, which significantly reduces the number of design variables needed in either single or two stage approaches. The number of design variables in the formulation is independent from the meshing size, which enables application of non-gradient methods to realistic designs. Test results of a short cantilever and an L-shaped bracket studies show reasonable success of both single and two stage approaches, with each approach having different merits.     

In situ, noninvasive characterization of superhydrophobic coatings

Light scattering was used to measure the time-dependent loss of air entrapped within a submerged microporous hydrophobic surface subjected to different environmental conditions. The loss of trapped air resulted in a measurable decrease in surface reflectivity and the kinetics of the process was determined in real time and compared to surface properties, such as porosity and morphology. The light-scattering results were compared with measurements of skin-friction drag, static contact angle, and contact-angle hysteresis. The in situ, noninvasive optical technique was shown to correlate well with the more conventional methods for quantifying surface hydrophobicity, such as flow slip and contact angle.