1,726,837 research outputs found
Victor de Bonis : Wesbrook Talks
No full textWebcast sponsored by the Irving K. Barber Learning Centre. Back in the ‘80s when the Vancouver Canucks were searching for wins in a tough Smythe Division, Victor de Bonis could be found parking cars at the Pacific Coliseum. After a detour through accounting firm KPMG, de Bonis joined the Canucks operation in 1994, and has since seen various teams and ownerships come and go. Yet through perseverance, relationships and a dedication to winning, over the past two decades, de Bonis has helped turned the franchise into one of the National Hockey League’s most successful franchises. We heard how he got his start, and learn about the challenges he faced and opportunities he seized along the way. Wesbrook Talks is presented by Wesbrook Village and alumni UBC. It is designed to provide intimate opportunities to listen to and engage with prominent alumni in the community.
Speaker Bio
Victor de Bonis is the Chief Operating Officer for Canucks Sports and Entertainment (CSE), and an Alternate Governor for the NHL. Working in partnership with President of Hockey Operations Trevor Linden, Victor has primary responsibility over all facets of business operations and directs the Senior Leadership Team.AlumniNon UBCUnreviewedOthe
Identifying black-glazed pottery productions in the central Mediterranean: an interdisciplinary approach.
No full textDe Bonis Constante Matrimonio Quaesitis
Full text linkDE BONIS CONSTANTE MATRIMONIO QUAESITIS
De Bonis Constante Matrimonio Quaesitis ([1])
Titelseite ([1])
Text ([1])
Textbeitrag von Georg Goezius ( -
Disputatio Theologica De Bonis Operibus
No full textDISPUTATIO THEOLOGICA DE BONIS OPERIBUS
Disputatio Theologica De Bonis Operibus ([1])
Titelseite ([1])
Widmung ([1])
Thesen ([2])
Beiträge ([9]
De Bonis, Antonio
No full textBotanico: De Bonis, Antonio (1862-1901).
Nota manoscritta sul recto: All’Illustre e chiar.mo Prof.r Pier A.a Saccardo affettuosamente. ossequiente Ant.o De Bonis.
Montata su cartoncino 104 x 63 mm.
1 fotografia : albumina ; 87 x 55 mm.
Vai alla scheda bibliografica: https://galileodiscovery.unipd.it/discovery/fulldisplay?context=L&vid=39UPD_INST:VU1&search_scope=MyInst_and_CI&tab=Everything&docid=alma99001566709020604
Optimal Algorithms for Two Group Testing Problems and New Bounds on Generalized Superimposed Codes
No full textTwo variants of the well known group testing problem are considered. In the first variant a finite set of items O and an unknown subset P of O are given, and one wants to identify the set P by asking the least number of questions
of the form "Do Q and P share a single element?'', where Q is a subset of O. This problem naturally arises in the design of efficient contention resolution algorithms for certain random multiple-access communication systems [Berger et al. “Random multiple-access communication and group testing,” IEEE Trans. Commun., vol. 32, no. 7, pp. 769–779, 1984].
In the second variant of the problem, the answer to the question "Do Q and P share a single element?'' is correctly
YES if Q and P intersect in a single element and NO if Q and P have an empty intersection, and it is left to a (possibly malicious) adversary otherwise. This model was introduced in [Damaschke, “Randomized group testing for mutually obscuring defectives,” Inf. Process. Lett., vol. 67, pp. 131–135, 1998] in the context of chemical compound testing. In this correspondence several algorithms for these group testing problems are presented, trying to optimize different measures of performance: The overall number of tests performed by the algorithm, the number of stages in which
tests can be arranged, and the decoding complexity of identifying the elements of P from tests outcomes. Some
of the given algorithms are optimal with respect to more
than one of the above criteria. Instrumental to the results presented in the correspondence are new and improved
bounds on certain generalization of superimposed codes
introduced in [Dyachkov and Rykov, “A generalization of superimposed codes and its application to the multiple-access channel,” in Proc. 1984 IEEE Int. Symp. Inf. Theory, pp. 62–64], [De Bonis and Vaccaro, “Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels,” Theoretic. Comput. Sci., vol. 306, no. 1–3, pp. 223–243, 2003], a result that it is believed to be of independent
interest
Remarks on two integral operators and numerical methods for CSIE
Full text linkIn this paper the author extends the mapping properties of some singular integral operators in Zygmund spaces equipped with uniform norm. As by-product quadrature methods for solving CSIE having index and are proposed. Their stability and convergence are proved and error estimates in Zygmund norm are given. Some numerical tests are also shown
- …
