Search results for " computing"

A grid representation for distributed virtual environments

2004

Fast Internet connections and the widespread use of high performance graphic cards are making Distributed Virtual Environments (DVE) very common nowadays. The architecture and behavior of these systems are very similar to new grid computing applications where concepts such as sharing and high scalability are extremely exploited. However, there are several key issues in these systems that should still be improved in order to design a scalable and cost-effective DVE system. One of these key issues is the partitioning problem. This problem consists of efficiently assigning clients (3-D avatars) to the arbiters (servers) in the system. As an alternative to the ad-hoc heuristic proposed in the l…

Computation of Yvon-Villarceau circles on Dupin cyclides and construction of circular edge right triangles on tori and Dupin cyclides

2014

Ring Dupin cyclides are non-spherical algebraic surfaces of degree four that can be defined as the image by inversion of a ring torus. They are interesting in geometric modeling because: (1) they have several families of circles embedded on them: parallel, meridian, and Yvon-Villarceau circles, and (2) they are characterized by one parametric equation and two equivalent implicit ones, allowing for better flexibility and easiness of use by adopting one representation or the other, according to the best suitability for a particular application. These facts motivate the construction of circular edge triangles lying on Dupin cyclides and exhibiting the aforementioned properties. Our first contr…

Improving computation efficiency using input and architecture features for a virtual screening application

2023

Virtual screening is an early stage of the drug discovery process that selects the most promising candidates. In the urgent computing scenario it is critical to find a solution in a short time frame. In this paper, we focus on a real-world virtual screening application to evaluate out-of-kernel optimizations, that consider input and architecture features to improve the computation efficiency on GPU. Experiment results on a modern supercomputer node show that we can almost double the performance. Moreover, we implemented the optimization using SYCL and it provides a consistent benefit with the CUDA optimization. A virtual screening campaign can use this gain in performance to increase the nu…

On the systolic calculation of all-pairs interactions using transputer arrays

1991

Efficient and accurate methodology for solving multiserver retrial systems

2005

Proposed is a novel methodology for solving retrial systems which is based on the aggregation of levels of the Markov model beyond a given one. Its evaluation concludes that it is more accurate than previous approximations while requiring a low computational cost.

Datorzinātne un informācijas tehnoloģijas: Datu bāzes un informācijas sistēmas: doktorantu konsorcijs. Sestā Starptautiskā Baltijas konference Baltic…

2004

The Baltic Conference on Databases and Information Systems is a biannual international forum for technical discussion among researchers and developers of database and information systems. The objective of the conference is to bring together researchers as well as practitioners and PhD students in the field of computing research that will improve the construction of future information systems. On the other hand, the conference is giving opportunities to developers, users and researchers of advanced IS technologies to present their work and to exchange their ideas and at the same time providing a feedback to database community.

From Deep Learning to Deep University: Cognitive Development of Intelligent Systems

2018

Search is not only an instrument to find intended information. Ability to search is a basic cognitive skill helping people to explore the world. It is largely based on personal intuition and creativity. However, due to the emerged big data challenge, people require new forms of training to develop or improve this ability. Current developments within Cognitive Computing and Deep Learning enable artificial systems to learn and gain human-like cognitive abilities. This means that the skill how to search efficiently and creatively within huge data spaces becomes one of the most important ones for the cognitive systems aiming at autonomy. This skill cannot be pre-programmed, it requires learning…

Comparison of implementations of the lattice-Boltzmann method

2008

AbstractSimplicity of coding is usually an appealing feature of the lattice-Boltzmann method (LBM). Conventional implementations of LBM are often based on the two-lattice or the two-step algorithm, which however suffer from high memory consumption and poor computational performance, respectively. The aim of this work was to identify implementations of LBM that would achieve high computational performance with low memory consumption. Effects of memory addressing schemes were investigated in particular. Data layouts for velocity distribution values were also considered, and they were found to be related to computational performance. A novel bundle data layout was therefore introduced. Address…

Adaptive Service Offloading for Revenue Maximization in Mobile Edge Computing With Delay-Constraint

2019

Mobile Edge Computing (MEC) is an important and effective platform to offload the computational services of modern mobile applications, and has gained tremendous attention from various research communities. For delay and resource constrained mobile devices, the important issues include: 1) minimization of the service latency; 2) optimal revenue maximization; 3) high quality-of-service (QoS) requirement to offload the computational service offloading. To address the above issues, an adaptive service offloading scheme is designed to provide the maximum revenue and service utilization to MEC. Unlike most of the existing works, we consider both the delay-tolerant and delay-constraint services i…

Performance analysis of user-centric SBS deployment with load balancing in heterogeneous cellular networks: A Thomas cluster process approach

2020

Abstract In conventional heterogeneous cellular networks (HCNets), the locations of user equipments (UEs) and base stations (BSs) are modeled randomly using two different homogeneous Poisson point processes (PPPs). However, this might not be a suitable assumption in case of UE distribution because UE density is not uniform everywhere in HCNets. Keeping in view the existence of nonuniform UEs, the small base stations (SBSs) are assumed to be deployed in the areas with high UE density, which results in correlation between UEs and BS locations. In this paper, we analyse the performance of HCNets with nonuniform UE deployment containing a union of clustered and uniform UE sets. The clustered UE…