OpenRaiser/Intern-Atlas huggingface dataset:
Geometric Registration of High-genus Surfaces
Venue: arXiv cs.CG 2013
Year: 2013

This paper presents a method to obtain geometric registrations between high-genus ($g\geq 1$) surfaces. Surface registration between simple surfaces, such as simply-connected open surfaces, has been well studied. However, very few works have been carried out for the registration of high-genus surfaces. The high-genus topology of the surface poses great challenge for surface registration. A possible approach is to partition surfaces into simply-connected patches and registration is done patch by patch. Consistent cuts are required, which are usually difficult to obtain and prone to error. In this work, we propose an effective way to obtain geometric registration between high-genus surfaces without introducing consistent cuts. The key idea is to conformally parameterize the surface into its universal covering space, which is either the Euclidean plane or the hyperbolic disk embedded in $\mathbb{R}^2$. Registration can then be done on the universal covering space by minimizing a shape mismatching energy measuring the geometric dissimilarity between the two surfaces. Our proposed algorithm effectively computes a smooth registration between high-genus surfaces that matches geometric information as much as possible. The algorithm can also be applied to find a smooth and bijective registration minimizing any general energy functionals. Numerical experiments on high-genus surface data show that our proposed method is effective for registering high-genus surfaces with geometric matching. We also applied the method to register anatomical structures for medical imaging, which demonstrates the usefulness of the proposed algorithm.
Speech Enhancement Using Pitch Detection Approach For Noisy Environment
Venue: arXiv cs.SD 2013
Year: 2013

Acoustical mismatch among training and testing phases degrades outstandingly speech recognition results. This problem has limited the development of real-world nonspecific applications, as testing conditions are highly variant or even unpredictable during the training process. Therefore the background noise has to be removed from the noisy speech signal to increase the signal intelligibility and to reduce the listener fatigue. Enhancement techniques applied, as pre-processing stages; to the systems remarkably improve recognition results. In this paper, a novel approach is used to enhance the perceived quality of the speech signal when the additive noise cannot be directly controlled. Instead of controlling the background noise, we propose to reinforce the speech signal so that it can be heard more clearly in noisy environments. The subjective evaluation shows that the proposed method improves perceptual quality of speech in various noisy environments. As in some cases speaking may be more convenient than typing, even for rapid typists: many mathematical symbols are missing from the keyboard but can be easily spoken and recognized. Therefore, the proposed system can be used in an application designed for mathematical symbol recognition (especially symbols not available on the keyboard) in schools.
Revisiting Bayesian Blind Deconvolution
Venue: arXiv cs.CV 2013
Year: 2013

Blind deconvolution involves the estimation of a sharp signal or image given only a blurry observation. Because this problem is fundamentally ill-posed, strong priors on both the sharp image and blur kernel are required to regularize the solution space. While this naturally leads to a standard MAP estimation framework, performance is compromised by unknown trade-off parameter settings, optimization heuristics, and convergence issues stemming from non-convexity and/or poor prior selections. To mitigate some of these problems, a number of authors have recently proposed substituting a variational Bayesian (VB) strategy that marginalizes over the high-dimensional image space leading to better estimates of the blur kernel. However, the underlying cost function now involves both integrals with no closed-form solution and complex, function-valued arguments, thus losing the transparency of MAP. Beyond standard Bayesian-inspired intuitions, it thus remains unclear by exactly what mechanism these methods are able to operate, rendering understanding, improvements and extensions more difficult. To elucidate these issues, we demonstrate that the VB methodology can be recast as an unconventional MAP problem with a very particular penalty/prior that couples the image, blur kernel, and noise level in a principled way. This unique penalty has a number of useful characteristics pertaining to relative concavity, local minima avoidance, and scale-invariance that allow us to rigorously explain the success of VB including its existing implementational heuristics and approximations. It also provides strict criteria for choosing the optimal image prior that, perhaps counter-intuitively, need not reflect the statistics of natural scenes. In so doing we challenge the prevailing notion of why VB is successful for blind deconvolution while providing a transparent platform for introducing enhancements.
Fast Feature Reduction in intrusion detection datasets
Venue: arXiv cs.CR 2013
Year: 2013

In the most intrusion detection systems (IDS), a system tries to learn characteristics of different type of attacks by analyzing packets that sent or received in network. These packets have a lot of features. But not all of them is required to be analyzed to detect that specific type of attack. Detection speed and computational cost is another vital matter here, because in these types of problems, datasets are very huge regularly. In this paper we tried to propose a very simple and fast feature selection method to eliminate features with no helpful information on them. Result faster learning in process of redundant feature omission. We compared our proposed method with three most successful similarity based feature selection algorithm including Correlation Coefficient, Least Square Regression Error and Maximal Information Compression Index. After that we used recommended features by each of these algorithms in two popular classifiers including: Bayes and KNN classifier to measure the quality of the recommendations. Experimental result shows that although the proposed method can't outperform evaluated algorithms with high differences in accuracy, but in computational cost it has huge superiority over them.
Small Support Equilibria in Large Games
Venue: arXiv cs.GT 2013
Year: 2013

