SNR bounds of FSO links and its evaluation for selected beams

We formulate the signal-to-noise ratio (SNR) for free-space optical links. Upon inserting typical operating parameters, it is seen that SNR well approximates to the inverse of aperture averaged scintillation parameter. By adopting a common source beam power of 10 mW, we select three different source sizes of Gaussian, annular Gaussian (AG), and cosh-Gaussian beams. We then evaluate the SNR of these beams. Our results indicate that when fixed aperture opening is used, fully and partially coherent beams yield almost the same SNR performance. On the other hand, however, focusing and lowering wavelength of operation appear to be quite instrumental in improving the SNR performance. In this context, medium-sized AGB seems to exhibit the best performance.     

Estimation of missing observations in two‐level split‐plot designs

Inserting estimates for the missing observations from split‐plot designs restores their balanced or orthogonal structure and alleviates the difficulties in the statistical analysis. In this article, we extend a method due to Draper and Stoneman to estimate the missing observations from unreplicated two‐level factorial and fractional factorial split‐plot (FSP and FFSP) designs. The missing observations, which can either be from the same whole plot, from different whole plots, or comprise entire whole plots, are estimated by equating to zero a number of specific contrast columns equal to the number of the missing observations. These estimates are inserted into the design table and the estimates for the remaining effects (or alias chains of effects as the case with FFSP designs) are plotted on two half‐normal plots: one for the whole‐plot effects and the other for the subplot effects. If the smaller effects do not point at the origin, then different contrast columns to some or all of the initial ones should be discarded and the plots re‐examined for bias. Using examples, we show how the method provides estimates for the missing observations that are very close to their actual values. Copyright © 2007 John Wiley & Sons, Ltd.     

Approximate and exact hybrid algorithms for private nearest-neighbor queries with database protection

Mobile devices with global positioning capabilities allow users to retrieve points of interest (POI) in their proximity. To protect user privacy, it is important not to disclose exact user coordinates to un-trusted entities that provide location-based services. Currently, there are two main approaches to protect the location privacy of users: (i) hiding locations inside cloaking regions (CRs) and (ii) encrypting location data using private information retrieval (PIR) protocols. Previous work focused on finding good trade-offs between privacy and performance of user protection techniques, but disregarded the important issue of protecting the POI dataset D. For instance, location cloaking requires large-sized CRs, leading to excessive disclosure of POIs (O(|D|) in the worst case). PIR, on the other hand, reduces this bound to \(O(\sqrt{|D|})\), but at the expense of high processing and communication overhead. We propose hybrid, two-step approaches for private location-based queries which provide protection for both the users and the database. In the first step, user locations are generalized to coarse-grained CRs which provide strong privacy. Next, a PIR protocol is applied with respect to the obtained query CR. To protect against excessive disclosure of POI locations, we devise two cryptographic protocols that privately evaluate whether a point is enclosed inside a rectangular region or a convex polygon. We also introduce algorithms to efficiently support PIR on dynamic POI sub-sets. We provide solutions for both approximate and exact NN queries. In the approximate case, our method discloses O(1) POI, orders of magnitude fewer than CR- or PIR-based techniques. For the exact case, we obtain optimal disclosure of a single POI, although with slightly higher computational overhead. Experimental results show that the hybrid approaches are scalable in practice, and outperform the pure-PIR approach in terms of computational and communication overhead.     

Auto-tuning Similarity Search Algorithms on Multi-core Architectures

In recent times, large high-dimensional datasets have become ubiquitous. Video and image repositories, financial, and sensor data are just a few examples of such datasets in practice. Many applications that use such datasets require the retrieval of data items similar to a given query item, or the nearest neighbors (NN or $k$ -NN) of a given item. Another common query is the retrieval of multiple sets of nearest neighbors, i.e., multi $k$ -NN, for different query items on the same data. With commodity multi-core CPUs becoming more and more widespread at lower costs, developing parallel algorithms for these search problems has become increasingly important. While the core nearest neighbor search problem is relatively easy to parallelize, it is challenging to tune it for optimality. This is due to the fact that the various performance-specific algorithmic parameters, or “tuning knobs”, are inter-related and also depend on the data and query workloads. In this paper, we present (1) a detailed study of the various tuning knobs and their contributions on increasing the query throughput for parallelized versions of the two most common classes of high-dimensional multi-NN search algorithms: linear scan and tree traversal, and (2) an offline auto-tuner for setting these knobs by iteratively measuring actual query execution times for a given workload and dataset. We show experimentally that our auto-tuner reaches near-optimal performance and significantly outperforms un-tuned versions of parallel multi-NN algorithms for real video repository data on a variety of multi-core platforms.     

