用于超短激光脉冲技术的高精度数字同步机的研究

数字同步机是用来解决超短激光脉冲输出大晃动问题的一种高精度宽延时范围的数字同步系统.对于不同的延时时间,以巧妙地运用数字延时和模拟延时相结合的方法,满足不同延时时间的实验要求,保证了各延时段临界点的延时精度.数字同步机实现一路标准时钟脉冲输出,四路延时脉冲输出,输出脉冲的晃动值≤500ps,很好地满足了实验要求.     

Improved algorithms for synchronizing computer network clocks

The Network Time Protocol (NTP) is widely deployed in the Internet to synchronize computer clocks to each other and to international standards via telephone modem, radio and satellite. The protocols and algorithms have evolved over more than a decade to produce the present NTP Version 3 specification and implementations. Most of the estimated deployment of 100000 NTP servers and clients enjoy synchronization to within a few tens of milliseconds in the Internet of today. This paper describes specific improvements developed for NTP Version 3 which have resulted in increased accuracy, stability and reliability in both local-area and wide-area networks. These include engineered refinements of several algorithms used to measure time differences between a local clock and a number of peer clocks in the network, as well as to select the best subset from among an ensemble of peer clocks and combine their differences to produce a local dock accuracy better than any in the ensemble. This paper also describes engineered refinements of the algorithms used to adjust the time and frequency of the local clock, which functions as a disciplined oscillator. The refinements provide automatic adjustment of algorithm parameters in response to prevailing network conditions, in order to minimize network traffic between clients and busy servers while maintaining the best accuracy. Finally, this paper describes certain enhancements to the Unix operating system kernel software in order to realize submillisecond accuracies with fast workstations and networks     

Distributed event-triggered path construction in wireless sensor networks

We consider the problem of guiding mobile agents to visit a subset of sensor nodes called event nodes in wireless sensor networks without location information, where the set of event nodes is not known in advance. As the set of event nodes changes over time, a path needs to be updated on-line. We propose a novel distributed algorithm to construct and update such a dynamic path to visit a set of event nodes. To the best of our knowledge, this is the first work to solve this problem using a distributed algorithm without any location information. Our approach is to maintain the Voronoi diagram of the dynamic set of event nodes implicitly in sensor networks. Doing so, we overcome the lack of location information and implement scalable distributed dynamic navigation. For computing an optimal path is NP-Hard, we prove that the ratio of the length of the constructed path by our algorithm to that of the optimal path is bounded by O(log k), where k is the number of event nodes, under a reasonable assumption. Our approach can be used to compute both an event visiting tour which requires to return to a starting point and an event visiting path which does not return to a starting point. We also extend our method to navigate multiple agents so that they collectively visit a set of event nodes.     

Network classless time protocol based on clock offset optimization

Time synchronization is critical in distributed environments. A variety of network protocols, middleware and business applications rely on proper time synchronization across the computational infrastructure and depend on the clock accuracy. The Network Time Protocol (NTP) is the current widely accepted standard for synchronizing clocks over the Internet. NTP uses a hierarchical scheme in order to synchronize the clocks in the network. In this paper we present a novel non-hierarchical peer-to-peer approach for time synchronization termed CTP-Classless Time Protocol. This approach exploits convex optimization theory in order to evaluate the impact of each clock offset on the overall objective function. We define the clock offset problem as an optimization problem and derive its optimal solution. Based on the solution we develop a distributed protocol that can be implemented over a communication network, prove its convergence to the optimal clock offsets and show its properties. For compatibility, CTP may use the packet format and number of measurements used by NTP. We also present methodology and numerical results for evaluating and comparing the accuracy of time synchronization schemes. We show that the CTP outperforms hierarchical schemes such as NTP in the sense of clock accuracy with respect to a universal clock.     

轻量化卷积神经网络红外目标识别性能分析与FPGA实现

随着深度学习应用于计算机视觉,其数据量大、网络层结构复杂,在硬件部署中存在资源不足、延时高等成为关键问题,本文通过分析五种较有代表性轻量化网络的优缺点,提出一种将轻量化网络应用到红外目标检测领域的基于MobileNet的轻量化网络改进,并以FPGA为硬件载体实现。该网络使用Tanh激活函数替代原有激活函数并简化网络层数,以适应红外目标的特征提取,针对深度学习目标检测算法在硬件实现方面存在的数据量大,资源占用大,运算延时高等问题,采用FPGA进行硬件实现。实验表明,在Xilinx Zynq-7020 XA开发板上,设定时钟频率100 MHz,输入图像大小为640×512,改进后的MobileNet在保证原相同精度情况下实现5.1 ms每张图像。     