In this note we provide a new proof for the results of Lipton et al. on the existence of an approximate Nash equilibrium with logarithmic support size. Besides its simplicity, the new proof leads to the following contributions: 1. For n-player games, we improve the bound on the size of the support of an approximate Nash equilibrium. 2. We generalize the result of Daskalakis and Papadimitriou on small probability games from the two-player case to the general n-player case. 3. We provide a logarithmic bound on the size of the support of an approximate Nash equilibrium in the case of graphical games.
Characterization of Rational Ruled Surfaces
Venue: arXiv cs.SC 2013
Year: 2013

The ruled surface is a typical modeling surface in computer aided geometric design. It is usually given in the standard parametric form. However, it can also be in the forms than the standard one. For these forms, it is necessary to determine and find the standard form. In this paper, we present algorithms to determine whether a given implicit surface is a rational ruled surface. A parametrization of the surface is computed for the affirmative case. We also consider the parametric situation. More precisely, after a given rational parametric surface is determined as a ruled one, we reparameterize it to the standard form.
Adaptive Frequency Domain Detectors for SC-FDE in Multiuser DS-UWB Systems with Structured Channel Estimation and Direct Adaptation
Venue: arXiv cs.IT 2013
Year: 2013

In this paper, we propose two adaptive detection schemes based on single-carrier frequency domain equalization (SC-FDE) for multiuser direct-sequence ultra-wideband (DS-UWB) systems, which are termed structured channel estimation (SCE) and direct adaptation (DA). Both schemes use the minimum mean square error (MMSE) linear detection strategy and employ a cyclic prefix. In the SCE scheme, we perform the adaptive channel estimation in the frequency domain and implement the despreading in the time domain after the FDE. In this scheme, the MMSE detection requires the knowledge of the number of users and the noise variance. For this purpose, we propose simple algorithms for estimating these parameters. In the DA scheme, the interference suppression task is fulfilled with only one adaptive filter in the frequency domain and a new signal expression is adopted to simplify the design of such a filter. Least-mean squares (LMS), recursive least squares (RLS) and conjugate gradient (CG) adaptive algorithms are then developed for both schemes. A complexity analysis compares the computational complexity of the proposed algorithms and schemes, and simulation results for the downlink illustrate their performance.
Boosting with the Logistic Loss is Consistent
Venue: arXiv cs.LG 2013
Year: 2013

This manuscript provides optimization guarantees, generalization bounds, and statistical consistency results for AdaBoost variants which replace the exponential loss with the logistic and similar losses (specifically, twice differentiable convex losses which are Lipschitz and tend to zero on one side). The heart of the analysis is to show that, in lieu of explicit regularization and constraints, the structure of the problem is fairly rigidly controlled by the source distribution itself. The first control of this type is in the separable case, where a distribution-dependent relaxed weak learning rate induces speedy convergence with high probability over any sample. Otherwise, in the nonseparable case, the convex surrogate risk itself exhibits distribution-dependent levels of curvature, and consequently the algorithm's output has small norm with high probability.
A study for the effect of the Emphaticness and language and dialect for Voice Onset Time (VOT) in Modern Standard Arabic (MSA)
Venue: arXiv cs.CL 2013
Year: 2013

The signal sound contains many different features, including Voice Onset Time (VOT), which is a very important feature of stop sounds in many languages. The only application of VOT values is stopping phoneme subsets. This subset of consonant sounds is stop phonemes exist in the Arabic language, and in fact, all languages. The pronunciation of these sounds is hard and unique especially for less-educated Arabs and non-native Arabic speakers. VOT can be utilized by the human auditory system to distinguish between voiced and unvoiced stops such as /p/ and /b/ in English.This search focuses on computing and analyzing VOT of Modern Standard Arabic (MSA), within the Arabic language, for all pairs of non-emphatic (namely, /d/ and /t/) and emphatic pairs (namely, /d?/ and /t?/) depending on carrier words. This research uses a database built by ourselves, and uses the carrier words syllable structure: CV-CV-CV. One of the main outcomes always found is the emphatic sounds (/d?/, /t?/) are less than 50% of non-emphatic (counter-part) sounds ( /d/, /t/).Also, VOT can be used to classify or detect for a dialect ina language.
Using Exclusive Web Crawlers to Store Better Results in Search Engines' Database
Venue: arXiv cs.IR 2013
Year: 2013

