scholarly journals COMPUTING THE DISTANCE DISTRIBUTION OF SYSTEMATIC NONLINEAR CODES

2010 ◽  
Vol 09 (02) ◽  
pp. 241-256 ◽  
Author(s):  
ELEONORA GUERRINI ◽  
EMMANUELA ORSINI ◽  
MASSIMILIANO SALA

The most important families of nonlinear codes are systematic. A brute-force check is the only known method to compute their weight distribution and distance distribution. On the other hand, it outputs also all closest word pairs in the code. In the black-box complexity model, the check is optimal among closest-pair algorithms. In this paper, we provide a Gröbner basis technique to compute the weight/distance distribution of any systematic nonlinear code. Also our technique outputs all closest pairs. Unlike the check, our method can be extended to work on code families.

2021 ◽  
Vol 2019 (1) ◽  
pp. 93-107
Author(s):  
Agnieszka Czejkowska ◽  
Katarina Froebus

Zusammenfassung: Der vorliegende Beitrag widmet sich Narrativen der Verunsicherung, die in Zusammenhang mit der COVID-19-Krise aufgerufen werden und für ,,innere Sicherheit“ sorgen sollen. Dabei identifizieren wir Kalküle, die einerseits individuelle Besonnenheit aktivieren und anderseits gesellschaftliche Stabilisierung gewährleisten sollen. Das gelingt uns mit Rückgriff auf psychoanalytische Subjekttheorien, die Strategien der individuellen Rationalisierung fokussieren, und auf diskursorientierte Subjekttheorien, die gesellschaftliche Disziplinierungstechnologien in den Blick nehmen.Abstract: This article is focused on narratives of uncertainness, being created during the COVID-19 crisis in order to provide ‘home security’. In doing so, we identify approaches that on the one hand activate individual level-headedness and on the other hand are supposed to ensure societal stabilization. We succeed in doing this by resorting to psychoanalytic subject theories that emphasize strategies of individual rationalization and to discourse-oriented subject theories that accent social disciplinary technologies.


2020 ◽  
Vol 12 (1) ◽  
pp. 58-89
Author(s):  
Ahmed Almutairi ◽  
Behzad Shoarian Satari ◽  
Carlos Rivas ◽  
Cristian Florin Stanciu ◽  
Mozhdeh Yamani ◽  
...  

In this article, the authors successfully created two new plugins one for Autopsy Forensic Tool, and the other for Volatility Framework. Both plugins are useful for encoding digital evidences in Forensic Lucid which is the goal of this work. The first plugin was integrated in Autopsy to generate a report for the case of a Brute Force Authentication attack by looking for evidence in server logs based on a key search. On the other hand, the second plugin named ForensicLucidDeviceTree aims to find whether a device stack has been infected by a root-kit or not expression is implied by the previous statement. The results of both plugins are shown in Forensic Lucid Format and were successfully compiled using GIPC compiler.


2020 ◽  
Author(s):  
Zhen Liu ◽  
Qiong Huang ◽  
Duncan S Wong

Abstract Attribute-based encryption (ABE) is a versatile one-to-many encryption primitive, which enables fine-grained access control over encrypted data. Due to its promising applications in practice, ABE schemes with high efficiency, security and expressivity have been continuously emerging. On the other hand, due to the nature of ABE, a malicious user may abuse its decryption privilege. Therefore, being able to identify such a malicious user is crucial towards the practicality of ABE. Although some specific ABE schemes in the literature enjoys the tracing function, they are only proceeded case by case. Most of the ABE schemes do not support traceability. It is thus meaningful and important to have a generic way of equipping any ABE scheme with traceability. In this work, we partially solve the aforementioned problem. Namely, we propose a way of transforming (non-traceable) ABE schemes satisfying certain requirements to fully collusion-resistant black-box traceable ABE schemes, which adds only $O(\sqrt{\mathcal{K}})$ elements to the ciphertext where ${\mathcal{K}}$ is the number of users in the system. And to demonstrate the practicability of our transformation, we show how to convert a couple of existing non-traceable ABE schemes to support traceability.


2007 ◽  
Vol 06 (03) ◽  
pp. 403-414 ◽  
Author(s):  
MASSIMILIANO SALA

Using Gröbner techniques, we can exhibit a method to get the distance and weight distribution of cyclic codes and shortened cyclic codes, improving earlier similar results for the distance of cyclic codes.


Author(s):  
Navid Nobani ◽  
Fabio Mercorio ◽  
Mario Mezzanzanica

Explainable Artificial Intelligence (XAI) is gaining interests in both academia and industry, mainly thanks to the proliferation of darker more complex black-box solutions which are replacing their more transparent ancestors. Believing that the overall performance of an XAI system can be augmented by considering the end-user as a human being, we are studying the ways we can improve the explanations by making them more informative and easier to use from one hand, and interactive and customisable from the other hand.


