Search results for "Computer and Information Science"
showing 10 items of 1335 documents
Identifying potential areas of expansion for the endangered brown bear (Ursus arctos) population in the cantabrian mountains (NW Spain)
2019
Many large carnivore populations are expanding into human-modified landscapes and the subsequent increase in coexistence between humans and large carnivores may intensify various types of conflicts. A proactive management approach is critical to successful mitigation of such conflicts. The Cantabrian Mountains in Northern Spain are home to the last remaining native brown bear (Ursus arctos) population of the Iberian Peninsula, which is also amongst the most severely threatened European populations, with an important core group residing in the province of Asturias. There are indications that this small population is demographically expanding its range. The identification of the potential are…
Large Spatial Scale of the Phenotype-Environment Color Matching in Two Cryptic Species of African Desert Jerboas (Dipodidae: Jaculus)
2014
We tested the camouflage hypothesis, or the linkage between animal (Saharan rodent) and habitat coloration, on the largest geographical scale yet conducted. We aimed to determine whether phenotypic variation is explained by micro-habitat variation and/or genetic polymorphism to determine 1) the strength of linkage between fur color and local substrate color, and 2) the divergence in fur coloration between two genetic clades, representing cryptic species, throughout the complete range of the African desert jerboas (Jaculus jaculus). We used a combination of museum and field-collected specimens, remote sensing tools, satellite and digital photography and molecular genetic and phylogenetic met…
Hierarchical log Gaussian Cox process for regeneration in uneven-aged forests
2021
We propose a hierarchical log Gaussian Cox process (LGCP) for point patterns, where a set of points x affects another set of points y but not vice versa. We use the model to investigate the effect of large trees to the locations of seedlings. In the model, every point in x has a parametric influence kernel or signal, which together form an influence field. Conditionally on the parameters, the influence field acts as a spatial covariate in the intensity of the model, and the intensity itself is a non-linear function of the parameters. Points outside the observation window may affect the influence field inside the window. We propose an edge correction to account for this missing data. The par…
WarpDrive: Massively Parallel Hashing on Multi-GPU Nodes
2018
Hash maps are among the most versatile data structures in computer science because of their compact data layout and expected constant time complexity for insertion and querying. However, associated memory access patterns during the probing phase are highly irregular resulting in strongly memory-bound implementations. Massively parallel accelerators such as CUDA-enabled GPUs may overcome this limitation by virtue of their fast video memory featuring almost one TB/s bandwidth in comparison to main memory modules of state-of-the-art CPUs with less than 100 GB/s. Unfortunately, the size of hash maps supported by existing single-GPU hashing implementations is restricted by the limited amount of …
An Ontology to Support Semantic Management of FMEA Knowledge
2016
<p>Risk mitigation has always been a special concern for organization’s strategic management. Various tools and techniques have been developed to manage risk in an effective way. Failure Mode and Effects Analysis (FMEA) is one of the tools used for effective assessment of risk. It analyzes all potential failure modes, their causes, and effects on a product or process. Moreover it recommends actions to mitigate failures in order to enhance product reliability. Organizations spend their resources and domain experts make their efforts to complete this analysis. It further helps organizations identify the expected risks and plan strategies in advance to tackle them. But unfortunately the …
A Hierarchical Learning Scheme for Solving the Stochastic Point Location Problem
2012
Published version of a chapter in the book: Advanced Research in Applied Artificial Intelligence. Also available from the publisher at: http://dx.doi.org/10.1007/978-3-642-31087-4_78 This paper deals with the Stochastic-Point Location (SPL) problem. It presents a solution which is novel in both philosophy and strategy to all the reported related learning algorithms. The SPL problem concerns the task of a Learning Mechanism attempting to locate a point on a line. The mechanism interacts with a random environment which essentially informs it, possibly erroneously, if the unknown parameter is on the left or the right of a given point which also is the current guess. The first pioneering work […
Exploring Virtual Reality as an Integrated Development Environment for Cyber-Physical Systems
2019
Cyber Physical Systems (CPS) development approaches tend to start from the physical (hardware) perspective, and the software is the final element in the process. However, this approach is unfit for the more software-intensive world that is increasingly iterative, connected, and constantly online. Many constraints prevent the application of iterative, incremental, and agile development methodologies, which now are the norm for many other fields of software. Time-consuming system validation can only start when both hardware and software components are ready, which implies that the software delivery and quality is almost always the final bottleneck in the CPS development and integration. Also …
The minimum mean cycle-canceling algorithm for linear programs
2022
Abstract This paper presents the properties of the minimum mean cycle-canceling algorithm for solving linear programming models. Originally designed for solving network flow problems for which it runs in strongly polynomial time, most of its properties are preserved. This is at the price of adapting the fundamental decomposition theorem of a network flow solution together with various definitions: that of a cycle and the way to calculate its cost, the residual problem, and the improvement factor at the end of a phase. We also use the primal and dual necessary and sufficient optimality conditions stated on the residual problem for establishing the pricing step giving its name to the algorith…
Gray code for derangements
2004
AbstractWe give a Gray code and constant average time generating algorithm for derangements, i.e., permutations with no fixed points. In our Gray code, each derangement is transformed into its successor either via one or two transpositions or a rotation of three elements. We generalize these results to permutations with number of fixed points bounded between two constants.
Combined column-and-row-generation for the optimal communication spanning tree problem
2018
Abstract This paper considers the exact solution of the optimal communication spanning tree problem (OCSTP), which can be described as follows: Given an undirected graph with transportation costs on every edge and communication requirements for all pairs of vertices, the OCSTP seeks for a spanning tree that minimizes the sum of the communication costs between all pairs of vertices, where the communication cost of a pair of vertices is defined as their communication requirement multiplied by the transportation cost of the unique tree path that connects the two vertices. Two types of compact formulations for OCSTP were presented in the literature. The first one is a four-index model based on …