Find research datasets worth reusing
Search datasets from major research repositories and use ShareScore to quickly assess how well each record supports discovery, access, and reuse.
13
datasets available to search
ShareScore release 0.9.0
Dataset results
13 results for “vrp”
Text-fig. 5. Lithocarpoxylon ashwillii sp. nov., UF 279-24544. a, b: Semi-ring porous wood, exclusively solitary vessels in a radial/ diagonal arrangement, diffuse axial parenchyma, TS. c: Homocellular rays composed of procumbent cells; vasicentric tracheids; vessel elements with simple perforation plates (PP), TLS. d: Vessel-ray parenchyma pits (VRP) with reduced borders, vertical, RLS. e: Crystalliferous axial parenchyma strand (C) with a single crystal per chamber; ray with procumbent cells, RLS. f: Aggregate ray (right) composed of loosely associated 1–2-seriate rays, TLS. g: Uniseriate rays, thin-walled tyloses in vessels, vasicentric tracheids (VT). Lithocarpoxylon sp., UF 279-84864. h, i: Semi-ring porous wood, exclusively solitary vessels in radial arrangement. j: Aggregate ray and uniseriate rays. k: Scalariform perforation plate with fewer than 10 bars. l: Vessel-ray parenchyma pits with reduced borders to simple, vertical. Scale bars: 200 µm in a, b, f, h, j; 100 µm in c, i; 50 µm in d. e; 20 µm in k, l. in A Diverse Assemblage Of Late Eocene Woods From Oregon, Western Usa
Text-fig. 5. Lithocarpoxylon ashwillii sp. nov., UF 279-24544. a, b: Semi-ring porous wood, exclusively solitary vessels in a radial/ diagonal arrangement, diffuse axial parenchyma, TS. c: Homocellular rays composed of procumbent cells; vasicentric tracheids; vessel elements with simple perforation plates (PP), TLS. d: Vessel-ray parenchyma pits (VRP) with reduced borders, vertical, RLS. e: Crystalliferous axial parenchyma strand (C) with a single crystal per chamber; ray with procumbent cells, RLS. f: Aggregate ray (right) composed of loosely associated 1–2-seriate rays, TLS. g: Uniseriate rays, thin-walled tyloses in vessels, vasicentric tracheids (VT). Lithocarpoxylon sp., UF 279-84864. h, i: Semi-ring porous wood, exclusively solitary vessels in radial arrangement. j: Aggregate ray and uniseriate rays. k: Scalariform perforation plate with fewer than 10 bars. l: Vessel-ray parenchyma pits with reduced borders to simple, vertical. Scale bars: 200 µm in a, b, f, h, j; 100 µm in c, i; 50 µm in d. e; 20 µm in k, l.
Text-fig. 2. Celtis popsii sp. nov., UF 279-34460. a: Growth ring with earlywood of multiple rows of vessels solitary and in radial multiples; latewood vessels in wavy tangential bands, TS. b: Growth ring boundary, latewood vessels in multiples with axial parenchyma confluent, TS. c: Simple perforation plates, alternate intervessel pits, polygonal in outline, TLS. d: Vessel-ray parenchyma pits to right of VRP, oval in outline, with slightly reduced borders, RLS. e: Rays tending to two sizes, some multiseriate rays with distinct sheath cells, multiseriate rays usually with 1 marginal row of square to upright cells, occasionally with 4 or more; uniseriate rays less than 10 cells high, TLS. f: Detail of multiseriate ray with distinct sheath cells, vessel element end walls, TLS. Scale bars: 200 µm in a, e; 100 µm in b; 50 µm in c, f; 20 µm in d. in A Diverse Assemblage Of Late Eocene Woods From Oregon, Western Usa
Text-fig. 2. Celtis popsii sp. nov., UF 279-34460. a: Growth ring with earlywood of multiple rows of vessels solitary and in radial multiples; latewood vessels in wavy tangential bands, TS. b: Growth ring boundary, latewood vessels in multiples with axial parenchyma confluent, TS. c: Simple perforation plates, alternate intervessel pits, polygonal in outline, TLS. d: Vessel-ray parenchyma pits to right of VRP, oval in outline, with slightly reduced borders, RLS. e: Rays tending to two sizes, some multiseriate rays with distinct sheath cells, multiseriate rays usually with 1 marginal row of square to upright cells, occasionally with 4 or more; uniseriate rays less than 10 cells high, TLS. f: Detail of multiseriate ray with distinct sheath cells, vessel element end walls, TLS. Scale bars: 200 µm in a, e; 100 µm in b; 50 µm in c, f; 20 µm in d.
BRAIN Journal-A Combination of Meta-heuristic and Heuristic Algorithms for the VRP, OVRP and VRP with Simultaneous Pickup and Delivery- Figure 4. The solution of C6 found by CEACO
<p>Furthermore, the GA has not been able to find the best solutions in thirteen of the fourteen examples. Therefore, it is the weakest algorithm among the five presented algorithms. However, SS_ACO has been able to find better solutions than the GA and has come up with the best solution in 12 examples. Among remaining five algorithms, PSO has failed in improving the solutions in 10 examples and has come up with solutions similar to the ones found by GA. From the comparison between GAPSO and CEACO, it can be seen that GAPSO in six examples has been able to find better solutions than the proposed algorithm. However, the CEACO has found better solutions than this algorithm for one example. For example, the solution of C6 is shown in Figure 4 which is the best found solution until now by other algorithms. </p>
BRAIN Journal-A Combination of Meta-heuristic and Heuristic Algorithms for the VRP, OVRP and VRP with Simultaneous Pickup and Delivery- Figure 3. The pseudo of CEACO
<p>The idea here is that a better solution may have a better chance to find a global optimum. After each iteration, if the best solution is not changed during 20 times, the algorithm finished and the best found solution is reported. Otherwise, the algorithm goes to transition rule step. Figure 3 shows the pseudo code of the proposed algorithm. </p>
BRAIN Journal-A Combination of Meta-heuristic and Heuristic Algorithms for the VRP, OVRP and VRP with Simultaneous Pickup and Delivery- Figure 1. The ACO for the TSP
<p>Ant colony optimization (ACO) is one of the most popular meta-heuristic algorithms inspired by the behavior of real ants seeking a path between their colony and a source of food. For the first time, this algorithm was used to solve the traveling salesman problem (TSP) as shown in Figure 1</p>
BRAIN Journal-A Combination of Meta-heuristic and Heuristic Algorithms for the VRP, OVRP and VRP with Simultaneous Pickup and Delivery- Figure 2. Insert (left), swap (middle) and 2-opt exchanges (right)
<p> The literature on meta-heuristics indicates that a promising approach for obtaining highquality solutions is to couple a local search algorithm with a mechanism to generate initial solutions. So, after all ants have constructed their routes and before updating global pheromone, three types of local search schemes including 2- opt scheme, insert and swap moves are performed to further reduce the routes length (Figure 2). In insert algorithm, a customer is moved to another route but in swap algorithm a customer in a certain route is swapped with another customer from a different route. One of the most commonly encountered moves is the 2-opt which starts with a feasible tour and continues by omitting two arcs of the same route, which are not adjacent and then connects them again by another method in such a way that the new tour length is shorter. In multiple routes, two edges belong to different routes, which form a criss-cross, are selected and two new edges are replaced. It also should be noted that the new solution will be only accepted in state that first, the constraints are not violated specially about each vehicle’s capacity. It can be noted that there are several routes for connecting nodes and producing the tour again, but a state that satisfies the problem’s constraints is acceptable</p>
Using the Genetic Algorithm for the Optimization of Dynamic School Bus Routing Problem-Figure 1. Example of a VRP solution
<p>VRP is widely described as the process where the distribution vehicles deliver goods in a depot to the clients found in geographically dispersed locations and then return to the depot on the optimum route. The VRP, first introduced by Dantzig and Ramser in 1959, aims to minimize the total distance to be covered during the routing of the vehicles in a centrally-located depot (Dantzig & Ramser, 1959). The routing process is operated by taking the vehicle capacities into consideration so as to ensure that each client located on the routing plan is visited only once. The depot, vehicle, and goods concepts mentioned in the general description of VRP can be re-adapted as school, student and bus stop, based on different sectors that the problem applies to. Figure 1 shows a scheme indicating the VRP solution applied to a distribution system, where the clientele network is dispersed over three different zones.</p>
A Study to Evaluate Concurrent VRP-HER2 Vaccination and Pembrolizumab for Patients With Breast Cancer
ClinicalTrials.gov study NCT03632941. IPD Sharing: NO. Countries: 1. Publications: 1.
VRP-Clinic Software Evaluation - in Support of Rehabilitation (VRP02)
ClinicalTrials.gov study NCT03104647. IPD Sharing: NO. Countries: 1. Publications: 0.
Immunotherapy With CEA(6D) VRP Vaccine (AVX701) in Patients With Stage III Colorectal Cancer
ClinicalTrials.gov study NCT01890213. IPD Sharing: Not stated. Countries: 1. Publications: 0.
Vancomycin Reduction Practices (VRP) in the NICU
ClinicalTrials.gov study NCT06772675. IPD Sharing: UNDECIDED. Countries: 1. Publications: 0.
A Phase I/II Study With CEA(6D) VRP Vaccine in Patients With Advanced or Metastatic CEA-Expressing Malignancies
ClinicalTrials.gov study NCT00529984. IPD Sharing: Not stated. Countries: 1. Publications: 0.
Comparison of mock treated L929 cells with L929 cells infected with wildtype versus nt3A mutant VRP at 5hpi
GEO Series GSE7647. Mus musculus. 6 samples. Type: Expression profiling by array.
ScienceDex guides
Understand access before you commit
These curated guides explain access requirements, typical timelines, costs, and reuse considerations for widely used research datasets.
Allen Brain Atlas
Allen Brain Atlas is an Allen Institute collection of brain map atlases, datasets, APIs, and analysis tools covering mouse, human, and non-human primate brain resources.
Annotated Behaviour and Observability Dataset (ABODe)
ABODe is a University of Edinburgh DataShare dataset for behavior classification in group-housed mice using home-cage video, identities, bounding boxes, ground-plate positions, and annotator labels.
DANDI Archive for NWB datasets
DANDI is a BRAIN Initiative archive for publishing and sharing neurophysiology data, including electrophysiology, optophysiology, and behavioral data packaged as NWB and related standards.
International Brain Laboratory public data
The International Brain Laboratory public data releases expose standardized mouse decision-making experiments, including Neuropixels recordings, widefield calcium imaging, behavior, and session metadata accessed through the ONE API.
OpenNeuro
OpenNeuro is a free, open platform for sharing neuroimaging datasets, with public search, dataset pages, and download paths for web, S3, DataLad, and the OpenNeuro CLI.