1982 ◽  
Vol 72 ◽  
pp. 32-48 ◽  
Author(s):  
Andrew Wallace-Hadrill
Keyword(s):  
The Will ◽  

When the emperor Claudius decided, at the instigation of his freedman Pallas, to make a highly unconventional marriage with his niece, he manoeuvred the senate, through the agency of his staunch amicus Vitellius, into passing an ‘unsolicited’ request that he marry Agrippina. He declared that his hesitations would be overcome if the senate put pressure on him: who was he to resist the will of the community, being but a citizen like the rest? Some senators even rushed to the palace promising to compel him by brute force. The incident encapsulates an ambivalence in the emperor's role familiar to all readers of Tacitus. On the one hand the autocratic reality: a decision of high political moment (it was no surprise that Agrippina's son subsequently acceded to the throne) taken in the palace on the counsel of freedmen, potent and resented, involving a violation of the mos maiorum. On the other hand the elaborate and yet transparent republican façade: the senate decrees, the princeps submits to the will of the citizen body.


2010 ◽  
Vol 2010 ◽  
pp. 1-6 ◽  
Author(s):  
Marco Frediani ◽  
David Sémeril ◽  
Dominique Matt ◽  
Luca Rosi ◽  
Piero Frediani ◽  
...  

cone-25,27-Dipropyloxy-26,28-dioxo-calix[4]arene titanium (IV) dichloride(1)has been assessed in the ring-opening polymerisation ofrac-lactide (L,D-LA). The polymers formed (PLDA) turned out to display an isotactic stereoblock microstructure (determined by NMR) despite the fact that the catalyst hasC2vsymmetry. Two techniques were applied for initiating the polymerisation reaction, microwave irradiation, and conventional thermal treatment. The polymers obtained were all characterised by NMR, IR, HPLC-SEC, DSC, and MALDI-TOF analysis. The use of microwave irradiation, applied for the first time to calixarene-based catalysts in the presence of therac-lactide monomer, increased the polymerisation rate compared with that obtained by the other method. On the other hand, standard thermal treatment enabled a slightly better control than microwave irradiation over the molecular weight and molecular weight distribution of the polylactides formed.


2012 ◽  
Vol 15 ◽  
pp. 38-43 ◽  
Author(s):  
Igor Pak

AbstractLet G be a group generated by k elements, G=〈g1,…,gk〉, with group operations (multiplication, inversion and comparison with identity) performed by a black box. We prove that one can test whether the group G is abelian at a cost of O(k) group operations. On the other hand, we show that a deterministic approach requires Ω(k2) group operations.


2001 ◽  
Vol DMTCS Proceedings vol. AA,... (Proceedings) ◽  
Author(s):  
Nicolas Thiéry

International audience We present a characteristic-free algorithm for computing minimal generating sets of invariant rings of permutation groups. We circumvent the main weaknesses of the usual approaches (using classical Gröbner basis inside the full polynomial ring, or pure linear algebra inside the invariant ring) by relying on the theory of SAGBI- Gröbner basis. This theory takes, in this special case, a strongly combinatorial flavor, which makes it particularly effective. Our algorithm does not require the computation of a Hironaka decomposition, nor even the computation of a system of parameters, and could be parallelized. Our implementation, as part of the library $permuvar$ for $mupad$, is in many cases much more efficient than the other existing software.


1982 ◽  
Vol 55 (1) ◽  
pp. 76-87 ◽  
Author(s):  
E. Pechhold ◽  
G. Pruckmayr

Abstract Hardness, modulus, and tear strength of PTMEG-based polyurethanes are mainly affected by the hard-segment (MDI/BDO) concentration. On the other hand, PTMEG molecular weight mainly influences low-temperature and dynamic properties. Resilience and hydrolytic stability are affected by both soft-segment concentration and chain length. PTMEG of narrow molecular weight distribution yields softer polyurethanes with considerably longer elongation at break. Broad molecular weight distribution is advantageous only at the lower molecular weight range (650 and 1000), giving rise to improved resilience and low-temperature performance. Polyurethanes made from PTMEG of low molecular weight (Mn≤1000) have inherent drawbacks due to poor phase separation (high Tg) and limits in soft segment concentration (∼63% maximum for PTMEG 1000). The only advantage they offer is easier processability (lower viscosity and melting temperature). On the other hand, PTMEG above 2100 offers little property advantages and is more difficult to handle. Optimum overall polyurethane properties can be achieved with PTMEG in the molecular weight range of 1800 to 2100. It is conceivable that PTMEG-based polyurethanes made with different diisocyanates, curatives, curative/NCO ratios, or in the presence of triols or catalysts may show similar trends as the MDI/BDO formulations described in this study.


Sign in / Sign up

Export Citation Format

Share Document