ACTA MATHEMATICA SCIENTIA

ＡＣＴＡＭＡＴＨＥＭＡＴＩＣＡＳＣＩＥＮＴＩＡ￥／／ＩｎｆｏｒｍａｔｉｏｎｆｏｒＡｕｔｈｏｒｓＳｃｏｐｅＴｈｅａｉｍｏｆＡＣＴＡＭＡＴＨＥＭＡＴＩＣＡＳＣＩＥＮＴＩＡｉｓｔｏｐｒｅｓｅｎｔｔｏｔｈｅｓｐｅｃｉａｌｉｚｅｄｒｅａｄｅｒ（ｆｒｏｍｔｈｅｌ...     

具有多重延误休假的可修排队系统M~x／G（M／G）／1（M／G）分析

具有多重延误休假的可修排队系统Ｍ~ｘ／Ｇ（Ｍ／Ｇ）／１（Ｍ／Ｇ）分析史定华（上海科技大学数学系，上海２０１８００）张文国（石家庄铁道学院基础部，石家在０５００４３）ＡＮＡＬＹＳＩＳＯＦＴＨＥＲＥＰＡＩＲＡＢＬＥＱＵＥＵＥＩＮＧＳＹＳＴＥＭＭ~ｘ／Ｇ（Ｍ...     

A GLOBAL ALGORITHM IN THE NUMERICAL RESOLUTION OF THEVISCOUS／INVISCID COUPLED PROBLEM

ＡＧＬＯＢＡＬＡＬＧＯＲＩＴＨＭＩＮＴＨＥＮＵＭＥＲＩＣＡＬＲＥＳＯＬＵＴＩＯＮＯＦＴＨＥＶＩＳＣＯＵＳ／ＩＮＶＩＳＣＩＤＣＯＵＰＬＥＤＰＲＯＢＬＥＭＸＵＣＨＵＡＮＪＵＭＡＤＡＹ，Ｙ．ＭａｎｕｓｃｒｉｐｔｒｅｃｅｉｖｅｄＯｃｔｏｂｅｒ１７，１９...     

CIMS环境下技术创新的组织

本文探讨了ＣＩＭＳ环境下企业技术创新的组织问题，提出了ＣＩＭＳ环境下技术创新的组织结构和组织形式，为ＣＩＭＳ环境下企业技术创新组织的重构提供了参考。     

A BRIEF INTRODUCTION TO THE MEMBERS （MATHEMATICS） OF ACADEMIA SINICA NEWLY ELECTED IN 1995

ＡＢＲＩＥＦＩＮＴＲＯＤＵＣＴＩＯＮＴＯＴＨＥＭＥＭＢＥＲＳ（ＭＡＴＨＥＭＡＴＩＣＳ）ＯＦＡＣＡＤＥＭＩＡＳＩＮＩＣＡＮＥＷＬＹＥＬＥＣＴＥＤＩＮ１９９５￥／／ＬｉＤａｑｉａｎ（ＬｉＴａ－ｔｓｉｅｎ）ＭａｔｈｅｍａｔｉｃｉａｎａｎｄＰｒｏｆｅｓｓｏｒ...     

THE MATCHED QUEUEING SYSTEM GI。PH/PH/1

ＴＨＥＭＡＴＣＨＥＤＱＵＥＵＥＩＮＧＳＹＳＴＥＭＧＩ。ＰＨ／ＰＨ／１ＸＵＧＵＡＮＣＨＵＩ（ＧＵＡＮＧ－ＨＵＩＨＳＶ）（徐光煇）；ＨＥＱＩＭＩＮＧ（何启明）（ＩｎｓｔｉｔｕｔｅｏｆＡｐｐｌｉｅｄＭａｔｈｅｍａｔｉｃｓ，ｔｈｅＣｈｉｎｅｓｅＡｃａｄｅｍｙ...     

THE SUBDIVISION ALGORITHM FOR GENERATING CURVES AND ITS PROPERTIES

ＴＨＥＳＵＢＤＩＶＩＳＩＯＮＡＬＧＯＲＩＴＨＭＦＯＲＧＥＮＥＲＡＴＩＮＧＣＵＲＶＥＳＡＮＤＩＴＳＰＲＯＰＥＲＴＩＥＳＷＵＺＯＮＧＭＩＮ；ＹＥＱＩＮＧＡＮＤＬＩＵＪＩＡＮＰＩＮＡｂｓｔｒａｃｔ：ＩｎｔｈｅａｐｐｌｉｃａｔｉｏｎｏｆＣＡＤ／ＣＡＭ，ｔｈｅ...     

