The role of hyperfine mixing in b→cb\to c semileptonic and electromagnetic decays of doubly-heavy baryons

We analyze the effects of hyperfine mixing in $b\to c\,$ semileptonic and electromagnetic decays of doubly heavy baryons.Comment: Talk given at the Chiral 10 Conferenc

The effect of hyperfine mixing in electromagnetic and semileptonic decays of doubly heavy baryons

We consider the role played by hyperfine mixing in electromagnetic and semileptonic decays of doubly heavy baryons, which give rise to large corrections to the decay widths in both cases.Comment: Talk given in Quark Confinement and the Hadron Spectrum IX, Madrid September 201

Modelling the Product Development performance of Colombian Companies

Organised by: Cranfield UniversityThis paper presents the general model of the Product Development Process (PDP) in the Metal mechanics Industry in Barranquilla-Colombia, since this sector contributes significantly to the productivity of this industrial city. This case study counted on a five-company sample. The main goal was to model the current conditions of the PDP according to the Concurrent Engineering philosophy. The companies were selected according to their productive profile, in order to contrast differences regarding the structure of their productive processes, conformation of multidisciplinary teams, integration of different areas, customers and suppliers to the PDP; human resources, information, technology and marketing constraints.Mori Seiki – The Machine Tool Compan

On the limits of engine analysis for cheating detection in chess

The integrity of online games has important economic consequences for both the gaming industry and players of all levels, from professionals to amateurs. Where there is a high likelihood of cheating, there is a loss of trust and players will be reluctant to participate — particularly if this is likely to cost them money. Chess is a game that has been established online for around 25 years and is played over the Internet commercially. In that environment, where players are not physically present “over the board” (OTB), chess is one of the most easily exploitable games by those who wish to cheat, because of the widespread availability of very strong chess-playing programs. Allegations of cheating even in OTB games have increased significantly in recent years, and even led to recent changes in the laws of the game that potentially impinge upon players’ privacy. In this work, we examine some of the difficulties inherent in identifying the covert use of chess-playing programs purely from an analysis of the moves of a game. Our approach is to deeply examine a large collection of games where there is confidence that cheating has not taken place, and analyse those that could be easily misclassified. We conclude that there is a serious risk of finding numerous “false positives” and that, in general, it is unsafe to use just the moves of a single game as prima facie evidence of cheating. We also demonstrate that it is impossible to compute definitive values of the figures currently employed to measure similarity to a chess-engine for a particular game, as values inevitably vary at different depths and, even under identical conditions, when multi-threading evaluation is used