Search results for " assignment"
showing 10 items of 65 documents
Frequency Assignment and Multicoloring Powers of Square and Triangular Meshes
2005
The static frequency assignment problem on cellular networks can be abstracted as a multicoloring problem on a weighted graph, where each vertex of the graph is a base station in the network, and the weight associated with each vertex represents the number of calls to be served at the vertex. The edges of the graph model interference constraints for frequencies assigned to neighboring stations. In this paper, we first propose an algorithm to multicolor any weighted planar graph with at most $\frac{11}{4}W$ colors, where W denotes the weighted clique number. Next, we present a polynomial time approximation algorithm which garantees at most 2W colors for multicoloring a power square mesh. Fur…
Therapeutenbegleitete und patientengeleitete Exposition bei Panikstörung mit Agoraphobie
2016
Zusammenfassung. Theoretischer Hintergrund: Die Exposition gilt als hoch wirksames Therapieelement in der Behandlung der Panikstörung mit Agoraphobie. Es ist jedoch weitgehend unklar, wie häufig und mit welchen Effekten verschiedene Modalitäten der Exposition (therapeutenbegleitet vs. patientengeleitet) in der Routineversorgung durchgeführt werden. Fragestellung: Es sollen Häufigkeit und Wirksamkeit der verschiedenen Durchführungsmodalitäten von Exposition in der Routinebehandlung der Panikstörung mit Agoraphobie untersucht werden. Methode: Bei N = 93 konsekutiven Patienten einer Hochschulambulanz mit der Hauptdiagnose Panikstörung mit Agoraphobie wurden Prä-Post-Veränderungen der Angstsym…
Recent results on mesonic weak decay of Λ-hypernuclei
2010
The FINUDA experiment has performed a systematic study of mesonic weak decay of p-shell Λ-hypernuclei. Recent results on the mesonic decay spectra and ratios are illustrated and discussed.
Dispersion from C
2019
Resonance assignment of intrinsically disordered proteins is remarkably challenging due to scant chemical shift dispersion arising from conformational heterogeneity. The challenge is even greater if repeating segments are present in the amino acid sequence. To forward unambiguous resonance assignment of intrinsically disordered proteins, we present iHACANCO, HACACON and (HACA)CONCAHA, three Hα-detected 4D experiments with Cα as an additional dimension. In addition, we present (HACA)CON(CA)NH and (HACA)N(CA)CONH, new 4D Hα-start, HN-detect experiments which have two NH dimensions to enhance peak dispersion in a sequential walk through C′, NH and HN, and provide more accurate NH/HN chemical s…
XTDS and SPVIEW: Graphical tools for the analysis and simulation of high-resolution molecular spectra
2008
International audience; XTDS is a Java front-end to the different programs implementing the tensorial formalism developed in the Dijon group [see for instance: V. Boudon, J.-P. Champion, T. Gabard, M. Loëte, F. Michelot, G. Pierre, M. Rotger, Ch. Wenger, M. Rey, J. Mol. Spectrosc. 228 (2004) 620–634 ]. It allows the simulation and analysis of polyad systems for molecules of various symmetries (Td and Oh spherical tops like CH4 and SF6, C2v and C4v quasi-spherical tops like SO2F2 and SF5Cl, D2h molecules like C2H4). SPVIEW is a multiplatform Java application that allows graphical assignment of high-resolution molecular spectra. It is possible to load, display and manipulate experimental and …
Population structure in Atlantic cod in the eastern North Sea-Skagerrak-Kattegat: early life stage dispersal and adult migration.
2015
Background In marine fish species, where pelagic egg and larvae drift with ocean currents, population structure has been suggested to be maintained by larval retention due to hydrographic structuring and by homing of adult fish to natal areas. Whilst natal homing of adults has been demonstrated for anadromous and coral reef fishes, there are few documented examples of philopatric migration in temperate marine fish species. Results Here, we demonstrate temporally stable genetic differentiation among spawning populations of Atlantic cod (Gadus morhua L.), and present genetic and behavioural evidence for larval drift and philopatric migration in the eastern North Sea-Skagerrak-Kattegat area. W…
The minimal cost maximum matching of a graph (supplementary remarks)
1971
In addition to the preceding paper, it will be shown that (1) the matching problem is closely related to the linear assignment problem and how (2) this property can be taken advantage of for solving the matching problem.
17β-Hydroxysteroid dehydrogenase-3 deficiency: From pregnancy to adolescence
2009
OBJECTIVE: Aim of this study is to report on basal clinical phenotype and follow up after diagnosis, of patients with 17beta-hydroxysteroid-dehydrogenase type 3 (17beta-HSD3) deficiency in Italy. SETTING: Pediatric Endocrine Departments, University Hospitals. PATIENTS: The cases of 5 Italian subjects affected by 17beta-HSD3 deficiency are presented in this study. INTERVENTIONS: Laboratory and genetic assessment. Gonadectomy and female sex assignment (4 patients) or GnRH analog therapy to regress puberty and gender identity disorder (1 patient). RESULTS: Presentation lasted from pregnancy (pre-natal diagnosis of a 46,XY fetus with female external genitalia) to infancy (inguinal hernia contai…
A genetic algorithm for the minimum generating set problem
2016
Graphical abstractDisplay Omitted HighlightsWe propose a novel formulation for the MGS problem based on multiple knapsack.The so-conceived MGS problem is solved by a novel GA.The GA embeds an intelligent construction method and specialized crossover operators.We perform a thorough comparison with regards to state-of-the-art algorithms.The proposal proves to be very competitive, specially for large and hard instances. Given a set of positive integers S, the minimum generating set problem consists in finding a set of positive integers T with a minimum cardinality such that every element of S can be expressed as the sum of a subset of elements in T. It constitutes a natural problem in combinat…
A fast heuristic for solving the D1EC coloring problem
2010
In this paper we propose an efficient heuristic for solving the Distance-1 Edge Coloring problem (D1EC) for the on-the-fly assignment of orthogonal wireless channels in wireless as soon as a topology change occurs. The coloring algorithm exploits the simulated annealing paradigm, i.e., a generalization of Monte Carlo methods for solving combinatorial problems. We show that the simulated annealing-based coloring converges fast to a sub optimal coloring scheme even for the case of dynamic channel allocation. However, a stateful implementation of the D1EC scheme is needed in order to speed-up the network coloring upon topology changes. In fact, a stateful D1EC reduces the algorithm’s convergen…