OpenRaiser/Intern-Atlas huggingface dataset:
A Constrained Random Demodulator for Sub-Nyquist Sampling
Venue: arXiv cs.IT 2012
Year: 2012

This paper presents a significant modification to the Random Demodulator (RD) of Tropp et al. for sub-Nyquist sampling of frequency-sparse signals. The modification, termed constrained random demodulator, involves replacing the random waveform, essential to the operation of the RD, with a constrained random waveform that has limits on its switching rate because fast switching waveforms may be hard to generate cleanly. The result is a relaxation on the hardware requirements with a slight, but manageable, decrease in the recovery guarantees. The paper also establishes the importance of properly choosing the statistics of the constrained random waveform. If the power spectrum of the random waveform matches the distribution on the tones of the input signal (i.e., the distribution is proportional to the power spectrum), then recovery of the input signal tones is improved. The theoretical guarantees provided in the paper are validated through extensive numerical simulations and phase transition plots.
GeT_Move: An Efficient and Unifying Spatio-Temporal Pattern Mining Algorithm for Moving Objects
Venue: arXiv cs.DB 2012
Year: 2012

Recent improvements in positioning technology has led to a much wider availability of massive moving object data. A crucial task is to find the moving objects that travel together. Usually, these object sets are called spatio-temporal patterns. Due to the emergence of many different kinds of spatio-temporal patterns in recent years, different approaches have been proposed to extract them. However, each approach only focuses on mining a specific kind of pattern. In addition to being a painstaking task due to the large number of algorithms used to mine and manage patterns, it is also time consuming. Moreover, we have to execute these algorithms again whenever new data are added to the existing database. To address these issues, we first redefine spatio-temporal patterns in the itemset context. Secondly, we propose a unifying approach, named GeT_Move, which uses a frequent closed itemset-based spatio-temporal pattern-mining algorithm to mine and manage different spatio-temporal patterns. GeT_Move is implemented in two versions which are GeT_Move and Incremental GeT_Move. To optimize the efficiency and to free the parameters setting, we also propose a Parameter Free Incremental GeT_Move algorithm. Comprehensive experiments are performed on real datasets as well as large synthetic datasets to demonstrate the effectiveness and efficiency of our approaches.
PID Parameters Optimization by Using Genetic Algorithm
Venue: arXiv cs.SY 2012
Year: 2012

Time delays are components that make time-lag in systems response. They arise in physical, chemical, biological and economic systems, as well as in the process of measurement and computation. In this work, we implement Genetic Algorithm (GA) in determining PID controller parameters to compensate the delay in First Order Lag plus Time Delay (FOLPD) and compare the results with Iterative Method and Ziegler-Nichols rule results.
A procedural framework and mathematical analysis for solid sweeps
Venue: arXiv cs.OH 2012
Year: 2012

Sweeping is a powerful and versatile method of designing objects. Boundary of volumes (henceforth envelope) obtained by sweeping solids have been extensively investigated in the past, though, obtaining an accurate parametrization of the envelope remained computationally hard. The present work reports our approach to this problem as well as the important problem of identifying self-intersections within the envelope. Parametrization of the envelope is, of course, necessary for its use in most current CAD systems. We take the more interesting case when the solid is composed of several faces meeting smoothly. We show that the face structure of the envelope mimics locally that of the solid. We adopt the procedural approach at defining the geometry in this work which has the advantage of being accurate as well as computationally efficient. The problem of detecting local self-intersections is central to a robust implementation of the solid sweep. This has been addressed by computing a subtle mathematical invariant which detects self-intersections, and which is computationally benign and requires only point queries.
Adjacency Matrix Based Energy Efficient Scheduling using S-MAC Protocol in Wireless Sensor Networks
Venue: arXiv cs.NI 2012
Year: 2012

Communication is the main motive in any Networks whether it is Wireless Sensor Network, Ad-Hoc networks, Mobile Networks, Wired Networks, Local Area Network, Metropolitan Area Network, Wireless Area Network etc, hence it must be energy efficient. The main parameters for energy efficient communication are maximizing network lifetime, saving energy at the different nodes, sending the packets in minimum time delay, higher throughput etc. This paper focuses mainly on the energy efficient communication with the help of Adjacency Matrix in the Wireless Sensor Networks. The energy efficient scheduling can be done by putting the idle node in to sleep node so energy at the idle node can be saved. The proposed model in this paper first forms the adjacency matrix and broadcasts the information about the total number of existing nodes with depths to the other nodes in the same cluster from controller node. When every node receives the node information about the other nodes for same cluster they communicate based on the shortest depths and schedules the idle node in to sleep mode for a specific time threshold so energy at the idle nodes can be saved.
Convergence and Equivalence results for the Jensen's inequality - Application to time-delay and sampled-data systems
Venue: arXiv cs.SY 2012
Year: 2012

