Recommender systems apply statistical and knowledge discovery techniques to the problem of making recommendations during live user interaction. This paper describes a novel approach of building recommender systems for...
详细信息
Recommender systems apply statistical and knowledge discovery techniques to the problem of making recommendations during live user interaction. This paper describes a novel approach of building recommender systems for the Web with the aid of usergenerated content. Recently certain communities of Internet users have engaged in creating high quality peer reviewed content for the Web. In our approach we are planning to extract the semantics of such user-generated content and to use these semantics to make more useful recommendations.
Different modelling techniques intended to deal with complexity of modern IMA systems are widely used now. Models can be used to help developers to lay out relevant information structurally. They can also be used to p...
详细信息
Attack surface is the set of code and data that can be changed, stolen, or exploited by the user of the system. Attack surface of the complex systems may consist of functions on different programming languages and dat...
详细信息
The article describes the method for constructing sequences of user actions that are optimized for manual execution, based on the model in the form of a diagram of states and transitions. Scenarios for such implementa...
详细信息
Real world data is not stationary and thus models must be monitored in production. One way to be sure in a model’s performance is regular testing. If the labels are not available, the task of minimizing the labeling ...
Contemporary commodity operating systems are too big and do not inspire trust in their security and reliability. Still they are used for processing sensitive data due to the vast amount of legacy software and good sup...
详细信息
ISBN:
(纸本)9781605584737
Contemporary commodity operating systems are too big and do not inspire trust in their security and reliability. Still they are used for processing sensitive data due to the vast amount of legacy software and good support for virtually all hardware devices. Common approaches used to ensure sensitive data protection are either too strict or not reliable. In this article we propose virtualization-based approach for preventing sensitive data leaks from a computer running untrusted commodity OS without sacrificing public network connectivity, computer usability and performance. It is based on separating privileges between two virtual machines: public VM that has unlimited network access and private (isolated) VM that is used for processing sensitive data. Virtual machine monitor uses public VM to provide transparent access to Internet for selected trusted applications running inside the private VM on a system call level. Proposed security architecture allows using one and the same untrusted OS on both virtual machines without necessity to encrypt sensitive data. However it poses a challenge of enforcing dynamic protection over the trusted applications running in the potentially compromised OS. We investigate this problem and provide our solution for it. Copyright 2009 ACM.
The paper is dedicated to theoretical research of spatial indexing methods in conformity to three dimensional scenes arising in CAD/CAM systems, robotics, virtual and augmented reality applications. Special attention ...
详细信息
An important limitation of existing adversarial attacks on real-world object detectors lies in their threat model: adversarial patch-based methods often produce suspicious images while image generation approaches do n...
详细信息
This paper considers local scour around a pipeline under turbulent *** Navier-Stokes equations are solved with a shear stress turbulence *** original bed deformation equation based on an analytical sediment transport ...
详细信息
This paper considers local scour around a pipeline under turbulent *** Navier-Stokes equations are solved with a shear stress turbulence *** original bed deformation equation based on an analytical sediment transport model is used to describe the changes in the bottom *** proposed sediment transport equation is based on Coulomb’s friction law for granular flow,Prandtl’s friction law for turbulent flow,and agrees with a large number of phenomenological formulas by other authors.A numerical algorithm for solving the mathematical model of bed surface erosion is implemented in *** simulations of the problem show that under the influence of turbulent flow generated at the pipeline streamline,a characteristic bottom wave of low steepness appears,the parameters of which asymptotically agree with the experimental *** on the analysis of experimental and numerical studies of the considered case,an assumption about the self-similar behavior of the bed surface evolution is *** on this assumption,a new method of constructing the self-similar dependence of the bed surface on time and space coordinates is *** the proposed approach,the average values of tangential bottom stresses are determined for a number of self-similar bottom surface shapes,and then the rates of change of bottom wave lengths and amplitudes are calculated using the proposed analytical model.A comparison with experimental data and numerical calculations shows that the solution error does not exceed a few percent and the computational time is reduced by up to 30 times.
In this paper, a learning-based optimal transportation algorithm for autonomous taxis and ridesharing vehicles is introduced. The goal is to design a mechanism to solve the routing problem for a fleet of autonomous ve...
详细信息
ISBN:
(纸本)9781538692882
In this paper, a learning-based optimal transportation algorithm for autonomous taxis and ridesharing vehicles is introduced. The goal is to design a mechanism to solve the routing problem for a fleet of autonomous vehicles in real-time in order to maximize the transportation company's profit. To solve this problem, the system is modeled as a Markov Decision Process (MDP) using past customers data. By solving the defined MDP, a centralized high-level planning recommendation is obtained, where this offline solution is used as an initial value for the real-time learning. Then, a distributed SARSA reinforcement learning algorithm is proposed to capture the model errors and the environment changes, such as variations in customer distributions in each area, traffic, and fares, thereby providing an accurate model and optimal policies in real-time. Agents are using only their local information and interaction, such as current passenger requests and estimates of neighbors' tasks and their optimal actions, to obtain the optimal policies in a distributed fashion. The agents use the estimated values of each action, provided by distributed SARSA reinforcement learning, in a distributed game-theory based task assignment to select their conflict-free customers. Finally, the customers data provided by the city of Chicago is used to validate the proposed algorithms.
暂无评论