OpenRaiser/Intern-Atlas huggingface dataset:
The Characteristics of the Factors That Govern the Preferred Force in the Social Force Model of Pedestrian Movement
Venue: arXiv cs.IT 2010
Year: 2010

The social force model which belongs to the microscopic pedestrian studies has been considered as the supremacy by many researchers and due to the main feature of reproducing the self-organized phenomena resulted from pedestrian dynamic. The Preferred Force which is a measurement of pedestrian's motivation to adapt his actual velocity to his desired velocity is an essential term on which the model was set up. This Force has gone through stages of development: first of all, Helbing and Molnar (1995) have modeled the original force for the normal situation. Second, Helbing and his co-workers (2000) have incorporated the panic situation into this force by incorporating the panic parameter to account for the panic situations. Third, Lakoba and Kaup (2005) have provided the pedestrians some kind of intelligence by incorporating aspects of the decision-making capability. In this paper, the authors analyze the most important incorporations into the model regarding the preferred force. They make comparisons between the different factors of these incorporations. Furthermore, to enhance the decision-making ability of the pedestrians, they introduce additional features such as the familiarity factor to the preferred force to let it appear more representative of what actually happens in reality.
Parametric polynomial minimal surfaces of arbitrary degree
Venue: arXiv cs.GR 2010
Year: 2010

Weierstrass representation is a classical parameterization of minimal surfaces. However, two functions should be specified to construct the parametric form in Weierestrass representation. In this paper, we propose an explicit parametric form for a class of parametric polynomial minimal surfaces of arbitrary degree. It includes the classical Enneper surface for cubic case. The proposed minimal surfaces also have some interesting properties such as symmetry, containing straight lines and self-intersections. According to the shape properties, the proposed minimal surface can be classified into four categories with respect to $n=4k-1$ $n=4k+1$, $n=4k$ and $n=4k+2$. The explicit parametric form of corresponding conjugate minimal surfaces is given and the isometric deformation is also implemented.
Close Clustering Based Automated Color Image Annotation
Venue: arXiv cs.LG 2010
Year: 2010

Most image-search approaches today are based on the text based tags associated with the images which are mostly human generated and are subject to various kinds of errors. The results of a query to the image database thus can often be misleading and may not satisfy the requirements of the user. In this work we propose our approach to automate this tagging process of images, where image results generated can be fine filtered based on a probabilistic tagging mechanism. We implement a tool which helps to automate the tagging process by maintaining a training database, wherein the system is trained to identify certain set of input images, the results generated from which are used to create a probabilistic tagging mechanism. Given a certain set of segments in an image it calculates the probability of presence of particular keywords. This probability table is further used to generate the candidate tags for input images.
Preserving HTTP Sessions in Vehicular Environments
Venue: arXiv cs.NI 2010
Year: 2010

Wireless Internet in the in-vehicle environment is an evolving reality that reflects the gradual maturity of wireless technologies. Its complexity is reflected in the diversity of wireless technologies and dynamically changing network environments. The ability to adapt to the dynamics of such environments and to survive transient failures due to network handoffs are fundamentally important in failure-prone vehicular environments. In this paper we identify several new issues arising from network heterogeneity in vehicular environments and concentrate on designing and implementing a network-aware prototype system that supports HTTP session continuity in the presence of network volatility, with the emphasis on the following specifically tailored features: (1) automatic and transparent HTTP failure recovery, (2) network awareness and adaptation, (3) application-layer preemptive network handoff. Experimental results gathered from real application environments based on CDMA {\it 1xRTT} and IEEE 802 networks are presented and analyzed.
Row Sampling for Matrix Algorithms via a Non-Commutative Bernstein Bound
Venue: arXiv cs.DS 2010
Year: 2010

