蓝牙技术在智能家庭网络系统设计中的运用

本文简要概述了智能家庭网络以及蓝牙技术在家庭组网技术中的优势,构建了基于蓝牙技术的智能家庭网络,介绍了蓝牙模块和内部协议构架,设计了蓝牙模块的通信接口电路。     

蓝牙技术及其现状与发展浅析

蓝牙技术是最近几年新发展起来的一种通用短距离无线数据/话音通信标准(或称作连接协议)。概 述了蓝牙的发展过程、技术特点及组网能力;介绍了蓝牙技术的应用领域以及有待解决的问题与未来发展趋势。     

基于嵌入式Linux的蓝牙以太网关设计

蓝牙技术作为一种新型短程无线通信技术,存在与其他通信协议的兼容性问题,介绍了蓝牙基本组网机制和数据分组格式,深入分析了蓝牙业务发现协议SDP和蓝牙局域网接入规范LAP,提出本地接入点LAP和蓝牙终端的一般业务发现过程.然后,基于嵌入式Linux操作系统搭建蓝牙网关嵌入式开发平台,提出可行的蓝牙网关系统结构,实现蓝牙匹克网与有线以太网之间的互联互通.     

遗传算法在蓝牙scatternet组网中的应用

蓝牙a＆hoc网络包括微微网与散射网两种组网方式,可以实现短距离无线通信,并能较好的满足实际需求。其中,散射网的拓扑结构与组网方式很大程度上影响与制约着蓝牙技术的应用。为了提高蓝牙散射网的组网效率与性能,文中提出了基于遗传算法的组网方式,通过该算法可较好的改进散射网的形成速度。     

基于蓝牙技术的组网和在个人局域网中的应用

首先,介绍了蓝牙技术的概念,指出了其适用于小型移动通信设备特别是个人局域网的组网和实现的特点。其次,重点分析了蓝牙组网的通信协议与其组网中的关键技术,提出了蓝牙系统的组成。最后,就蓝牙系统在个人局域网的应用前景进行了探讨。     

多跳蓝牙设备分散网的动态组网算法

近几年无线自组网络发展迅速,而蓝牙自组网的拓扑构建问题已成为无线自组网络研究的一个重要分支.目前已有很多学者提出了蓝牙设备在多跳环境下的不同组网协议的算法,但大多是针对静态的组网问题.对于蓝牙设备不在直接通讯范围内的多跳通讯要求以及节点的动态变化情况,提出了一种新的蓝牙设备分散网的分布创建思想,同时该算法满足动态性的要求.形成的分散网的拓扑结构采用类似树形结构、没有根节点的无环连通图,因而具有控制简洁,组网快捷的特点.     

基于卫星组网的分布式网络管理协议

网络管理协议是网络管理系统核心组成部分.根据卫星组网的特点和管理需求提出了一种分布式卫星组网管理协议--层次化卫星组网管理协议(HSNMP),该协议由层间协议、子网间协议和子网内协议3部分组成.设计了协议的操作原语及其协议数据单元.HSNMP不仅能保证正确、有效地完成卫星组网管理任务,而且具有良好的可扩展性.最后通过卫星组网仿真系统对该协议在不同卫星组网中的有效性进行了仿真验证.     

蓝牙无线远程控制的应用研究

蓝牙技术由于其优越的性质而得到越来越广泛的应用,它具有一定的组网能力,可以应用于社会的各个领域。本文阐述了蓝牙无线技术的重要性质,对它的组网模式进行归纳,并描述了蓝牙组建无线远程控制网络的具体方案。     

基于蓝牙的无线传感器网络节点设计与实现

根据传感器网络技术的应用发展需求,设计了一种基于蓝牙和LPC2114的无线传感器网络节点。介绍了节点总体架构以及各硬件模块:传感器模块、数据处理模块、无线通信模块和电源模块的设计,阐述了蓝牙无线传感器网络的组网方法。设计的传感器网络节点性能稳定,具有较强的实用价值。     

蓝牙技术在组建无线局域网中的应用

本文对蓝牙技术做了介绍,并就组网体系结构做了说明,对蓝牙技术的发展趋势做了展望。     

On the absence of global solutions for quantum versions of Schrödinger equations and systems

We, first, consider the quantum version of the nonlinear Schrödinger equation

$i^q{D}_{q|t}u(t,x)+\Delta u(qt,x)=\lambda |u(qt,x){|}^p,t>0,x\in {\mathbb{R}}^N,$

where $0<q<1$, $i^q$ is the principal value of $i^q$, $D_{q|t}$ is the $q$-derivative with respect to $t$, $\Delta$ is the Laplacian operator in ${\mathbb{R}}^N$, $\lambda \in ??\left\{0\right\}$, $p>1$, and $u(t,x)$ is a complex-valued function. Sufficient conditions for the nonexistence of global weak solution to the considered equation are obtained under suitable initial data. Next, we study the system of nonlinear coupled equations

$i^q{D}_{q|t}u(t,x)+\Delta u(qt,x)=\lambda |v(qt,x){|}^p,t>0,x\in {\mathbb{R}}^N,$

$i^q{D}_{q|t}v(t,x)+\Delta v(qt,x)=\lambda |u(qt,x){|}^m,t>0,x\in {\mathbb{R}}^N,$     

Edge-bipancyclicity of the k-ary n-cubes with faulty nodes and edges

The k-ary n-cube has been one of the most popular interconnection networks for massively parallel systems. In this paper, we investigate the edge-bipancyclicity of k-ary n-cubes with faulty nodes and edges. It is proved that every healthy edge of the faulty k-ary n-cube with f_v faulty nodes and f_e faulty edges lies in a fault-free cycle of every even length from 4 to kⁿ − 2f_v (resp. kⁿ − f_v) if k ? 4 is even (resp. k ? 3 is odd) and f_v + f_e ? 2n − 3. The results are optimal with respect to the number of node and edge faults tolerated.     