Crawler-based search engines are the mostly used search engines among web and Internet users, involve web crawling, storing in database, ranking, indexing and displaying to the user. But it is noteworthy that because of increasing changes in web sites search engines suffer high time and transfers costs which are consumed to investigate the existence of each page in database while crawling, updating database and even investigating its existence in any crawling operations. "Exclusive Web Crawler" proposes guidelines for crawling features, links, media and other elements and to store crawling results in a certain table in its database on the web. With doing this, search engines store each site's tables in their databases and implement their ranking results on them. Thus, accuracy of data in every table (and its being up-to-date) is ensured and no 404 result is shown in search results since, in fact, this data crawler crawls data entered by webmaster and the database stores whatever he wants to display.
Automatic Parameter Adaptation for Multi-object Tracking
Venue: arXiv cs.CV 2013
Year: 2013

Object tracking quality usually depends on video context (e.g. object occlusion level, object density). In order to decrease this dependency, this paper presents a learning approach to adapt the tracker parameters to the context variations. In an offline phase, satisfactory tracking parameters are learned for video context clusters. In the online control phase, once a context change is detected, the tracking parameters are tuned using the learned values. The experimental results show that the proposed approach outperforms the recent trackers in state of the art. This paper brings two contributions: (1) a classification method of video sequences to learn offline tracking parameters, (2) a new method to tune online tracking parameters using tracking context.
Interference-Aware Channel Assignment for Maximizing Throughput in WMN
Venue: arXiv cs.NI 2013
Year: 2013

Wireless Mesh network (WMN) is dynamically self-organizing and self-configured, with the nodes in the network automatically establishing an ad-hoc network and maintaining the mesh connectivity. The ability to use multiple-radios and multiple channels can be cashed to increase aggregate throughput of wireless mesh network. Thus the efficient use of available interfaces and channels without interference becomes the key factor. In this paper we propose, interference aware clustered based channel assignment schemes which minimizes the interference and increases throughput. In our proposed scheme we have given priority to minimize interference from nearby mesh nodes in interference range than maximizing channel diversity. We simulated our proposed work using NS-3 and results show that our scheme improves network performance than BFSCA and Distributed Greedy CA.
Multi-q Pattern Classification of Polarization Curves
Venue: arXiv cs.CE 2013
Year: 2013

Several experimental measurements are expressed in the form of one-dimensional profiles, for which there is a scarcity of methodologies able to classify the pertinence of a given result to a specific group. The polarization curves that evaluate the corrosion kinetics of electrodes in corrosive media are an application where the behavior is chiefly analyzed from profiles. Polarization curves are indeed a classic method to determine the global kinetics of metallic electrodes, but the strong nonlinearity from different metals and alloys can overlap and the discrimination becomes a challenging problem. Moreover, even finding a typical curve from replicated tests requires subjective judgement. In this paper we used the so-called multi-q approach based on the Tsallis statistics in a classification engine to separate multiple polarization curve profiles of two stainless steels. We collected 48 experimental polarization curves in aqueous chloride medium of two stainless steel types, with different resistance against localized corrosion. Multi-q pattern analysis was then carried out on a wide potential range, from cathodic up to anodic regions. An excellent classification rate was obtained, at a success rate of 90%, 80%, and 83% for low (cathodic), high (anodic), and both potential ranges, respectively, using only 2% of the original profile data. These results show the potential of the proposed approach towards efficient, robust, systematic and automatic classification of highly non-linear profile curves.
Opportunistic Interference Management for Multicarrier systems
Venue: arXiv cs.IT 2013
Year: 2013

We study opportunistic interference management when there is bursty interference in parallel 2-user linear deterministic interference channels. A degraded message set communication problem is formulated to exploit the burstiness of interference in M subcarriers allocated to each user. We focus on symmetric rate requirements based on the number of interfered subcarriers rather than the exact set of interfered subcarriers. Inner bounds are obtained using erasure coding, signal-scale alignment and Han-Kobayashi coding strategy. Tight outer bounds for a variety of regimes are obtained using the El Gamal-Costa injective interference channel bounds and a sliding window subset entropy inequality. The result demonstrates an application of techniques from multilevel diversity coding to interference channels. We also conjecture outer bounds indicating the sub-optimality of erasure coding across subcarriers in certain regimes.
A fast method for implementation of the property lists in programming languages
Venue: arXiv cs.PL 2013
Year: 2013

One of the major challenges in programming languages is to support different data structures and their variations in both static and dynamic aspects. One of the these data structures is the property list which applications use it as a convenient way to store, organize, and access standard types of data. In this paper, the standards methods for implementation of the Property Lists, including the Static Array, Link List, Hash and Tree are reviewed. Then an efficient method to implement the property list is presented. The experimental results shows that our method is fast compared with the existing methods.
DREAM_OLSR PROTOCOL (Distance Routing Effective Algorithm for Mobility - Optimized Link State Routing)
Venue: arXiv cs.NI 2013
Year: 2013

