An Economic Model-Based Matching Approach Between Buyers and Sellers Through a Broker in an Open E-Marketplace

A broker in an open e-marketplace enables buyers and sellers to do business with each other. Although a broker plays an important role in e-marketplaces, theory and guidelines for matching between buyers and sellers in multi-attribute exchanges are limited. Therefore, a challenge for a broker’s responsibility is how to maximize a buyer’s total satisfaction degree as its goals under the consideration of trade-off between a buyer’s buying quantity and price paid to a seller, and other attributes. To solve this challenge, this paper proposes an economic model-based matching approach between a buyer’s requirements and a seller’s offers. The major contributions of this paper are that (i) a broker can model a seller’s price policy as per a buyer’s buying quantity through communication between a broker and a seller; (ii) due to each buyer’s different quantity demand, a broker models a buyer’s satisfaction degree as per a buyer’s buying quantity based on communication between a broker and a buyer; and (iii) to carry out a broker’s matching processes, an objective function and a set of constraints are generated to help a broker to maximize a buyer’s total satisfaction degree. Experimental results demonstrate the good performance of the proposed approach.     

Strategic Response to a Powerful Downstream Retailer:Difference-Setting Wholesale Pricing Contract and Partial Forward Integration

We study a supply chain consisted of a supplier and both retailers,and the supplier sells a single product through a dominant retailer and a weak retailer.The aggressive bargaining behavior of the dominant retailer brings the supplier much concern and two feasible strategies are presented to respond to that:difference-setting wholesale pricing contract and integration with the weak retailer.We investigate the decisions of supply chain members under each solution and find that,compared to the traditional form,the supplier always benefits from announcing the difference-setting wholesale pricing contract for it not only raises the marginal wholesale profits of both channels but also reduces the market share of the dominant retailer,thus potentially weakening its channel power.In addition,we show that combining with the weak retailer is not a wise choice for suppliers when the dominant retailer with relatively little bargaining power enjoys a large market share.Finally,by comparing the equilibria of these two solutions,we find that the optimal choice for suppliers depends not only on the difference in market share but also on the dominant retailer's bargaining power in the negotiation.     

From Researching Regions at a Distance to Participatory Network Building: Integrating Action Research and Economic Geography

This paper describes the change in a researcher's practices from one of studying regional industrial development at a distance to one of working closely with a network of agri-food managers. This is accompanied by a discussion of the methodological and theoretical possibilities for an action research inspired economic geography. Some of the core characteristics of a pragmatic conceptualization of action research are revised. It is argued that theoretical developments within economic geography make possible a dialogue between researchers and local actors and that economic geography is challenged to accept that knowledge is generated through such a dialogue. Attempts to create a dialogue between action research and economic geography in a specific Norwegian industrial and geographical context are described. These attempts indicate that the researcher's methodological approach has been transformed from a narrow one relying solely on conventional social science methods to a broader one including participatory action research.     

Viability criteria for differential inclusions

A method of verifying the viability criterion at a given point for a region with nonsmooth boundary, which is expressed by a quasidifferentiabl function, under a differential inclusion which is a convex hull of finitely many functions, is proposed. By this method, determining the viability is transformed into solving a number of systems of linear inequalities, or equivalently solving a number of linear programming problems. For the other differential inclusion, called the generalized convex process, it is shown that viability condition holds for a polytope if and only if it holds at all of its vertices. This result is an extension of corresponding one for a linear control system.     

不同借贷利率下的投资组合选择——-基于均值和VaR的效用最大化模型

用VaR代替方差来度量风险,从而把基于均值和方差的效用函数拓展为基于均值和VaR的一般二元效用函数（关于均值递增,关于VaR递减）,进而研究含无风险资产且具有不同借贷利率时投资组合选择的效用最大化模型.利用均值-VaR模型有效边界的性质,得到了一般效用函数下最大效用存在的条件及最优解的本质特征,并给出了求解的具体方法和数值算法.最后作为结论的直接应用和说明,利用中国股票市场数据给出了一个实例分析.     

市场导向下企业生产计划快速反应系统

市场导向下企业生产计划快速反应系统龚国华（上海工业大学经济管理学院２０００７０）ＱｕｉｃｋｌｙＲｅａｃｔｉｎｇＳｙｓｔｅｍｏｆＥｎｔｅｒｐｒｉｓｅｅＰｒｏｄｕｃｔｉｏｎＰｌａｎＧｕｉｄｅｄｂｙＭａｒｋｅｔＧｏｎｇＧｕｏｈｕａ（ＳｈａｎｇｈａｉＵｎｉｖ...     

