OpenRaiser/Intern-Atlas huggingface dataset:
You Only Live Twice or "The Years We Wasted Caring about Shoulder-Surfing"
Venue: arXiv cs.CR 2015
Year: 2015

Passwords are a good idea, in theory. They have the potential to act as a fairly strong gateway. In practice though, passwords are plagued with problems. They are (1) easily shared, (2) trivial to observe and (3) maddeningly elusive when forgotten. While alternatives to passwords have been proposed, none, as yet, have been adopted widely. There seems to be a reluctance to switch from tried and tested passwords to novel alternatives, even if the most glaring flaws of passwords can be mitigated. One argument is that there is not enough investigation into the feasibility of many password alternatives. Graphical authentication mechanisms are a case in point. Therefore, in this paper, we detail the design of two prototype applications that utilise graphical authentication mechanisms. However, when forced to consider the design of such prototypes, we find that pertinent password problems eg. observation of entry, are just that: password problems. We conclude that effective, alternative authentication mechanisms should target authentication scenarios rather than the well-known problems of passwords. This is the only route to wide-spread adoption of alternatives.
Two infinite classes of rotation symmetric bent functions with simple representation
Venue: arXiv cs.IT 2015
Year: 2015

In the literature, few $n$-variable rotation symmetric bent functions have been constructed. In this paper, we present two infinite classes of rotation symmetric bent functions on $\mathbb{F}_2^{n}$ of the two forms: {\rm (i)} $f(x)=\sum_{i=0}^{m-1}x_ix_{i+m} + γ(x_0+x_m,\cdots, x_{m-1}+x_{2m-1})$, {\rm (ii)} $f_t(x)= \sum_{i=0}^{n-1}(x_ix_{i+t}x_{i+m} +x_{i}x_{i+t})+ \sum_{i=0}^{m-1}x_ix_{i+m}+ γ(x_0+x_m,\cdots, x_{m-1}+x_{2m-1})$, \noindent where $n=2m$, $γ(X_0,X_1,\cdots, X_{m-1})$ is any rotation symmetric polynomial, and $m/gcd(m,t)$ is odd. The class (i) of rotation symmetric bent functions has algebraic degree ranging from 2 to $m$ and the other class (ii) has algebraic degree ranging from 3 to $m$.
E-Monitoring Program Pembangunan Infrastruktur Perdesaan (PPIP) pada Dinas PU Cipta Karya dan Pengairan Kabupaten Muba
Venue: arXiv cs.CY 2015
Year: 2015

Information technology is widely used as a media monitor various activities. In this study, the authors will utilize IT to monitor the Rural Infrastructure Development Program (PPIP). PPIP is a program of community development at the village level in the framework of the provision of basic infrastructure in rural settlements carried out by the Directorate General of Human Settlements Ministry of Public Works to support the policy of the Indonesian government. PPIP Kab. Muba through the Department of Public Works and Human Settlement Irrigation District Muba as actors in the process of distribution of program development implementation, disbursement, monitoring (monitoring), and reporting. In the implementation process of the realization of all the monitoring data is processed in a conventional manner or format of diverse reports from the field so often goes wrong, the late submission of reports and inaccuracies among reports received by the condition of the field. The system can manage employment targets, reporting a physical realization and financial absorption, process data reporting information on a regular basis, timely, complete and factual as the data obtained directly from implementing supervisory officers in the field. This system is built with web-based information technology using PHP and MySQL database.
On the Displacement for Covering a $d-$dimensional Cube with Randomly Placed Sensors
Venue: arXiv cs.DS 2015
Year: 2015

