SERVICE VALUE NETWORKS： INTO PRACTICE

Modeling a business to match its customer perceived （and customer desired） outcomes, remains an on-going task. This paper considers shows how a service value networks （SVNs） approach may be engaged to model, and deliver, understanding of the front-end business and its direct engagement with its immediate （or front-end） customers. These front-end customers may be either： （1） its off-line, in-store customers - engaging directly with the business sales staff （or representative）, or-（2） its on-line, virtual customers - engaging with the business via internet or remote access. In this situation, both the business, and the customer draw upon their respective viewpoints, and both sides influence the interaction. External to these business and customer influences are additional factors that capture the immediate and broader global effects - termed environmental effects. These three business-customer engagement areas of influence are captured by a SVN SEM approach.
Without a business-customer encounter of some kind the likelihood of a services business, and a prospecting customer, successfully engaging in an exchange process is reduced. This exchange may be a physical, and/or services exchange, and/or an information and/or ideas exchange. To the business, this encounter is, in effect, a trade, and as a result, the business targets acquiring an economic exchange that will ultimately deliver a net positive economic outcome. To the customer, external and internal information feeds, servicing, perceived value, and satisfaction, are key encounter drivers. SVNs offers a new way to understand the business-customer encounter, and to then utilize this acquired knowledge to either： （1） build a strategic management model, or （2） reengineer its business networks, and to then create a re-positioned, more customer-aligned business operation - one that is capable of delivering win - win, competitive business-customer solutions.     

A note on the principal theorems in the theory of functional analysis

Two theorems are proved. They are with principal significance in functional analysis, for they imply some well-known theorems, such as the open mapping theorem, the closed graph theorem and the Banach-Steinhaus theorem. Du Nailin: born in Jan. 1962, Instructor     

THE PERIODIC CAPACITATED ARC ROUTING PROBLEM LINEAR PROGRAMMING MODEL, METAHEURISTIC AND LOWER BOUNDS

1. Introduction The Capacitated Arc Routing Problem(CARP) is defined on an undirected network inwhich a fleet of identical vehicles with limitedcapacity is based at a depot node. Each edge hasa non-negative traversal cost and can betraversed any number…     

综合智能系统框架的研究及其实现

当前人工智能(AI)正处在一个转折时期,无论是基于符号推理的专家系统(ES),还是基于网络推理的人工神经网络(ANN)在使用过程中都已暴露出了不可克服的缺点。因此,将ES与ANN结合起来构成混合系统(Hybrid System)已经成为大势所趋,同时考虑到人在智能模拟中的不可替代作用,又应将人的因素与混合系统进行综合集成从而构造综合智能系统(Integrated Intelligent Sysrem)。本文探讨了一个基于人,神经网络,专家系统集成的综合智能系统框架,并给出了一个基于此框架而开发的组合机床流水线智能报价系统的实例,     

Nova Geminorum 1912 and the origin of the idea of gravitational lensing

Einstein’s early calculations of gravitational lensing, contained in a scratch notebook and dated to the spring of 1912, are reexamined. A hitherto unknown letter by Einstein suggests that he entertained the idea of explaining the phenomenon of new stars by gravitational lensing in the fall of 1915 much more seriously than was previously assumed. A reexamination of the relevant calculations by Einstein shows that, indeed, at least some of them most likely date from early October 1915. But in support of earlier historical interpretation of Einstein’s notes, it is argued that the appearance of Nova Geminorum 1912 (DN Gem) in March 1912 may, in fact, provide a relevant context and motivation for Einstein’s lensing calculations on the occasion of his first meeting with Erwin Freundlich during a visit in Berlin in April 1912. We also comment on the significance of Einstein’s consideration of gravitational lensing in the fall of 1915 for the reconstruction of Einstein’s final steps in his path towards general relativity.     

The DNA concentration effect on DNA radiation damage induced by <Superscript>7</Superscript>Li ions and γ rays

To evaluate the influence of the DNA concentration in the aqueous solution on DNA radiation damage, the plasmid DNA in the presence or absence of Mannitol （scavenger of free radical OH.） was irradiated by ^7Li ions and γ rays at various DNA concentrations. Gel electrophoresis analysis revealed that the DNA damage of single and double strand breaks induced by irradiation became more severe at lower DNA concentration. In the condition of γ-ray irradiation, most of double strand breaks （DSB） damage was neutralized and less associated with DNA concentration in the presence of mannitol. However, under ^7Li irradiation, DSB damage could not be cleared by mannitol but was gradually aggravated with decreasing DNA concentrations. These findings imply that under low-LET irradiation, most of the DSB damage is generated by free radical OH·diffusion, and thus may be counteracted by scavengers, while at higher-LET irradiation, quite a fraction of DSB induction is caused by direct ionizing energy deposition of heavy ions, which cannot be eliminated. This work also indicates that the proportion between free radical damage and direct ionizing damage is s constant which is independent of DNA concentration when the DNA concentration is under a certain value （50ng/μL）. Our study sheds light on the un- derlying mechanisms in the DNA radiation damage process.     

A Binary Integer Program to Maximize the Agreement Between Partitions

This research note focuses on a problem where the cluster sizes for two partitions of the same object set are assumed known; however, the actual assignments of objects to clusters are unknown for one or both partitions. The objective is to find a contingency table that produces maximum possible agreement between the two partitions, subject to constraints that the row and column marginal frequencies for the table correspond exactly to the cluster sizes for the partitions. This problem was described by H. Messatfa (Journal of Classification, 1992, pp. 5–15), who provided a heuristic procedure based on the linear transportation problem. We present an exact solution procedure using binary integer programming. We demonstrate that our proposed method efficiently obtains optimal solutions for problems of practical size. We would like to thank the Editor, Willem Heiser, and an anonymous reviewer for helpful comments that resulted in improvements of this article.     

关于素模域上方程r^3＋s^3=c的解数

设素数ｐ≥３，用Ｎ（ｐ，ｃ）表示满足同余方程ｒ￣３＋ｓ￣３≡ｃ（ｍｏｄｑ）的解数，其中ｒ，ｓ是模ｐ的二次剩余，且０＜ｒ，ｓ＜ｐ。给出了Ｎ（ｐ，ｃ）的渐近公式。