基于仿射混杂系统控制设计的机器人导航控制

根据单纯形仿射混杂系统的可达性分析设计控制律,使机器人在平面任意两点间运行,保证其安全性并考虑其最优性.对机器人的状态空间进行三角划分,根据目标吸引原理来建立其对偶图,针对对偶图提出路径规划算法得到最短路径穿越的三角形序列.然后根据仿射系统在单纯形中的性质,提出运动规划算法,得到机器人的角速度和线速度,控制机器人穿越给定的三角形序列到达目标点.仿真结果表明了方法的有效性.     

虚拟现实场景中提取2D导航地图的方法研究

虚拟现实技术向我们展示多姿多彩的景象，并且成为人机交互的趋势。由于Internet的普及，许多虚拟场景可以从网上直接免费获取；但是，在利用这些共享资源搭建自己的虚拟世界过程有这样一个问题：如何得到虚拟场景所对应的平面导航图。这种导航图是控制漫游路线的基础数据，但也是共享资源所欠缺的。本文提出模拟操纵法，通过模拟用户在虚拟场景漫游来获取路径数据，进而形成有效的平面导航图．     

基于混沌社会演化算法的文本聚类新方法

用K均值算法进行文本聚类通常只能以局部最优结束,很难找到全局最优.文章提出了一种基于混沌社会演化算法的文本聚类新方法.在该方法中提出了认知主体在聚类中对范式继承的方式,在认知主体对范式的背叛中提出一种混沌变异算子.实验证明该方法不但能有效地提高文本聚类的效率而且能有效地提高文本聚类的精度.     

一种基于结构熵的类内聚度度量方法

内聚度是指模块内各成分之间的联结强度。在面向对象软件系统中,内聚度主要是指类内部的属性和方法之间的联结强度。在类依赖图的基础上,提出了一种基于结构熵类内聚度度量方法,从类的属性与属性、属性与方法和方法与方法之间依赖关系3个方面对类的内聚度进行度量。并综合以上3种内聚度给出了一个类内聚度的度量方法,为评价类的内聚度提供了指南。     

ON THE THEORY OF RESOLVENTS AND ITS APPLICATIONS

1.IntroductionSomefrequentlyusedalgebraicalgorithmssharethesamepropertythattheytransformasetofpolynomialequationstoasinglepolynomialequationsuchthatthezerosetofthepolynomialsetandthehypersurfacedefinedbythesinglepolynomialareequivalentincertainsense.FOralgorithmswiththisproperty,wemaymention'thealgorithmtofindaprimitiveelementforafinitelygeneratedalgebraicextensionfield[1],thealgorithmtofindaplanecurvewhichisbirationaltoaspacealgebraiccur.e[2]!etc.Inthispaper,wepresentageneralalgorithmwhichcan…     

HAMILTONICITY IN 2-CONNECTED {K_(1,3) F}-FREE GRAPHS

ＨＡＭＩＬＴＯＮＩＣＩＴＹＩＮ２－ＣＯＮＮＥＣＴＥＤ｛Ｋ_（１，３）Ｆ｝－ＦＲＥＥＧＲＡＰＨＳ￥ＬＩＧｕｏｊｕｎ（ＭａｔｈｅｍａｔｉｃｓＤｅｐｅｒｔｍｅｎｔｏｆＹａｎｔａｉＴｅａｃｈｅｒ＇ｓＣｏｌｌｅｇｅ，Ｙａｎｔａｉ２６４０００，Ｃｈｉｎａ）ＬＩＵ?..     

具有中心车站的元胞自动机城市交通流模型

在Biham等人提出的二维元胞自动机交通流模型基础上,建立了具有中心车站的二维元胞自动机城市交通流模型,该模型考虑了对外交通对城市交通流的影响,推导出了这种二维CA交通流模型的演化方程.在计算机上模拟了在不同对外交通概率情况下的交通状况,得到了车辆在不同参数下交通流模型的基本演化图,进一步还模拟了城市长途车站数量对城市交通的影响.结果表明,较小的对外交通概率就会对城市交通状况产生较大的影响,适当增加中心车站的数量对城市交通状况有一定的改善.     

组合市场中消费者联盟形成及多方博弈的研究

关注电子商务的进一步发展,研究组合贸易中的消费者联盟形成及多方博弈问题.在给出一种多Agent中介系统控制的组合市场模型的基础上,使用群集分析方法对组合市场中大量消费者联盟形成过程的宏观动态特性进行仿真,通过数值仿真实验为组合市场中不同角色在贸易中所起的作用进行定量的分析,并为不同角色间的市场博弈提供定量分析的方法.     