Consider $n$ sensors placed randomly and independently with the uniform distribution in a $d-$dimensional unit cube ($d\ge 2$). The sensors have identical sensing range equal to $r$, for some $r >0$. We are interested in moving the sensors from their initial positions to new positions so as to ensure that the $d-$dimensional unit cube is completely covered, i.e., every point in the $d-$dimensional cube is within the range of a sensor. If the $i$-th sensor is displaced a distance $d_i$, what is a displacement of minimum cost? As cost measure for the displacement of the team of sensors we consider the $a$-total movement defined as the sum $M_a:= \sum_{i=1}^n d_i^a$, for some constant $a>0$. We assume that $r$ and $n$ are chosen so as to allow full coverage of the $d-$dimensional unit cube and $a > 0$. The main contribution of the paper is to show the existence of a tradeoff between the $d-$dimensional cube, sensing radius and $a$-total movement. The main results can be summarized as follows for the case of the $d-$dimensional cube. If the $d-$dimensional cube sensing radius is $\frac{1}{2n^{1/d}}$ and $n=m^d$, for some $m\in N$, then we present an algorithm that uses $O\left(n^{1-\frac{a}{2d}}\right)$ total expected movement (see Algorithm 2 and Theorem 5). If the $d-$dimensional cube sensing radius is greater than $\frac{3^{3/d}}{(3^{1/d}-1)(3^{1/d}-1)}\frac{1}{2n^{1/d}}$ and $n$ is a natural number then the total expected movement is $O\left(n^{1-\frac{a}{2d}}\left(\frac{\ln n}{n}\right)^{\frac{a}{2d}}\right)$ (see Algorithm 3 and Theorem 7). In addition, we simulate Algorithm 2 and discuss the results of our simulations.
Distributed Autoregressive Moving Average Graph Filters
Venue: arXiv cs.SI 2015
Year: 2015

We introduce the concept of autoregressive moving average (ARMA) filters on a graph and show how they can be implemented in a distributed fashion. Our graph filter design philosophy is independent of the particular graph, meaning that the filter coefficients are derived irrespective of the graph. In contrast to finite-impulse response (FIR) graph filters, ARMA graph filters are robust against changes in the signal and/or graph. In addition, when time-varying signals are considered, we prove that the proposed graph filters behave as ARMA filters in the graph domain and, depending on the implementation, as first or higher ARMA filters in the time domain.
Structural Complexity of Multi-Valued Partial Functions Computed by Nondeterministic Pushdown Automata
Venue: arXiv cs.FL 2015
Year: 2015

This paper continues a systematic and comprehensive study on the structural properties of CFL functions, which are in general multi-valued partial functions computed by one-way one-head nondeterministic pushdown automata equipped with write-only output tapes (or pushdown transducers), where CFL refers to a relevance to context-free languages. The CFL functions tend to behave quite differently from their corresponding context-free languages. We extensively discuss containments, separations, and refinements among various classes of functions obtained from the CFL functions by applying Boolean operations, functional composition, many-one relativization, and Turing relativization. In particular, Turing relativization helps construct a hierarchy over the class of CFL functions. We also analyze the computational complexity of optimization functions, which are to find optimal values of CFL functions, and discuss their relationships to the associated languages.
A $N$-Body Solver for Square Root Iteration
Venue: arXiv cs.NA 2015
Year: 2015

We develop the Sparse Approximate Matrix Multiply ($\tt SpAMM$) $n$-body solver for first order Newton Schulz iteration of the matrix square root and inverse square root. The solver performs recursive two-sided metric queries on a modified Cauchy-Schwarz criterion, culling negligible sub-volumes of the product-tensor for problems with structured decay in the sub-space metric. These sub-structures are shown to bound the relative error in the matrix-matrix product, and in favorable cases, to enjoy a reduced computational complexity governed by dimensionality reduction of the product volume. A main contribution is demonstration of a new, algebraic locality that develops under contractive identity iteration, with collapse of the metric-subspace onto the identity's plane diagonal, resulting in a stronger $\tt SpAMM$ bound. Also, we carry out a first order {Fréchet} analyses for single and dual channel instances of the square root iteration, and look at bifurcations due to ill-conditioning and a too aggressive $\tt SpAMM$ approximation. Then, we show that extreme $\tt SpAMM$ approximation and contractive identity iteration can be achieved for ill-conditioned systems through regularization, and we demonstrate the potential for acceleration with a scoping, product representation of the inverse factor.
Generalized Cross-Layer Designs for Generic Half-Duplex Multicarrier Wireless Networks with Frequency-Reuse
Venue: arXiv cs.NI 2015
Year: 2015

