847 research outputs found
Double exponential lower bounds for possible solutions in the Second Case of the Fermat Last Theorem
No full textDe Gasperi, l’Europa e le relazioni internazionali dell’Italia: la fine di un ciclo storico?
No full textLa rappresentazione dell'invisibile: il sentiment mapping
No full textQuesto lavoro è il risultato di un’attività inte
rdisciplinare:
linguistica computazionale ed in
particolare le tecniche per l’estrazione automatica
di informazioni implicite
contenute nei testi (text-
mining), la statistica e la geografia.
Il fine è la mappatura del sentiment, estratto grazie all’analisi
semantica dei documenti distribuiti nella rete: e-
mail, sms, post sui blog,
ecc. Le applicazioni
pratiche possono essere molte, in ambito economi
co, marketing, scienze sociali, politiche, di
intelligence, ecc.This work is the result of an
interdisciplinary activity: computati
onal linguistics and in particular
techniques for automatic extraction of implicit
information contained in the texts (text-mining),
statistics and geography. The ai
m is the mapping of the sentimen
t, extracted through semantic
analysis of documents distributed in the network:
e-mail, text messages, blog posts, etc.. Practical
applications may be many, in economics, marketing,
social sciences, political
, intelligence, etc.
Code obfuscation and malware detection by abstract interpretation
No full textNon disponibileAn obfuscating transformation aims at confusing a program in order to make it
more difficult to understand while preserving its functionality. Software protection
and malware detection are two major applications of code obfuscation. Software
developers use code obfuscation in order to defend their programs against
attacks to the intellectual property, usually called malicious host attacks. In fact,
by making the programs more difficult to understand it is possible to obstruct
malicious reverse engineering – a typical attack to the intellectual property of
programs. On the other side, malware writers usually obfuscate their malicious
code in order to avoid detection. In this setting, the ability of code obfuscation
to foil most of the existing detection techniques, such as misuse detection algorithms,
relies in their purely syntactic nature that makes malware detection
sensitive to slight modifications of programs syntax. In the software protection
scenario, researchers try to develop sophisticated obfuscating techniques that are
able to resist as many attacks as possible. In the malware detection scenario,
on the other hand, it is important to design advanced detection algorithms in
order to detect as many variants of obfuscated malware as possible. It is clear
how both malicious host and malicious code attacks represent harmful threats
to the security of computer networks.
In this dissertation, we are interested in both security issues described above.
In particular, we describe a formal approach to code obfuscation and malware
detection based on program semantics and abstract interpretation. This theoretical
framework is useful in contrasting some well known drawbacks of software
protection through code obfuscation, as well as for improving existing malware
detection schemes. In fact, the lack of rigorous theoretical bases for code obfuscation
prevents any possibility to formally study and certify their effectiveness
in protecting proprietary programs. Moreover, in order to design malware detection
schemes that are resilient to obfuscation we have to focus on program
semantics rather than on program syntax.
Our formal framework for code obfuscation relies on a semantics-based definition
of code obfuscation that characterizes each program transformation T
as a potential obfuscation in terms of the most concrete property preserved by
T on program semantics. Deobfuscating techniques, and reverse engineering in
general, usually begin with some sort of static program analysis, which can be
specified as an abstraction of program semantics. In the software protection
scenario, this observation naturally leads to model attackers as abstractions of
program semantics. In fact, the abstraction modeling the attacker expresses the
amount of information, namely the semantic properties, that the attacker is able
to observe. It follows that, comparing the degree of abstraction of an attacker A
with the one of the most concrete property preserved by an obfuscating transformation
T, it is possible to understand whether obfuscation T defeats attack
A. Following the same reasoning it is possible to compare the efficiency of different
obfuscating transformations, as well as the ability of different attackers
in contrasting a given obfuscation. We apply our semantics-based framework to
a known control code obfuscation technique that aims at confusing the control
flow of the original program by inserting opaque predicates.
As argued above, an obfuscating transformation modifies a program while
preserving an abstraction of its semantics. This means that different obfuscated
versions of the same malware have to share (at least) the malicious intent,
namely the maliciousness of their semantics, even if they may express it
through different syntactic forms. The basic idea of our formal approach to
malware detection is to use program semantics to model both malware and program
behaviour, and semantic abstractions to hide the details changed by the
obfuscation. Thus, given an obfuscation T, we are interested in defining an abstraction
of program semantics that does not distinguish between the semantics
of malware M and the semantics of its obfuscated version T(M). In particular,
we provide this suitable abstraction for an interesting class of commonly used
obfuscating transformations. It is clear that, given a malware detector D, it is
always possible to define its semantic counterpart by analyzing how D works
on program semantics. At this point, by translating both malware detectors
and obfuscating transformations in the semantic world, we are able to certify
which obfuscations a detector is able to handle. This means that our semanticsbased
framework provides a formal setting where malware detectors designers
can prove the efficiency of their algorithms
Le miroir convexe : La contribution de Christian Biet aux séminaires Balmas
No full textL’étude analyse les contributions de Christian Biet aux séminaires Balmas, des colloques littéraires que l’université de Milan organise régulièrement, à Gargnano au bord du lac de Garde. Le miroir convexe – une métaphore que Biet a lui-même utilisée au séminaire de 2003 – devient un outil précieux pour reconnaître dans ses différentes contributions une méthode d’investigation, un point de vue singulier qui remet le public et son actualité au centre de toute interrogation critique
PREDA: An R-package to identify regional variations in genomic data
No full textChromosomal patterns of genomic signals represent molecular ngerprints that may reveal how the local structural organization of a genome impacts the functional control mechanisms. Thus, the integrative analysis of multiple sources of genomic data and information deepens the resolution and enhances the interpretation of stand-alone high-throughput data. In this note, we present PREDA (Position RElated Data Analysis), an R package for detecting regional variations in genomics data. PREDA identies relevant chromosomal patterns in high-throughput data using a smoothing approach that accounts for distance and density variability of genomics features. Custom-designed data structures allow efciently managing diverse signals in different genomes. A variety of smoothing functions and statistics empower exible and robust workows. The modularity of package design allows an easy deployment of custom analytical pipelines. Tabular and graphical representations facilitate downstream biological interpretation of results. © The Author 2011. Published by Oxford University Press. All rights reserved
The Hegemonic Gaze and East-Central Europe - Challenging the Totalitarian Paradigm
No full textThe chapter introduces the notion of the "hegemonic gaze" in relation to the representation of East-Central Europe, demonstrating how the artist becomes interpellated as a regional subject, becoming simultaneously included and othered. It begins by examining the complexities involved in defining the region and the power dynamics involved in naming and being named. The author argues that different terms produce specific subject positions, reinforcing certain narratives about the region and foregrounding the end of communism and the failure of the socialist project.
Through the lens of Stuart Hall's theory of encoding and decoding, the chapter explores how exhibitions and artworks depicting socialist monuments and architecture often become simplified and reinterpreted within the global art discourse. The author shows how the ‘‘hegemonic gaze’’ reinforces existing narratives and imposes meanings. Despite artists' efforts to engage with the complexities of the past, their work is often interpellated within predetermined frameworks that limit its interpretation
PENGARUH PEMBERIAN FORMULA PREDA DAN TEMPE TERHADAP LAMA PENYAKIT DIARE AKUT PADA ANAK USIA 6-24 BULAN Studi di RSU RA. Kartini Kabupaten Jepara Tahun 2010 THE EFFECT OF PREDA AND TEMPE (SOYBEAN CAKE) FORMULA ON THE DURATION OF ACUTE DIARRHOEA IN IN 6-24 MONTHS OLD CHILDREN A Study in RA. Kartini General Hospital, Jepara
No full textABSTRAK
PENGARUH PEMBERIAN FORMULA PREDA DAN TEMPE TERHADAP LAMA
PENYAKIT DIARE AKUT PADA ANAK USIA 6-24 BULAN
Studi di RSU RA. Kartini Kabupaten Jepara Tahun 2010
SRI YUNIATI HARTININGRUM
Latar Belakang: Kejadian diare masih cukup tinggi, tiap anak dapat
menderita diare 2-8 kali pertahun dengan angka kematian 5 per 1000 Balita
pertahun. Penderita diare membutuhkan diet yang adekuat. Tempe dapat
memperpendek lama penyakit diare. Formula Preda juga dapat digunakan
diet penyakit diare. Berdasarkan permasalahan yang ada peneliti tertarik
ingin membandingkan efektifitas penggunanan formula Preda dan tempe
untuk penanganan diare.
Tujuan: Mengetahui perbedaan pengaruh pemberian formula Preda dan
tempe terhadap lama penyakit diare akut anak usia 6-24 bulan di RSU RA
Kartini Kabupaten Jepara.
Metode Penelitian: Jenis penelitian ini adalah eksperimen dengan
rancangan penelitiannya pre-experiment dengan design Static group
comparison design. Populasinya semua penderita penyakit diare pada anak
usia 6-24 bulan yang dirawat di RSU RA. Kartini Kabupaten Jepara.
Sampel diambil secara accidental dari bulan Januari - Pebruari 2010
sebanyak 25 dengan jenis perlakuan formula Preda dan 25 dengan tempe.
Data diperoleh melalui kuesioner dan wawancara meliputi karakteristik
subjek dan ibu serta pemberian ASI. BB dan PB. Analisis yang digunakan
adalah Independen T-Test, uji Mann-Whitney , uji chi square dan Anakova.
Hasil: Tidak terdapat perbedaan pemberian ASI, jenis penyebab diare dan
status gizi awal (BB/PB) berdasarkan jenis perlakuan (p1= 0,525, p2=
0,281, p3= 0,132). Terdapat perbedaan jumlah formula yang dikonsumsi
berdasarkan jenis perlakuan (p= 0,025*). Lama penyakit diare pada formula
Preda dan tempe adalah 5 hari dan 4,2 hari, menunjukkan terdapat
perbedaan yang bermakna lama penyakit diare dengan jenis perlakuan (p=
0,010*).
Simpulan : Formula tempe dapat dipakai sebagai pengganti formula Preda
pada anak dengan penyakit diare akut.
Kata Kunci : Formula Preda, tempe , diare akut.
Kepustakaan : 61 ( 1990-2010 )
ABSTRACTS
THE Effect of Preda and Tempe (Soybean Cake) Formula
on the Duration of Acute Diarrhoea in 6-24 Months Old Children
A Study in RA. Kartini Hospital, Jepara
Sri Yuniati Hartiningrum
Backgrounds : The occurrence of diarrea is still high enough, every child
which suffer from diarrhea 2-8 time a year with mortality rate of 5 death in
every 1000 under-five-years-old children. Patients with diarrhoea needs
adequate diet which at present are given Preda formula in RSU RA Kartini.
Soybean cake were reparted to reduce the duration of diarrhoea. Purposes
: To analyze the different effect of Preda formula and soybean cake formula
on the duration of acute diarrhoea in 6-24 monhs old children in RA. Kartini
General Hospital, Jepara.
Method of Study : The study was an experimental study with Static group
comparison design. The population of the study were the entire 6-24
months children with diarrhoea underwent treatment in RA. Kartini Hospital.
Sample were collected using accidental method between Januari-February
2010. Consisting of 25 samples for Preda as well as for soybean cake
treatment. Data were obtained using quetionnaire and interview, consisting
of characteristic of subjects and their mothers breasfeeding, weight and
height. Independent t-test, mann-Whitney test, Chi square test and
Anacova were used in the data analysis.
Results : There were no difference in breastfeeding, type of cause of
diarrhoea based on type and nutritional status between both groups (p1=
0,525, p2= 0,281, p3= 0,132). There was difference in the amount of
formula consumed (p= 0,025*). The duration of diarrhoea in Preda formula
and soybean cake group were 4,95 and 4,21 days respectively, which
indicates a significant difference (p= 0,010*)
Conclusion : Soybean cake formula could be used as a subtitute for Preda
formula in children with acute diarrhea.
Keywords : Preda formula, soybean cake and acute diarrhoea
Bibliography : 61 (1990 – 2010
Adversarial Authorship Attribution in Open-Source Projects
No full textOpen-source software is open to anyone by design, whether it is a community of developers, hackers or malicious users. Authors of open-source software typically hide their identity through nicknames and avatars. However, they have no protection against authorship attribution techniques that are able to create software author profiles just by analyzing software characteristics. In this paper we present an author imitation attack that allows to deceive current authorship attribution systems and mimic a coding style of a target developer. Withing this context we explore the potential of the existing attribution techniques to be deceived. Our results show that we are able to imitate the coding style of the developers based on the data collected from the popular source code repository, GitHub. To subvert author imitation attack, we propose a novel author obfuscation approach that allows us to hide the coding style of the author. Unlike existing obfuscation tools, this new obfuscation technique uses transformations that preserve code readability. We assess the effectiveness of our attacks on several datasets produced by actual developers from GitHub, and participants of the GoogleCodeJam competition. Throughout our experiments we show that the author hiding can be achieved by making sensible transformations which significantly reduce the likelihood of identifying the author’s style to 0% by current authorship attribution systems
- …