The Jensen's inequality plays a crucial role in the analysis of time-delay and sampled-data systems. Its conservatism is studied through the use of the Grüss Inequality. It has been reported in the literature that fragmentation (or partitioning) schemes allow to empirically improve the results. We prove here that the Jensen's gap can be made arbitrarily small provided that the order of uniform fragmentation is chosen sufficiently large. Non-uniform fragmentation schemes are also shown to speed up the convergence in certain cases. Finally, a family of bounds is characterized and a comparison with other bounds of the literature is provided. It is shown that the other bounds are equivalent to Jensen's and that they exhibit interesting well-posedness and linearity properties which can be exploited to obtain better numerical results.
A Complete Workflow for Development of Bangla OCR
Venue: arXiv cs.CV 2012
Year: 2012

Developing a Bangla OCR requires bunch of algorithm and methods. There were many effort went on for developing a Bangla OCR. But all of them failed to provide an error free Bangla OCR. Each of them has some lacking. We discussed about the problem scope of currently existing Bangla OCR's. In this paper, we present the basic steps required for developing a Bangla OCR and a complete workflow for development of a Bangla OCR with mentioning all the possible algorithms required.
Proposed optimal LSP selection method in MPLS networks
Venue: arXiv cs.NI 2012
Year: 2012

Multi-Protocol Label Switching (MPLS) had been deployed by many data networking service providers, including the next-generation mobile backhaul networks, because of its undeniable potential in terms of virtual private network (VPN) management, traffic engineering, etc. In MPLS networks, IP packets are transmitted along a Label Switched Path (LSP) established between edge nodes. To improve the efficiency of resource use in MPLS networks, it is essential to utilize the LSPs efficiently. This paper proposes a method of selecting the optimal LSP pair from among multiple LSP pairs which are established between the same pair of edge nodes, on the assumption that both the upward and downward LSPs are established as a pair (both-way operation). It is supposed that both upward and downward bandwidths are allocated simultaneously in the selected LSP pair for each service request. It is demonstrated by simulation evaluations that the proposal method could reduce the total amount of the bandwidth required by up to 15% compared with the conventional selection method. The proposed method can also reuse the know-how and management tools in many existing networks which are based on both-way operation.
Refinement of Strategy and Technology Domains STOPE View on ISO 27001
Venue: arXiv cs.CR 2012
Year: 2012

It is imperative for organizations to us Information Security Management System (ISMS) to effectively manage their information assets. ISMS starts with a set of policies that dictate the usage computer resources. It starts with the "21 essential security controls" of ISO 27001, which give the basic standard requirements of information security management. Our research is concerned with the assessment of the application of these controls to organizations. STOPE (Strategy, Technology Organization, People and Environment) methodologies were used to integrated domains as a framework for this assessment. The controls are mapped on these domains and subsequently refined into "246 simple and easily comprehended elements".
Improved Spatial Modulation for High Spectral Efficiency
Venue: arXiv cs.SY 2012
Year: 2012

