Search results

In this study, human activity with finite and specific ranking is modeled with finite state machine, and an application for human–robot interaction was realized. A robot arm was designed that makes specific movements. The purpose of this paper is to create a language associated to a complex task, which was then used to teach individuals by the robot that knows the language.

Although the complex task is known by the robot, it is not known by the human. When the application is started, the robot continuously checks the specific task performed by the human. To carry out the control, the human hand is tracked. For this, the image processing techniques and the particle filter (PF) based on the Bayesian tracking method are used. To determine the complex task performed by the human, the task is divided into a series of sub-tasks. To identify the sequence of the sub-tasks, a push-down automata that uses a context-free grammar language structure is developed. Depending on the correctness of the sequence of the sub-tasks performed by humans, the robot produces different outputs.

This application was carried out for 15 individuals. In total, 11 out of the 15 individuals completed the complex task correctly by following the different outputs.

This type of study is suitable for applications to improve human intelligence and to enable people to learn quickly. Also, the risky tasks of a person working in a production or assembly line can be controlled with such applications by the robots.

Describes intuitively the fact that four types of formal languages can be generated by four types of grammars or can be recognized by four types of automata. Gives the relationships between context‐sensitive languages and computer programming languages. Defines and investigates parallel productions, parallel grammars, and context‐free parallel grammars. Shows that context‐sensitive languages exist which can be generated by context‐free parallel grammars. In addition, states the advantages of context‐free parallel grammars. Also shows that context‐free languages (CFL) are a proper subset of context‐free parallel languages (CFPL). Furthermore, CFPL is a more effective tool for modelling computer programming languages than CFL, especially for parallel computer programming languages, for example, the ADA programming language. Also illustrates context‐sensitive property of recognizing hand‐written characters. The results may have useful applications in artificial intelligence, model parallel computer programming languages, software engineering, expert systems and robotics.

Business process workflow is a design conceptualization to automate the sequence of activities to achieve a business goal with involved participants and a predefined set of rules. Regarding this, a formal business workflow model is a prime requisite to implement a consistent and rigorous business process. In this context, majority of the existing research works are formalized structural features and have not focused on functional and behavioral design aspects of business processes. To address this problem, this paper aims to propose a formal model of business process workflow called as business process workflow using typed attributed graph (BPWATG) enriched with structural, functional and behavioral characteristics of business processes.

Typed attributed graph (ATG) and first-order logic have been used to formalize proposed BPWATG to provide rigorous syntax and semantics towards business process workflows. This is an effort to execute a business workflow on an automated machine. Further, the proposed BPWATG is illustrated using a case study to show the expressiveness of proposed model. Besides, the proposed graph is initially validated using generic modelling environment (GME) case tool. Moreover, a comparative study is performed with existing formal approaches based on several crucial features to exhibit the effectiveness of proposed BPWATG.

The proposed model is capable of facilitating structural, functional and behavioral aspects of business process workflows using several crucial features such as dependency conceptualization, timer concepts, exception handling and deadlock detection. These features are used to handle real-world problems and ensure the consistency and correctness of business workflows.

BPWATG is proposed to formalize a business workflow that is required to make a model of business process machine-readable. Besides, formalizations of dependency conceptualization, exception handling, deadlock detection and time-out concepts are specified. Moreover, several non-functional properties (reusability, scalability, flexibility, dynamicity, reliability and robustness) are supported by the proposed model.

Reports on ongoing research in developing generative process planning systems. Presents a feature‐based model for describing component geometry and its structural aspects (connectivity) and a hierarchical structure for form features definition and classification, as well as methods for representing the capabilities of machine tools. These models form the basis for decision making in the prototype process planning system GENPLAN. As an example, reports on how the models are being used for reasoning about component geometry and a linguistic approach that is adopted for machine tool selection in process planning.

Browsing a database of article abstracts is one way to select and buy relevant magazine articles online. Our research contributes to the design and development of text grammars for abstracting texts in unlimited subject domains. We developed a system that parses texts based on the text grammar of a specific text type and that extracts sentences and statements which are relevant for inclusion in the abstracts. The system employs knowledge of the discourse patterns that are typical of news stories. The results are encouraging and demonstrate the importance of discourse structures in text summarisation.

Several pick‐up devices have been proposed and invented for automated garment handling but a scientific understanding of picking up operation is incomplete. This paper is an extension of earlier studies into modelling the interaction of the performance of pinch gripper and the properties of flexible material (foam). Here, the relationship between the performance of pinch gripper (size and shape), external load, deformation and the properties fabric is investigated. The distributions of stress and strain within a fabric under differently shaped grippers (flat and curved) are revealed. The main factors affecting the first step of picking up action‐two pegs pushing down on the top of fabric are identified. Experiments have been carried out on single‐ and multi‐layer fabrics, and the accuracy of the models is demonstrated through comparison of the predicted results with the experimental data. This study is aimed towards optimisation of design of a gripper and providing knowledge for an intelligent grasping system of fabric handling.

This chapter examines whether the view of the jury in cases involving forensic evidence can be changed from that of “naïve automatons” to that of “sophisticated decision makers”; whether the defense and prosecution must provide the jurors with information to help them develop a schema upon which to evaluate the forensic evidence; and whether to remove decision making from the expert forensic scientist and return it to the jury. The chapter uses secondary sources of information collected from criminal cases, the current federal law, as interpreted by the U.S. Supreme Court dealing with expert testimony, studies of how to enable juries confronted with forensic evidence, as well as a framework of learning theory and persuasion games. I argue that expert forensic scientists make errors. Juries are capable of making decisions based on complex forensic evidence if provided the knowledge within which to develop schema to evaluate that evidence. Competition between the defense and prosecution in presenting interpretations of scientifically valid evidence, as well as providing schema to enable the jury to evaluate the information, provides juries with the ability to arrive at a full information decision. Expert nullification of jury decision making should be halted and decision making returned to the jury. The value of this chapter is to integrate learning theory from cognitive psychology with one-shot and extended persuasion games to evaluate the roles of the jury and the expert forensic scientists within the criminal justice system.

This article aims to explore how to incorporate similarity joins into XML database management systems (XDBMSs). The authors aim to provide seamless and efficient integration of similarity joins on tree-structured data into an XDBMS architecture.

The authors exploit XDBMS-specific features to efficiently generate XML tree representations for similarity matching. In particular, the authors push down a large part of the structural similarity evaluation close to the storage layer.

Empirical experiments were conducted to measure and compare accuracy, performance and scalability of the tree similarity join using different similarity functions and on the top of different storage models. The results show that the authors’ proposal delivers performance and scalability without hurting the accuracy.

Similarity join is a fundamental operation for data integration. Unfortunately, none of the XDBMS architectures proposed so far provides an efficient support for this operation. Evaluating similarity joins on XML is challenging, because it requires similarity matching on the text and structure. In this work, the authors integrate similarity joins into an XDBMS. To the best of the authors’ knowledge, this work is the first to leverage the storage scheme of an XDBMS to support XML similarity join processing.

One of the key factors for success in assembly automation at present is the ability of system integrators to deliver more reliable and customised systems within shorter periods of time. Despite the active research in the development of distributed engineering support systems, there is a clear need for practical methods and tools to support the interactions between different stakeholders at the early product and assembly system design stages. This paper reports on the development of assembly process and equipment data models using context free grammars. The models enable a web‐based decision‐making for formation of assembly workstations using distributed linguistic approach.