CodePDF Available

OTVCA_V3

January 2019

DOI:10.13140/RG.2.2.16690.86721

Authors:

Helmholtz-Zentrum Dresden-Rossendorf

This code implements a new-version of OTVCA which does not include whitening stage. OTVCA was illustrated in the following Paper. B. Rasti, M. O. Ulfarsson, and J. R. Sveinsson,” Hyperspectral Feature Extraction Using Total Variation Component Analysis”, IEEE Trans. Geoscience and Remote Sensing, 54 (12), 6976-6985.

Content uploaded by Behnood Rasti

Author content

6.08 MB

ResearchGate has not been able to resolve any citations for this publication.

ResearchGate has not been able to resolve any references for this publication.

Hyperspectral Feature Extraction Using Total Variation Component Analysis

Article

August 2016

Behnood Rasti · Magnus Ulfarsson · Johannes R. Sveinsson

Article

A Technique to Analyze Heap Usage of Java Programs Using Code Inserting

January 2007 · Journal of the Korea Society of Computer and Information

In the Java a profiler interface such as JVM TI is provided for communication between a Java virtual machine and a profiler. The JVM TI specification, however does not require an implementation of a profiler interface. Consequently the JVM without an implementation of a profiler interface cannot use a profiler with the JVM TI. For solving the problem, we propose a technique which analyzes heap ... [Show full abstract] usage without a profiler interface. This technique inserts codes to extract heap usage into source files in the Java. We implemented a code inserter to verify the proposed technique. We experimented with Java programs that are frequently used and opened. the experimental result presents the number of created objects. the maximum number of allocated objects, and the used pattern of the objects.

Article

Full-text available

Malicious JavaScript Detection by Features Extraction

January 2014 · e-Informatica Software Engineering Journal

In recent years, JavaScript-based attacks have become one of the most common and successful types of attack. Existing techniques for detecting malicious JavaScripts could fail for different reasons. Some techniques are tailored on specific kinds of attacks, and are ineffective for others. Some other techniques require costly computational resources to be implemented. Other techniques could be ... [Show full abstract] circumvented with evasion methods. This paper proposes a method for detecting malicious JavaScript code based on five features that capture different characteristics of a script: execution time, external referenced domains and calls to JavaScript functions. Mixing different types of features could result in a more effective detection technique, and overcome the limitations of existing tools created for identifying malicious JavaScript. The experimentation carried out suggests that a combination of these features is able to successfully detect malicious JavaScript code (in the best cases we obtained a precision of 0.979 and a recall of 0.978).

Article

Implementing a pseudo-random modulation code to an existing optical signal processing system /

Donald E. Martens

Thesis (M.S.)--Oregon Graduate Institute of Science and Technology, 1991.

Preprint

A Systematic Construction of MDS Codes with Small Sub-packetization Level and Near Optimal Repair Ba...

January 2019

In the literature, all the known high-rate MDS codes with the optimal repair bandwidth possess a significantly large sub-packetization level, which may prevent the codes to be implemented in practical systems. To build MDS codes with small sub-packetization level, existing constructions and theoretical bounds imply that one may sacrifice the optimality of the repair bandwidth. Partly motivated by ... [Show full abstract] the work of Tamo et al. (IEEE Trans. Inform. Theory, 59(3), 1597-1616, 2013), in this paper, we present a powerful transformation that can greatly reduce the sub-packetization level of any MDS codes with respect to the same code length n. As applications of the transformation, four high-rate MDS codes having both small sub-packetization level and near optimal repair bandwidth can be obtained, where two of them are also explicit and the required field sizes are comparable to the code length n. Additionally, we propose another explicit MDS code that have small sub-packetization level, near optimal repair bandwidth, and the optimal update property. The required field size is also comparable to the code length n.