OpenRaiser/Intern-Atlas huggingface dataset:
Genetic algorithms for finding the weight enumerator of binary linear block codes
Venue: arXiv cs.IT 2013
Year: 2013

In this paper we present a new method for finding the weight enumerator of binary linear block codes by using genetic algorithms. This method consists in finding the binary weight enumerator of the code and its dual and to create from the famous MacWilliams identity a linear system (S) of integer variables for which we add all known information obtained from the structure of the code. The knowledge of some subgroups of the automorphism group, under which the code remains invariant, permits to give powerful restrictions on the solutions of (S) and to approximate the weight enumerator. By applying this method and by using the stability of the Extended Quadratic Residue codes (ERQ) by the Projective Special Linear group PSL2, we find a list of all possible values of the weight enumerators for the two ERQ codes of lengths 192 and 200. We also made a good approximation of the true value for these two enumerators.
Towards a model of the human society: A theoretical solution of the cooperation problem
Venue: arXiv cs.GT 2013
Year: 2013

In this paper we address the cooperation problem in structured populations by considering the prisoner's dilemma game as metaphor of the social interactions between individuals with imitation capacity. We present a new strategy update rule called democratic weighted update where the individuals behavior is socially influenced by each one of their neighbors. In particular, the capacity of an individual to socially influence other ones is proportional to its wisdom which is defined by its successful in the game. When in a neighborhood there are cooperators and defectors, the focal player is contradictorily influenced by them and, therefore, the effective social influence is given by the difference of the total wisdom of each strategy in its neighborhood. First, by considering the growing process of the network and neglecting mutations we show the evolution of highly cooperative systems. Then, we broadly shown that the social influence allows to overcome the emergence of mutants into highly cooperative systems. In this way, we are able to conclude that considering the growing process of the system, individuals with imitation capacity and the social influence the cooperation evolves. Therefore, here we present a theoretical solution of the cooperation problem among unrelated individuals with imitiation capacity.
A Multilingual Semantic Wiki Based on Attempto Controlled English and Grammatical Framework
Venue: arXiv cs.CL 2013
Year: 2013

We describe a semantic wiki system with an underlying controlled natural language grammar implemented in Grammatical Framework (GF). The grammar restricts the wiki content to a well-defined subset of Attempto Controlled English (ACE), and facilitates a precise bidirectional automatic translation between ACE and language fragments of a number of other natural languages, making the wiki content accessible multilingually. Additionally, our approach allows for automatic translation into the Web Ontology Language (OWL), which enables automatic reasoning over the wiki content. The developed wiki environment thus allows users to build, query and view OWL knowledge bases via a user-friendly multilingual natural language interface. As a further feature, the underlying multilingual grammar is integrated into the wiki and can be collaboratively edited to extend the vocabulary of the wiki or even customize its sentence structures. This work demonstrates the combination of the existing technologies of Attempto Controlled English and Grammatical Framework, and is implemented as an extension of the existing semantic wiki engine AceWiki.
Dealing with Run-Time Variability in Service Robotics: Towards a DSL for Non-Functional Properties
Venue: arXiv cs.RO 2013
Year: 2013

Service robots act in open-ended, natural environments. Therefore, due to combinatorial explosion of potential situations, it is not possible to foresee all eventualities in advance during robot design. In addition, due to limited resources on a mobile robot, it is not feasible to plan any action on demand. Hence, it is necessary to provide a mechanism to express variability at design-time that can be efficiently resolved on the robot at run-time based on the then available information. In this paper, we introduce a DSL to express run- time variability focused on the execution quality of the robot (in terms of non-functional properties like safety and task efficiency) under changing situations and limited resources. We underpin the applicability of our approach by an example integrated into an overall robotics architecture.
Optimal DoF Region of the Two-User MISO-BC with General Alternating CSIT
Venue: arXiv cs.IT 2013
Year: 2013

