Zobrazeno 1 - 10
of 336
pro vyhledávání: '"Shirani F"'
Publikováno v:
Journal of Dental Medicine, Vol 21, Iss 4, Pp 278-284 (2009)
"nBackground and Aim: As composite-dentin bond strength is affected by cavity preparation and the bond strength of composite resin to new and used bur prepared dentin has not yet been evaluated, this study evaluated the effects of cutting dentin with
Externí odkaz:
https://doaj.org/article/613c973382d14be5ab8e5080a1cfbe49
Publikováno v:
Journal of Dental Medicine, Vol 21, Iss 3, Pp 189-195 (2008)
"nBackground and Aim: Fractured anterior teeth can be restored by adhesive bonding of the separated fragment to the remaining tooth structure. This invitro study evaluated the force required for fracture of rebonded fragments which were dried and rew
Externí odkaz:
https://doaj.org/article/ded5ac491b4a4b849bf72b6eb187a071
Publikováno v:
Journal of Dental Medicine, Vol 21, Iss 2, Pp 116-123 (2008)
"nBackground and Aim: Microleakage has been always a major concern in restorative dentistry. The curing contraction of composites still presents a problem with controlling microleakage and postoperative sensitivity. The aim of this study was to inves
Externí odkaz:
https://doaj.org/article/e13e9011b6c74a57b40c4d387fde163d
Publikováno v:
Journal of Dental Medicine, Vol 19, Iss 3, Pp 24-34 (2006)
Background and Aim: The structural rehabilitation of a pulpless tooth is critically important to ensure a successful restorative outcome following endodontic treatment. A post and core is often indicated for the retention and reinforcement of the fin
Externí odkaz:
https://doaj.org/article/c592935b5a054c53a474bdd5b06b6f59
This work considers the fundamental privacy limits under active fingerprinting attacks in power-law bipartite networks. The scenario arises naturally in social network analysis, tracking user mobility in wireless networks, and forensics applications,
Externí odkaz:
http://arxiv.org/abs/2202.05895
Publikováno v:
In Radiología (English Edition) May-June 2023 65(3):200-212
In this paper, matching pairs of random graphs under the community structure model is considered. The problem emerges naturally in various applications such as privacy, image processing and DNA sequencing. A pair of randomly generated labeled graphs
Externí odkaz:
http://arxiv.org/abs/1810.13347
In this paper, the problem of matching pairs of correlated random graphs with multi-valued edge attributes is considered. Graph matching problems of this nature arise in several settings of practical interest including social network de-anonymization
Externí odkaz:
http://arxiv.org/abs/1802.00918
In this paper, de-anonymizing internet users by actively querying their group memberships in social networks is considered. In this problem, an anonymous victim visits the attacker's website, and the attacker uses the victim's browser history to quer
Externí odkaz:
http://arxiv.org/abs/1801.06498
In this paper, a new information theoretic framework for graph matching is introduced. Using this framework, the graph isomorphism and seeded graph matching problems are studied. The maximum degree algorithm for graph isomorphism is analyzed and suff
Externí odkaz:
http://arxiv.org/abs/1711.10360