An agent-based fuzzy cognitive map approach to the strategic marketing planning for industrial firms

This is the post-print version of the final paper published in Industrial Marketing Management. The published article is available from the link below. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. Copyright @ 2013 Elsevier B.V.Industrial marketing planning is a typical example of an unstructured decision making problem due to the large number of variables to consider and the uncertainty imposed on those variables. Although abundant studies identified barriers and facilitators of effective industrial marketing planning in practice, the literature still lacks practical tools and methods that marketing managers can use for the task. This paper applies fuzzy cognitive maps (FCM) to industrial marketing planning. In particular, agent based inference method is proposed to overcome dynamic relationships, time lags, and reusability issues of FCM evaluation. MACOM simulator also is developed to help marketing managers conduct what-if scenarios to see the impacts of possible changes on the variables defined in an FCM that represents industrial marketing planning problem. The simulator is applied to an industrial marketing planning problem for a global software service company in South Korea. This study has practical implication as it supports marketing managers for industrial marketing planning that has large number of variables and their cause–effect relationships. It also contributes to FCM theory by providing an agent based method for the inference of FCM. Finally, MACOM also provides academics in the industrial marketing management discipline with a tool for developing and pre-verifying a conceptual model based on qualitative knowledge of marketing practitioners.Ministry of Education, Science and Technology (Korea

Tandem ring-closing metathesis reaction with a ruthenium catalyst containing a N-heterocyclic ligand

The highly active catalyst 2 was used in tandem RCM to make molecules with various ring systems containing α,β-unsaturated carbonyl compounds

Optimal Estimates for the Electric Field in Two-Dimensions

The purpose of this paper is to set out optimal gradient estimates for solutions to the isotropic conductivity problem in the presence of adjacent conductivity inclusions as the distance between the inclusions goes to zero and their conductivities degenerate. This difficult question arises in the study of composite media. Frequently in composites, the inclusions are very closely spaced and may even touch. It is quite important from a practical point of view to know whether the electric field (the gradient of the potential) can be arbitrarily large as the inclusions get closer to each other or to the boundary of the background medium. In this paper, we establish both upper and lower bounds on the electric field in the case where two circular conductivity inclusions are very close but not touching. We also obtain such bounds when a circular inclusion is very close to the boundary of a circular domain which contains the inclusion. The novelty of these estimates, which improve and make complete our earlier results published in Math. Ann., is that they give an optimal information about the blow-up of the electric field as the conductivities of the inclusions degenerate.Comment: 26 page

Shape matching and clustering in design

Generalising knowledge and matching patterns is a basic human trait in re-using past experiences. We often cluster (group) knowledge of similar attributes as a process of learning and or aid to manage the complexity and re-use of experiential knowledge [1, 2]. In conceptual design, an ill-defined shape may be recognised as more than one type. Resulting in shapes possibly being classified differently when different criteria are applied. This paper outlines the work being carried out to develop a new technique for shape clustering. It highlights the current methods for analysing shapes found in computer aided sketching systems, before a method is proposed that addresses shape clustering and pattern matching. Clustering for vague geometric models and multiple viewpoint support are explored

Automatic generation of robot and manual assembly plans using octrees

This paper aims to investigate automatic assembly planning for robot and manual assembly. The octree decomposition technique is applied to approximate CAD models with an octree representation which are then used to generate robot and manual assembly plans. An assembly planning system able to generate assembly plans was developed to build these prototype models. Octree decomposition is an effective assembly planning tool. Assembly plans can automatically be generated for robot and manual assembly using octree models. Research limitations/implications - One disadvantage of the octree decomposition technique is that it approximates a part model with cubes instead of using the actual model. This limits its use and applications when complex assemblies must be planned, but in the context of prototyping can allow a rough component to be formed which can later be finished by hand. Assembly plans can be generated using octree decomposition, however, new algorithms must be developed to overcome its limitations

Hadronic B Decays to Charmless VT Final States

Charmless hadronic decays of B mesons to a vector meson (V) and a tensor meson (T) are analyzed in the frameworks of both flavor SU(3) symmetry and generalized factorization. We also make comments on B decays to two tensor mesons in the final states. Certain ways to test validity of the generalized factorization are proposed, using $B \to VT$ decays. We calculate the branching ratios and CP asymmetries using the full effective Hamiltonian including all the penguin operators and the form factors obtained in the non-relativistic quark model of Isgur, Scora, Grinstein and Wise.Comment: 27 pages, no figures, LaTe