Browsing
     by title


0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

or enter first few letters:   
OK
Full Text
Peer Reviewed
See detailOn indefinite sums weighted by periodic sequences
Marichal, Jean-Luc UL

in Results in Mathematics (2019), 74(3), 95

For any integer $q\geq 2$ we provide a formula to express indefinite sums of a sequence $(f(n))_{n\geq 0}$ weighted by $q$-periodic sequences in terms of indefinite sums of sequences $(f(qn+p))_{n\geq 0 ... [more ▼]

For any integer $q\geq 2$ we provide a formula to express indefinite sums of a sequence $(f(n))_{n\geq 0}$ weighted by $q$-periodic sequences in terms of indefinite sums of sequences $(f(qn+p))_{n\geq 0}$, where $p\in\{0,\ldots,q-1\}$. When explicit expressions for the latter sums are available, this formula immediately provides explicit expressions for the former sums. We also illustrate this formula through some examples. [less ▲]

Detailed reference viewed: 82 (11 UL)
Full Text
Peer Reviewed
See detailOn Input Market Frictions and Estimation of Factors Demand
Dupuy, Arnaud UL; Sorensen, Todd

in Southern Economic Journal (2014)

Detailed reference viewed: 54 (4 UL)
Full Text
Peer Reviewed
See detailOn Input/Output Argumentation Frameworks
Baroni, Pietro UL; Boella, Guido UL; Cerutti, Federico et al

in Proceedings of COMMA (2012)

This paper introduces Input/Output Argumentation Frameworks, a novel approach to characterize the behavior of an argumentation framework as a sort of black box exposing a well-defined external interface ... [more ▼]

This paper introduces Input/Output Argumentation Frameworks, a novel approach to characterize the behavior of an argumentation framework as a sort of black box exposing a well-defined external interface. As a starting point, we define the novel notion of semantics decomposability and analyze complete, stable, grounded and preferred semantics in this respect. Then we show as a main result that, under grounded, complete, stable and credulous preferred semantics, Input/Output Argumentation Frameworks with the same behavior can be interchanged without affecting the result of semantics evaluation of other arguments interacting with them [less ▲]

Detailed reference viewed: 37 (3 UL)
See detailOn Intersection Codes and Iterative Decoding
Franck, Christian UL

Doctoral thesis (2013)

Detailed reference viewed: 127 (23 UL)
Full Text
Peer Reviewed
See detailOn Invertible Three Neighborhood Null-Boundary Uniform Cellular Automata
Ghosh, Soumyabrata UL; Maiti, Nirmalya S.; Chaudhuri, P. Pal et al

in Complex Systems (2011), 20(1), 4

Detailed reference viewed: 33 (4 UL)
Full Text
Peer Reviewed
See detailOn Judgment Aggregation in Abstract Argumentation
Caminada, Martin UL; Pigozzi, Gabriella UL

in Autonomous Agents & Multi-Agent Systems (2011), 22(1), 64102

Judgment aggregation is a field in which individuals are required to vote for or against a certain decision (the conclusion) while providing reasons for their choice. The reasons and the conclusion are ... [more ▼]

Judgment aggregation is a field in which individuals are required to vote for or against a certain decision (the conclusion) while providing reasons for their choice. The reasons and the conclusion are logically connected propositions. The problem is how a collective judgment on logically interconnected propositions can be defined from individual judgments on the same propositions. It turns out that, despite the fact that the individuals are logically consistent, the aggregation of their judgments may lead to an inconsistent group outcome, where the reasons do not support the conclusion. However, in this paper we claim that collective irrationality should not be the only worry of judgment aggregation. For example, judgment aggregation would not reject a consistent combination of reasons and conclusion that no member voted for. In our view this may not be a desirable solution. This motivates our research about when a social outcome is ‘compatible’ with the individuals’ judgments. The key notion that we want to capture is that any individual member has to be able to defend the collective decision. This is guaranteed when the group outcome is compatible with its members views. Judgment aggregation problems are usually studied using classical propositional logic. However, for our analysis we use an argumentation approach to judgment aggregation problems. Indeed the question of how individual evaluations can be combined into a collective one can also be addressed in abstract argumentation. We introduce three aggregation operators that satisfy the condition above, and we offer two definitions of compatibility. Not only does our proposal satisfy a good number of standard judgment aggregation postulates, but it also avoids the problem of individual members of a group having to become committed to a group judgment that is in conflict with their own individual positions. [less ▲]

Detailed reference viewed: 57 (1 UL)
Full Text
Peer Reviewed
See detailOn Key Recovery Attacks against Existing Somewhat Homomorphic Encryption Schemes
Chenal, Massimo UL; Tang, Qiang UL

in Progress in Cryptology - LATINCRYPT 2014, Florianópolis 17-19 September 2014 (2014)

In his seminal paper at STOC 2009, Gentry left it as a future work to investigate (somewhat) homomorphic encryption schemes with IND-CCA1 security. At SAC 2011, Loftus et al. showed an IND-CCA1 attack ... [more ▼]

In his seminal paper at STOC 2009, Gentry left it as a future work to investigate (somewhat) homomorphic encryption schemes with IND-CCA1 security. At SAC 2011, Loftus et al. showed an IND-CCA1 attack against the somewhat homomorphic encryption scheme presented by Gentry and Halevi at Eurocrypt 2011. At ISPEC 2012, Zhang, Plantard and Susilo showed an IND-CCA1 attack against the somewhat homomorphic encryption scheme developed by van Dijk et al. at Eurocrypt 2010. In this paper, we continue this line of research and show that most existing somewhat homomorphic encryption schemes are not IND-CCA1 secure. In fact, we show that these schemes suffer from key recovery attacks (stronger than a typical IND-CCA1 attack), which allow an adversary to recover the private keys through a number of decryption oracle queries. The schemes, that we study in detail, include those by Brakerski and Vaikuntanathan at Crypto 2011 and FOCS 2011, and that by Gentry, Sahai and Waters at Crypto 2013. We also develop a key recovery attack that applies to the somewhat homomorphic encryption scheme by van Dijk et al., and our attack is more efficient and conceptually simpler than the one developed by Zhang et al.. Our key recovery attacks also apply to the scheme by Brakerski, Gentry and Vaikuntanathan at ITCS 2012, and we also describe a key recovery attack for the scheme developed by Brakerski at Crypto 2012. [less ▲]

Detailed reference viewed: 169 (28 UL)
Full Text
Peer Reviewed
See detailOn Koszul-Tate resolutions and Sullivan models
Pistalo, Damjan UL; Poncin, Norbert UL

in Dissertationes Mathematicae (2018), 531

Detailed reference viewed: 191 (28 UL)
Peer Reviewed
See detailOn L2 error bounds between systems
Salinas, A.; Papachristodoulou, A.; Goncalves, Jorge UL

Scientific Conference (2006)

Detailed reference viewed: 25 (1 UL)
Full Text
Peer Reviewed
See detailOn Lambda and Time Operators: the Inverse Intertwining Problem Revisited
Gómez-Cubillo, Fernando; Suchanecki, Zdzislaw UL; Villullas, S.

in International Journal of Theoretical Physics (2011), 50

An exact theory of irreversibility was proposed by Misra, Prigogine and Courbage, based on non-unitary similarity transformations Λ that intertwine reversible dynamics and irreversible ones. This would ... [more ▼]

An exact theory of irreversibility was proposed by Misra, Prigogine and Courbage, based on non-unitary similarity transformations Λ that intertwine reversible dynamics and irreversible ones. This would advocate the idea that irreversible behavior would originate at the microscopic level. Reversible evolution with an internal time operator have the intertwining property. Recently the inverse intertwining problem has been answered in the negative, that is, not every unitary evolution allowing such Λ-transformation has an internal time. This work contributes new results in this direction. [less ▲]

Detailed reference viewed: 44 (0 UL)
Full Text
Peer Reviewed
See detailOn Lambda transformation approach to the theory of irreversibility
Gómez-Cubillo, Fernando; Suchanecki, Zdzislaw UL

in Bussei Kenkyu (2012), 97(3), 398-413

Detailed reference viewed: 25 (2 UL)
See detailOn Learning a Language in Transformation: Two final year students’ experiences in Chinese complementary education
Li, Jinling; Juffermans, Kasper UL

E-print/Working paper (2011)

This paper is concerned with Chinese-Dutch children’s experiences with learning Chinese in the Netherlands. The paper presents basic facts about the Chinese language and its changing position in the world ... [more ▼]

This paper is concerned with Chinese-Dutch children’s experiences with learning Chinese in the Netherlands. The paper presents basic facts about the Chinese language and its changing position in the world, a brief history of the Chinese diaspora in the Netherlands and the context of Chinese complementary education. It analyses two written accounts of final year students’ experiences with learning Chinese, focusing on the ways of speaking about Chinese in relation to identity and education. In conclusion, it is argued that the students’ experiences urge us to consider Chinese as a polycentric language – i.e. as a language with multiple and competing centres of gravity – and as a language in transformation. [less ▲]

Detailed reference viewed: 47 (0 UL)
Full Text
Peer Reviewed
See detailOn Learning Navigation Behaviors for Small Mobile Robots With Reservoir Computing Architectures
Antonelo, Eric Aislan UL; Schrauwen, B.

in IEEE Transactions on Neural Networks and Learning Systems (2015), 26(4), 763-780

Detailed reference viewed: 68 (5 UL)
Full Text
Peer Reviewed
See detailOn Legality in Criminal Matters between Primacy of EU Law and National Constitutional Traditions. A Study of the Taricco Saga
Allegrezza, Silvia UL

in Mitsilegas, Valsamis; di martino, Alberto; Mancano, Leandro (Eds.) The Court of Justice and European Criminal Law Leading Cases in a Contextual Analysis (2019)

The present article retraces the history of the “Taricco saga” before the Court of Justice of the European Union (CJEU), which put in the spotlight the clashes between the primacy and effectiveness of EU ... [more ▼]

The present article retraces the history of the “Taricco saga” before the Court of Justice of the European Union (CJEU), which put in the spotlight the clashes between the primacy and effectiveness of EU law in the field of the protection of the financial interests of the EU, and the constitutional identities of the Member States with regard to fundamental rights in criminal law. Starting from the analysis of the first firm stance of the CJEU in the Taricco I judgment, to the Italian Constitutional Court’s reaction in defence of its own interpretation of the principle of legality in criminal law, the article then focuses on the final revirement of the CJEU towards a more tolerant position in M.A.S. and M.B.. The author, building upon the notion of constitutional pluralism and tolerance, does not consider such outcome as a defeat for the primacy of EU but rather welcomes it as a first step towards a more inclusive approach to the principle of primacy of EU law that necessarily encompasses fundamental rights and constitutional traditions, and that takes into due consideration the specificities of criminal law. [less ▲]

Detailed reference viewed: 23 (4 UL)
Full Text
Peer Reviewed
See detailOn level one cuspidal Bianchi modular forms
Rahm, Alexander UL; Şengün, Mehmet Haluk

in LMS J. Comput. Math. (2013), 16

Detailed reference viewed: 89 (0 UL)
Full Text
Peer Reviewed
See detailOn Lévy's Brownian motion indexed by elements of compact groups
Baldi, Paolo; Rossi, Maurizia UL

in Colloquium Mathematicum (2013)

Detailed reference viewed: 68 (1 UL)
Full Text
Peer Reviewed
See detailOn linear decompositions of L-valued simple graphs
Bisdorff, Raymond UL

E-print/Working paper (1996)

In this report we will present a linear decomposition of a given L- valued binary relation into a set of sub-relations of kernel-dimension one. We will apply this theoretical result to the design of a ... [more ▼]

In this report we will present a linear decomposition of a given L- valued binary relation into a set of sub-relations of kernel-dimension one. We will apply this theoretical result to the design of a faster algorithm for computing L-valued kernels on general L-valued simple graphs. [less ▲]

Detailed reference viewed: 8 (0 UL)
Full Text
Peer Reviewed
See detailOn living in a multicultural environment
Murdock, Elke UL

in Murdock, Elke (Ed.) Multiculturalism, Identity and Difference. Experiences of Culture Contact. (2016)

Detailed reference viewed: 78 (0 UL)
Full Text
Peer Reviewed
See detailOn Locating Malicious Code in Piggybacked Android Apps
Li, Li UL; Li, Daoyuan UL; Bissyande, Tegawendé François D Assise UL et al

in Journal of Computer Science & Technology (2017)

To devise efficient approaches and tools for detecting malicious packages in the Android ecosystem, researchers are increasingly required to have a deep understanding of malware. There is thus a need to ... [more ▼]

To devise efficient approaches and tools for detecting malicious packages in the Android ecosystem, researchers are increasingly required to have a deep understanding of malware. There is thus a need to provide a framework for dissecting malware and locating malicious program fragments within app code in order to build a comprehensive dataset of malicious samples. Towards addressing this need, we propose in this work a tool-based approach called HookRanker, which provides ranked lists of potentially malicious packages based on the way malware behaviour code is triggered. With experiments on a ground truth of piggybacked apps, we are able to automatically locate the malicious packages from piggybacked Android apps with an accuracy@5 of 83.6% for such packages that are triggered through method invocations and an accuracy@5 of 82.2% for such packages that are triggered independently. [less ▲]

Detailed reference viewed: 126 (9 UL)
Full Text
Peer Reviewed
See detailOn low complexity detection for QAM isomorphic constellations
Kayhan, Farbod UL

in Kayhan, Farbod (Ed.) On low compelxity detection for QAM isomorphic constellations (2017, December)

Despite of the known gap from the Shannon's capacity, several standards are still employing QAM or star shape constellations, mainly due to the existing low complexity detectors. In this paper, we ... [more ▼]

Despite of the known gap from the Shannon's capacity, several standards are still employing QAM or star shape constellations, mainly due to the existing low complexity detectors. In this paper, we investigate the low complexity detection for a family of QAM isomorphic constellations. These constellations are known to perform very close to the peak-power limited capacity, outperforming the DVB-S2X standard constellations. The proposed strategy is to first remap the received signals to the QAM constellation using the existing isomorphism and then break the log likelihood ratio computations to two one dimensional PAM constellations. Gains larger than 0.6 dB with respect to QAM can be obtained over the peak power limited channels without any increase in detection complexity. Our scheme also provides a systematic way to design constellations with low complexity one dimensional detectors. Several open problems are discussed at the end of the paper. [less ▲]

Detailed reference viewed: 81 (3 UL)