基于“推送”技术的餐饮网站订餐模块的设计

随着生活节奏的加快,订餐已经成为人们餐饮生活工作中的一部分。为了适应这种业务的需要,许多餐饮企业都开展了送餐业务,并把订餐的功能放到了网上。本文从以客户为本的理念出,对餐饮网站总体功能的设计方法进行了描述,重点是对网络订餐功能进行了论述,包括订餐系统的需求分析、订餐业务流程、订餐算法、数据库和关键技术等内容。     

基于PHP和MySQL的校园订餐系统构建

该课题通过对网上订餐和实际校园环境进行需求分析,开发出一个基于互联网的B/S模式的B2C网上订餐系统,该系统分为前端和后台,订餐客户通过前端网页可以进行浏览和订餐,商家可以通过后台实现订餐处理和店铺管理。系统的数据库方面,使用关系数据库管理系统MySQL,系统安全性能更高,同时采用当前正在流行JavaScript、DIV+CSS和Ajax等技术编程集合使用Jquery框架使用户界面更加美观,用户体验更加完美。     

基于短信的企业订餐系统

介绍了基于短信的企业订餐系统的开发,实现了员工通过短信订餐、退餐,以及系统自动发送统计短信给食堂,发送欠费催缴、订餐提醒、订餐确认等短信给员工。     

基于Android和JavaEE订餐系统的设计与实现

针对目前手机订餐系统客户端与服务器端数据传输效率低,以及订餐后台管理系统架构可扩展性较弱,本文提出并实现了一种基于Android和Java EE的手机订餐系统。订餐客户端采用Json数据格式与服务器端进行数据交互,提高了网络数据传输效率。订餐后台管理系统采用SSH2+DWR整合框架使得展示层、业务层以及数据持久层三层分离,降低了系统的耦合性,提高了系统的扩展性与可维护性。实践证明,该架构实现的订餐系统能提高餐馆或者酒店的点菜服务质量以及网上订餐效率。     

基于LAMP的网上订餐系统的设计研究

随着网络技术的发展与普及,越来越多的人开始通过网络进行购物,同时网上订餐也走进了大家的视野,并且已经成为年轻人甚至是一部分其他群体的主要订餐方式。该文主要研究基于LAMP架构的网上订餐系统的设计与实现,该系统以Apache为服务器,以MySQL为数据库,以PHP为开发语言。该系统包括前台功能模块分类展示菜品信息,用户可以方便快捷的浏览和订餐;后台模块能全面的管理菜品、订单和会员信息,较好的保证数据的及时性、准确性和有效性。该网上订餐系统可以使餐厅通过站点,让顾客直接从网站订餐。     

网上订餐系统的设计实现

网上订餐系统是实现信息化食堂管理的一个重要环节。该文设计和实现了一个B/S结构的网上订餐系统,着重讨论订餐系统的功能与实现、数据流程及存储。该系统的主要功能包括职工管理、菜单管理、网上订餐、订单管理及财务结算。该网上订餐系统基于微软的.NET FRAMEWORK 4.0开发,采用IIS6.0+SQL SERVER 2005的Windows Server 2003服务器平台,前台使用HTML语言与JAVASCRIPT语言,后台使用ASP.NET与C#4.0。     

SpeedLine推出综合订餐解决方案

英国零售技术评论12月9日报道,餐厅POS开发商Speed Line最近又推出一种将网上订餐与呼叫中心相结合的餐厅综合订餐解决方案,直接与餐厅的POS系统整合,可降低成本,增加收入以及提高服务质量。由Dalphis Software提供呼叫中心订餐的界面以及网上订餐的网站,通过Speed Line Orderlink网关,将来自呼叫中心与订餐网站的订单实时送到餐厅的POS系统,从而使餐厅菜单、定价、     

基于手机短信的订餐系统设计与开发

手机的普及为移动电子商务的开展创造了条件.介绍了利用手机开展移动电子商务的3种主要模式,结合具体应用提出了一种构建在手机短信平台上的移动订餐系统.该系统利用J2ME和XML技术实现了订餐短信的自动生成,利用GSMModem实现了移动短信平台与计算机系统的集成,同时实现了订餐短信的自动分发路由.与其它基于手机短信的商业应用不同,该系统不依赖于通信运营商的端口,相对自主.短信订餐相对传统订餐方式有明显优势.     

