Filters








69,785 Hits in 4.5 sec

Ergodic H-S/MRC Mutual Information [article]

Zeliang Ou, Chongjun Ouyang, Pei Yang, Lu Zhang, Hongwen Yang, Xin Zhang
2019 arXiv   pre-print
For independent and identically distributed (i.i.d.) Rayleigh flat fading, a general recursive expression is developed to estimate the ergodic input-output mutual information of the whole system.  ...  This paper studies the ergodic mutual information of hybrid selection/maximal-ratio combining (H-S/MRC) diversity system under BPSK/QPSK modulations.  ...  As explained earlier, the expansion of the β-function in Equ. ( Fig. 1 . 1 Simulated and analytical ergodic mutual information versusγ when L = 1.  ... 
arXiv:1904.12239v2 fatcat:sgqbdmfylrbj3fa2vo4in5bjbq

Taking a Detour to Zero: An Alternative Formalization of Functions Beyond PR [article]

David M. Cerna
2018 arXiv   pre-print
There are two well known systems formalizing total recursion beyond primitive recursion (PR), system T by Gödel and system F by Girard and Reynolds. system T defines recursion on typed objects and can  ...  We can show that our formalism expresses the functions expressible using system T. We leave comparison to system F and beyond to future work.  ...  Equivalence to Primitive Recursion General Formulation and the Mutual Ackermann Function The higher in the GPR hierarchy the more recursive variables are needed.  ... 
arXiv:1609.07254v3 fatcat:f6hwus7i6ff6tosuaf2ddg3k5i

Datatypes in L2 [chapter]

Nick Chapman, Simon Finn, Michael P. Fourman
1994 Lecture Notes in Computer Science  
The subset includes parameterisation and mutual recursion but has restrictions on the use of function type construction. We sketch a set-theoretic model for these datatypes.  ...  Finally, we briefly discuss the relationship between L2's datatypes and datatypes in HOL.  ...  The work reported in this paper was partially funded by the projects Formal System Design (IED/2/1292) and Synthesis, Optimisation and Analysis (JESSI AC8).  ... 
doi:10.1007/3-540-58450-1_39 fatcat:4gprnirchneuxkiutnr2spafn4

Initializing Mutually Referential Abstract Objects: The Value Recursion Challenge

Don Syme
2006 Electronical Notes in Theoretical Computer Science  
Mutual dependencies between objects arise frequently in programs, and programmers must typically solve this value recursion by manually filling "initialization holes" to help construct the corresponding  ...  Our primary contribution is to use the mechanism to develop compelling examples of how the absence of value recursion leads to real problems in the presence of abstraction boundaries, and give micro-examples  ...  We also thank anonymous reviewers for their helpful remarks and lively discussion.  ... 
doi:10.1016/j.entcs.2005.11.038 fatcat:5oq5mbebybadlfslzzhfda27s4

Simple implementations of mutually orthogonal complementary sets of sequences

Xiaojing Huang
2005 2005 International Symposium on Intelligent Signal Processing and Communication Systems  
Then, their superb scalability and completeness are summarized. Finally, the C and Matlab functions and a logic schematic diagram are given to easily generate these complementary sequences.  ...  Then, their superb scalability and completeness are summarized. Finally, the C and Matlab functions and a logic schematic diagram are given to easily generate these complementary sequences.  ...  = (_ 1) Y(ir,I e'r ekr)jr+('n-l(ekn-I )jn-I 8 function h=hn(i, j,k,n) j=bitand(bitxor(bitshift(j,l),bitxor(i,k)),j); for i=l:n-1 j=bitxor(bitshift(j,-l),bitand(j,l)); end h=(-l)^j; If we use digital circuit  ... 
doi:10.1109/ispacs.2005.1595423 fatcat:f7tbtejjrng37ho46gq47swzvq

IsoLATE: A Type System for Self-recursion [chapter]

Ravi Chugh
2015 Lecture Notes in Computer Science  
One semantic approach is to use simple record types and explicit recursion (i.e. fix) to define mutually recursive units of functionality.  ...  Furthermore, these systems do not apply to languages without explicit recursion (such as JavaScript, Python, and Ruby).  ...  The author wishes to thank Cédric Fournet, Ranjit Jhala, Arjun Guha, Niki Vazou, and anonymous reviewers for many helpful comments and suggestions that have improved this paper.  ... 
doi:10.1007/978-3-662-46669-8_11 fatcat:bsg6mvijwnfytmto2j6t7lcptm

Conversion to tail recursion in term rewriting

Naoki Nishida, Germán Vidal
2014 The Journal of Logic and Algebraic Programming  
In this article, we introduce an automatic transformation of first-order functions into tail recursive form. Functions are defined using a (first-order) term rewrite system.  ...  Tail recursive functions are a special kind of recursive functions where the last action in their body is the recursive call.  ...  Introduction Tail recursive functions are recursive functions that call themselves (or other mutually recursive functions) as a final action in their recursive definitions.  ... 
doi:10.1016/j.jlap.2013.07.001 fatcat:glmgqdwc5rccdh3ap6nyyuyz5m

Embedding of Systems of Affine Recurrence Equations in Coq [chapter]

David Cachera, David Pichardie
2003 Lecture Notes in Computer Science  
This allows us to automatically prove that the functional translation of equations respects the wanted xpoint properties, and to systematically derive mutual induction schemes.  ...  system.  ...  Dom X : n times z }| { Z -> ... -> Z -> Prop Mutually recursive functions Let us consider a SARE de ned as follows, where each variable X j is de ned on a domain of dimension n j and has a number l j  ... 
doi:10.1007/10930755_10 fatcat:w26wn6ys3bamdkxd64oyt2n32i

Polytypic unification

PATRIK JANSSON, JOHAN JEURING
1998 Journal of functional programming  
The system is self contained but does not handle all tree types as it can not generate code for mutual recursive functions, and also requires that all constructors in the types have exactly one argument  ...  This report describes what polytypic programming is, a new system for writing polytypic functions, and a number of useful example functions including generalised versions of map, zip and a specific lazy  ...  In appendix A we show all the code generated by the system for two directly recursive types and one pair of mutually recursive types.  ... 
doi:10.1017/s095679689800313x fatcat:ynxyoyuozfh4zf3xitq2xq3iem

Sensitivity analysis of the metric based test selection [chapter]

Jadranka A. Curgus, Son T. Vuong, Jinsong Zhu
1997 Testing of Communicating Systems  
In our earlier work [7, 3], we introduced a novel concept of test distance and an effective multi-pass metric-based method of test selection for communication protocols.  ...  We present empirical results regarding the sensitivity of common metric definitions to various aspects of protocols such as recursion levels, multiple concurrent connections, transition or event patterns  ...  Test development system The test system that we use to conduct the experiments is the TESTGEN+ system [8] . A functional diagram of the system is shown in Figure 1 .  ... 
doi:10.1007/978-0-387-35198-8_13 fatcat:r3gl52srtvgxjc3uiczcgzt3eu

Generic programming with fixed points for mutually recursive datatypes

Alexey Rodriguez Yakushev, Stefan Holdermans, Andres Löh, Johan Jeuring
2009 Proceedings of the 14th ACM SIGPLAN international conference on Functional programming - ICFP '09  
Many real-life examples such as abstract syntax trees are in fact systems of mutually recursive datatypes and therefore excluded.  ...  Using Haskell's GADTs and type families, we describe a technique that allows a fixed-point view for systems of mutually recursive datatypes.  ...  Acknowledgements José Pedro Magalhães and Marcos Viera commented on a previous version of this paper.  ... 
doi:10.1145/1596550.1596585 dblp:conf/icfp/YakushevHLJ09 fatcat:bt2sbjcot5ae7i3tiikia63szi

Generic programming with fixed points for mutually recursive datatypes

Alexey Rodriguez Yakushev, Stefan Holdermans, Andres Löh, Johan Jeuring
2009 SIGPLAN notices  
Many real-life examples such as abstract syntax trees are in fact systems of mutually recursive datatypes and therefore excluded.  ...  Using Haskell's GADTs and type families, we describe a technique that allows a fixed-point view for systems of mutually recursive datatypes.  ...  Acknowledgements José Pedro Magalhães and Marcos Viera commented on a previous version of this paper.  ... 
doi:10.1145/1631687.1596585 fatcat:ulx633rmufbu5plbom2wiwdauy

System Demonstration of Spiral: Generator for High-Performance Linear Transform Libraries [chapter]

Yevgen Voronenko, Franz Franchetti, Frédéric de Mesmay, Markus Püschel
2008 Lecture Notes in Computer Science  
We demonstrate Spiral, a domain-specific library generation system.  ...  The key idea underlying Spiral is to perform automatic reasoning and optimizations at a high abstraction level using the mathematical, declarative domainspecific languages SPL and P -SPL and a rigorous  ...  The system is based on a set of techniques from different disciplines including linear algebra, algorithms, programming languages, generative programming, rewriting systems, and compilers.  ... 
doi:10.1007/978-3-540-79980-1_30 fatcat:mnhwp3iw45c4ncdkt7qz5onr2y

Cumulative subject index volumes 44–47

1980 Information and Control  
A B Adult concept and extension concept, equivalent for deterministic 0L systems with two tables, 47, 107 Affine transformations and linear equivalences of Boolean functions, 45, 156 Algebras tree, of  ...  Greibach, 46, 108 Algorithm for determining affine and general linear equivalences of Boolean functions, 45, 156 robustized vector recursive stabilizer, for image restoration, 44, 320 simple level, expected  ...  for, 46, 270 Gaussian noise contamination, and mutual information and channel capacity, 46, 46 Generating functions for derivation trees, 45, 199 Global sensitivity generalized, and correlation  ... 
doi:10.1016/s0019-9958(80)90592-6 fatcat:zwdwzq5kifakzlpgfkl5hog2ra

Shannon information retrieved from overlapped chromatographic peaks with Kalman filter

Yuzuru HAYASHI, Sumie YOSHIOKA, Yasushi TAKEDA
1989 Analytical Sciences  
A function (FUMI) which describes the Shannon mutual information in chromatography is derived.  ...  Computer simulation demonstrates that a sufficient amount of mutual information can be retrieved from overlapped peaks (Gaussian) through (i) observation and (ii) data processing.  ...  Analytical systems provide us with information in various forms and ways.  ... 
doi:10.2116/analsci.5.329 fatcat:pvilx4d32ngt5eqbdznio6xd4e
« Previous Showing results 1 — 15 out of 69,785 results