30 research outputs found
Building an understanding of major advertising strategies for location-based digital signage: A study of Korean marketing practitioners'practice
No full textDigital signage is "location-based media" that occupy both indoor and outdoor spaces. Digital signage has recently been highlighted in the media industry and is attracting attention as a major marketing tool. Based on grounded theory, the researcher conducted individual in-depth interviews with twenty experts who have more than ten years of work experience in the advertising industry in order to investigate and classify the key strategies for developing advertising campaigns with location-based digital signage. The study classifies five key strategies, and the author proposes additional strategies that can help increase advertising effectiveness. The study concludes by noting limitations and suggestions for future research. © 2019 Mattingley Publishing. All rights reserved
Branch and Bound Methods
No full textBranch and bound algorithms are methods for global optimization in nonconvex prob-lems [LW66, Moo91]. They are nonheuristic, in the sense that they maintain a provable upper and lower bound on the (globally) optimal objective value; they terminate with a certificate proving that the suboptimal point found is -suboptimal. Branch and bound al-gorithms can be (and often are) slow, however. In the worst case they require effort that grows exponentially with problem size, but in some cases we are lucky, and the methods converge with much less effort. In these notes we describe two typical and simple examples of branch and bound methods, and show some typical results, for a minimum cardinality problem. 1 Unconstrained nonconvex minimization The material in this section is taken from [BBB91]. The branch and bound algorithm we describe here finds the global minimum of a function f: Rm → R over an m-dimensional rectangle Qinit, to within some prescribed accuracy . We let f? denote the optimal value, i.e., f? = infx∈Qinit f(x). For a rectangle Q ⊆ Qinit we define Φmin(Q) = in
Heat Treatment and Polymorphism of Gutta-Percha and Balata
No full textAbstract
The hydrocarbon from balata or gutta-percha is polymorphic, and the modification in which it is usually known is the metastable variety, but it can be converted to the stable modification by one of a variety of comparatively simple heat-treatments. The α modification, to which it is converted by the heat-treatment, has somewhat different properties and these are compared. Some beneficial effects are reported which enable gutta-percha products to become the basis of a very superior variety of submarine cable insulation, which has been called K.-gutta. In writing this article the author is indebted to W. S. Smith and H. J. Garnett for criticism and advice and to F. Mattingley and H. F. Wilson and others of the laboratory staff for assistance and coöperation in carrying out this work. Thanks are also due to the Telegraph Construction and Maintenance Co., Ltd., for permission to publish these results.</jats:p
Dissociable functional roles of the human action-observation network (Commentary on E. S. Cross et al.)
No full text