In the setting of the time-selective two-user multiple-input single-output (MISO) broadcast channel (BC), recent work by Tandon et al. considered the case where - in the presence of error-free delayed channel state information at the transmitter (delayed CSIT) - the current CSIT for the channel of user 1 and of user 2, alternate between the two extreme states of perfect current CSIT and of no current CSIT. Motivated by the problem of having limited-capacity feedback links which may not allow for perfect CSIT, as well as by the need to utilize any available partial CSIT, we here deviate from this `all-or-nothing' approach and proceed - again in the presence of error-free delayed CSIT - to consider the general setting where current CSIT now alternates between any two qualities. Specifically for $I_1$ and $I_2$ denoting the high-SNR asymptotic rates-of-decay of the mean-square error of the CSIT estimates for the channel of user~1 and of user~2 respectively, we consider the case where $I_1,I_2 \in\{γ,α\}$ for any two positive current-CSIT quality exponents $γ,α$. In a fast-fading setting where we consider communication over any number of coherence periods, and where each CSIT state $I_1I_2$ is present for a fraction $λ_{I_1I_2}$ of this total duration, we focus on the symmetric case of $λ_{αγ}=λ_{γα}$, and derive the optimal degrees-of-freedom (DoF) region. The result, which is supported by novel communication protocols, naturally incorporates the aforementioned `Perfect current' vs. `No current' setting by limiting $I_1,I_2\in\{0,1\}$. Finally, motivated by recent interest in frequency correlated channels with unmatched CSIT, we also analyze the setting where there is no delayed CSIT.
On Random Sampling Auctions for Digital Goods
Venue: arXiv cs.GT 2013
Year: 2013

