Zobrazeno 1 - 10
of 7 521
pro vyhledávání: '"A. Derakhshan"'
Noninterference guarantees that an attacker cannot infer secrets by interacting with a program. Information flow control (IFC) type systems assert noninterference by tracking the level of information learned (pc) and disallowing communication to enti
Externí odkaz:
http://arxiv.org/abs/2407.20410
We study the polynomial-time approximability of the optimal online stochastic bipartite matching algorithm, initiated by Papadimitriou et al. (EC'21). Here, nodes on one side of the graph are given upfront, while at each time $t$, an online node and
Externí odkaz:
http://arxiv.org/abs/2407.15285
Protection of confidential data is an important security consideration of today's applications. Of particular concern is to guard against unintentional leakage to a (malicious) observer, who may interact with the program and draw inference from made
Externí odkaz:
http://arxiv.org/abs/2407.02304
The competition complexity of an auction setting is the number of additional bidders needed such that the simple mechanism of selling items separately (with additional bidders) achieves greater revenue than the optimal but complex (randomized, prior-
Externí odkaz:
http://arxiv.org/abs/2403.03937
Publikováno v:
Majallah-i ḥifāẓat-i giyāhān, Vol 31, Iss 2, Pp 284-295 (2017)
Introduction: Since the first compilation of herbicide-resistant weeds in 1982, the number of reported herbicide-resistant species has increased significantly. Iudosulfuron-methyl-sodium + mesosulfuron-methyl+ mefenpyr diethyl, sulfosulfuron and trib
Externí odkaz:
https://doaj.org/article/aae425eaaa4047fb9b2b006488f6db8a
Autor:
Derakhshan, Mahsa, Saneian, Mohammad
In this paper, we study the weighted stochastic matching problem. Let $G=(V, E)$ be a given edge-weighted graph and let its realization $\mathcal{G}$ be a random subgraph of $G$ that includes each edge $e\in E$ independently with a known probability
Externí odkaz:
http://arxiv.org/abs/2311.08513
Large Language Models' safety remains a critical concern due to their vulnerability to adversarial attacks, which can prompt these systems to produce harmful responses. In the heart of these systems lies a safety classifier, a computational model tra
Externí odkaz:
http://arxiv.org/abs/2311.00172
Autor:
Derakhshan, Jamshid, Hrushovski, Ehud
We describe the imaginary sorts of infinite products in terms of imaginary sorts of the factors. We extend the result to certain reduced powers and then to infinite products $\prod_{i\in I} M_i$ enriched with a predicate for the ideal of finite subse
Externí odkaz:
http://arxiv.org/abs/2309.11678
Publikováno v:
Majallah-i ḥifāẓat-i giyāhān, Vol 30, Iss 3, Pp 518-532 (2017)
Introduction: Seed germination is one of the key stages in the life cycle of plants that can ultimately affect their fitness in the environment. The temporal pattern of seed germination is extremely depended on the soil water potential (Ψ) of the ge
Externí odkaz:
https://doaj.org/article/ad2e47775b32426bad739b0712904c64
Program equivalence is the fulcrum for reasoning about and proving properties of programs. For noninterference, for example, program equivalence up to the secrecy level of an observer is shown. A powerful enabler for such proofs are logical relations
Externí odkaz:
http://arxiv.org/abs/2309.00192