MIXED METHODS FOR COMPRESSIBLE MISCIBLE DISPLACEMENT WITH THE EFFECT OF MOLECULAR DISPERSION

ＭＩＸＥＤＭＥＴＨＯＤＳＦＯＲＣＯＭＰＲＥＳＳＩＢＬＥＭＩＳＣＩＢＬＥＤＩＳＰＬＡＣＥＭＥＮＴＷＩＴＨＴＨＥＥＦＦＥＣＴＯＦＭＯＬＥＣＵＬＡＲＤＩＳＰＥＲＳＩＯＮＬＩＱＩＡＮ（李潜）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＳｈａｎｄｏｎｇＮ...     

EpisandInjectivesinFTS＿0

ＥｐｉｓａｎｄＩｎｊｅｃｔｉｖｅｓｉｎＦＴＳ＿０Ａ．Ｋ．Ｓｒｉｖａｓｔａｖａ＆Ｓ．Ｐ．Ｍｉｓｈｒａ＊／／ＤｅｐａｒｉｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＢａｎａｒａｓＨｉｎｄｕＵｎｉｖｅｒｓｉｔｙＶａｒａｎａｓｉ－２２１００５（Ｕ．Ｐ），ＩＮＤＩＡ。...     

COMPLETE EXTREMAL SURFACES OF MIXED TYPE IN 3-DIMENSIONAL MINKOWSKI SPACE

ＣＯＭＰＬＥＴＥＥＸＴＲＥＭＡＬＳＵＲＦＡＣＥＳＯＦＭＩＸＥＤＴＹＰＥＩＮ３－ＤＩＭＥＮＳＩＯＮＡＬＭＩＮＫＯＷＳＫＩＳＰＡＣＥ￥ＧＵＣＨＡＯＨＡＯ（ＩｎｓｔｉｔｕｔｅｏｆＭａｔｈｅｍａｔｉｃｓ，ＦｕｄａｎＵｎｉｖｅｒｓｉｔｙ，Ｓｈａｎｇｈａｉ２００...     

企业情报管理信息系统的分析

本文运用系统工程的思想，现代化的管理知识和计算机网络技术，并结合实际课题的的研究，对企业情报ＭＩＳ的系统分析技术进行了有益的探讨．     

管理信息系统的发展与展望

近年来，随着信息技术的飞速发展和管理的不断创新，管理信息系统的概念正在突破原有的界限．向着系统发展的网络化、系统开发方法的理性统一化以及系统运行的智能化的方向发展。本就此进行讨论，并提出一些看法。     

Application of structural equation modeling to evaluate the intention of shippers to use Internet services in liner shipping

Operations research (OR) is the application of modeling techniques to formulate and analyze systems and problems for management decision-making. Structural equation modeling (SEM) is a modeling technique applied to social or behavioral systems to understand and explain relationships that may exist among elements of systems. Recently, the measurement of unobservable variables has gained increasing attention in operations management (OM) research, and the OR discipline has begun to recognize the value of applying SEM to analyze behavioral-related OR problems. To provide OR researchers with a better understanding of the application of this useful statistical modeling technique, this paper presents a tutorial on the application of SEM. Specifically, we investigate the key factors that affect the adoption of Internet services in the context of liner shipping services. Although [Fishbein, M.A., Ajzen, I., 1975. Belief, Attitude, Intention and Behavior: An Introduction to Theory and Research, Addison-Wesley, Reading, MA; Davis, F.D., 1989. Perceived usefulness, perceived ease of use, and user acceptance of information technology. MIS Quarterly 13 (3), 319–339; Ajzen, I., 1985. From intention to actions: A theory of planned behavior. In: Kuhl, J., Bechmann, J. (Eds.), Action Control: From Cognition to Behavior. Springer Verlag, New York, pp. 11–39; Ajzen, I., 1991. The theory of planned behavior. Organizational Behavior and Human Decision Processes 50, 179–211] have made important contributions to understanding users’ behavior of technology acceptance, shippers’ resistance to end-user systems is still a common problem in the liner shipping industry. To better predict, explain, and increase shippers’ acceptance of technology, we need to understand why shippers accept or reject Internet services provided by their liner shipping carriers. Another objective of this paper is to propose and empirically test a theoretical framework that relates the intention of shippers to use Internet services in liner shipping with its antecedents such as perceived usefulness, perceived ease of use, and the perceptions of security protection. Tests of the structural model confirm Davis’s (1989) notion that perceived ease of use explains the intention of shippers to use Internet services, and that perceived ease of use has a strong positive effect on perceived usefulness. The results also indicate that security protection influences perceived ease of use. The SEM analyses in this study offer OR researchers a methodological guide on how to assess the efficacy of both a measurement model that relates observed indicators to latent factors and a structural model that poses relationships between constructs.     

