Search results for "value"
showing 10 items of 5321 documents
Determination of optimal fluoroscopic angulations for aorto-coronary ostial interventions from coronary computed tomography angiography.
2020
Abstract Background An optimal aorto-coronary angiographic projection, characterized by an orthogonal visualization of the proximal coronary artery, is crucial for interventional success. We determined the distribution of optimal C-arm positions and assessed their feasibility by invasive coronary angiography. Methods Orthogonal aorto-coronary ostial angulations were determined in 310 CT data sets. In 100 patients undergoing subsequent invasive angiography, we assessed if the CT-predicted angulations were achievable by the C-arm system. If the predicted projection was not achievable due to mechanical constraints of the C-arm system, the most close, achievable angulation was determined. Patie…
Using an Adaptive Network-based Fuzzy Inference System to Estimate the Vertical Force in Single Point Incremental Forming
2019
Manufacturing processes are usually complex ones, involving a significant number of parameters. Unconventional manufacturing processes, such as incremental forming is even more complex, and the establishment of some analytical relationships between parameters is difficult, largely due to the nonlinearities in the process. To overcome this drawback, artificial intelligence techniques were used to build empirical models from experimental data sets acquired from the manufacturing processes. The approach proposed in this work used an adaptive network-based fuzzy inference system to extract the value of technological force on Z-axis, which appears during incremental forming, considering a set of…
On the stability of spline-collocation methods of multivalue type
1987
In this paper the general classV of spline-collocation methods for first order systems of ordinary differential equations is investigated. The methods can in part be regarded as so-called multivalue methods. This type contains the generalized singly-implicit methods treated by Butcher.
A-stable spline-collocation methods of multivalue type
1989
In this paper the general classV of spline-collocation methods presented by Multhei is investigated. The methods ofV approximate solutions of first order initial value problems. ClassV contains as subclass the methods of so-called multivalue type, and in particular contains the generalized singly-implicit methods treated by Butcher.
Recursive and bargaining values
2021
Abstract We introduce two families of values for TU-games: the recursive and bargaining values. Bargaining values are obtained as the equilibrium payoffs of the symmetric non-cooperative bargaining game proposed by Hart and Mas-Colell (1996). We show that bargaining values have a recursive structure in their definition, and we call this property recursiveness. All efficient, linear, and symmetric values that satisfy recursiveness are called recursive values. We generalize the notions of potential, and balanced contributions property, to characterize the family of recursive values. Finally, we show that if a time discount factor is considered in the bargaining model, every bargaining value h…
TUG-OF-WAR, MARKET MANIPULATION, AND OPTION PRICING
2014
We develop an option pricing model based on a tug-of-war game involving the the issuer and holder of the option. This two-player zero-sum stochastic differential game is formulated in a multi-dimensional financial market and the agents try, respectively, to manipulate/control the drift and the volatility of the asset processes in order to minimize and maximize the expected discounted pay-off defined at the terminal date $T$. We prove that the game has a value and that the value function is the unique viscosity solution to a terminal value problem for a partial differential equation involving the non-linear and completely degenerate parabolic infinity Laplace operator.
Values of games with probabilistic graphs
1999
Abstract In this paper we consider games with probabilistic graphs. The model we develop is an extension of the model of games with communication restrictions by Myerson (1977) . In the Myerson model each pair of players is joined by a link in the graph if and only if these two players can communicate directly. The current paper considers a more general setting in which each pair of players has some probability of direct communication. The value is defined and characterized in this context. It is a natural extension of the Myerson value and it turns out to be the Shapley value of a modified game.
Kernel manifold alignment for domain adaptation
2016
The wealth of sensory data coming from different modalities has opened numerous opportu- nities for data analysis. The data are of increasing volume, complexity and dimensionality, thus calling for new methodological innovations towards multimodal data processing. How- ever, multimodal architectures must rely on models able to adapt to changes in the data dis- tribution. Differences in the density functions can be due to changes in acquisition conditions (pose, illumination), sensors characteristics (number of channels, resolution) or different views (e.g. street level vs. aerial views of a same building). We call these different acquisition modes domains, and refer to the adaptation proble…
Topology of synaptic connectivity constrains neuronal stimulus representation, predicting two complementary coding strategies
2022
In motor-related brain regions, movement intention has been successfully decoded from in-vivo spike train by isolating a lower-dimension manifold that the high-dimensional spiking activity is constrained to. The mechanism enforcing this constraint remains unclear, although it has been hypothesized to be implemented by the connectivity of the sampled neurons. We test this idea and explore the interactions between local synaptic connectivity and its ability to encode information in a lower dimensional manifold through simulations of a detailed microcircuit model with realistic sources of noise. We confirm that even in isolation such a model can encode the identity of different stimuli in a lo…
How does serendipity affect diversity in recommender systems? A serendipity-oriented greedy algorithm
2018
Most recommender systems suggest items that are popular among all users and similar to items a user usually consumes. As a result, the user receives recommendations that she/he is already familiar with or would find anyway, leading to low satisfaction. To overcome this problem, a recommender system should suggest novel, relevant and unexpected i.e., serendipitous items. In this paper, we propose a serendipity-oriented, reranking algorithm called a serendipity-oriented greedy (SOG) algorithm, which improves serendipity of recommendations through feature diversification and helps overcome the overspecialization problem. To evaluate our algorithm, we employed the only publicly available datase…