Search results

Attitude determination and control subsystem (ADCS) is a vital part of earth observation satellites (EO-Satellites) that governs the satellite’s rotational motion and pointing. In designing such a complicated sub-system, many parameters including mission, system and performance requirements (PRs), as well as system design parameters (DPs), should be considered. Design cycles which prolong the time-duration and consequently increase the cost of the design process are due to the dependence of these parameters to each other. This paper aims to describe a rapid-sizing method based on the design for performance strategy, which could minimize the design cycles imposed by conventional methods.

The proposed technique is an adaptation from that used in the aircraft industries for aircraft design and provides a ball-park figure with little engineering man-hours. The authors have shown how such a design technique could be generalized to cover the EO-satellites platform ADCS. The authors divided the system requirements into five categories, including maneuverability, agility, accuracy, stability and durability. These requirements have been formulated as functions of spatial resolution that is the highest level of EO-missions PRs. To size, the ADCS main components, parametric characteristics of the matching diagram were determined by means of the design drivers.

Integrating the design boundaries based on the PRs in critical phases of the mission allowed selecting the best point in the design space as the baseline design with only two iterations. The ADCS of an operational agile EO-satellite is sized using the proposed method. The results show that the proposed method can significantly reduce the complexity and time duration of the performance sizing process of ADCS in EO-satellites with an acceptable level of accuracy.

Rapid performance sizing of EO-satellites ADCS using matching diagram technique and consequently, a drastic reduction in design time via minimization of design cycles makes this study novel and represents a valuable contribution in this field.

Pattern recognition systems often have to handle problem of large volume of training data sets including duplicate and similar training samples. This problem leads to large memory requirement for saving and processing data, and the time complexity for training algorithms. The purpose of the paper is to reduce the volume of training part of a data set – in order to increase the system speed, without any significant decrease in system accuracy.

A new technique for data set size reduction – using a version of modified frequency diagram approach – is presented. In order to reduce processing time, the proposed method compares the samples of a class to other samples in the same class, instead of comparing samples from different classes. It only removes patterns that are similar to the generated class template in each class. To achieve this aim, no feature extraction operation was carried out, in order to produce more precise assessment on the proposed data size reduction technique.

The results from the experiments, and according to one of the biggest handwritten numeral standard optical character recognition (OCR) data sets, Hoda, show a 14.88 percent decrease in data set volume without significant decrease in performance.

The proposed technique is effective for size reduction for all pictorial databases such as OCR data sets.

State-of-the-art algorithms currently used for data set size reduction usually remove samples near to class's centers, or support vector (SV) samples between different classes. However, the samples near to a class center have valuable information about class characteristics, and they are necessary to build a system model. Also, SV s are important samples to evaluate the system efficiency. The proposed technique, unlike the other available methods, keeps both outlier samples, as well as the samples close to the class centers.

Security is a vital requirement for software systems. Misuse case models allow system designers to inject security considerations within their designs early in the development cycle rather than patching an end system with security mechanisms after it was developed. The notation and syntactical rules of misuse case models are relatively simple. However, misuse case modeling practitioners are highly vulnerable to modeling pitfalls, creating defective models that can have catastrophic effects downstream in the development cycle. This paper seeks to present a framework that unitizes antipatterns to help remedy defective misuse case models and poor modeling practices.

A repository of antipatterns was constructed and formatted to be machine‐readable whenever possible so that it can be utilized by the proposed framework. The feasibility of the proposed approach was then demonstrated using a real‐world misuse case model of an online bookstore system.

The results indicate that the overall quality and clarity of the bookstore misuse case model is improved by applying the proposed technique and framework.

This research work presents a series of domain‐independent antipatterns. Users of this framework may be interested to develop domain‐dependent antipatterns to better suit their modeling and development needs.

The proposed approach will help misuse case modelers, especially novice ones, to improve the quality of their current models as well as future models.

The purpose of this paper is to provide a feature‐based characterization of version control systems (VCSs), providing an overview about the state‐of‐the‐art of versioning systems dedicated to modeling artifacts.

Based on a literature study of existing approaches, a description of the features of versioning systems is established. Special focus is set on three‐way merging which is an integral component of optimistic versioning. This characterization is employed on current model versioning systems, which allows the derivation of challenges in this research area.

The results of the evaluation show that several challenges need to be addressed in future developments of VCSs and merging tools in order to allow the parallel development of model artifacts.

Making model‐driven engineering (MDE) a success requires supporting the parallel development of model artifacts as is done nowadays for text‐based artifacts. Therefore, model versioning capabilities are a must for leveraging MDE in practice.

The paper gives a comprehensive overview of collaboration features of VCSs for software engineering artifacts in general, discusses the state‐of‐the‐art of systems for model artifacts, and finally, lists urgent challenges, which have to be considered in future model versioning system for realizing MDE in practice.

Presents a table comparing business process for the future manufacturing enterprises with a set of mapping techniques and methodologies. The first section is a brief introduction about the current situation for many European manufacturing companies. After that, describes the process‐based organization and a set of generic processes. Presents two key processes which were identified for each of five enterprises of the future suggested by Puttick. Following this, gives a description of the most common techniques and methodologies currently used, together with an evaluation of them. The table obtained by matching the processes with the techniques can be used as a guide when choosing the most suitable mapping technique or methodology for a enterprise’s key processes.

The purpose of this paper is to propose a lossy/lossless binary textual image compression method based on an improved pattern matching (PM) technique.