Digital Steiner sets and Matheron semi-groups

There are various ways to define digital convexity in Zⁿ$Z^n$. The proposed approach focuses on structuring elements (and not the sets under study), whose digital versions should allow to construct hierarchies of operators satisfying Matheron semi-groups law _γλγμ=_γmax(λ,_μ)${\gamma }_{\lambda }{\gamma }_{\mu }={\gamma }_{\max (\lambda \text{,}\mu )}$, where λ$\lambda$ is a size factor. In Rⁿ$R^n$ the convenient class is the Steiner one. Its elements are Minkowski sums of segments. We prove that it admits a digital equivalent when the segments of Zⁿ$Z^n$ are Bezout. The conditions under which the Steiner sets are convex in Zⁿ$Z^n$, and are connected, are established. The approach is then extended to structuring elements that vary according to the law of perspective, and also to anamorphoses, so that the digital Steiner class and its properties can extend to digital spaces as a sphere or a torus.     

Paths in Möbius cubes and crossed cubes

The Möbius cube MQn and the crossed cube CQn are two important variants of the hypercube Qn. This paper shows that for any two different vertices u and v in G∈{MQn,CQn} with n?3, there exists a uv-path of every length from dG(u,v)+2 to n²−1 except for a shortest uv-path, where dG(u,v) is the distance between u and v in G. This result improves some known results.     

Cycles passing through a prescribed path in a hypercube with faulty edges

Let Qn denote an n-dimensional hypercube with n?2, P be a path of length h in Qn and F⊂E(Qn)\E(P). Recently, Tsai proved that if 1?h?n−1 and |F|?n−1−h, then in the graph Qn−F the path P lies on a cycle of every even length from 2h+2 to n², and P also lies on a cycle of length 2h if |F|?h−2. In this paper, we show that if 1?h?2n−3 and |F|?n−2−⌊h/2⌋, then in Qn−F the path P lies on a cycle of every even length from 2h+2 to n², and P also lies on a cycle of length 2h if P contains two edges of the same dimension or P is a shortest path and |F∩E(Qh)|?h−2, where Qh is the h-dimensional subcube containing the path P. Moreover, the upper bound 2n−3 of h is sharp and the upper bound n−2−⌊h/2⌋ of |F| is sharp for any given h with 1?h?2n−3.     

Note on nonparametric spectral analysis of wideband spectrum with missing data via sample-and-hold interpolation and deconvolution

In [1] a procedure for bias-free estimation of the autocorrelation function is introduced for equidistantly sampled data with randomly occurring samples being invalid. The method incorporates sample-and-hold interpolation of the missing data points. The occurring dynamic error of the primary estimate of the correlation function is treated by a deconvolution procedure with two parameters $c_0$ and $c_1$ with $c_0+2c_1=1$, which are the on-diagonal and the aside-diagonal parameters of a specific correction matrix (at all lag times except zero). The parameters $c_0$ and $c_1$ were obtained as a function of the probability α of a sample to be valid by numerical simulation. However, explicit expressions for the parameters $c_0(\alpha )=1-\frac{2}{\alpha }+\frac{2}{{\alpha }^2}$ and $c_1(\alpha )=\frac{1}{\alpha }-\frac{1}{{\alpha }^2}$ can be derived, which might improve the usability of the deconvolution procedure in [1].     

Optimal fault-tolerant embedding of paths in twisted cubes

The twisted cube is an important variation of the hypercube. It possesses many desirable properties for interconnection networks. In this paper, we study fault-tolerant embedding of paths in twisted cubes. Let _TQn(V,E)${\mathit{TQ}}_n(V,E)$ denote the n-dimensional twisted cube. We prove that a path of length l   can be embedded between any two distinct nodes with dilation 1 for any faulty set F⊂V(_TQn)∪E(_TQn)$F\subset V({\mathit{TQ}}_n)\cup E({\mathit{TQ}}_n)$ with |F|?n-3$\left|F\right|?n-3$ and any integer l   with 2^n-1-1?l?|V(_TQn-F)|-1$2^{n-1}-1?l?|V({\mathit{TQ}}_n-F)|-1$ (n?3$n?3$). This result is optimal in the sense that the embedding has the smallest dilation 1. The result is also complete in the sense that the two bounds on path length l   and faulty set size |F|$\left|F\right|$ for a successful embedding are tight. That is, the result does not hold if l?2^n-1-2$l?2^{n-1}-2$ or |F|?n-2$\left|F\right|?n-2$. We also extend the result on (n-3)$(n-3)$-Hamiltonian connectivity of _TQn${\mathit{TQ}}_n$ in the literature.     

Thermodynamic assessment of the KCl–K2CO3–NaCl–Na2CO3 system

Phase equilibria and thermodynamic properties of the KCl–K₂CO₃–NaCl–Na₂CO₃ system were analyzed on the basis of the thermodynamic evaluation of the KCl–NaCl,KCl–K₂CO₃,NaCl–Na₂CO₃,K₂CO₃–Na₂CO₃ and KCl–K₂CO₃–NaCl–Na₂CO₃ systems. The Gibbs energies of individual phases was approximated by two-sublattice models for ionic liquids and crystals. Most of the experimental information was well described by the present set of thermodynamic parameters. The lowest monovariant eutectic temperature in the KCl–NaCl–Na₂CO₃ system is located at 573 ^°C, with a composition of X_Na2CO3=0.31,X_KCl=0.35 and X_NaCl=0.34.