Optimization of plasma-deposited silicon oxinitride films for optical channel waveguides

In view of applications of SiO_xN_y thin films in MOEMS technology, a study of the optomechanical characteristics of the PECVD deposited material are investigated. To optimize the quality of SiO_xN_y layers we establish the relationship between the chemical properties, optical performances, micromechanical stress, and growth parameters of deposited films. To use the SiO_xN_y thin film for the core layer of a strip-loaded waveguide, we propose preparation conditions of SiO_xN_y that offer a low-loss optical waveguide with well-controlled refractive index, based on a low-internal stress multilayer structure.     

On L(d,1)-labelings of graphs

Given a graph G and a positive integer d, an L(d,1)-labeling of G is a function f that assigns to each vertex of G a non-negative integer such that if two vertices u and v are adjacent, then |f(u)−f(v)|d; if u and v are not adjacent but there is a two-edge path between them, then |f(u)−f(v)|1. The L(d,1)-number of G, λ_d(G), is defined as the minimum m such that there is an L(d,1)-labeling f of G with f(V){0,1,2,…,m}. Motivated by the channel assignment problem introduced by Hale (Proc. IEEE 68 (1980) 1497–1514), the L(2,1)-labeling and the L(1,1)-labeling (as d=2 and 1, respectively) have been studied extensively in the past decade. This article extends the study to all positive integers d. We prove that λ_d(G)Δ²+(d−1)Δ for any graph G with maximum degree Δ. Different lower and upper bounds of λ_d(G) for some families of graphs including trees and chordal graphs are presented. In particular, we show that the lower and the upper bounds for trees are both attainable, and the upper bound for chordal graphs can be improved for several subclasses of chordal graphs.     

利用子波变换模拟人眼视觉信息提取过程的研究

由于人类视觉系统在对图象信息进行初级加工过程中表现出由粗到细且能使其局域化的特性,而子波变换恰恰正好具有这样的特性.本文提出了利用DOG函数作为子波基函数,模拟人眼视觉信息提取过程,并给出了两维模拟计算的结果.提出了基于子波变换理论的视觉信息提取通道模型.在文中讨论了这一模型的特点和潜在的应用前景.     

Labeling bipartite permutation graphs with a condition at distance two

An L(p,q)-labeling of a graph G is an assignment f from vertices of G to the set of non-negative integers {0,1,…,λ} such that |f(u)−f(v)|≥p if u and v are adjacent, and |f(u)−f(v)|≥q if u and v are at distance 2 apart. The minimum value of λ for which G has L(p,q)-labeling is denoted by λ_p,q(G). The L(p,q)-labeling problem is related to the channel assignment problem for wireless networks.In this paper, we present a polynomial time algorithm for computing L(p,q)-labeling of a bipartite permutation graph G such that the largest label is at most (2p−1)+q(bc(G)−2), where bc(G) is the biclique number of G. Since λ_p,q(G)≥p+q(bc(G)−2) for any bipartite graph G, the upper bound is at most p−1 far from optimal.     

Minimization of channel electron multiplier background counting rate

In this paper we discuss background counting rate minimization of a channel electron multiplier (CEM) using it in simple pulse counting mode. The minimization was investigated by a variable additional bias voltage applied to an aluminium source carrier set in front of a CEM entrance tube. For an optimal bias voltage of −20 V we found the background counting rate to be reduced to one twenty fifth of its value with no additional bias voltage applied.     

Timed Petri nets and prediction to improve the Chandy–Misra conservative-distributed simulation

The main contribution of this paper shows that distributed simulation of timed Petri nets (TPN) can take advantage of their structure to obtain a significant lookahead which is usually difficult to compute with other models. In this paper, we introduce a conservative-distributed simulation with a reduced number of control messages and without deadlock resolution. This approach is based on a part of optimism computed on the prediction time each logical process can determine for its advancement. Obviously this prediction time must be computed easily according to the structure of the simulated logical process. Timed Petri nets meet these requirements and we use their structure to evaluate the depth of the prediction. In conservative-distributed simulation, it is known that the deeper the prediction, the better the efficiency of the simulation. We present a method we have devised based on channel time prediction. We compare its performance to the Chandy–Misra method and to some related Petri nets approaches (Chiola). Experiments carried out on Sun stations show that there is more parallelism and a reduced number of null messages in the cases of deadlock avoidance. Moreover, considering deadlock detection and resolution technique we observe that in many cases no deadlock occurs with less control messages.     

UMFSK水声通信技术研究

在MFSK基础上,本文提出了UMFSK信道编码方法。采用窄带调频和跳频调制技术,故在一定程度上抑制了由多途效应引起的码内/码间干扰;提出了基于UMFSK的实时信道标校技术,可对信道进行稳键均衡,抗信道多途引起的码内干扰。进行了湖试,取得了试验数据并进行了数据分析。分析表明：UMFSK可抑制码元相消干涉引起的码内干扰,其效果随码元调频带宽的增大而变好;信道标校技术可对信道进行稳键均衡,并由于结构简单,可做到实时实现。基于UMFSK的误码率为10^-3（通信带宽2kHz,速率100-150bps)。     

Reciprocal supply chain with intention

The traditional hypothesis of “rationality” is far from perfect. Models of fairness solely based on consequence cannot explain why the same consequence of an action is perceived and reciprocated differently. A reciprocity model which accounts for both consequence and its underlying intention is presented in this paper to illustrate the effect of intention in a traditional dyadic channel where one supplier plays a Stackelberg-like game with one retailer. This research aims to investigate how reciprocity may affect the members’ decisions and the channel’s coordination. In this study, two scenarios are discussed: (1) the retailer has a preference for reciprocity while the supplier does not and (2) both the retailer and the supplier have a preference for reciprocity. Results for acrimonious supply chain (γμ>1$\gamma \mu >1$) and harmonious supply chain (γμ?1$\gamma \mu ?1$) are analyzed. Furthermore, we derive equilibria under the two scenarios and prove the existence and the uniqueness of the equilibria. The results show that intention plays an important role in decision making of the supply chain and will significantly change the equilibria. Moreover, an acrimonious supply chain can be coordinated with a simple wholesale-price contract under certain conditions, which can never happen in a traditional channel. A harmonious supply chain, however, cannot be coordinated in any way.     

More than a second channel? Supply chain strategies in B2B spot markets

The emergence of B2B spot markets has greatly facilitated spot trading and impacted supply chain structures as well as the way commercial transactions take place between firms in many industries. While providing new opportunities, the B2B spot market also exposes participants to a price risk. This new business landscape raises some important questions on how the supplier and manufacturer should change their sales channel and procurement strategies and tailor their decisions to this changing environment. In this paper, we study the channel-choice, pricing and ordering/production decisions of the risk-averse supplier and manufacturer in a two-tier supply chain with a B2B spot market. Our analysis shows that, to benefit from the B2B spot market and control the risk exposure, the upstream supplier should develop an integrated channel-choice and pricing strategy. When the supplier adopts a dual-channel strategy, the equilibrium contract price decreases in the supplier’s risk attitude, but increases in the demand uncertainty. However, it first decreases and then increases in the manufacturer’s risk attitude and spot price volatility. We conclude that rather than simply being a second channel, the B2B spot market provides a strategic tool to supply chain members to achieve an advantageous position in their contract trading.