In the Farsi/Arabic script, contrary to the printed Latin script, letters usually attach together and produce various patterns. Hence, some patterns are fully or partially subsets of some others. Two new ideas are proposed here. First, the number of library prototypes is reduced by detecting and then removing the fully or partially similar prototypes. Second, a new effective pattern encoding scheme is proposed for all types of patterns including text and graphics. The new encoding scheme has two operation modes of chain coding and soft PM, depending on the ratio of the pattern area to its chain code effective length. In order to encode the number sequences, the authors have modified the multi‐symbol QM‐coder. The proposed method has three levels for the lossy compression. Each level, in its turn, further increases the compression ratio. The first level includes applying some processing in the chain code domain such as omission of small patterns and holes, omission of inner holes of characters, and smoothing the boundaries of the patterns. The second level includes the selective pixel reversal technique, and the third level includes using the proposed method of prioritizing the residual patterns for encoding, with respect to their degree of compactness.

Experimental results show that the compression performance of the proposed method is considerably better than that of the best existing binary textual image compression methods as high as 1.6‐3 times in the lossy case and 1.3‐2.4 times in the lossless case at 300 dpi. The maximum compression ratios are achieved for Farsi and Arabic textual images.

Only the binary printed typeset textual images are considered.

The proposed method has a high‐compression ratio for archiving and storage applications.

To the authors' best knowledge, the existing textual image compression methods or standards have not so far exploited the property of full or partial similarity of prototypes for increasing the compression ratio for any scripts. Also, the idea of combining the boundary description methods with the run‐length and arithmetic coding techniques has not so far been used.

This paper aims to propose a framework on complaint management system for quality management by applying the text mining method and potential failure identification that can support organization learning (OL). Customer complaints in the form of email text is the input of the framework, while the most frequent complaints are visualized using a Pareto diagram. The company can learn from this Pareto diagram and take action to improve their process.

The first main part of the framework is creating a defect database from potential failure identification, which is the initial part of the failure mode and effect analysis technique. The second main part is the text mining of customer email complaints. The last part of the framework is matching the result of text mining with the defect database and presenting in the form of a Pareto diagram. After the framework is proposed, a case study is conducted to illustrate the applicability of the proposed method.

By using the defect database, the framework can interpret the customer email complaints into the list of most defect complained by customer using a Pareto diagram. The results of the Pareto diagram, based on the results of text mining of consumer complaints via email, can be used by a company to learn from complaint and to analyze the potential failure mode. This analysis helps company to take anticipatory action for avoiding potential failure mode happening in the future.

The framework on complaint management system for quality management by applying the text mining method and potential failure identification is proposed for the first time in this paper.

A web service is a software system designed to support interoperable machine‐to‐machine or application‐to‐application interactions over networks. Descriptions enable web services to be discovered, used by other web services, and composed into new web services. Web service composition is a mechanism for creating new web services by reusing existing ones. In order to compose a web service, the right primitive services have to be discovered. A matchmaking technique enables discovering these services. Web services have functional, non‐functional, behavioral, and semantic characteristics. These four aspects of web services provide different key information about the service; therefore they have to be considered for description, matching, and composition. The purpose of this paper is to propose a formal description framework and a formal matchmaking technique that allows describing and discovering web services by considering their four characteristics.

In this paper, the description framework combines two existing languages for functional, semantic, and behavioral description, along with a simple and new language for non‐functional description.

A case study is used to illustrate the description framework and the matchmaking technique. The implementation and performance evaluation of the matchmaking technique is presented. The framework formalizes and integrates the languages in a common semantic domain in order to match and manipulate the different aspects together and formally. Isabelle is used by the matchmaking technique for discovering the partially and fully matched services.

The contribution of this paper lies in the new description framework and the new matchmaking technique.

Overview All organisations are, in one sense or another, involved in operations; an activity implying transformation or transfer. The major portion of the body of knowledge concerning operations relates to production in manufacturing industry but, increasingly, similar problems are to be found confronting managers in service industry. It is only in the last decade or so that new technology, involving, in particular, the computer, has encouraged an integrated view to be taken of the total business. This has led to greater recognition being given to the strategic potential of the operations function. In order to provide greater insight into operations a number of classifications have been proposed. One of these, which places operations into categories termed factory, job shop, mass service and professional service, is examined. The elements of operations management are introduced under the headings of product, plant, process, procedures and people.

The complexity of business environments often causes organizations to produce several inconsistent views of the same business process (BP), leading to fragmentation. BP view integration attempts to produce an integrated view from different views of the same model, facilitating the management of BP models.

To study the trends of BP view integration, the authors conduct an extensive and systematic literature review to summarize findings since the 1970s. With a starting corpus of 918 documents, this survey draws up a systematic inventory of solutions used in academia and industry. By narrowing it down to 71 articles, the authors discuss in-depth 17 BP integration techniques papers, classifying each solution according to 9 criteria.

The authors' study shows that most view-integration methods (11) utilize annotation-based matching, based on formal merging rules. While most solutions are formalized, only approximately half are validated with a real-world use case scenario. View integration can be applied to areas other than database schema integration and BP view integration.

By summarizing existing knowledge up to June 2021, the authors explore possible future research directions. The authors highlight the application of view integration to the blockchain research area, where stakeholders can have different views on the same blockchain. The authors expect that this study contributes to interdisciplinary research across view integration, namely to the context of blockchain.

This survey serves to pave the way for future trends, where the authors highlight the application of view integration to blockchain research.