In this paper, joint designs of data routes and resource allocations are developed for generic half-duplex multicarrier wireless networks in which each subcarrier can be reused by multiple links. Two instances are considered. The first instance pertains to the general case in which each subcarrier can be timeshared by multiple links, whereas the second instance pertains to a special case in which time-sharing is not allowed and a subcarrier, once assigned to a set of links, is used by those links throughout the signalling interval. Novel frameworks are developed to optimize the joint design of data routes, subcarrier schedules and power allocations. These design problems are nonconvex and hence difficult to solve. To circumvent this difficulty, efficient techniques based on geometric programming are developed to obtain locally optimal solutions. Numerical results show that the designs developed in both instances yield performance that is superior to that of their counterparts in which frequency-reuse is not allowed.
Symbol Detection for Frame-Based Faster-than-Nyquist Signaling via Sum-of-Absolute-Values Optimization
Venue: arXiv cs.IT 2015
Year: 2015

In this letter, we propose a new symbol detection method for faster-than-Nyquist signaling (FTNS) systems. Based on frame theory, we formulate a symbol detection problem as a under-determined linear equation on a finite set. The problem is reformulated as a sum-of-absolute-values (SOAV) optimization that can be efficiently solved by the fast iterative shrinkage thresholding algorithm (FISTA). The proximity operator for the convex optimization is derived analytically. Simulation results are given to show that the proposed method can successfully detect symbols in faster-than-Nyquist signaling systems and has lower complexity in terms of computation time.
Evaluasi Celah Keamanan Web Server pada LPSE Kota Palembang
Venue: arXiv cs.CR 2015
Year: 2015

Along the development of information technology systems among the public at large, also develops information systems to facilitate the public to access and search for information in the form of a website. Electronic Procurement Service (LPSE) Palembang is a business unit set up to organize the service system of government procurement of goods or services electronically. And to allow companies or providers that want to follow the procurement of goods or services, LPSE providing a website that can be accessed from anywhere so the company or provider to follow the procurement of goods or services without having to come to the office LPSE. In the management of its website, LPSE Palembang has its own web server so that the need to consider the existing security system on the web server. Web servers often become the target of attacks by an attacker. This study is set to test the security system of the web server to find out if a web server is secure or not of the crime committed by an attacker. This research involves penetration testing with multiple applications. The results show some holes and suggestions.
Two-level space-time domain decomposition methods for unsteady inverse problems
Venue: arXiv cs.NA 2015
Year: 2015

As the number of processor cores on supercomputers becomes larger and larger, algorithms with high degree of parallelism attract more attention. In this work, we propose a novel space-time coupled algorithm for solving an inverse problem associated with the time-dependent convection-diffusion equation in three dimensions. We introduce a mixed finite element/finite difference method and a one-level and a two-level space-time parallel domain decomposition preconditioner for the Karush-Kuhn-Tucker (KKT) system induced from reformulating the inverse problem as an output least-squares optimization problem in the space-time domain. The new full space approach eliminates the sequential steps of the optimization outer loop and the inner forward and backward time marching processes, thus achieves high degree of parallelism. Numerical experiments validate that this approach is effective and robust for recovering unsteady moving sources. We report strong scalability results obtained on a supercomputer with more than 1,000 processors.
The Open Service Compendium. Business-pertinent Cloud Service Discovery, Assessment, and Selection
Venue: arXiv cs.SE 2015
Year: 2015

