Why does it pay to be selfish in a MANET?

Routing protocols for a mobile ad hoc network have assumed that all mobile nodes voluntarily participate in forwarding others' packets. This was a reasonable assumption because all MNs in a MANET belonged to a single authority. In the near future, however, a MANET may consist of MNs that belong to many different organizations since numerous civilian applications are expected to crop up. In this situation, some MNs may run independently and purposely decide not to forward packets so as to save their own energy. This could potentially lead to network partitioning and corresponding performance degradation. To minimize such situations in MANETs, many studies have explored the use of both the carrot and the stick approaches by having reputation-based, credit-payment, and game theory schemes. This article summarizes existing schemes, identifies their relative advantages, and projects future directions     

Application of extended boundary conditions and the Haar wavelets in the analysis of wave scattering by thin screens

A recent approach to solution of 2D scattering problems for electromagnetic waves scattered by thin screens is analyzed. With the use of examples of scattering by a strip and an unclosed cylindrical surface, it is shown that the proposed approach has no advantages in terms of the efficiency of numerical solution over a well-known approach based on exact integral equations for currents that have singular kernels and that are solved with the Krylov-Bogoliubov method.     

Magnetically induced non-Faraday nonreciprocity in a fiber-optic gyroscope

Optical phase nonreciprocity is found to appear in fiber-optic gyroscopes as a result of a magnetically induced distortion of a propagating fiber mode. It is shown that this nonreciprocity places a limitation on the magnetic stability of a gyroscope.     

Finding structure in audio for music information retrieval

This paper presents a brief overview of recent approaches to two problems in music information retrieval: query by example and automated source separation. It describes the challenges inherent in musical query by example and the systems that take very different approaches to the problem. The paper also explores approaches to source separation in a musical context, focusing on systems that take distinct approaches to the problem. Finally, it comments about the future directions for digital signal processing (DSP) research in the context of music information retrieval.     

基于USB总线的虚拟频谱分析仪设计

文章详细介绍了基于USB总线的虚拟频谱分析仪的设计过程。该仪器使用嵌入式混合处理器MC56F8323来实现动态信号的实时采集、频谱分析和数字滤波等功能。处理结果由USB2．0接口芯片CY7C68013上传至PC机．以完成数据显示、存储、绘制图形等功能。其中，CY7C68013工作于Slave FIFO模式，以实现与MC56F8323间的数据传输。该系统可同时对两路动态信号进行实时谱分析，每路采样频率高选500kHz。     

高酸原油脱酸工艺技术研究

介绍了一种原油脱酸工艺方法。研究了温度、时间对高酸原油脱酸的影响,脱酸温度大于 260℃,脱酸反应较快。分析了高酸原油脱酸前后馏分酸值的变化,脱酸反应对130℃以上各馏分酸值降低都较多,180℃以上馏分脱酸率在80％以上。     

Routing Correlated Data with Fusion Cost in Wireless Sensor Networks

In this paper, we propose a routing algorithm called minimum fusion Steiner tree (MFST) for energy efficient data gathering with aggregation (fusion) in wireless sensor networks. Different from existing schemes, MFST not only optimizes over the data transmission cost, but also incorporates the cost for data fusion, which can be significant for emerging sensor networks with vectorial data and/or security requirements. By employing a randomized algorithm that allows fusion points to be chosen according to the nodes' data amounts, MFST achieves an approximation ratio of 5/4log(k + 1), where k denotes the number of source nodes, to the optimal solution for extremely general system setups, provided that fusion cost and data aggregation are nondecreasing against the total input data. Consequently, in contrast to algorithms that only excel in full or nonaggregation scenarios without considering fusion cost, MFST can thrive in a wide range of applications     

Parametric effects on the transient Voltage performance of a DC superconducting cable

The objective of this work was to determine the significant parameters of a 3-GW 200-kV dc superconducting cable system which influence the transient voltage distribution in the various parts of the cable. The cable system consists of four coaxial metallic cylinders. It was found that the dielectric constant and the electrical resistivity of the soil significantly affect the severity of the transient voltages; lower dielectric constant and higher resistivity of the soil will increase the magnitudes of the transient voltages by increasing the earth-return impedance. It was also found that the effect of the conductor internal impedances of the cable is insignificant. Shorting the coaxial cylinders of the cryogen flow and the cryostat will lessen the severity of the transient voltages. Grounding the second, third, and fourth cylinders at regular intervals with low-impedance grounding impedance will also improve the transient performance of the cable. More research is needed to evaluate these procedures.     

Sigma-delta modulators operating at a limit cycle

A new type of sigma-delta modulator that operates in a special mode named limit-cycle mode (LCM) is proposed. In this mode, most of the SDM building blocks operate at a frequency that is an integer fraction of the applied sampling frequency. That brings several very attractive advantages: a reduction of the required power consumption per converted bandwidth, an immunity to excessive loop delays and to digital-analog converter waveform asymmetry and a higher tolerance to clock imperfections. The LCMs are studied via a graphical application of the describing function theory. A second-order continuous time SDM with 5 MHz conversion bandwidth, 1 GHz sampling frequency and 125 MHz limit-cycle frequency is used as a test case for the evaluation of the performance of the proposed type of modulators. High level and transistor simulations are presented and compared with the traditional SDM designs.     

Protecting local access telecommunications networks: Toward a minimum-cost solution

The problem of designing fibre-optic networks for local-access telecommunications generates (at least) three non-trivial subproblems. In the first of these subproblems one must determine how many fibre-optic cables (fibres) are required at either end of a street. In the next subproblem a minimum-cost network must be designed to support the fibres. The network must also provide distinct paths from either end of the street to the central exchange(s). Finally, the fibre-optic cables must be placed in protective covers. These covers are available in a number of different sizes, allowing some flexibility when covering each section of the network. In this paper we describe a dynamic programming (DP) formulation for finding a minimum-cost (protective) covering for the network (the third of the subproblems). This problem is a generalised set covering problem with side constraints and is further complicated by the introduction of fixed and variable welding costs. The DP formulation selects covers along each arc (in the network), but cannot exactly model the fixed costs and so does not guarantee optimality. We also describe an integer programming (IP) formulation for assessing the quality of the DP solutions. The cost of the networks constructed by the IP model is less than those designed using the DP model, but the saving is not significant for the problems examined (less than 0.1%). This indicates that the DP model will generally give very good solutions. Furthermore, as the problem dimensions grow, DP gives significantly better solution times than IP.