Search results for "assignment"
showing 10 items of 101 documents
Linear and cyclic radio k-labelings of trees
2007
International audience; Motivated by problems in radio channel assignments, we consider radio k-labelings of graphs. For a connected graph G and an integer k ≥ 1, a linear radio k-labeling of G is an assignment f of nonnegative integers to the vertices of G such that |f(x)−f(y)| ≥ k+1−dG(x,y), for any two distinct vertices x and y, where dG(x,y) is the distance between x and y in G. A cyclic k-labeling of G is defined analogously by using the cyclic metric on the labels. In both cases, we are interested in minimizing the span of the labeling. The linear (cyclic, respectively) radio k-labeling number of G is the minimum span of a linear (cyclic, respectively) radio k-labeling of G. In this p…
Approximate Algorithm for Fast Capacity Provisioning in WANs with Trade-Off between Performance and Cost under Budget Constraint
2014
Due to the emergence of Software Defined Networking (SDN) with the idea of centralized control over computer networks, the Capacity and Flow Assignment Problem (CFA) may be approached in a classical non-distributed fashion in real-life scenarios. The question arises whether a heuristical approach to this NP-complete problem is of any use in practice.
Complete 1H and 13C NMR assignments of clerodane diterpenoids of Salvia splendens.
2006
Unambiguous and complete assignments of 1H and 13C NMR chemical shifts for five clerodane diterpenes, four of them isolated from Salvia splendens (salviarin, splendidin and splenolides A and B) and one obtained by acetylation of splenolide A, are presented. The assignments are based on 2D shift-correlated [1H,1H–COSY, 1H,13C-gHSQC–1J(C,H) and 1H,13C-gHMBC-nJ(C,H) (n = 2 and 3)] and nuclear Overhauser effect (NOE) experiments. The conformation of the rings of these compounds is supported by the 3J(H,H) values and NOE results. Copyright © 2006 John Wiley & Sons, Ltd.
Usage assignment of the residence in the cases of familiar crises: commentary on the article 6 Valencian Law of familiar relations
2015
En este trabajo se analiza la regulación valenciana respecto a la atribución del uso de la vivienda familiar, tomando en consideración las sentencias dictadas en aplicación del art. 6 de la Ley de relaciones familiares. In this paper we study the Valencian regulation with regard to the assignment of the usage of the familiar residence, taking in consideration the judgments dictated in application of the article 6 law of familiar relations.
Multilevel Bandwidth and Radio Labelings of Graphs
2008
This paper introduces a generalization of the graph bandwidth parameter: for a graph G and an integer k ≤ diam(G), the k-level bandwidth Bk(G)of G is defined by Bk(G) = minγ max{|γ(x)-γ(y)|-d(x, y)+1 : x, y ∈ V (G), d(x, y) ≤ k}, the minimum being taken among all proper numberings γ of the vertices of G. We present general bounds on Bk(G) along with more specific results for k = 2 and the exact value for k = diam(G). We also exhibit relations between the k-level bandwidth and radio k-labelings of graphs from which we derive a upper bound for the radio number of an arbitrary graph.
Optical Routing of Uniform Instances in Cayley Graphs
2001
Abstract Abstract We consider the problem of routing uniform communication instances in Cayley graphs. Such instances consist of all pairs of nodes whose distance is included in a specified set U. We give bounds on the load induced by these instances on the links and for the wavelength assignment problem as well. For some classes of Cayley graphs that have special symmetry property (rotational graphs), we are able to construct routings for uniform instances such that the load is the same for each link of the graph.
A Restricted-Weakly Connected Dominating Set for Role Assignment in a Multichannel MAC for Wireless Mesh Network
2009
International audience; We propose an efficient way of constructing the wireless mesh structure associated with Molecular MAC, a multichannel access method designed for efficient packet forwarding. We base our role assignment on a restricted Weakly Connected Dominating Set structure. After presenting a formal definition of the role assignment problem, we prove its NP-completeness. Then, we propose a centralized 2-approximation algorithm that maximizes the sum of radio link capacities in the molecular structure. Finally, we extend this protocol so that it can operate in a distributed way still providing the same guarantee. This distributed protocol is self-stabilizing thus robust to topology…
Students’ Redesign of Mandatory Assignments in Teacher Education
2017
This article explores specific aspects of literacy practices in teacher education in Norway, building upon data collected within the research project Digital literacy and use of learning resources in teacher education in Norway (DigiGLU). Our main aim is to explore how teachers in different subject courses in teacher education (TE) design mandatory assignments, and how students respond to these designs. After the extensive TE-reform in 2010, in revised plans and documents guiding professional training, mandatory assignments (both form and content) were considered more important for the students’ learning process. In our investigation, the concepts of design for learning and design in learni…
Exact and Approximate Algorithms for Two–Criteria Topological Design Problem of WAN with Budget and Delay Constraints
2004
This paper studies the problem of designing wide area networks (WAN). In the paper the two-criteria topology assignment problem with two constraints is considered. The goal is select flow routes, channel capacities and network topology in order to minimize the total average delay per packet and the leasing cost of channels subject to the budget constraint and delay constraint. The problem is NP-complete. Then, the branch and bound method is used to construct the exact algorithm. Also the approximate algorithm is presented. Some computational results are reported. Based on computational experiments, several properties of the considered problem are formulated.
Argumentation graphs with constraint-based reasoning for collaborative expertise
2018
International audience; Collaborative processes are very important in telemedicine domain since they allow for making right decisions in complex situations with multidisciplinary staff. When modelling these collaborative processes, some inconsistencies can appear. In semantic modelling (conceptual graphs), these inconsistencies are verified using constraints. In this work, collaborative processes are represented using an argumentation system modelled in a conceptual graph formalism where inconsistencies could be particular bad attack relation between arguments. To overcome these inconsistencies, two solutions are proposed. The first one is to weight the arguments evolving in the argumentati…