A Quorum-based Mechanism as an Enhancement to Clock Synchronization Protocols for IEEE 802.11 MANETs

In wireless mobile ad hoc networks (MANETs), it is essential that all mobile hosts (MHs) are synchronized to a common clock to support the power-saving (PS) mechanism. Many protocols have been proposed for clock synchronization in IEEE 802.11 MANETs. However, it is practically impossible for any protocol to completely solve the asynchronism problem especially when connectivity is achieved by multi-hop communication or when a network could be temporarily disconnected. In this work, we propose a quorum-based mechanism, which includes a new structure of beacon intervals for MHs to detect potential asynchronous neighbors and an enhanced beacon transmission rule to assist clock synchronization protocols to discover asynchronous neighbors within bounded time. The proposed mechanism should be regarded as an enhancement to existing clock synchronization protocols. Our simulation results show that the mechanism can effectively relieve the clock asynchronism problem for IEEE 802.11 MANETs     

基于Windows日志的电子证据获取与分析方法研究

为解决Windows日志的实时获取问题,针对2种日志文件格式,分别提出了相应的日志实时获取方法。在实时获取日志的基础上,提出了将日志文件与原子攻击功能关联的方法,将对日志文件的分析转换成对原子攻击功能的分析,大大减少了日志文件分析的时间。提出了一种基于时间的日志关联分析和事件重构方法,实现对计算机犯罪场景的还原。实验结果表明,提出的方法可以有效获取日志证据,重构犯罪过程。     

Efficient and Robust Protocols for Local Detection and Propagation in Smart Dust Networks

Smart Dust is a set of a vast number of ultra-small fully autonomous computing and communication devices, with very restricted energy and computing capabilities, that co-operate to quickly and efficiently accomplish a large sensing task. Smart Dust can be very useful in practice, i.e., in the local detection of a remote crucial event and the propagation of data reporting its realization. In this work we make an effort towards the research on smart dust from an algorithmic point of view. We first provide a simple but realistic model for smart dust and present an interesting problem, which is how to propagate efficiently information on an event detected locally. Then we present various smart dust protocols for local detection and propagation that are simple enough to be implemented on real smart dust systems, and perform, under some simplifying assumptions, a rigorous average case analysis of their efficiency and energy consumption (and their interplay). This analysis leads to concrete results showing that our protocols are very efficient and robust. We also validate the analytical results by extensive experiments.     

The use of symmetric multi-way two phase ranging to compensate time drift in wireless sensor network

This paper studies the impact of crystal clock drift on the ranging accuracy. A novel technique in which a group of sensor devices, each having a different clock drift, can reduce this adverse effect by a 2-phase round robin fashion is presented. In comparison to the conventional way of point-to-point group ranging scheme, this technique has the desirable advantage of low energy consumption, which is a very important requirement in wireless sensor networks. The ability to reduce the effect of timing drift is illustrated in the simulation results where our proposed method outperforms prior works under the effect of clock drift on the ranging accuracy.     

Real-Time Receiver Clock Jump Detection for Code Absolute Positioning with Kalman Filter

In global navigation satellite systems (GNSS) navigation the receiver and satellite clocks play a key role. The receivers are usually equipped with inaccurate quartz clocks, which experiment large drift relative to system time and consequently offset growing very fast; receiver manufactures bound the magnitude of the receiver clock offset to prevent it becomes too large and the actual bounding procedures vary from one manufacturer to another. The most common approach consists of introducing discrete jumps when the offset exceeds a threshold (usually 1 ms). This method is common in low-cost GNSS receivers and influences several applications as differential positioning, cycle-slip detection, precise point positioning technique, absolute positioning with Kalman filter. In this work some techniques to detect and account for millisecond clock jump, suitable for code positioning of a single receiver with Kalman filter, are proposed. Two deterministic algorithms to detect receiver clock jumps are shown: in measurement and parameter domain. The technique in measurement domain uses current pseudorange measurements compared with pseudorange and Doppler measurements at previous epoch; the technique in parameter domain compares current and previous least squares estimations of receiver clock bias, considering the clock drift. Two different approaches are described to account for the clock jumps, once detected, a deterministic one, consisting of fixing the pseudorange discontinuities, and a statistic one, consisting of suitably varying the Kalman filter settings. A static GNSS data set is processed with and without the proposed algorithms to demonstrate their efficiency.     

Parameter estimation and error reduction for OFDM-based WLANs

