《中图法》与《中分表》修订信息(连载5)

发布自2012年以来《中分表》的日常修订信息,以及《中图法》第5版修订信息。

RESEARCH ON VALUE OF INFORMATION SHARING IN ONE SUPPLIER-MULTIPLE RETAILER SUPPLY CHAIN

Prior research has generally focused on models involving a single or multiple retailers with independent demands. The value of demand information sharing is analyzed in a two-level supply chain involving one supplier-multiple retailer model in which retailer demands may be correlated. Each member in the supply chain forecasts its demand using an AR (1) demand process. Two conditions of the information sharing are considered (1) Without the information sharing, the retailers only communicate their orders to the supplier. (2) With the information sharing, retailers communicate their orders and forecasting models to the supplier. Analyses showthat the reductions of supplier's average inventory and average costs are substantial with the information sharing. However, the retailers donot get direct benefit from the information sharing. The retailers may ask the supplier to reduce the replenishment leadtime, so that the retailers will obtain substantial cost savings and inventory reduction. Both partners may obtain benefits when information sharing and leadtime reduction are implemented together.

Efficient Quantum Secure Communication Protocol by Rearranging Particle Orders

We propose a quantum secure communication protocol by using three-particle GHZ states. In this protocol, we utilize the ideas of the rearranging orders and the sequence transmission. The sender of messages, Alice, first disturbs the particle orders in an initial sequence, and then sends the sequence of the disturbed orders to the receiver of messages, Bob. Under Alice＇s introduction, Bob rearranges the sequence back to the initial sequence. By making a GHZ state measurement on each of the three particles in turn, Bob can attain Alice＇s secret messages. In addition, we still calculate the efficiency of our three-particle GHZ protocol and generalize it to the case using multi-particle GHZ state.

HHR:Hierarchical Hybrid Routing Scheme for Information-Centric Network

Publish/subscribe(pub/sub) paradigm is the main communication model for Information-Centric Network(ICN) proposals.A key issue for pub/sub system is how to route the content objects to the correct subscribers,and ICN is no exception.ICN network would be divided into core domain and many edge domains as today's internet does.HHR(Hierarchy Hybrid Routing scheme) is presented for ICN:A Chord-like routing scheme is used in core domain,while edge domains routing structure can be classified into three categories,Local Routing(LR),Delivery of Local Publication to Core domain(DLPC),and Remote Publication Routing into edge domain(RPR).LR can be decided by each edge domain,which determined by many factors,such as locality characteristic for pub/sub information and local policies.A hierarchical routing algorithm is proposed to solve DLPC and RPR simultaneously.Simulation results demonstrate that HHR can be fast deployed,and can be applied in large scale network or dynamic subscription environment.

Analysis of Economic Order Quantity Under Fuzzy Environments

In the economic order quantity （EOQ） model, the decision maker has vague information about holding cost, ordering cost and market demand. With these uncertainties characterized as fuzzy variables, a new formula is developed by analyzing the fuzzy total cost. By comparing with other four EOQ formulas, i.e., using the crisp numbers with the highest membership values in classic EOQ formula, using the expected values of fuzzy parameters in classic EOQ formula, using the fuzzy variables in classic EOQ formula and then calculating the expected value, and calculat- ing EOQ by hybrid intelligent algorithm simulation, the effectiveness of this formula Js illustrated.

Recognizing the Automorphism Groups of Mathieu Groups Through Their Orders and Large Degrees of Their Irreducible Characters＊

It is a well-known fact that characters of a finite group can give important information about the structure of the group. It was also proved by the third author that a finite simple group can be uniquely determined by its character table. Here the authors attempt to investigate how to characterize a finite almost-simple group by using less information of its character table, and successfully characterize the automorphism groups of Mathieu groups by their orders their character tables. and at most two irreducible character degrees of