Simultaneous Localization and Mapping (SLAM) algorithms with multiple autonomous robots have received considerable attention in recent years. In general, SLAM algorithms use odometry information and measurements from ...
详细信息
In this paper, we define some results on generalized interval-valued intuitionistic fuzzy sets (GIVIFSs). In fact, all interval-valued intuitionistic fuzzy sets (IVIFSs) are GIVIFSs but all GIVIFSs are not IVIFSs. We ...
详细信息
For drawing electrical wiring diagram of buildings, mostly two dimensional CAD programs are used. Drawing is done starting from the source (utility pole) to main power panel and then it is distributed towards to subpa...
详细信息
For drawing electrical wiring diagram of buildings, mostly two dimensional CAD programs are used. Drawing is done starting from the source (utility pole) to main power panel and then it is distributed towards to subpanels. Then, end points such as sockets, lighting armature, etc are defined. In this study several algorithms are developed in order to evaluate different part of drawing project. Tree structure of drawing is analyzed and all materials to be used are decided based on an algorithm. Apart from these, some of the supplies to be used in project but not shown in the drawings are also be chosen with certain criteria. These decision systems will result in efficiency of overall cost of the project. In wire drawing one of the most important point is the line drawing with reference to an object. Apart from light outlet all wires are referenced to walls. Furthermore, all supplies shown in drawings are allocated with reference to walls and with an angle to walls. In wiring diagram drawings, standard CAD programs have no ability for wire drawing with reference to walls. Besides that, suggestion and selection of the most appropriate supplies is not possible. These increase drawing time and result in very high cost calculation errors. These algorithms provide fast and correct implementation. By analyzing drawings in a tree structure on which users have minimal impact, and with automatic selection of supplies all type of calculation mistakes are minimized.
In large projects parallelization of existing programs or refactoring of source code is time consuming as well as error-prone and would benefit from tool support. However, existing automatic transformation systems are...
详细信息
In large projects parallelization of existing programs or refactoring of source code is time consuming as well as error-prone and would benefit from tool support. However, existing automatic transformation systems are not extensively used because they either require tedious definitions of source code transformations or they lack general adaptability. In our approach, a programmer changes code inside a project, resulting in before and after source code versions. The difference (the generated transformation) is stored in a database. When presented with some arbitrary code, our tool mines the database to determine which of the generalized transformations possibly apply. Our system is different from a pure compiler based (semantics preserving) approach as we only suggest code modifications. Our contribution is a set of generalizing annotations that we have found by analyzing recurring patterns in open source projects. We show the usability of our system and the annotations by finding matches and applying generated transformations in real-world applications.
Wait states in parallel applications can be identified by scanning event traces for characteristic patterns. In our earlier work we defined such inefficiency patterns for MPI-2 one-sided communication, although still ...
详细信息
This paper presents a new method by which it is possible to realistically predict the software reliability of critical systems. The main feature of this method is that it allows estimating the number of remaining crit...
详细信息
This paper presents a new method by which it is possible to realistically predict the software reliability of critical systems. The main feature of this method is that it allows estimating the number of remaining critical faults in the software. The algorithm employs well-known methods such as Imperfect Debugging and it provides a more reliable prognosis than the methods conventionally used for this purpose. Furthermore, the new approach describes two processes of handling critical failures (one for detection and one for correction). The new algorithm also takes into account the socalled repair time, a measurement that is vitally important for a reliable prognosis. For use in the prediction model, it is mathematically described as a time function. As every programmer knows, it can be difficult to have even the simplest program run without faults. So-called software reliability models (SRM's), based on stochastic and aiming to predict the reliability of both software and hardware, have been used since the 70's. SRM's rely on certain model assumptions some of which cannot be deemed realistic anymore. Hence, for today's reliability engineering, these models are insufficient. At this point in time, though, there are hardly any methods that enable us to obtain predictions as to how the reliability of critical faults or the failure rate of critical systems behave over time. Currently, there is no mathematical model distinguishing between critical and non-critical faults, and only few models consider Imperfect Debugging (ID). The method presented here, however, is based on ID and it is able to distinguish between critical and non-critical software faults. Moreover, this new method employs a so-called Time-Delay and thus two new processes have to be designed. Mathematically, these processes describe the detection of faults and their correction, respectively. It is necessary to define appropriate distribution functions and to clearly state the requisite model assumptions.
Liver is a vital organ of a body that has numerous functions. Severe malfunctioning of these functions causes a liver necrosis. The diagnosis of this necrosis is performed by a specialist who uses appropriate microsco...
详细信息
Abstract Modelica models often contain functions with algorithmic code. The fraction of algorithmic code is increasing since Modelica, in addition to equation-based modeling, is also used for embedded system control c...
详细信息
Abstract Modelica models often contain functions with algorithmic code. The fraction of algorithmic code is increasing since Modelica, in addition to equation-based modeling, is also used for embedded system control code and symbolic model transformations in compilers using the MetaModelica language extension. Thus, debugging of algorithmic Modelica code is becoming increasingly relevant. Our earlier work in debuggers for the algorithmic subset of Modelica used trace-based techniques which are very portable but turned out to have too much overhead for very large applications. The new debugger is the first Modelica debugger that can operate without trace information. Instead it communicates with a low-level C-language symbolic debugger, the Gnu debugger GDB, to directly extract information from a running executable, set and remove breakpoints, etc. This is made possible by the new bootstrapped OpenModelica compiler which keeps track of a detailed mapping from the high level Modelica code down to the generated C code compiled to machine code. The debugger is operational, supports browsing of both standard Modelica data structures and tree/list data structures, and operates efficiently on large applications such as the OpenModelica compiler with more than 100 000 lines of code.
Networking Technology, undoubtedly, plays a vital role in modern warfare especially in Network Centric Operations (NCOs) and Global Information Grid (GIG) concept. However, the current popular network infrastructure, ...
详细信息
Networking Technology, undoubtedly, plays a vital role in modern warfare especially in Network Centric Operations (NCOs) and Global Information Grid (GIG) concept. However, the current popular network infrastructure, mainly TCP/IP architecture, is in fact unsuitable with advanced military communication especially in tactical operation networks. The key characteristics of military communications are classified as delay/disruption/disconnection tolerant networks (DTNs) which are long and variable delays, high error rates and greatly heterogeneous. As a result a call for new type of network architecture emerges to support such peculiar characteristics of military communication network. This paper reviews the current approaches in network technology of military communication and proposes the conceptual design of Virtualization Network (VN) for military communication to address the limitation of current network infrastructure. The implementation of Military Network Virtualization Environment (MVNE) introduces the crucial two new key features of military tactical network: information classification and movable nodes. These features along with essential research challenges must be analyzed to realize a viable virtualization network for military communications.
暂无评论