Spatial Modulation (SM) is a technique that can enhance the capacity of MIMO schemes by exploiting the index of transmit antenna to convey information bits. In this paper, we describe this technique, and present a new MIMO transmission scheme that combines SM and spatial multiplexing. In the basic form of SM, only one out of MT available antennas is selected for transmission in any given symbol interval. We propose to use more than one antenna to transmit several symbols simultaneously. This would increase the spectral efficiency. At the receiver, an optimal detector is employed to jointly estimate the transmitted symbols as well as the index of the active transmit antennas. In this paper we evaluate the performance of this scheme in an uncorrelated Rayleigh fading channel. The simulations results show that the proposed scheme outperforms the optimal SM and V-BLAST (Vertical Bell Laboratories Layered space-time at high signal-to-noise ratio (SNR). For example, if we seek a spectral efficiency of 8 bits/s/Hz at bit error rate (BER) of 10^-5, the proposed scheme provides 5dB and 7dB improvements over SM and V-BLAST, respectively.
D-iteration: application to differential equations
Venue: arXiv cs.NA 2012
Year: 2012

In this paper, we study how the D-iteration algorithm can be applied to numerically solve the differential equations such as heat equation in 2D or 3D. The method can be applied on the class of problems that can be addressed by the Gauss-Seidel iteration, based on the linear approximation of the differential equations.
Web service selection based on ranking of qos using associative classification
Venue: arXiv cs.SE 2012
Year: 2012

With the explosive growth of the number of services published over the Internet, it is difficult to select satisfactory web services among the candidate web services which provide similar functionalities. Quality of Service (QoS) is considered as the most important non-functional criterion for service selection. But this criterion is no longer considered as the only criterion to rank web services, satisfying user's preferences. The similarity measure (outputs-inputs similarity) between concepts based on ontology in an interconnected network of semantic Web services involved in a composition can be used as a distinguishing criterion to estimate the semantic quality of selected services for the composite service. Coupling the semantic similarity as the functional aspect and quality of services allows us to further constrain and select services for the valid composite services. In this paper, we present an overall service selection and ranking framework which firstly classify candidate web services to different QoS levels respect to user's QoS requirements and preferences with an Associative Classification algorithm and then rank the most qualified candidate services based on their functional quality through semantic matching. The experimental results show that proposed framework can satisfy service requesters' non-functional requirements.
Relay selection for multiple access relay channel with decode-forward and analog network coding
Venue: arXiv cs.IT 2012
Year: 2012

This paper presents a relay selection for decode-and-forward based on network coding (DF-NC) and analog-NC protocols in general scheme of cellular network system. In the propose scheme the two source node simultaneously transmit their own information to all the relays as well as the destination node, and then, a single relay i.e. best with a minimum symbol error rate (SER) will be selected to forward the new version of the received signal. Simulation results show that, the DF-NC scheme with considerable performance has exactness over analog-NC scheme. To improve the system performance, optimal power allocation between the two sources and the best relay is determined based on the asymptotic SER. By increasing the number of relays node, the optimum power allocation achieve better performance than asymptotic SER.
The macroeconomic effect of the information and communication technology in Hungary
Venue: arXiv cs.CY 2012
Year: 2012

It was not until the beginning of the 1990s that the effects of information and communication technology on economic growth as well as on the profitability of enterprises raised the interest of researchers. After giving a general description on the relationship between a more intense use of ICT devices and dynamic economic growth, the author identified and explained those four channels that had a robust influence on economic growth and productivity. When comparing the use of information technonology devices in developed as well as in developing countries, the author highlighted the importance of the available additional human capital and the elimination of organizational inflexibilities in the attempt of narrowing the productivity gap between the developed and developing nations. By processing a large quantitiy of information gained from Hungarian enterprises operating in several economic sectors, the author made an attempt to find a strong correlation between the development level of using ICT devices and profitability together with total factor productivity. Although the impact of using ICT devices cannot be measured unequivocally at the microeconomic level because of certain statistical and methodological imperfections, by applying such analytical methods as cluster analysis and correlation and regression calculation, the author managed to prove that both the correlation coefficient and the gradient of the regression trend line showed a positive relationship between the extensive use of information and communication technology and the profitability of enterprises.
Towards Quranic reader controlled by speech
Venue: arXiv cs.OH 2012
Year: 2012

In this paper we describe the process of designing a task-oriented continuous speech recognition system for Arabic, based on CMU Sphinx4, to be used in the voice interface of Quranic reader. The concept of the Quranic reader controlled by speech is presented, the collection of the corpus and creation of acoustic model are described in detail taking into account a specificities of Arabic language and the desired application.
Femtocaching and Device-to-Device Collaboration: A New Architecture for Wireless Video Distribution
Venue: arXiv cs.NI 2012
Year: 2012

We present a new architecture to handle the ongoing explosive increase in the demand for video content in wireless networks. It is based on distributed caching of the content in femto-basestations with small or non-existing backhaul capacity but with considerable storage space, called helper nodes. We also consider using the mobile terminals themselves as caching helpers, which can distribute video through device-to-device communications. This approach allows an improvement in the video throughput without deployment of any additional infrastructure. The new architecture can improve video throughput by one to two orders-of-magnitude.
An Intelligent Software Workflow Process Design for Location Management on Mobile Devices
Venue: arXiv cs.NI 2012
Year: 2012

Advances in the technologies of networking, wireless communication and trimness of computers lead to the rapid development in mobile communication infrastructure, and have drastically changed information processing on mobile devices. Users carrying portable devices can freely move around, while still connected to the network. This provides flexibility in accessing information anywhere at any time. For improving more flexibility on mobile device, the new challenges in designing software systems for mobile networks include location and mobility management, channel allocation, power saving and security. In this paper, we are proposing intelligent software tool for software design on mobile devices to fulfill the new challenges on mobile location and mobility management. In this study, the proposed Business Process Redesign (BPR) concept is aims at an extension of the capabilities of an existing, widely used process modeling tool in industry with 'Intelligent' capabilities to suggest favorable alternatives to an existing software workflow design for improving flexibilities on mobile devices.
Improving Seek Time for Column Store Using MMH Algorithm
Venue: arXiv cs.DB 2012
Year: 2012

Hash based search has, proven excellence on large data warehouses stored in column store. Data distribution has significant impact on hash based search. To reduce impact of data distribution, we have proposed Memory Managed Hash (MMH) algorithm that uses shift XOR group for Queries and Transactions in column store. Our experiments show that MMH improves read and write throughput by 22% for TPC-H distribution.
Discrimination between Arabic and Latin from bilingual documents
Venue: arXiv cs.CV 2012
Year: 2012

2011 International Conference on Communications, Computing and Control Applications (CCCA)
Characterization of Dynamic Bayesian Network
Venue: arXiv cs.AI 2012
Year: 2012

In this report, we will be interested at Dynamic Bayesian Network (DBNs) as a model that tries to incorporate temporal dimension with uncertainty. We start with basics of DBN where we especially focus in Inference and Learning concepts and algorithms. Then we will present different levels and methods of creating DBNs as well as approaches of incorporating temporal dimension in static Bayesian network.
Design and Engineering of a Chess-Robotic Arm
Venue: arXiv cs.RO 2012
Year: 2012

In the scope of the "Chess-Bot" project, this study's goal is to choose the right model for the robotic arm that the "the Chess-Bot" will use to move the pawn from a cell to another. In this paper, there is the definition and the structure of a robot arm. Also, the different engineering and kinematics fundamentals of the robot and its components will be detailed. Furthermore, the different structures of robotic arms will be presented and compared based on different criteria. Finally, a model for "the Chess-Bot" arm will be synthesized based on accurate algorithms and equations.
A Characterization of Bispecial Sturmian Words
Venue: arXiv cs.FL 2012
Year: 2012

A finite Sturmian word w over the alphabet {a,b} is left special (resp. right special) if aw and bw (resp. wa and wb) are both Sturmian words. A bispecial Sturmian word is a Sturmian word that is both left and right special. We show as a main result that bispecial Sturmian words are exactly the maximal internal factors of Christoffel words, that are words coding the digital approximations of segments in the Euclidean plane. This result is an extension of the known relation between central words and primitive Christoffel words. Our characterization allows us to give an enumerative formula for bispecial Sturmian words. We also investigate the minimal forbidden words for the set of Sturmian words.
Space-Time MIMO Multicasting
Venue: arXiv cs.IT 2012
Year: 2012

Multicasting is the general method of conveying the same information to multiple users over a broadcast channel. In this work, the Gaussian MIMO broadcast channel is considered, with multiple users and any number of antennas at each node. A "closed loop" scenario is assumed, for which a practical capacity-achieving multicast scheme is constructed. In the proposed scheme, linear modulation is carried over time and space together, which allows to transform the problem into that of transmission over parallel scalar sub-channels, the gains of which are equal, except for a fraction of sub-channels that vanishes with the number of time slots used. Over these sub-channels, off-the-shelf fixed-rate AWGN codes can be used to approach capacity.
Automated Feedback Generation for Introductory Programming Assignments
Venue: arXiv cs.PL 2012
Year: 2012

We present a new method for automatically providing feedback for introductory programming problems. In order to use this method, we need a reference implementation of the assignment, and an error model consisting of potential corrections to errors that students might make. Using this information, the system automatically derives minimal corrections to student's incorrect solutions, providing them with a quantifiable measure of exactly how incorrect a given solution was, as well as feedback about what they did wrong. We introduce a simple language for describing error models in terms of correction rules, and formally define a rule-directed translation strategy that reduces the problem of finding minimal corrections in an incorrect program to the problem of synthesizing a correct program from a sketch. We have evaluated our system on thousands of real student attempts obtained from 6.00 and 6.00x. Our results show that relatively simple error models can correct on average 65% of all incorrect submissions.
Vision Paper: Towards an Understanding of the Limits of Map-Reduce Computation
Venue: arXiv cs.DB 2012
Year: 2012

A significant amount of recent research work has addressed the problem of solving various data management problems in the cloud. The major algorithmic challenges in map-reduce computations involve balancing a multitude of factors such as the number of machines available for mappers/reducers, their memory requirements, and communication cost (total amount of data sent from mappers to reducers). Most past work provides custom solutions to specific problems, e.g., performing fuzzy joins in map-reduce, clustering, graph analyses, and so on. While some problems are amenable to very efficient map-reduce algorithms, some other problems do not lend themselves to a natural distribution, and have provable lower bounds. Clearly, the ease of "map-reducability" is closely related to whether the problem can be partitioned into independent pieces, which are distributed across mappers/reducers. What makes a problem distributable? Can we characterize general properties of problems that determine how easy or hard it is to find efficient map-reduce algorithms? This is a vision paper that attempts to answer the questions described above.