We consider parameter estimation and error reduction for orthogonal frequency-division multiplexing (OFDM) based high-speed wireless local area networks (WLANs). We devise or select algorithms that can provide benefit to the overall system performance and can be efficiently implemented in real-time. In particular, first, we give a channel model which is especially useful for assessing the channel parameter estimation methods devised for OFDM-based WLANs. Second, we provide a sequential method for the estimation of carrier frequency offset (CFO), symbol timing, and channel response by exploiting the structure of the packet preamble specified by the IEEE 802.11a standard. Finally, to correct the residue CFO induced phase error using the pilot tones, we consider maximum-likelihood phase tracking and least-squares phase fitting approaches; to improve the channel estimation accuracy using the decoded data, we present a semiblind channel estimation method; to mitigate the sampling clock induced time delay error, we provide a sampling clock synchronization approach that obviates the need of an automatic frequency control clock recovery circuit. The overall system performance of using our algorithms is demonstrated via several numerical examples.     

RTS-MAC: A Relative Time Synchronization MAC Protocol for Low Duty Cycle Body Sensor Networks

Emerging applications in the medical field require body sensor networks to communicate in real-time in a very energy-efficient way. An example is the Artificial Accommodation System??a set of two small active medical implants aiming at restoring accommodation of the human eye??in which sensor data have to be exchanged continuously between both eyes. To achieve energy efficiency, it is essential to operate the radios with a very low duty cycle. Therefore, idle listening and general protocol overhead must be reduced as much as possible. In this paper, we present a relative time synchronization medium access control protocol (RTS-MAC), which keeps relative time synchronization between two or more sensor nodes in a very energy-efficient manner: RTS-MAC makes use of the periodic broadcast of regular data messages and exploits the inter-arrival times to predict future arrivals within tight boundaries. Thereby, no overhead is generated for synchronization purposes, and still, idle listening is reduced to a minimum, which solely depends on the short-term accuracy of the underlying clock systems. We implemented the proposed protocol using off-the-shelf components and employed the internal low-accuracy oscillators of the microcontrollers as clock sources. Thereby, we achieved very low duty cycles close to an ideal minimum. Further, our results indicate that through omitting external crystals in favor of a minimally larger battery, the battery life of a sensor node can be prolonged.     

On Fast and Accurate Detection of Unauthorized Wireless Access Points Using Clock Skews

We explore the use of clock skew of a wireless local area network access point (AP) as its fingerprint to detect unauthorized APs quickly and accurately. The main goal behind using clock skews is to overcome one of the major limitations of existing solutions—the inability to effectively detect Medium Access Control (MAC) address spoofing. We calculate the clock skew of an AP from the IEEE 802.11 Time Synchronization Function (TSF) time stamps sent out in the beacon/probe response frames. We use two different methods for this purpose—one based on linear programming and the other based on least-square fit. We supplement these methods with a heuristic for differentiating original packets from those sent by the fake APs. We collect TSF time stamp data from several APs in three different residential settings. Using our measurement data as well as data obtained from a large conference setting, we find that clock skews remain consistent over time for the same AP but vary significantly across APs. Furthermore, we improve the resolution of received time stamp of the frames and show that with this enhancement, our methodology can find clock skews very quickly, using 50-100 packets in most of the cases. We also discuss and quantify the impact of various external factors including temperature variation, virtualization, clock source selection, and NTP synchronization on clock skews. Our results indicate that the use of clock skews appears to be an efficient and robust method for detecting fake APs in wireless local area networks.     

Inter-Data Commonality Detection for Spectrum Monitoring in Wireless Sensor Networks

Cooperative spectrum monitoring with multiple sensors has been deemed as an efficient mechanism for improving the monitoring accuracy and enlarging the monitoring area in wireless sensor networks.However,there exists redundancy among the spectrum data collected by a sensor node within a data collection period,which may reduce the data uploading efficiency.In this paper,we investigate the inter-data commonality detection which describes how much two data have in common.We define common segment set and divide it into six categories firstly,then a method to measure a common segment set is conducted by extracting commonality between two files.Moreover,the existing algorithms fail in finding a good common segment set,so Common Data Measurement(CDM)algorithm that can identify a good common segment set based on inter-data commonality detection is proposed.Theoretical analysis proves that CDM algorithm achieves a good measurement for the commonality between two strings.In addition,we conduct an synthetic dataset which are produced randomly.Numerical results shows that CDM algorithm can get better performance in measuring commonality between two binary files compared with Greedy-String-Tiling(GST)algorithm and simple greedy algorithm.     

基于有向拓扑势的用户角色分析方法