When trying to discover, assess, and select cloud services, companies face many challenges, such as fast-moving markets, vast numbers of offerings, and highly ambiguous selection criteria. This publication presents the Open Service Compendium (OSC), an information system which supports businesses in their discovery, assessment and cloud service selection by offering a simple dynamic service description language, business-pertinent vocabularies, as well as matchmaking functionality. It contributes to the state of the art by offering a more practical, mature, simple, and usable approach than related works.
Weight Assignment Logic
Venue: arXiv cs.FL 2015
Year: 2015

We introduce a weight assignment logic for reasoning about quantitative languages of infinite words. This logic is an extension of the classical MSO logic and permits to describe quantitative properties of systems with multiple weight parameters, e.g., the ratio between rewards and costs. We show that this logic is expressively equivalent to unambiguous weighted Büchi automata. We also consider an extension of weight assignment logic which is expressively equivalent to nondeterministic weighted Büchi automata.
Performance of a Free Space Optical Relay-Assisted Hybrid RF/FSO System in Generalized M-Distributed Channels
Venue: arXiv cs.IT 2015
Year: 2015

This paper investigates the average symbol error rate (ASER) performance of a dual-hop hybrid relaying system relying on both radio frequency (RF) and free space optical (FSO) links. Specifically, the RF link is used for supporting mobile communication, while the FSO link is adopted as the backhaul of the cellular infrastructure. Considering non-line-of-sight (NLoS) RF transmissions and a generalized atmospheric turbulence (AT) channel, the associated statistical features constituted of both the exact and the asymptotic moment generating functions (MGF) are derived in closed form. They are then used for calculating the ASER of M-ary phase shift keying (PSK), differentially encoded non-coherent PSK (DPSK) and non-coherent frequency-shift keying (FSK). A range of additional asymptotic expressions are also derived for all the modulation schemes under high signal-to-noise ratios (SNR). It is observed from the asymptotic analysis that the ASERs of all the modulation schemes are dominated by the average SNR of the RF link in the hybrid relaying system using a fixed relay gain, while in the relaying system using a dynamic channel dependent relay gain, the ASERs of all the modulation schemes depend both on the average SNR and on the AT condition of the FSO path. We also find that the fixed-gain relaying strategy achieves twice the diversity order of the channel-dependent relaying strategy albeit at the cost of requiring a high power amplifier (PA) dynamic range at the relay node. Furthermore, by comparing the asymptotic ASERs, we calculate the SNR differences between the different modulation schemes in both the fixed-gain and the channel-dependent relaying system. Finally, simulation results are presented for confirming the accuracy of our expressions and observations.
A Neuro-Fuzzy Method to Improving Backfiring Conversion Ratios
Venue: arXiv cs.SE 2015
Year: 2015

Software project estimation is crucial aspect in delivering software on time and on budget. Software size is an important metric in determining the effort, cost, and productivity. Today, source lines of code and function point are the most used sizing metrics. Backfiring is a well-known technique for converting between function points and source lines of code. However when backfiring is used, there is a high margin of error. This study introduces a method to improve the accuracy of backfiring. Intelligent systems have been used in software prediction models to improve performance over traditional techniques. For this reason, a hybrid Neuro-Fuzzy is used because it takes advantages of the neural networks learning and fuzzy logic human-like reasoning. This paper describes an improved backfiring technique which uses Neuro-Fuzzy and compares the new method against the default conversion ratios currently used by software practitioners.
CBSE CASE Environment
Venue: arXiv cs.SE 2015
Year: 2015

With the need to produce ever larger and more complex software systems, the use of reusable components has become increasingly imperative. Of the many existing and proposed techniques for software development, it seems clear that components-based software engineering (CBSE) will be at the forefront of new approaches to the production of software systems, and holds the promise of substantially enhancing the software development and maintenance process. The required features of a CASE environment suitable for component reuse will be put forward in this paper.
Network Community Detection on Metric Space
Venue: arXiv cs.SI 2015
Year: 2015

