scispace - formally typeset
Search or ask a question
Topic

Trojan

About: Trojan is a research topic. Over the lifetime, 2028 publications have been published within this topic receiving 33209 citations.


Papers
More filters
Proceedings ArticleDOI
03 Nov 2003
TL;DR: Unlike the synchronous and static marker passing algorithm previously used for parallel semantic network design, the TROJAN operates asynchronously, supporting knowledge sharing, dynamic load balancing and duplicate checking.
Abstract: This paper describes a new parallel semantic network system, the TROJAN. Unlike the synchronous and static marker passing algorithm previously used for parallel semantic network design, the TROJAN operates asynchronously, supporting knowledge sharing, dynamic load balancing and duplicate checking. Current implementation of the TROJAN focuses on path-based knowledge inferences, using ANSI C and the MPICH-G2 with flex lexical analyzer and the yacc parser generator. The performance tests have been carried out on a local Grid, consisting of three heterogeneous systems: a SUN Cluster, an SGI Origin 3800, and a Dell Pentium cluster. The experiments demonstrate promising speedups.

5 citations

Journal ArticleDOI
TL;DR: In this paper, CCD-photometry was performed for two Jupiter Trojan asteroids (911) Agamemnon and (4709) Ennomos) for which the diameters were obtained from occultation events.
Abstract: CCD-photometry was performed for two Jupiter Trojan asteroids (911) Agamemnon and (4709) Ennomos for which the diameters were obtained from occultation events. New data on rotation periods, lightcurve amplitudes, color indices, magnitude–phase slopes, and absolute magnitudes were obtained for these asteroids. We have used the diameters from occultations (166 and 99 km) and new data on absolute magnitudes at the instant occultation (7.95 and 8.85 mag) to revise their albedos to 0.042 (911 Agamemnon) and 0.052 (4709 Ennomos).

5 citations

22 Feb 2019
TL;DR: Analysis of the dataset and features suggests that looking at the structural complexity and levels of detail in a text are the most important types of feature in characterising April Fools’, and it is proposed that these features are also very useful for understanding Fake News, and disinformation more widely.
Abstract: Every year on April 1st, people play practical jokes on one another and news websites fabricate false stories with the goal of making fools of their audience. In an age of disinformation, with Facebook under fire for allowing “Fake News” to spread on their platform, every day can feel like April Fools’ day. We create a dataset of April Fools’ hoax news articles and build a set of features based on past research examining deception, humour, and satire. Analysis of our dataset and features suggests that looking at the structural complexity and levels of detail in a text are the most important types of feature in characterising April Fools’. We propose that these features are also very useful for understanding Fake News, and disinformation more widely.

5 citations

Proceedings ArticleDOI
08 Jul 2018
TL;DR: This work presents an effective methodology to detect sequential trojan circuits inserted into sequential hardware designs without scan chains, and shows experimental results demonstrating the effectiveness of the methodology using several test cases.
Abstract: Small, low-cost embedded systems implemented as sequential circuits often do not contain scan chains. Malicious trojan circuits, which themselves may be state machines, inserted into such systems are hard to detect. We present an effective methodology to detect sequential trojan circuits inserted into sequential hardware designs without scan chains. The methodology consists of three steps: We use sequential testability metrics, model checking and signal tracing to progressively separate the trojan gates from legitimate circuit gates. We show experimental results demonstrating the effectiveness of the methodology using several test cases.

5 citations


Network Information
Related Topics (5)
Cloud computing
156.4K papers, 1.9M citations
70% related
Cache
59.1K papers, 976.6K citations
70% related
Planet
27K papers, 980.6K citations
68% related
Compiler
26.3K papers, 578.5K citations
66% related
Key (cryptography)
60.1K papers, 659.3K citations
66% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
2023136
2022282
2021111
2020139
2019144
2018168