bonndata (Rheinische Friedrich-Wilhelms-Universität Bonn)
Not a member yet
194 research outputs found
Sort by
single crystal X-ray structure data files from the dissertation "Synthesis and characterization of new thiophosphates with chromium and vanadium"
No full textEinkristallröntgenstrukturanalysedaten aus der Disstertation "Synthese und Charakterisierung neuer Thiophosphate mit Chrom und Vanadium" im cif-Format.
Es handelt sich um Thiophosphatverbindungen, die als kristalline Produkte aus Festkörpersynthesen entstanden sind.
Single crystal X-ray structure analysis data from the dissertation "Synthesis and characterization of new thiophosphates with chromium and vanadium" in cif format.
These are thiophosphate compounds that were formed as crystalline products from solid-state syntheses
Geometry file with optimized molecular structures from the dissertation 'Development of New Methods for Catalysis with Titanocene Complexes'
No full textGeometriedatei im XYZ-Format der optimierten Molekülstrukturen, die in der Dissertation mit dem Titel "Entwicklung neuer Methoden für die Katalyse mit Titanocenkomplexen" abgebildet sind oder für weitere Auswertungen verwendet wurden.
Bei den Molekülstrukturen handelt es sich um Titanocenkomplexe, Co-Katalysatorspezies, Additive, supramolekulare Komplexe, Edukte, Intermediate, Übergangszustände, Produkte und Reagenzien.Geometry file in XYZ format with the optimized molecular structures depicted or used for analysis in the dissertation titled 'Development of New Methods for Catalysis with Titanocene Complexes'.
These molecular structures are titanocenes, co-catalyst species, additives, supramolecular complexes, substrates, intermediates transition states, products and reagents
Simulation for quasi-geodesic in ASEP and speed changed ASEP
No full textThis repository contains the code to simulate ASEP and ASEPsc. Apart from the particle's position, it can also be used to simulate the endpoint of quasi-geodesic in both processes. A data set containing the results of one million trials is also provided
Replication Data of the dissertation "Kondo Collapse and Revival by Pulsed Light"
No full textThis repository contains all the necessary scripts and data to reproduce the plots of the PhD dissertation titled "Kondo Collapse and Revival by Pulsed Light"
Triangular Grid Instances for the Euclidean Steiner Tree Problem
No full textThis data set contains triangular nxk arrays with 2<=n, k<=10 using the TSPLIB-format.
The instances where generated as part of the master's thesis of Daphne Rohrssen
written 2022 under the supervision of Stefan Hougardy at the University of Bonn.
Some of these instances are very hard to solve exactly for GeoSteiner 5.1. For example the 4x9 instance with 36 vertices needs more than 10 days of CPU time. SCIP-JACK 2.1 solves this instance within 20 minutes. However, one should be aware of the fact that both codes have numerical problems and cannot guarantee optimality of the solutions. With SCIP-JACK this seems to happen more often than with GeoSteiner
Minimum Mean Cycle Instances
No full textThis data set contains some large real-world instances of the minimum mean cycle problem.
They are reported as the bonn01 to bonn09 instances in the paper:
Georgiadis, L., Goldberg, A. V., Tarjan, R. E., & Werneck, R. F.
"An experimental study of minimum mean cycle algorithms",
in 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 1–13,
SIAM.
The instances arise in clock skew scheduling in chip design, e.g. see
Held, S., Korte, B., Rautenbach, D. and Vygen, J.
"Combinatorial optimization in VLSI design. Combinatorial Optimization",
in Combinatorial Optimization, NATO Science for Peace and Security Series - D: Information and Communication Security, pp. 33–96, 2011.
The clock skew scheduling problem in chip design is, given a directed graph G with edge delays d:E(G)-> R,
find a minimum cycle time T and arrival times (a schedule) a: V(G) -> R such that
a(v) + d(v,w) <= a(w) + T for all (v,w) in E(G).
G is called a latch graph. The nodes represent latches and registers, and the edges represent the longest signal paths between registers.
The problem of minimizing T is equivalent to maximizing the worst slack min{s(v,w) := a(w) + T - a(v) - d(v,w) | (v,w) in E(G)} for a fixed cycle time T.
The instances provided in the tar file below consist of directed graphs with edge costs c(v,w) = T - d(v,w),
i.e. edge slacks w.r.t. a zero-skew schedule where a = 0.
The maximum achievable worst slack by varying the schedule 'a' equals the value of a minimum mean cycle in (G,c).
Instance sizes range from 70346 nodes and 898220 edges to 1065274 nodes and 104340248 edges.
Other instances are very dense, e.g. 5361 nodes and 4169878 edges.
Note that the instances may not be strongly connected or even connected.
Format: Ignore empty lines and lines starting with '#', then:
1st line: number_of_nodes number_of_edges
next lines: from_node to_node edge_cost (i.e., zero skew slack
Tanzania Cashewnuts Contract Farming 2022
No full textUnit of analysis: small holder farmers households
TeX source code of the dissertation "Kondo Collapse and Revival by Pulsed Light"
No full textThe LaTeX source code for the PhD dissertation titled "Kondo Collapse and Revival by Pulsed Light". It provides all the necessary files and scripts to compile the complete document
Raw data from the dissertation “Characterization of the mitochondrial stress sensor Pink1 during mitophagy”
No full textAppendix to the dissertation: Characterization of the mitochondrial stress sensor Pink1 during mitophagy. Appendix shows raw data of chapter 5.5 "Identification of Pink1 interactors by SILAC immunoprecipitation" which were used for analysi
Replication data for "Analyzing the Potency of Pretrained Transformer Models for Automated Program Repair"
No full textThis repository contains replication data for the paper "Analyzing the Potency of Pretrained Transformer Models for Automated Program Repair".
The dataset contains commits that indicate a bug fix from 200 repositories on Github.
Scripts for fetching data associated with the commits are available (see Github repository linked under "Related Material").
File descriptions:
repositories.csv: List of repository names with metadata
commits.csv: List of commit identifiers of the 200 repositories with most bug fixing commits
commits_high_watch_count.csv: List of commit identifiers of the 200 repositories with most bug fixing commits with a watch count of at least 50
Icon licensed under CC-BY by xinh.studi