网上订餐系统的设计与开发

传统的餐饮行业已不能满足消费者的需求,想要提高企业竞争力,吸引更多的消费者,利用互联网建立网上订餐系统已经是一大趋势。网上订餐系统基于B/S架构,采用PHP语言进行开发。本系统开发了会员信息注册、个人资料修改、菜品信息管理、订餐管理和留言信息管理等模块,实现了网上订餐系统的基本功能,可满足小型餐饮企业的需求。     

当外卖星探赚外快

对于不爱出门的宅男来说,打电话给订餐服务是生活中必不可少的内容之一,不过若是想让美食自己送上门,用户要么事先去附近餐厅索要联系方式,要么去网络上搜索大型快餐连锁的电话,而相对于传统的电话订餐方式及Web在线订餐网站,用手机APP订餐更智能化。比如,通过GPS定位可随时搜索到附近的外卖餐     

新型彩色图像形态学处理方法

提出了一种基于参考色彩的加权距离序与改进词典序相结合的彩色形态学算子定义方法,该方法利用L*a*b* 色彩模型与其极坐标表示形式,采用权值影响因子,将矢量映射为标量函数进行初始比较;同时结合词典序来解决距离相等的不足,提出一种基于λ模数的一般词典序方法,能任意调整量化函数,降低排列在先的分量作用,将其应用到彩色图像处理中。与传统距离和词典序的彩色形态相比,该方法既能得到与视觉判断相一致的分析结果,更能保持图像色彩平衡的能力,特别是在纹理边界区域,图像边缘细节更为丰富,可以得到更平滑的处理效果。     

基于改进词典序的彩色图像形态学研究

向量排序是彩色形态学应用中的关键问题。针对传统词典序中过度优先第一维向量的不足,提出一种基于α模数的一般词典序方法,能任意调整量化函数,降低排列在先的分量作用。将其应用到彩色图像处理中,与传统的词典序彩色形态学算子相比,实验结果表明算法具有出色的向量保持能力,显示出更优的降噪与图像分割性能。     

Extending stochastic ordering to belief functions on the real line

In this paper, the concept of stochastic ordering is extended to belief functions on the real line defined by random closed intervals. In this context, the usual stochastic ordering is shown to break down into four distinct ordering relations, called credal orderings, which correspond to the four basic ordering structures between intervals. These orderings are characterized in terms of lower and upper expectations. We then derive the expressions of the least committed (least informative) belief function credally less (respectively, greater) than or equal to a given belief function. In each case, the solution is a consonant belief function that can be described by a possibility distribution. A simple application to reliability analysis is used as an example throughout the paper.     

What is a Sorting Function?

What is a sorting function—not a sorting function for a given ordering relation, but a sorting function with nothing given?Formulating four basic properties of sorting algorithms as defining requirements, we arrive at intrinsic notions of sorting and stable sorting: A function is a sorting function if and only it is an intrinsically parametric permutation function. It is a stable sorting function if and only if it is an intrinsically stable permutation function.We show that ordering relations can be represented isomorphically as inequality tests, comparators and stable sorting functions, each with their own intrinsic characterizations, which in turn provide a basis for run-time monitoring of their expected I/O behaviors. The isomorphisms are parametrically polymorphically definable, which shows that it is sufficient to provide any one of the representations since the others are derivable without compromising data abstraction.Finally we point out that stable sorting functions as default representations of ordering relations have the advantage of permitting linear-time sorting algorithms; inequality tests forfeit this possibility.     

Integrated inventory and transportation decision for ubiquitous supply chain management

We consider price-dependent demand and develop an integrated inventory and transportation policy with strategic pricing to maximize the total profit for a ubiquitous enterprise. The proposed policy provides the optimal ordering, shipment and pricing decision. We first assume that demand for a product is a linear function of the price. A mathematical model for the total profit under quantity based dispatch is developed in consideration of ordering, shipment and pricing variables. Optimality properties for the model are then obtained and an efficient algorithm is provided to compute the optimal parameters for ordering, shipment and pricing decision. Finally, we extend our results to a more general case where demand for the product is a convex or a concave function of the price.     

