The Experts below are selected from a list of 29745 Experts worldwide ranked by ideXlab platform
Ankur Singh Bist - One of the best experts on this subject based on the ideXlab platform.
-
TECHNOLOGY Data Mining Techniques for Computer Virus Detection
2014Co-Authors: Ankur Singh BistAbstract:Computer viruses are big threat to computer world, researchers doing work in this area have made various efforts in the direction of classification and detection methods of these viruses. Graph mining and system call arrangement are some latest research activities in this field. The computability theory and the semi computable functions are quite important in our context of analyzing malicious activity. A mathematical model like random access Stored Program machine with the association of attached background is used by Ferenc Leitold while explaining modeling of viruses in his paper. Computer viruses like polymorphic viruses and metamorphic viruses use more efficient techniques for their evolution so it is required to use strong models to understand their evolution and then apply detection followed by the process of removal. Code Emulation is one the strongest way to analyze computer viruses but the anti-emulation activities made by virus designers are working against it. This paper explains the data mining techniques that are used for detection of computer viruses in better manner
-
Detection of Logic Bombs
2014Co-Authors: Ankur Singh BistAbstract:Computer viruses are big threat to computer world; researchers doing work in this area have made various efforts in the direction of classification and detection methods of these viruses. Graph mining, system call arrangement and CFG analysis are some latest research activities in this field. The computability theory and the semi computable functions are quite important in our context of analyzing malicious activities. A mathematical model like random access Stored Program machine with the association of attached background is used by Ferenc Leitold while explaining modeling of viruses in his paper. Computer viruses like polymorphic viruses and metamorphic viruses use more efficient techniques for their evolution so it is required to use strong models for understanding their evolution and then apply detection followed by the process of removal. Code Emulation is one of the strongest ways to analyze computer viruses but the anti-emulation activities made by virus designers are also active. This paper involves the study of logic bombs
-
TECHNOLOGY Spyware Detection Techniques
2014Co-Authors: Ankur Singh BistAbstract:Computer viruses are big threat to computer world; researchers doing work in this area have made various efforts in the direction of classification and detection methods of these viruses. Graph mining, system call arrangement and CFG analysis are some latest research activities in this field. The computability theory and the semi computable functions are quite important in our context of analyzing malicious activities. A mathematical model like random access Stored Program machine with the association of attached background is used by Ferenc Leitold while explaining modeling of viruses in his paper. Computer viruses like polymorphic viruses and metamorphic viruses use more efficient techniques for their evolution so it is required to use strong models for understanding their evolution and then apply detection followed by the process of removal. Code Emulation is one of the strongest ways to analyze computer viruses but the anti-emulation activities made by virus designers are also active. This paper involves the study of spywares
-
TECHNOLOGY Hashing Techniques for Computer Virus Detection
2014Co-Authors: Ankur Singh BistAbstract:Computer viruses are big threat to computer world; researchers doing work in this area have made various efforts in the direction of classification and detection methods of these viruses. Graph mining, system call arrangement and CFG analysis are some latest research activities in this field. The computability theory and the semi computable functions are quite important in our context of analyzing malicious activities. A mathematical model like random access Stored Program machine with the association of attached background is used by Ferenc Leitold while explaining modeling of viruses in his paper. Computer viruses like polymorphic viruses and metamorphic viruses use more efficient techniques for their evolution so it is required to use strong models for understanding their evolution and then apply detection followed by the process of removal. Code Emulation is one of the strongest ways to analyze computer viruses but the anti-emulation activities made by virus designers are also active. This paper involves the hashing techniques used for detection of computer viruses in better manner
-
TECHNOLOGY Malicious Code Analysis using Metalanguage
2014Co-Authors: Ankur Singh BistAbstract:Computer viruses are big threat to computer world; researchers doing work in this area have made various efforts in the direction of classification and detection methods of these viruses. Graph mining, system call arrangement and graphical analysis are some latest research activities in this field. The computability theory and the semi computable computable functions are quite important in our context of analyzing malicious activity. A mathematical model like random access Stored Program machine with the association attached background is used by Ferenc Leitold while explaining modeling of viruses in his paper. Computer viruses like polymorphic viruses and metamorphic viruses are using more efficient techniques for their evolution so it is required to use strong models to understand their evolution and then apply detection followed by the process of removal. Code Emulation is one of the strongest ways to analyze computer viruses but the anti-emulation activities made by virus designers are also active. Metalanguage and metaProgramming are used to analyze the malicious codes
Dongsheng Wang - One of the best experts on this subject based on the ideXlab platform.
-
choi states symmetry based quantum gate teleportation and Stored Program quantum computing
Physical Review A, 2020Co-Authors: Dongsheng WangAbstract:The Stored-Program architecture is canonical in classical computing, while its power needs more investigations for the quantum case. We study quantum information processing with Stored quantum Program states, i.e., using qubits instead of bits to encode quantum operations. We develop a Stored-Program model based on Choi states, following from channel-state duality, and a symmetry-based generalization of deterministic gate teleportation, which can be employed to compose Choi states. Our model enriches the family of universal models for quantum computing, in particular the measurement-based models, and can also be employed for tasks including quantum simulation and communication.
Mingsheng Ying - One of the best experts on this subject based on the ideXlab platform.
-
quantum random access Stored Program machines
arXiv: Logic in Computer Science, 2020Co-Authors: Qisheng Wang, Mingsheng YingAbstract:Random access machines (RAMs) and random access Stored-Program machines (RASPs) are models of computing that are closer to the architecture of real-world computers than Turing machines (TMs). They are also convenient in complexity analysis of algorithms. The relationships between RAMs, RASPs and TMs are well-studied. However, a clear relationships between their quantum counterparts are still missing in the literature. We fill in this gap by formally defining the models of quantum random access machines (QRAMs) and quantum random access Stored-Program machines (QRASPs) and clarifying the relationships between QRAMs, QRASPs and quantum Turing machines (QTMs). In particular, we prove: 1. A $T(n)$-time QRAM (resp. QRASP) can be simulated by an $O(T(n))$-time QRASP (resp. QRAM). 2. A $T(n)$-time QRAM under the logarithmic (resp. constant) cost criterion can be simulated by an $\tilde O(T(n)^4)$-time (resp. $\tilde O(T(n)^8)$-time) QTM. 3. A $T(n)$-time QTM can be simulated within error $\varepsilon > 0$ by an $O(T(n)^2 \operatorname{polylog}(T(n), 1/\varepsilon))$-time QRAM (under both the logarithmic and constant cost criterions). As a corollary, we have: $\textbf{P} \subseteq \textbf{EQRAMP} \subseteq \textbf{EQP} \subseteq \textbf{BQP} = \textbf{BQRAMP}$, where $\textbf{EQRAMP}$ and $\textbf{BQRAMP}$ stand for the sets of problems that can be solved by polynomial-time QRAMs with certainty and bounded-error, respectively.
Jaroslaw Rudy - One of the best experts on this subject based on the ideXlab platform.
-
dynamic random access Stored Program machine for runtime code modification
International Journal of Foundations of Computer Science, 2015Co-Authors: Jaroslaw RudyAbstract:This paper is concerned with the study of possibility of performing changes to existing running Programs with the use of the RAM and RASP models of computation. A new model of computation is defined with the capability of performing runtime changes. Theoretical properties, including time and space complexities, of the defined models are presented and proven. A number of simple empirical tests are conducted in order to prove the ability to perform runtime changes as well as support obtained theoretical results. The paper concludes that the defined model has virtually no affect on performance when there are no changes and the performance with changes is easily manageable. Moreover, the results can be used to develop runtime change capabilities for a wide range of Programming languages and paradigms.
Philip Koopman - One of the best experts on this subject based on the ideXlab platform.
-
An Architecture for Combinator Graph Reduction (TIGRE)
2018Co-Authors: Philip KoopmanAbstract:The results of cache-simulation experiments with an abstract machine for reducing combinator graphs are presented. The abstract machine, called TIGRE, exhibits reduction rates that, for similar kinds of combinator graphs on similar kinds of hardware, compare favorably with previously reported techniques. Furthermore, TIGRE maps easily and efficiently onto standard computer architectures, particularly those that allow a restricted form of self-modifying code. This provides some indication that the conventional "Stored Program" organization of computer systems is not necessarily an inappropriate one for functional Programming language implementations. This is not to say, however, that present day computer systems are well equipped to reduce combinator graphs. In particular, the behavior of the cache memory has a significant effect on performance. In order to study and quantify this effect, trace-driven cache simulations of a TIGRE graph reducer running on a reduced instruction-set computer are conducted. The results of these simulations are presented with the following hardware-cache parameters varied: cache size, block size, associativity, memory update policy, and write-allocation policy. To begin with, the cache organization of a commercially available system is used and then the performance sensitivity with respect to variations of each parameter are measured. From the results of the simulation study, a conclusion is made that combinator-graph reduction using TIGRE runs most efficiently when using a cache memory with an allocate-on-write-miss strategy, moderately large block size (preferably with sub-block placement), and copy-back memory updates.
-
Cache behavior of combinator graph reduction
ACM Transactions on Programming Languages and Systems, 1992Co-Authors: Philip Koopman, Peter Lee, Daniel P. SiewiorekAbstract:The results of cache-simulation experiments with an abstract machine for reducing combinator graphs are presented. The abstract machine, called TIGRE, exhibits reduction rates that, for similar kinds of combinator graphs on similar kinds of hardware, compare favorably with previously reported techniques. Furthermore, TIGRE maps easily and efficiently onto standard computer architectures, particularly those that allow a restricted form of self-modifying code. This provides some indication that the conventional "Stored Program" organization of computer systems is not necessarily an inappropriate one for functional Programming language implementations. This is not to say, however, that present day computer systems are well equipped to reduce combinator graphs. In particular, the behavior of the cache memory has a significant effect on performance. In order to study and quantify this effect, trace-driven cache simulations of a TIGRE graph reducer running on a reduced instruction-set computer are conducted. The results of these simulations are presented with the following hardware-cache parameters varied: cache size, block size, associativity, memory update policy, and write-allocation policy. To begin with, the cache organization of a commercially available system is used and then the performance sensitivity with respect to variations of each parameter are measured. From the results of the simulation study, a conclusion is made that combinator-graph reduction using TIGRE runs most efficiently when using a cache memory with an allocate-on-write-miss strategy, moderately large block size (preferably with subblock placement), and copy-back memory updates.