基于T-不变量的可重复向量的求解算法

研究了Petri网中T-不变量与可重复向量之间的关系,并基于此关系给出一个求解可重复向量的新方法。首先定义了变迁扩充网的概念,证明一个网的可重复向量与其变迁扩充网的T-不变量之间存在一一对应关系,从而将一个网可重复向量的求解转换为其变迁扩充网T-不变量的求解上。在此方法中,如果利用FM-算法去求解T-不变量,则某些求解的步骤可以省略,从而得到一个类似于FM-算法的算法来求解可重复向量。此算法能够求出一组可重复向量,而任一可重复向量都可被这组可重复向量非负有理系数线性表出。     

连续对策上的计策理论

引进连续对策上的计策的概念，分别研究一个局中人中另一个局中人的概率和识破这个局中人的计策的概率，给出局中人的判断的准确性的一种度量。     

CONNECTED [1, k]-FACTORS OF BALANCE BIPARTITE GRAPHS

1.IntroductionAllgraphsconsideredaresimpleandfinite.Wereferthereaderto[1]forstandardgraphterminologiesnotdefinedinthispaper.LetGbeagraphwithvertexsetV(G)andedgesetE(G).ForanySCV(G),wedenotebyNG(S)theneighborsetofSinG,anddefineNG[S]=NG(S)US.LetdG(v)denotethedegreeofvinG.IfwewriteG=(VI,VZ),itmeansthatGisabipartitegraphwiththepartition(VI,V2)ofV(G).IfIVII=IVZI,wecallGabalancebipartitegraph.LetafbbetwopositiveintegerssuchthataSb.AspanningsubgraphFofGiscalledan[a,b]-factorofGi…     

A partial robust optimization approach to inventory management for the offline-to-online problem under different selling prices

This study examines an optimal inventory strategy when a retailer markets a product at different selling prices through a dual-channel supply chain, comprising an online channel and an offline channel. Using the operating pattern of the offline-to-online (O2O) business model, we develop a partial robust optimization (PRO) model. Then, we provide a closed-form solution when only the mean and standard deviation of the online channel demand distribution is known and the offline channel demand follows a uniform distribution (partial robust). Specifically, owing to the good structural properties of the solution, we obtain a heuristic ordering formula for the general distribution case (i.e., the offline channel demand follows a general distribution). In addition, a series of numerical experiments prove the rationality of our conjecture. Moreover, after comparing our solution with other possible policies, we conclude that the PRO approach improves the performance of incorporating the internet into an existing supply chain and, thus, is able to adjust the level of conservativeness of the solution. Finally, in a degenerated situation, we compare our PRO approach with a combination of information approach. The results show that the PRO approach has more “robust” performance. As a result, a reasonable trade-off between robustness and performance is achieved.     

Batching Scheduling in a Two-Level Supply Chain with Earliness and Tardiness Penalties

This paper studies the batch sizing scheduling problem with earliness and tardiness penalties which is closely related to a two-level supply chain problem. In the problem, there are K customer orders, where each customer order consisting of some unit length jobs has a due date. The jobs are processed in a common machine and then delivered to their customers in batches, where the size of each batch has upper and lower bounds and each batch may incur a fixed setup cost which can also be considered a fixed delivery cost. The goal is to find a schedule which minimizes the sum of the earliness and tardiness costs and the setup costs incurred by creating a new batch. The authors first present some structural properties of the optimal schedules for single-order problem with an additional assumption (a): The jobs are consecutively processed from time zero. Based on these properties, the authors give a polynomial-time algorithm for single-order problem with Assumption (a). Then the authors give dynamic programming algorithms for some special cases of multiple-order problem with Assumption (a). At last, the authors present some structural properties of the optimal schedules for single-order problem without Assumption (a) and give a polynomial-time algorithm for it.     

ON THE DESIGN OF A NEURO-FUZZY CONTROLLER–APPLICATION TO THE CONTROL OF A BIOREACTOR

1. Introduction Fuzzy controllers have interesting characteristics, principally concerning their robustness and their ability to integrate human knowledge in the design of control systems, allowing to a human operator to interpret, at every time, the action of the control system. However, the synthesis of a fuzzy controller, giving the controlled process a specified behaviour, is not an evident thing. Indeed, tuning the parameters of a fuzzy controller is often achieved by a succession of tria…