An L(0,1)-labelling of a graph G is an assignment of nonnegative integers to the vertices of G such that the difference between the labels assigned to any two adjacent vertices is at least zero and the difference betw...
详细信息
An L(0,1)-labelling of a graph G is an assignment of nonnegative integers to the vertices of G such that the difference between the labels assigned to any two adjacent vertices is at least zero and the difference between the labels assigned to any two vertices which are at distance two is at least one. The span of an L(0,1)-labelling is the maximum label number assigned to any vertex of G. The L(0,1)-labelling number of a graph G, denoted by λ0.1(G) is the least integer k such that G has an L(0,1)-labelling of span k. This labelling has an application to a computer code assignment problem. The task is to assign integer control codes to a network of computer stations with distance restrictions. A cactus graph is a connected graph in which every block is either an edge or a cycle. In this paper, we label the vertices of a cactus graph by L(0,1)-labelling and have shown that, △-1≤λ0.1(G)≤△ for a cactus graph, where △ is the degree of the graph G.
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 ...
详细信息
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 ...
详细信息
This paper proposes a continuous, non-invasive blood pressure monitoring system concept, which uses a safety microprocessor to connect sensors for building a body sensor network. The changes in Pulse Transit Time (PTT...
ISBN:
(纸本)9781467347358
This paper proposes a continuous, non-invasive blood pressure monitoring system concept, which uses a safety microprocessor to connect sensors for building a body sensor network. The changes in Pulse Transit Time (PTT) can be detected with the sensor network. The microprocessor gathers the PTT and other vital signs of the patient to derive changes in blood pressure. Through the new Bluetooth protocol for safety systems, the current blood pressure value can be sent to a variety of terminals present in the wireless network, such as mobile phone, PC and medical monitoring systems. The 1oo2 architecture of the used microprocessor can provide high safety to a rating of safety integrity level 3 (SIL3), thus the whole network can meet the safety required in medical care systems.
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...
详细信息
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.
An L(0,1)-labelling of a graph G is an assignment of nonnegative integers to the vertices of G such that the difference between the labels assigned to any two adjacent vertices is at least zero and the difference betw...
详细信息
An L(0,1)-labelling of a graph G is an assignment of nonnegative integers to the vertices of G such that the difference between the labels assigned to any two adjacent vertices is at least zero and the difference between the labels assigned to any two vertices which are at distance two is at least one. The span of an L(0,1)-labelling is the maximum label number assigned to any vertex of G. The L(0,1)-labelling number of a graph G, denoted by λ0.1(G) is the least integer k such that G has an L(0,1)-labelling of span k. This labelling has an application to a computer code assignment problem. The task is to assign integer control codes to a network of computer stations with distance restrictions. A cactus graph is a connected graph in which every block is either an edge or a cycle. In this paper, we label the vertices of a cactus graph by L(0,1)-labelling and have shown that, △-1≤λ0.1(G)≤△ for a cactus graph, where △ is the degree of the graph G.
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 ...
详细信息
暂无评论