Heuristic classification for automated CAPP

In order to create a process plan from a workpiece description, a human expert thinks in a special terminology with respect to the given workpiece. The steps of human thinking during the generation process of a process plan are following the principles of heuristic classification: First using feature recognition an abstraction process isrealized yielding a high level (qualitative) description of the current workpiece in terms of features. To these features certain (more or less) abstract (partial) process plans--the so-called skeletal plans--are associated. In the refinement step these skeletal plans are merged together to one complete process plan. In this paper we present a set of domain-oriented higher level representation formalisms for features and skeletal plans suitable for the modeling of this approach. When an expert\u27s (process planner\u27s) knowledge has been represented using these formalisms, the generation of a process plan can be achieved by heuristic classification. This is demonstrated in the CAPP-system PIM, which is currently implemented as a prototype

Integrated testing and verification system for research flight software design document

The NASA Langley Research Center is developing the MUST (Multipurpose User-oriented Software Technology) program to cut the cost of producing research flight software through a system of software support tools. The HAL/S language is the primary subject of the design. Boeing Computer Services Company (BCS) has designed an integrated verification and testing capability as part of MUST. Documentation, verification and test options are provided with special attention on real time, multiprocessing issues. The needs of the entire software production cycle have been considered, with effective management and reduced lifecycle costs as foremost goals. Capabilities have been included in the design for static detection of data flow anomalies involving communicating concurrent processes. Some types of ill formed process synchronization and deadlock also are detected statically

Measuring Complexity and Stability of Web Programs�

Software maintenance engineers spend at least half of their time trying to understand the system they are to modify. This is due partially to the fact that often the only documentation available is the source code itself. The literate programming paradigm provides the incentive and the capability to produce high quality documentation and code simultaneously. The goal is to create "works of literature" which have all the extras (table of contents, cross references, and indices) to help readers to comprehend the programs quickly and thoroughly. The purpose of this thesis is to explore the similarities and differences in measurements of complexity and stability of literate programs compared to those of traditionally developed code.Computer Scienc

Intrusion Detection System based on time related features and Machine Learning

The analysis of the behavior of network communications over time allows the extraction of statistical features capable of characterizing the network traffic flows. These features can be used to create an Intrusion Detection System (IDS) that can automatically classify network traffic. But introducing an IDS into a network changes the latency of its communications. From a different viewpoint it is possible to analyze the latencies of a network to try to identifying the presence or absence of the IDS. The proposed method can be used to extract a set of phisical or time related features that characterize the communication behavior of an Internet of Things (IoT) infrastructure. For example the number of packets sent every 5 minutes. Then these features can help identify anomalies or cyber attacks. For example a jamming of the radio channel. This method does not necessarily take into account the content of the network packet and therefore can also be used on encrypted connections where is impossible to carry out a Deep Packet Inspection (DPI) analysis

Back End Development and Unit Test Case Generation for Collaborative Invention Mining

Software testing plays a very important role in the development process because it is an essential mean of providing reliability and quality to any software. Designing and execution of test cases consumes lot of time since it requires planning and resources manually. To overcome this it is highly required to automate the generation of test cases. UML, is a standard modeling language which supports object oriented technology. It is generally used to depict the analysis and design specification of software development. UML models are an essential and a rich source of information for test case design. In this thesis, we present a testing methodology which is used to generate the unit test cases from UML state chart diagram for an industrial application. Firstly, we discussed about the CIM, an industrial application which is used for transforming an Idea through a collaborative interaction into such a state so that the idea becomes patentable. This application provides a platform to the people in industry to encourage and enhance their invention skills for an enterprise. Next we proposed a testing approach to generate unit test cases for the phases of CIM application using UML state chart diagram. UML model provides a lot of information which can be used for testing. In our approach, firstly the state chart diagram is constructed for CIM application. Then the adjacency matrix is generated and subsequently transform the state chart diagram into a UML state chart graph. Then we traverse the graph using adjacency matrix by using DFS. Therefore test sequences are generated. Then we apply the node coverage minimization technique to generate the test cases so that maximum coverage is achieved