In the context of auctions for digital goods, an interesting random sampling auction has been proposed by Goldberg, Hartline, and Wright [2001]. This auction has been analyzed by Feige, Flaxman, Hartline, and Kleinberg [2005], who have shown that it is 15-competitive in the worst case {which is substantially better than the previously proven constant bounds but still far from the conjectured competitive ratio of 4. In this paper, we prove that the aforementioned random sampling auction is indeed 4-competitive for a large class of instances where the number of bids above (or equal to) the optimal sale price is at least 6. We also show that it is 4:68-competitive for the small class of remaining instances thus leaving a negligible gap between the lower and upper bound. We employ a mix of probabilistic techniques and dynamic programming to compute these bounds.
Hybrid DEEC: Towards Efficient Energy Utilization in Wireless Sensor Networks
Venue: arXiv cs.NI 2013
Year: 2013

The clustering algorithm are considered as a kind of key technique used to reduce energy consumption. It can help in increasing the stability period and network life time. Routing protocol for efficient energy utilization should be designed for heterogeneous Wireless Sensor Networks (WSNs). We purpose Hybrid-DEEC (H-DEEC), a chain and cluster based (hybrid) distributed scheme for efficient energy utilization in WSNs. In H-DEEC,elected Cluster Heads (CHs) communicate the Base Station (BS) through beta elected nodes, by using multi-hopping. We logically divide the network into two parts, on the basis of the residual energy of nodes. The normal nodes with high initial and residual energy will behighlyprobable to be CHs than the nodes with lesser energy. To overcome the deficiencies of H-DEEC, we propose Multi-Edged Hybrid-DEEC (MH-DEEC). In MH-DEEC the criteria of chain construction is modified. Finally, the comparison in simulation results with other heterogeneous protocols show that, MH-DEEC and H-DEEC achieves longer stability time and network life time due to efficient energy utilization.
Using UWB for Human Trajectory Extraction
Venue: arXiv cs.OH 2013
Year: 2013

In this paper we report on a methodology to model pedestrian behaviours whilst aggregate variables are concerned, with potential applications to different situations, such as evacuating a building in emergency events. The approach consists of using UWB (ultra-wide band) based data collection to characterise behaviour in specific scenarios. From a number of experiments carried out, we detail the single-file scenario to demonstrate the ability of this approach to represent macroscopic characteristics of the pedestrian flow. Results are discussed and we can conclude that UWB-based data collection shows great potential and suitability for human trajectory extraction, when compared to other traditional approaches.
Minimum BER Power Adjustment and Receiver Design for Distributed Space-Time Coded Cooperative MIMO Relaying Systems
Venue: arXiv cs.IT 2013
Year: 2013

An adaptive joint power allocation (JPA) and linear receiver design algorithm using the minimum bit error rate (MBER) criterion for a cooperative Multiple-Input Multiple-Output (MIMO) network is proposed. The system employs multiple relays with Distributed Space-Time Coding (DSTC) schemes and an Amplify-and-Forward (AF) strategy. It is designed according to a joint constrained optimization algorithm to determine the MBER power allocation parameters and the receive filter parameters for each transmitted symbol. The simulation results indicate that the proposed algorithm obtains performance gains compared to the equal power allocation systems and the minimum mean square error (MMSE) designs.
Multi-Layer Hybrid-ARQ for an Out-of-Band Relay Channel
Venue: arXiv cs.IT 2013
Year: 2013

This paper addresses robust communication on a fading relay channel in which the relay is connected to the decoder via an out-of-band digital link of limited capacity. Both the source-to-relay and the source-to-destination links are subject to fading gains, which are generally unknown to the encoder prior to transmission. To overcome this impairment, a hybrid automatic retransmission request (HARQ) protocol is combined with multi-layer broadcast transmission, thus allowing for variable-rate decoding. Moreover, motivated by cloud radio access network applications, the relay operation is limited to compress-and-forward. The aim is maximizing the throughput performance as measured by the average number of successfully received bits per channel use, under either long-term static channel (LTSC) or short-term static channel (STSC) models. In order to opportunistically leverage better channel states based on the HARQ feedback from the decoder, an adaptive compression strategy at the relay is also proposed. Numerical results confirm the effectiveness of the proposed strategies.
Business information through Spain's Chambers of Commerce: meeting business needs
Venue: arXiv cs.DL 2013
Year: 2013

From different public and private instances, mechanisms have been set in action that allow for companies to obtain information in order to make decisions with a stronger foundation. This article is focused on the description of an entire information system for the business world, developed in the realm of the Chambers of Commerce of Spain, which have given rise to the creation of an authentic network of inter-chamber information. In Spain, the obligatory membership of businesses to the Chambers of Commerce in their geographic areas, and therefore the compulsory payment of member quotas, has traditionally generated some polemics, above all because many firms have not perceived a material usefulness of the services offered by these Chambers. Notwithstanding, the 85 Chambers currently existing in Spain, as well as the organism that coordinates them -the Upper Council or Consejo Superior de Camaras de Comercio- and the company created expressly to commercialize informational services online, Camerdata, have developed genuinely informative tools that cover a good part of the informational demands that a business might claim, described here.
On Constructing the Value Function for Optimal Trajectory Problem and its Application to Image Processing
Venue: arXiv cs.CV 2013
Year: 2013

We proposed an algorithm for solving Hamilton-Jacobi equation associated to an optimal trajectory problem for a vehicle moving inside the pre-specified domain with the speed depending upon the direction of the motion and current position of the vehicle. The dynamics of the vehicle is defined by an ordinary differential equation, the right hand of which is given by product of control(a time dependent fuction) and a function dependent on trajectory and control. At some unspecified terminal time, the vehicle reaches the boundary of the pre-specified domain and incurs a terminal cost. We also associate the traveling cost with a type of integral to the trajectory followed by vehicle. We are interested in a numerical method for finding a trajectory that minimizes the sum of the traveling cost and terminal cost. We developed an algorithm solving the value function for general trajectory optimization problem. Our algorithm is closely related to the Tsitsiklis's Fast Marching Method and J. A. Sethian's OUM and SLF-LLL[1-4] and is a generalization of them. On the basis of these results, We applied our algorithm to the image processing such as fingerprint verification.
A Robust Rapid Approach to Image Segmentation with Optimal Thresholding and Watershed Transform
Venue: arXiv cs.CV 2013
Year: 2013

This paper describes a novel method for partitioning image into meaningful segments. The proposed method employs watershed transform, a well-known image segmentation technique. Along with that, it uses various auxiliary schemes such as Binary Gradient Masking, dilation which segment the image in proper way. The algorithm proposed in this paper considers all these methods in effective way and takes little time. It is organized in such a manner so that it operates on input image adaptively. Its robustness and efficiency makes it more convenient and suitable for all types of images.
CellTV - on the Benefit of TV Distribution over Cellular Networks A Case Study
Venue: arXiv cs.NI 2013
Year: 2013

As mobile IP-access is becoming the dominant technology for providing wireless services, the demand for more spectrum for this type of access is increasing rapidly. Since IP-access can be used for all types of services, instead of a plethora of dedicated, single-service systems, there is a significant potential to make spectrum use more efficient. In this paper, the feasibility and potential benefit of replacing the current terrestrial UHF TV broadcasting system with a mobile, cellular data (IP-) network is analyzed. In the cellular network, TV content would be provided as {one} of the services, here referred to as CellTV. In the investigation we consider typical Swedish rural and urban environments. We use different models for TV viewing patterns and cellular technologies as expected in the year 2020. Results of the quantitative analysis indicate that CellTV distribution can be beneficial if the TV consumption trend goes towards more specialized programming, more local contents, and more on-demand requests. Mobile cellular systems, with their flexible unicast capabilities, will be an ideal platform to provide these services. However, the results also demonstrate that CellTV is not a spectrum-efficient replacement for terrestrial TV broadcasting with current viewing patterns (i.e. a moderate number of channels with each a high numbers of viewers). In this case, it is doubtful whether the expected spectrum savings can motivate the necessary investments in upgrading cellular sites and developing advanced TV receiver required for the success of CellTV distribution.
Convolutional Codes: Techniques of Construction
Venue: arXiv cs.IT 2013
Year: 2013

In this paper we show how to construct new convolutional codes from old ones by applying the well-known techniques: puncturing, extending, expanding, direct sum, the (u|u + v) construction and the product code construction. By applying these methods, several new families of convolutional codes can be constructed. As an example of code expansion, families of convolutional codes derived from classical Bose- Chaudhuri-Hocquenghem (BCH), character codes and Melas codes are constructed.
Bounds on the Number of Huffman and Binary-Ternary Trees
Venue: arXiv cs.IT 2013
Year: 2013

Huffman coding is a widely used method for lossless data compression because it optimally stores data based on how often the characters occur in Huffman trees. An $n$-ary Huffman tree is a connected, cycle-lacking graph where each vertex can have either $n$ "children" vertices connecting to it, or 0 children. Vertices with 0 children are called \textit{leaves}. We let $h_n(q)$ represent the total number of $n$-ary Huffman trees with $q$ leaves. In this paper, we use a recursive method to generate upper and lower bounds on $h_n(q)$ and get $h_2(q) \approx (0.1418532)(1.7941471)^q+(0.0612410)(1.2795491)^q$ for $n=2$. This matches the best results achieved by Elsholtz, Heuberger, and Prodinger in August 2011. Our approach reveals patterns in Huffman trees that we used in our analysis of the Binary-Ternary (BT) trees we created. Our research opens a completely new door in data compression by extending the study of Huffman trees to BT trees. Our study of BT trees paves the way for designing data-specific trees, minimizing possible wasted storage space from Huffman coding. We prove a recursive formula for the number of BT trees with $q$ leaves. Furthermore, we provide analysis and further proofs to reach numeric bounds. Our discoveries have broad applications in computer data compression. These results also improve graphical representations of protein sequences that facilitate in-depth genome analysis used in researching evolutionary patterns.
Transmit Antenna Selection with Alamouti Scheme in MIMO Wiretap Channels
Venue: arXiv cs.IT 2013
Year: 2013

This paper proposes a new transmit antenna selection (TAS) scheme which provides enhanced physical layer security in multiple-input multiple-output (MIMO) wiretap channels. The practical passive eavesdropping scenario we consider is where channel state information (CSI) from the eavesdropper is not available at the transmitter. Our new scheme is carried out in two steps. First, the transmitter selects the first two strongest antennas based on the feedback from the receiver, which maximizes the instantaneous signal-to-noise ratio (SNR) of the transmitter-receiver channel. Second, the Alamouti scheme is employed at the selected antennas in order to perform data transmission. At the receiver and the eavesdropper, maximal-ratio combining is applied in order to exploit the multiple antennas.We derive a new closed-form expression for the secrecy outage probability in nonidentical Rayleigh fading, and using this result, we then present the probability of non-zero secrecy capacity in closed form and the ε-outage secrecy capacity in numerical form. We demonstrate that our proposed TAS-Alamouti scheme offers lower secrecy outage probability than a single TAS scheme when the SNR of the transmitter-receiver channel is above a specific value.
Full-Duplex Cooperative Cognitive Radio with Transmit Imperfections
Venue: arXiv cs.IT 2013
Year: 2013

This paper studies the cooperation between a primary system and a cognitive system in a cellular network where the cognitive base station (CBS) relays the primary signal using amplify-and-forward or decode-and-forward protocols, and in return it can transmit its own cognitive signal. While the commonly used half-duplex (HD) assumption may render the cooperation less efficient due to the two orthogonal channel phases employed, we propose that the CBS can work in a full-duplex (FD) mode to improve the system rate region. The problem of interest is to find the achievable primary-cognitive rate region by studying the cognitive rate maximization problem. For both modes, we explicitly consider the CBS transmit imperfections, which lead to the residual self-interference associated with the FD operation mode. We propose closed-form solutions or efficient algorithms to solve the problem when the related residual interference power is non-scalable or scalable with the transmit power. Furthermore, we propose a simple hybrid scheme to select the HD or FD mode based on zero-forcing criterion, and provide insights on the impact of system parameters. Numerical results illustrate significant performance improvement by using the FD mode and the hybrid scheme.
Application Set Approximation in Optimal Input Design for Model Predictive Control
Venue: arXiv cs.SY 2013
Year: 2013

This contribution considers one central aspect of experiment design in system identification. When a control design is based on an estimated model, the achievable performance is related to the quality of the estimate. The degradation in control performance due to errors in the estimated model is measured by an application cost function. In order to use an optimization based input design method, a convex approximation of the set of models that atisfies the control specification is required. The standard approach is to use a quadratic approximation of the application cost function, where the main computational effort is to find the corresponding Hessian matrix. Our main contribution is an alternative approach for this problem, which uses the structure of the underlying optimal control problem to considerably reduce the computations needed to find the application set. This technique allows the use of applications oriented input design for MPC on much more complex plants. The approach is numerically evaluated on a distillation control problem.
Optimization of PI Coefficients in DSTATCOM Nonlinear Controller for Regulating DC Voltage using Particle Swarm Optimization
Venue: arXiv cs.SY 2013
Year: 2013

Non-linear controller is preferred to linear controller due to non-linear operation of DSTATCOM. System dynamic can be improved by regulating and fixing the capacitor DC voltage in DSTATCOM. The nonlinear control is based on exact linearization via feedback. There is a PI controller in this system to regulate DC voltage. In conventional scheme, the trial and error method is used to determine PI values. Exact calculation to optimize PI coefficients can be carried out to reduce disturbances in DC link voltage and thus, in this paper, Particle Swarm Optimization is applied. As a result, Capacitor voltage tracks the reference values which have less vibration than conventional status. Both trial and error method and PSO are implemented. A set of corresponding diagrams achieved by these two methods are offered to demonstrate the effectiveness of new method. Optimizations and Simulations are worked out in MATLAB environment.