Quantifying and mitigating the bullwhip effect in a benchmark supply chain system by an extended prediction self-adaptive control ordering policy

An undesired observation known as the bullwhip effect in supply chain management leads to excessive oscillations of the inventory and order levels. This paper presents how to quantify and mitigate the bullwhip effect by introducing model predictive control (MPC) strategy into the ordering policy for a benchmark supply chain system. Instead of quantifying the bullwhip effect with commonly used statistical measure, we derive equivalently the expression of bullwhip metric via control-theoretic approach by applying discrete Fourier transform and (inverse) z-transform when the demand signal is stationary stochastic. A four-echelon supply chain is formulated and its dynamical features are analyzed to give the discrete model. An extended prediction self-adaptive control (EPSAC) approach to the multi-step predictor is implemented in the development of MPC formulation. The closed-form solution to MPC problem is derived by minimizing a specified objective function. The transfer function for MPC ordering policy is then obtained graphically from an equivalent representation of this closed-form solution. A numerical simulation shows that MPC ordering policy outperforms the traditional ordering policies on reducing bullwhip effect.     

Decentralized and centralized model predictive control to reduce the bullwhip effect in supply chain management

Mitigating the bullwhip effect is one of crucial problems in supply chain management. In this research, centralized and decentralized model predictive control strategies are applied to control inventory positions and to reduce the bullwhip effect in a benchmark four-echelon supply chain. The supply chain under consideration is described by discrete dynamic models characterized by balance equations on product and information flows with an ordering policy serving as the control schemes. In the decentralized control strategy, a MPC-EPSAC (Extended Prediction Self-Adaptive Control) approach is used to predict the changes in the inventory position levels. A closed-form solution of an optimal ordering decision for each echelon is obtained by locally minimizing a cost function, which consists of the errors between predicted inventory position levels and their setpoints, and a weighting function that penalizes orders. The single model predictive controller used in centralized control strategy optimizes globally and finds an optimal ordering policy for each echelon. The controller relies on a linear discrete-time state-space model to predict system outputs. But the predictions are approached by either of two multi-step predictors depending on whether the states of the controller model are directly observed or not. The objective function takes a quadratic form and thus the resulting optimization problem can be solved via standard quadratic programming method. The comparisons on performances of the two MPC strategies are illustrated with a numerical example.     

A procedure for ordering fuzzy subsets of the unit interval

We introduce a function to help in the ordering of fuzzy subsets of the unit interval. This function is the integral of the mean of the level sets associated with the fuzzy subsets. Various properties of this function are studied.     

Thermodynamics of solid solutions with ordering tendencies

This paper describes a new procedure for the calculation of phase diagrams for quasibinary systems that show ordering phenomena near special stoichiometric compositions. The diagrams are calculated from excess Gibbs energy functions that are modulated in the solid state at the specified stoichiometric compositions by distribution functions of the Gauss type. These ‘Gaussian’ terms consider the contribution of the composition and temperature depending ordering energy to the excess Gibbs energy of the solid solution.

As the solid state is described in this way by a single continuous Gibbs function, the thermodynamic factor for interdiffusion in such quasibinary systems can also be derived as a single continuous function yielding negative values inside the miscibility gaps of the phase diagram.     

On combining support vector machines and simulated annealing in stereovision matching

This paper outlines a method for solving the stereovision matching problem using edge segments as the primitives. In stereovision matching, the following constraints are commonly used: epipolar, similarity, smoothness, ordering, and uniqueness. We propose a new strategy in which such constraints are sequentially combined. The goal is to achieve high performance in terms of correct matches by combining several strategies. The contributions of this paper are reflected in the development of a similarity measure through a support vector machines classification approach; the transformation of the smoothness, ordering and epipolar constraints into the form of an energy function, through an optimization simulated annealing approach, whose minimum value corresponds to a good matching solution and by introducing specific conditions to overcome the violation of the smoothness and ordering constraints. The performance of the proposed method is illustrated by comparative analysis against some recent global matching methods.