We focus the use of \emph{row sampling} for approximating matrix algorithms. We give applications to matrix multipication; sparse matrix reconstruction; and, \math{\ell_2} regression. For a matrix \math{\matA\in\R^{m\times d}} which represents \math{m} points in \math{d\ll m} dimensions, all of these tasks can be achieved in \math{O(md^2)} via the singular value decomposition (SVD). For appropriate row-sampling probabilities (which typically depend on the norms of the rows of the \math{m\times d} left singular matrix of \math{\matA} (the \emph{leverage scores}), we give row-sampling algorithms with linear (up to polylog factors) dependence on the stable rank of \math{\matA}. This result is achieved through the application of non-commutative Bernstein bounds. We then give, to our knowledge, the first algorithms for computing approximations to the appropriate row-sampling probabilities without going through the SVD of \math{\matA}. Thus, these are the first \math{o(md^2)} algorithms for row-sampling based approximations to the matrix algorithms which use leverage scores as the sampling probabilities. The techniques we use to approximate sampling according to the leverage scores uses some powerful recent results in the theory of random projections for embedding, and may be of some independent interest. We confess that one may perform all these matrix tasks more efficiently using these same random projection methods, however the resulting algorithms are in terms of a small number of linear combinations of all the rows. In many applications, the actual rows of \math{\matA} have some physical meaning and so methods based on a small number of the actual rows are of interest.
A New SLNR-based Linear Precoding for Downlink Multi-User Multi-Stream MIMO Systems
Venue: arXiv cs.IT 2010
Year: 2010

Signal-to-leakage-and-noise ratio (SLNR) is a promising criterion for linear precoder design in multi-user (MU) multiple-input multiple-output (MIMO) systems. It decouples the precoder design problem and makes closed-form solution available. In this letter, we present a new linear precoding scheme by slightly relaxing the SLNR maximization for MU-MIMO systems with multiple data streams per user. The precoding matrices are obtained by a general form of simultaneous diagonalization of two Hermitian matrices. The new scheme reduces the gap between the per-stream effective channel gains, an inherent limitation in the original SLNR precoding scheme. Simulation results demonstrate that the proposed precoding achieves considerable gains in error performance over the original one for multi-stream transmission while maintaining almost the same achievable sum-rate.
Towards Improving the NIST Fingerprint Image Quality (NFIQ) Algorithm (Extended Version)
Venue: arXiv cs.CR 2010
Year: 2010

The NIST Fingerprint Image Quality (NFIQ) algorithm has become a standard method to assess fingerprint image quality. However, in many applications a more accurate and reliable assessment is desirable. In this publication, we report on our efforts to optimize the NFIQ algorithm by a re-training of the underlying neural network based on a large fingerprint image database. Although we only achieved a marginal improvement, our work has revealed several areas for potential optimization.
A Homogeneous Reaction Rule Language for Complex Event Processing
Venue: arXiv cs.AI 2010
Year: 2010

Event-driven automation of reactive functionalities for complex event processing is an urgent need in today's distributed service-oriented architectures and Web-based event-driven environments. An important problem to be addressed is how to correctly and efficiently capture and process the event-based behavioral, reactive logic embodied in reaction rules, and combining this with other conditional decision logic embodied, e.g., in derivation rules. This paper elaborates a homogeneous integration approach that combines derivation rules, reaction rules and other rule types such as integrity constraints into the general framework of logic programming, the industrial-strength version of declarative programming. We describe syntax and semantics of the language, implement a distributed web-based middleware using enterprise service technologies and illustrate its adequacy in terms of expressiveness, efficiency and scalability through examples extracted from industrial use cases. The developed reaction rule language provides expressive features such as modular ID-based updates with support for external imports and self-updates of the intensional and extensional knowledge bases, transactions including integrity testing and roll-backs of update transition paths. It also supports distributed complex event processing, event messaging and event querying via efficient and scalable enterprise middleware technologies and event/action reasoning based on an event/action algebra implemented by an interval-based event calculus variant as a logic inference formalism.
Compressive Sensing over Graphs
Venue: arXiv cs.IT 2010
Year: 2010

In this paper, motivated by network inference and tomography applications, we study the problem of compressive sensing for sparse signal vectors over graphs. In particular, we are interested in recovering sparse vectors representing the properties of the edges from a graph. Unlike existing compressive sensing results, the collective additive measurements we are allowed to take must follow connected paths over the underlying graph. For a sufficiently connected graph with $n$ nodes, it is shown that, using $O(k \log(n))$ path measurements, we are able to recover any $k$-sparse link vector (with no more than $k$ nonzero elements), even though the measurements have to follow the graph path constraints. We further show that the computationally efficient $\ell_1$ minimization can provide theoretical guarantees for inferring such $k$-sparse vectors with $O(k \log(n))$ path measurements from the graph.
Aggregate Interference Modeling in Cognitive Radio Networks with Power and Contention Control
Venue: arXiv cs.IT 2010
Year: 2010

In this paper, we present an interference model for cognitive radio (CR) networks employing power control, contention control or hybrid power/contention control schemes. For the first case, a power control scheme is proposed to govern the transmission power of a CR node. For the second one, a contention control scheme at the media access control (MAC) layer, based on carrier sense multiple access with collision avoidance (CSMA/CA), is proposed to coordinate the operation of CR nodes with transmission requests. The probability density functions of the interference received at a primary receiver from a CR network are first derived numerically for these two cases. For the hybrid case, where power and contention controls are jointly adopted by a CR node to govern its transmission, the interference is analyzed and compared with that of the first two schemes by simulations. Then, the interference distributions under the first two control schemes are fitted by log-normal distributions with greatly reduced complexity. Moreover, the effect of a hidden primary receiver on the interference experienced at the receiver is investigated. It is demonstrated that both power and contention controls are effective approaches to alleviate the interference caused by CR networks. Some in-depth analysis of the impact of key parameters on the interference of CR networks is given via numerical studies as well.
Witness Gabriel Graphs
Venue: arXiv cs.CG 2010
Year: 2010

We consider a generalization of the Gabriel graph, the witness Gabriel graph. Given a set of vertices P and a set of witnesses W in the plane, there is an edge ab between two points of P in the witness Gabriel graph GG-(P,W) if and only if the closed disk with diameter ab does not contain any witness point (besides possibly a and/or b). We study several properties of the witness Gabriel graph, both as a proximity graph and as a new tool in graph drawing.
Data visualization in political and social sciences
Venue: arXiv cs.GR 2010
Year: 2010

The basic objective of data visualization is to provide an efficient graphical display for summarizing and reasoning about quantitative information. During the last decades, political science has accumulated a large corpus of various kinds of data such as comprehensive factbooks and atlases, characterizing all or most of existing states by multiple and objectively assessed numerical indicators within certain time lapse. As a consequence, there exists a continuous trend for political science to gradually become a more quantitative scientific field and to use quantitative information in the analysis and reasoning. It is believed that any objective analysis in political science must be multidimensional and combine various sources of quantitative information; however, human capabilities for perception of large massifs of numerical information are limited. Hence, methods and approaches for visualization of quantitative and qualitative data (and, especially multivariate data) is an extremely important topic. Data visualization approaches can be classified into several groups, starting from creating informative charts and diagrams (statistical graphics and infographics) and ending with advanced statistical methods for visualizing multidimensional tables containing both quantitative and qualitative information. In this article we provide a short review of existing methods of data visualization methods with applications in political and social science.
Improved Fast Similarity Search in Dictionaries
Venue: arXiv cs.IR 2010
Year: 2010

We engineer an algorithm to solve the approximate dictionary matching problem. Given a list of words $\mathcal{W}$, maximum distance $d$ fixed at preprocessing time and a query word $q$, we would like to retrieve all words from $\mathcal{W}$ that can be transformed into $q$ with $d$ or less edit operations. We present data structures that support fault tolerant queries by generating an index. On top of that, we present a generalization of the method that eases memory consumption and preprocessing time significantly. At the same time, running times of queries are virtually unaffected. We are able to match in lists of hundreds of thousands of words and beyond within microseconds for reasonable distances.
Semantic Oriented Intelligent Electronic Learning
Venue: arXiv cs.OH 2010
Year: 2010

In this research paper we describe semantic oriented information engineering and knowledge management based solution towards E-Learning systems. We also try to justify the importance of proposed solution with respect to the E-Learning Approaches .i.e., Behavior, Objectivism, Cognitive and Construction. Moreover we briefly describe E-Learning, information engineering, knowledge management and some old and newly available technologies supporting development of E-Learning Systems in this research paper.
How Does Ontology Contribute in Semantic Web Development?
Venue: arXiv cs.OH 2010
Year: 2010

This paper investigates and briefly describes the major currently existing problems with World Wide Web .i.e., Information filtration and Security became the main reasons of semantic web's invention. The semantic web claims of providing the semantic based solutions towards current web problems. Semantic web have introduced and relies on a main building block "Ontology" to provide the information in machine processable semantic models and produce semantically modelled knowledge representation systems. This paper also describes the role, construction process and the contributions of ontology in providing some in time proposed and implemented solutions. Furthermore paper concludes with the currently existing limitations in Ontology and the areas which need improvements.
I-SOAS towards Product Data Management (PDM) based Application's Problems
Venue: arXiv cs.OH 2010
Year: 2010

In this research paper we address the importance of Product Data Management (PDM) with respect to the industrial contributional point of view and its major objectives. Moreover we also present some currently available major challenges to the Product Data Management based communities, and targeting those challenges we discuss an already proposed conceptual architectural based helpful approach and briefly describe how this approach can be helpful in solving the PDM communities faced problems.
A Simplification of a Real-Time Verification Problem
Venue: arXiv cs.LO 2010
Year: 2010

We revisit the problem of real-time verification with dense dynamics using timeout and calendar based models and simplify this to a finite state verification problem. To overcome the complexity of verification of real-time systems with dense dynamics, Dutertre and Sorea, proposed timeout and calender based transition systems to model the behavior of real-time systems and verified safety properties using k-induction in association with bounded model checking. In this work, we introduce a specification formalism for these models in terms of Timeout Transition Diagrams and capture their behavior in terms of semantics of Timed Transition Systems. Further, we discuss a technique, which reduces the problem of verification of qualitative temporal properties on infinite state space of (a large fragment of) these timeout and calender based transition systems into that on clockless finite state models through a two-step process comprising of digitization and canonical finitary reduction. This technique enables us to verify safety invariants for real-time systems using finite state model-checking avoiding the complexity of infinite state (bounded) model checking and scale up models without applying techniques from induction based proof methodology. Moreover, we can verify liveness properties for real-time systems, which is not possible by using induction with infinite state model checkers. We present examples of Fischer's Protocol, Train-Gate Controller, and TTA start-up algorithm to illustrate how such an approach can be efficiently used for verifying safety, liveness, and timeliness properties specified in LTL using finite state model checkers like SAL-smc and Spin. We also demonstrate how advanced modeling concepts like inter-process scheduling, priorities, interrupts, urgent and committed location can be specified as extensions of the proposed specification formalism.
Optimal Feedback Systems with Analogue Adaptive Transmitters
Venue: arXiv cs.IT 2010
Year: 2010

The paper presents original approach to concurrent optimization of the transmitting and receiving parts of adaptive communication systems (CS) with feedback channels. The results of research show a possibility and the way of designing the systems transmitting the signals with a bit rate equal to the capacity of the forward channel under given bit-error rate (BER). The results of work can be used for design of different classes of high-efficient low energy/size/cost CS, as well as allow further development and extension.
The Diversity-Multiplexing Tradeoff of the Dynamic Decode-and-Forward Protocol on a MIMO Half-Duplex Relay Channel
Venue: arXiv cs.IT 2010
Year: 2010

The diversity-multiplexing tradeoff of the dynamic decode-and-forward protocol is characterized for the half-duplex three-terminal (m,k,n)-relay channel where the source, relay and the destination terminals have m, k and n antennas, respectively. It is obtained as a solution to a simple, two-variable, convex optimization problem and this problem is solved in closed form for special classes of relay channels, namely, the (1,k,1) relay channel, the (n,1,n) relay channel and the (2,k,2) relay channel. Moreover, the tradeoff curves for a certain class of relay channels, such as the (m,k,n>k) channels, are identical to those for the decode-and-forward protocol for the full duplex channel while for other classes of channels they are marginally lower at high multiplexing gains. Our results also show that for some classes of relay channels and at low multiplexing gains the diversity orders of the dynamic decode-and-forward protocol protocol are greater than those of the static compress-and-forward protocol which in turn is known to be tradeoff optimal over all {\em static} half duplex protocols. In general, the dynamic decode-and-forward protocol has a performance that is comparable to that of the static compress-and-forward protocol which, unlike the dynamic decode-and-forward protocol, requires global channel state information at the relay node. Its performance is also close to that of the decode-and-forward protocol over the full-duplex relay channel thereby indicating that the half-duplex constraint can be compensated for by the dynamic operation of the relay wherein the relay switches from the receive to the transmit mode based on the source-relay channel quality.
A note on communicating between information systems based on including degrees
Venue: arXiv cs.AI 2010
Year: 2010

In order to study the communication between information systems, Gong and Xiao [Z. Gong and Z. Xiao, Communicating between information systems based on including degrees, International Journal of General Systems 39 (2010) 189--206] proposed the concept of general relation mappings based on including degrees. Some properties and the extension for fuzzy information systems of the general relation mappings have been investigated there. In this paper, we point out by counterexamples that several assertions (Lemma 3.1, Lemma 3.2, Theorem 4.1, and Theorem 4.3) in the aforementioned work are not true in general.
Bootstrap Markov chain Monte Carlo and optimal solutions for the Law of Categorical Judgment (Corrected)
Venue: arXiv cs.NA 2010
Year: 2010

A novel procedure is described for accelerating the convergence of Markov chain Monte Carlo computations. The algorithm uses an adaptive bootstrap technique to generate candidate steps in the Markov Chain. It is efficient for symmetric, convex probability distributions, similar to multivariate Gaussians, and it can be used for Bayesian estimation or for obtaining maximum likelihood solutions with confidence limits. As a test case, the Law of Categorical Judgment (Corrected) was fitted with the algorithm to data sets from simulated rating scale experiments. The correct parameters were recovered from practical-sized data sets simulated for Full Signal Detection Theory and its special cases of standard Signal Detection Theory and Complementary Signal Detection Theory.
Query-Efficient Locally Decodable Codes of Subexponential Length
Venue: arXiv cs.CC 2010
Year: 2010

We develop the algebraic theory behind the constructions of Yekhanin (2008) and Efremenko (2009), in an attempt to understand the ``algebraic niceness'' phenomenon in $\mathbb{Z}_m$. We show that every integer $m = pq = 2^t -1$, where $p$, $q$ and $t$ are prime, possesses the same good algebraic property as $m=511$ that allows savings in query complexity. We identify 50 numbers of this form by computer search, which together with 511, are then applied to gain improvements on query complexity via Itoh and Suzuki's composition method. More precisely, we construct a $3^{\lceil r/2\rceil}$-query LDC for every positive integer $r<104$ and a $\left\lfloor (3/4)^{51}\cdot 2^{r}\right\rfloor$-query LDC for every integer $r\geq 104$, both of length $N_{r}$, improving the $2^r$ queries used by Efremenko (2009) and $3\cdot 2^{r-2}$ queries used by Itoh and Suzuki (2010). We also obtain new efficient private information retrieval (PIR) schemes from the new query-efficient LDCs.