5G双频组网策略研究与应用

2.6 GHz和4.9 GHz双频组网中,用户驻留策略取决于4.9 GHz小区的建设用途,根据不同需求有不同的策略和配置方案.本文基于实际网络经验,结合用户体验和业务需求,提出了5G双频网策略的配置建议.     

Coarse‐to‐Fine Isometric Shape Correspondence by Tracking Symmetric Flips

We address the symmetric flip problem that is inherent to multi‐resolution isometric shape matching algorithms. To this effect, we extend our previous work which handles the dense isometric correspondence problem in the original 3D Euclidean space via coarse‐to‐fine combinatorial matching. The key idea is based on keeping track of all optimal solutions, which may be more than one due to symmetry especially at coarse levels, throughout denser levels of the shape matching process. We compare the resulting dense correspondence algorithm with state‐of‐the‐art techniques over several 3D shape benchmark datasets. The experiments show that our method, which is fast and scalable, is performance‐wise better than or on a par with the best performant algorithms existing in the literature for isometric (or nearly isometric) shape correspondence. Our key idea of tracking symmetric flips can be considered as a meta‐approach that can be applied to other multi‐resolution shape matching algorithms, as we also demonstrate by experiments.     

River: an intermediate language for stream processing

This paper presents both a calculus for stream processing, named Brooklet, and its realization as an intermediate language, named River. Because River is based on Brooklet, it has a formal semantics that enables reasoning about the correctness of source translations and optimizations. River builds on Brooklet by addressing the real‐world details that the calculus elides. We evaluated our system by implementing front‐ends for three streaming languages, and three important optimizations, and a back‐end for the System S distributed streaming runtime. Overall, we significantly lower the barrier to entry for new stream‐processing languages and thus grow the ecosystem of this crucial style of programming. Copyright © 2015 John Wiley & Sons, Ltd.     

Review and comparative evaluation of symbolic dynamic filtering for detection of anomaly patterns

Symbolic dynamic filtering (SDF) has been recently reported in literature as a pattern recognition tool for early detection of anomalies (i.e., deviations from the nominal behavior) in complex dynamical systems. This paper presents a review of SDF and its performance evaluation relative to other classes of pattern recognition tools, such as Bayesian Filters and Artificial Neural Networks, from the perspectives of: (i) anomaly detection capability, (ii) decision making for failure mitigation and (iii) computational efficiency. The evaluation is based on analysis of time series data generated from a nonlinear active electronic system. This work has been supported in part by the U.S. Army Research Laboratory and the U.S. Army Research Office under Grant No. W911NF-07-1-0376, by the U.S. Office of Naval Research under Grant No. N00014-08-1-380, and by NASA under Cooperative Agreement No. NNX07AK49A.     

The effect of different starter cultures and ripening temperatures on formation of biogenic amine in Turkish fermented sausages

Different starter culture added groups (Group I: Lactobacillus sake, Staphylococcus xylosus; Group II: Lactobacillus plantarum, Staphylococcus carnosus; Group III: Lactobacillus curvatus, Staphylococcus carnosus, and Staphylococcus xylosus) and control group sausage samples were produced experimentally at two different temperatures (22 and 26 °C). In raw materials and all groups, by the 0th, 2nd, 5th and 7th days of the ripening period, the analysis of HPLC and biogenic amine (tyramine, histamine, cadaverine, putrescine, phenylethylamine, tryptamine, spermine, and spermidine) amounts, microbiological (Lactic acid bacteria, Micrococcus/Staphylococcus, Enterobacteriaceae, Enterococcus spp., and moulds–yeasts) and chemical (pH, dry matter, and salt) have been done. During the ripening period, there is no statistical discrepancy (P > 0.05) in terms of biogenic amine amounts, microbiological, and chemical values detected from the sausage samples produced at 26 and 22 °C. However, in both levels of temperature, there is statistical discrepancy (P < 0.001) detected in terms of tyramine, putrescine values and the count of Enterococcus spp. between the starter culture added samples and control group samples. By this study, it has been stated that the ripening temperature does not make any statistical discrepancy (P > 0.05) for all values but the use of starter culture prevents the formation of biogenic amine in Turkish fermented sausages.