真实世界中存在大量有向、加权、动态的网络。针对有向加权网络的节点角色分析问题,提出了一种基于有向拓扑势的节点角色分析方法,该方法根据节点的行为模式及局部影响力将节点划分成4种角色。然后介绍了基于节点角色的动态网络演化分析方法,它能对角色行为进行动力学建模,展示了随时间连接模式的变化,并能检测较大影响的事件。实验结果表明,本方法能有效估计节点角色并检测动态网络的演化。     

Estimating distances via connectivity in wireless sensor networks

Distance estimation is vital for localization and many other applications in wireless sensor networks. In this paper, we develop a method that employs a maximum‐likelihood estimator to estimate distances between a pair of neighboring nodes in a static wireless sensor network using their local connectivity information, namely the numbers of their common and non‐common one‐hop neighbors. We present the distance estimation method under a generic channel model, including the unit disk (communication) model and the more realistic log‐normal (shadowing) model as special cases. Under the log‐normal model, we investigate the impact of the log‐normal model uncertainty; we numerically evaluate the bias and standard deviation associated with our method, which show that for long distances our method outperforms the method based on received signal strength; and we provide a Cramér–Rao lower bound analysis for the problem of estimating distances via connectivity and derive helpful guidelines for implementing our method. Finally, on implementing the proposed method on the basis of measurement data from a realistic environment and applying it in connectivity‐based sensor localization, the advantages of the proposed method are confirmed. Copyright © 2012 John Wiley & Sons, Ltd.     

WebAnalyzer: accurate detection of HTTP attack traces in web server logs

This paper presents a tool for detecting attacks against web server, using the analysis of web server log files. The main characteristic of this tool is its accuracy, being able to carefully graduate its analysis according to the actual success of the attacker. This capability is based on the design of a simple yet powerful signature definition language. We demonstrate the accuracy of the tool using a set of log lines representing several attack conditions and attack results.     

Solving multicommodity integral flow problems by simulated allocation

The paper discusses a stochastic approach, called Simulated Allocation (SA), to the capacitated and uncapacitated multicommodity integral flow allocation problems. Since such problems are in general NP‐complete, effective heuristic approaches are of interest, and SA is one of them. The idea of SA has its origin in discrete event simulation of alternative call routing in telecommunication networks. We describe an implementation of SA and illustrate its effectiveness by means of numerical examples including multiple knapsack problem and network design. Numerical experiments indicate that SA is capable of bypassing local minima of the problem objective function, and allows for achieving reasonable solutions in a reasonable time. This revised version was published online in June 2006 with corrections to the Cover Date.     

A Parallel Hill Climbing Algorithm for Pushing Dependent Data in Clients–Providers–Servers Systems

The up-link bandwidth in satellite networks and in advanced traffic wireless information system is very limited. A server broadcasts data files provided by different independent providers and accessed by many clients in a round-robin manner. The clients who access these files may have different patterns of access. Some clients may wish to access several files in any order (AND), some wish to access one out of several files (OR), and some clients may access a second file only after accessing another file (IMPLY). The goal of the server is to order the files in a way that minimizes the access time of the clients given some a priori knowledge of their access patterns. An appropriate clients–servers model was recently proposed by Bay-Noy, Naor and Schieber. They formulated three separate problems and proposed an algorithm that evaluates certain number of random permutations and chooses the one whose access time is minimized. In this paper, we formulate a combined AOI (AND-OR-IMPLY) problem, and propose to apply a parallel hill climbing algorithm (to each of the four problems), which begins from certain number of random permutations, and then applies hill climbing technique on each of them until there is no more improvement. The evaluation time of neighboring permutations generated in hill climbing process is optimized, so that it requires O(n) time per permutation instead of O(n ²) time required for evaluating access time of a random permutation, where n is the number of files the server broadcasts. Experiments indicate that the parallel hill climbing algorithm is O(n) times faster that random permutations method, both in terms of time needed to evaluate the same number of permutations, and time needed to provide a high quality solution. Thus the improvement is significant for broadcasting large number of files.     

Peptides secondary structure prediction with neural networks: acriterion for building appropriate learning sets

Artificial neural networks have been recently applied with success for protein secondary structure prediction. So far, one of the two main aspects on which neural net performance depends, the topology of the net, has been considered. The present work addresses the other main aspect, the building up of the learning set. The author presents a criterion to build up suitable learning sets based on the α-helix percentage. Starting from a set of several well known proteins, the author formed 7 groups of proteins with similar helix percentages and used them for the learning of the same neural net. The author found that the best secondary structure prediction for each of the tested proteins (not belonging to the initial set) was the one obtained using the learning set whose helix percentage was closest to that of the tested protein. The accuracy of correct prediction of the author's method on 3 types of secondary structure (α-helix, β-sheet and coil), has been compared with the accuracy of other secondary structure prediction methods