Community detection in a complex network is an important problem of much interest in recent years. In general, a community detection algorithm chooses an objective function and captures the communities of the network by optimizing the objective function, and then, one uses various heuristics to solve the optimization problem to extract the interesting communities for the user. In this article, we demonstrate the procedure to transform a graph into points of a metric space and develop the methods of community detection with the help of a metric defined for a pair of points. We have also studied and analyzed the community structure of the network therein. The results obtained with our approach are very competitive with most of the well-known algorithms in the literature, and this is justified over the large collection of datasets. On the other hand, it can be observed that time taken by our algorithm is quite less compared to other methods and justifies the theoretical findings.
A Self-Tuning Receiver-Initiated MAC Protocol for Wireless Sensor Networks
Venue: arXiv cs.NI 2015
Year: 2015

Receiver-initiated medium access control protocols for wireless sensor networks are theoretically able to adapt to changing network conditions in a distributed manner. However, existing algorithms rely on fixed beacon rates at each receiver. We present a new received initiated MAC protocol that adapts the beacon rate at each receiver to its actual traffic load. Our proposal uses a computationally inexpensive formula for calculating the optimum beacon rate that minimizes network energy consumption and, so, it can be easily adopted by receivers. Simulation results show that our proposal reduces collisions and diminishes delivery time maintaining a low duty cycle.
Tapping Into the Wells of Social Energy: A Case Study Based on Falls Identification
Venue: arXiv cs.CY 2015
Year: 2015

Are purely technological solutions the best answer we can get to the shortcomings our organizations are often experiencing today? The results we gathered in this work lead us to giving a negative answer to such question. Science and technology are powerful boosters, though when they are applied to the "local, static organization of an obsolete yesterday" they fail to translate in the solutions we need to our problems. Our stance here is that those boosters should be applied to novel, distributed, and dynamic models able to allow us to escape from the local minima our societies are currently locked in. One such model is simulated in this paper to demonstrate how it may be possible to tap into the vast basins of social energy of our human societies to realize ubiquitous computing sociotechnical services for the identification and timely response to falls.
A Comparative Analysis of Retrieval Techniques In Content Based Image Retrieval
Venue: arXiv cs.CV 2015
Year: 2015

Basic group of visual techniques such as color, shape, texture are used in Content Based Image Retrievals (CBIR) to retrieve query image or subregion of image to find similar images in image database. To improve query result, relevance feedback is used many times in CBIR to help user to express their preference and improve query results.In this paper, a new approach for image retrieval is proposed which is based on the features such as Color Histogram, Eigen Values and Match Point. Images from various types of database are first identified by using edge detection techniques.Once the image is identified, then the image is searched in the particular database, then all related images are displayed. This will save the retrieval time. Further to retrieve the precise query image, any of the three techniques are used and comparison is done w.r.t. average retrieval time. Eigen value technique found to be the best as compared with other two techniques
Factorizations of the Fibonacci Infinite Word
Venue: arXiv cs.FL 2015
Year: 2015

The aim of this note is to survey the factorizations of the Fibonacci infinite word that make use of the Fibonacci words and other related words, and to show that all these factorizations can be easily derived in sequence starting from elementary properties of the Fibonacci numbers.
A graph interpretation of the least squares ranking method
Venue: arXiv cs.GT 2015
Year: 2015

The paper aims at analyzing the least squares ranking method for generalized tournaments with possible missing and multiple paired comparisons. The bilateral relationships may reflect the outcomes of a sport competition, product comparisons, or evaluation of political candidates and policies. It is shown that the rating vector can be obtained as a limit point of an iterative process based on the scores in almost all cases. The calculation is interpreted on an undirected graph with loops attached to some nodes, revealing that the procedure takes into account not only the given object's results but also the strength of objects compared with it. We explore the connection between this method and another procedure defined for ranking the nodes in a digraph, the positional power measure. The decomposition of the least squares solution offers a number of ways to modify the method.