This paper lays down a proposal of protocol named DREAM_OLSR. The protocol has been developed so as to effect current OLSR (RFC 3626) [4] protocol. The protocol establishes an optimized solution hence the name has been manipulated from Open Link State Routing to DREAM Optimized Link State Routing. DREAM specifies Distance Routing Effective Algorithm for Mobility wherein it implements the Distance routing effective algorithm for the optimized solution. This optimization includes higher efficiency and fewer overheads for the MANET.
A computer algebra user interface manifesto
Venue: arXiv cs.SC 2013
Year: 2013

Many computer algebra systems have more than 1000 built-in functions, making expertise difficult. Using mock dialog boxes, this article describes a proposed interactive general-purpose wizard for organizing optional transformations and allowing easy fine grain control over the form of the result even by amateurs. This wizard integrates ideas including: * flexible subexpression selection; * complete control over the ordering of variables and commutative operands, with well-chosen defaults; * interleaving the choice of successively less main variables with applicable function choices to provide detailed control without incurring a combinatorial number of applicable alternatives at any one level; * quick applicability tests to reduce the listing of inapplicable transformations; * using an organizing principle to order the alternatives in a helpful manner; * labeling quickly-computed alternatives in dialog boxes with a preview of their results, * using ellipsis elisions if necessary or helpful; * allowing the user to retreat from a sequence of choices to explore other branches of the tree of alternatives or to return quickly to branches already visited; * allowing the user to accumulate more than one of the alternative forms; * integrating direct manipulation into the wizard; and * supporting not only the usual input-result pair mode, but also the useful alternative derivational and in situ replacement modes in a unified window.
Interference Channel with Intermittent Feedback
Venue: arXiv cs.IT 2013
Year: 2013

We investigate how to exploit intermittent feedback for interference management. Focusing on the two-user linear deterministic interference channel, we completely characterize the capacity region. We find that the characterization only depends on the forward channel parameters and the marginal probability distribution of each feedback link. The scheme we propose makes use of block Markov encoding and quantize-map-and-forward at the transmitters, and backward decoding at the receivers. Matching outer bounds are derived based on novel genie-aided techniques. As a consequence, the perfect-feedback capacity can be achieved once the two feedback links are active with large enough probabilities.
Generalized Diversity-Multiplexing Tradeoff of Half-Duplex Relay Networks
Venue: arXiv cs.IT 2013
Year: 2013

Diversity-multiplexing trade-off has been studied extensively to quantify the benefits of different relaying strategies in terms of error and rate performance. However, even in the case of a single half-duplex relay, which seems fully characterized, implications are not clear. When all channels in the system are assumed to be independent and identically fading, a fixed schedule where the relay listens half of the total duration for communication and transmits the second half combined with quantize-map-and-forward relaying (static QMF) is known to achieve the full-duplex performance [1]. However, when there is no direct link between the source and the destination, a dynamic decode-and-forward (DDF) strategy is needed [2]. It is not clear which one of these two conclusions would carry to a less idealized setup, where the direct link can be neither as strong as the other links nor fully non-existent. In this paper, we provide a generalized diversity-multiplexing trade-off for the half-duplex relay channel which accounts for different channel strengths and recovers the two earlier results as two special cases. We show that these two strategies are sufficient to achieve the diversity-multiplexing trade-off across all channel configurations, by characterizing the best achievable trade-off when channel state information (CSI) is only available at the receivers (CSIR). However, for general relay networks we show that a generalization of these two schemes through a dynamic QMF strategy is needed to achieve optimal performance.
Delay and Doppler Spreads of Non-Stationary Vehicular Channels for Safety Relevant Scenarios
Venue: arXiv cs.NI 2013
Year: 2013

Vehicular communication channels are characterized by a non-stationary time- and frequency-selective fading process due to rapid changes in the environment. The non-stationary fading process can be characterized by assuming local stationarity for a region with finite extent in time and frequency. For this finite region the wide-sense stationarity and uncorrelated-scattering (WSSUS) assumption holds approximately and we are able to calculate a time and frequency dependent local scattering function (LSF). In this paper, we estimate the LSF from a large set of measurements collected in the DRIVEWAY'09 measurement campaign, which focuses on scenarios for intelligent transportation systems. We then obtain the time-frequency-varying power delay profile (PDP) and the time-frequency-varying Doppler power spectral density (DSD) from the LSF. Based on the PDP and the DSD, we analyze the time-frequency-varying root mean square (RMS) delay spread and the RMS Doppler spread. We show that the distribution of these channel parameters follows a bi-modal Gaussian mixture distribution. High RMS delay spread values are observed in situations with rich scattering, while high RMS Doppler spreads are obtained in drive-by scenarios.