管理信息系统综合评价的数学模型

本在建立管理信息系统评价指标体系的基础上,通过建立数学模型,研究了管理信息系统的综合评价问题,并用实例加以说明。     

MIS工程项目管理最优化模型

MIS是具有创新性质的工程项目 ,是一项具有许多不确定因素的系统工程 ,本文结合铁路TMIS建设的实际问题 ,从系统工程的角度就含有随机因素的信息化工程项目管理进行了讨论 ,提出了一个方便实用的最优化模型并使用Excel给出了计算机求解方法。     

Independent sets in bounded-degree hypergraphs

In this paper we analyze several approaches to the Maximum Independent Set (MIS) problem in hypergraphs with degree bounded by a parameter Δ. Since independent sets in hypergraphs can be strong and weak, we denote by MIS (MSIS) the problem of finding a maximum weak (strong) independent set in hypergraphs, respectively. We propose a general technique that reduces the worst case analysis of certain algorithms on hypergraphs to their analysis on ordinary graphs. This technique allows us to show that the greedy algorithm for MIS that corresponds to the classical greedy set cover algorithm has a performance ratio of (Δ+1)/2. It also allows us to apply results on local search algorithms on graphs to obtain a (Δ+1)/2 approximation for the weighted MIS and (Δ+3)/5−? approximation for the unweighted case. We improve the bound in the weighted case to ⌈(Δ+1)/3⌉ using a simple partitioning algorithm. We also consider another natural greedy algorithm for MIS that adds vertices of minimum degree and achieves only a ratio of Δ−1, significantly worse than on ordinary graphs. For MSIS, we give two variations of the basic greedy algorithm and describe a family of hypergraphs where both algorithms approach the bound of Δ.     

Analyzing infeasible nonlinear programs

Nonlinear optimizers often report infeasibility during the process of initial construction of a model, or alterations to an existing model. Because solvers are unable to decide feasibility of a nonlinear constraint set with perfect accuracy, there are numerous possible explanations: the physical model really is infeasible, there is an error in the nonlinear constraint set causing infeasibility, or the model is feasible but the initial point or solver parameters are poorly chosen. It is difficult to proceed to a diagnosis of the problem in a large NLP.This paper presents an algorithm providing automated assistance in analyzing infeasible NLPs. The deletion filtering algorithm isolates a Minimal Intractable Subsystem (MIS) of constraints, a minimal set of constraints which appears infeasible to the solver given a specified initial point and parameter settings. The MIS may be as small as a few constraints from among the very much larger set defining the original model, and helps to focus the examination, thereby speeding the diagnosis. A computer tool embodying the algorithm, LSGRG (MIS), is developed and applied to demonstration examples.     

Multirate finite step methods for linear acoustics

Many processes contain phenomena on different time scales, leading to model equations with fast and small parts. There are several approaches to solve these equations, like additive Runge Kutta methods or multirate infinitesimal steps methods (MIS). Both methods make use of the additive splitting of the ODE in fast and small parts. The multiple infinitesimal step method integrates the slow part with a large macro stepsize, whereas the fast terms are solved with several smaller steps of a simpler method. The order conditions of a MIS method are derived under the assumption of the exact integration of the fast parts. We develop the multirate finite step methods (MFS). These methods are derived from the MIS methods, by taking a simple small scale integrator for the fast terms. This small scale integrator uses the same number of steps in each stage. With these assumptions, we derive the order conditions, such that the order is independent in the number of small steps. (© 2016 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Intra-domain traffic engineering with shortest path routing protocols

Throughout the last decade, extensive deployment of popular intra-domain routing protocols such as open shortest path first and intermediate system–intermediate system, has drawn an ever increasing attention to Internet traffic engineering. This paper reviews optimization techniques that have been deployed for managing intra-domain routing in networks operated with shortest path routing protocols, and the state-of-the-art research that has been carried out in this direction.     

TVD-based Finite Volume Methods for Sound-Advection-Buyancy Systems

Split-explicit Runge-Kutta methods provide an efficient integration procedure for hyperbolic systems with coupled slow and fast wave phenomena. They are generalized to multirate infinitesimal step methods (MIS) in order to develop an order to provide order conditions and to establish stability properties. The construction of MIS methods is based on an underlying Runge-Kutta method. This method is choosen to be total variation diminishing (TVD) to improve the stability properties of the method. Here, the maximum Courant number is improved by a factor of 4. (© 2014 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)