Search is not available for this dataset
query
stringlengths 1
13.4k
| pos
stringlengths 1
61k
| neg
stringlengths 1
63.9k
| query_lang
stringclasses 147
values | __index_level_0__
int64 0
3.11M
|
|---|---|---|---|---|
Understanding the Evolution of Code Smells by Observing Code Smell Clusters | Code smells are more likely to stay inter-connected in software rather than remaining as a single instance. These code smell clusters create maintainability issues in evolving software. This paper aims to understand the evolution of the code smells in software, by analyzing the behavior of these clusters such as size, number and connectivity. For this, the clusters are first identified and then these characteristics are observed. The identification of code smell clusters is performed in three steps - detection of code smells (God Class, Long Method, Feature Envy, Type Checking) using smell detection tools, extraction of their relationships by analyzing the source code architecture, and generation of graphs from the identified smells and their relationships, that finally reveals the smelly clusters. This analysis was executed on JUnit as a case study, and four important cluster behaviors were reported. | In this paper, we have presented an effective yield improvement methodology that can help both manufacturing ::: foundries, fabless and fab-lite companies to identify systematic failures. It uses the physical addresses of failing bits ::: from wafer sort results to overlay to inline wafer defect inspection locations. The inline defect patterns or the design ::: patterns where overlay results showed matches were extracted and grouped by feature similarity or cell names. The potentially problematic design patterns can be obtained and used for design debug and process improvement. | eng_Latn | 4,500 |
Irish software to detect airline threats | Hazard IQ to 'restore faith in air travel' A new intelligent software program developed by NUI Galway could give the airline industry a leg up in the security stakes.⦠| Want a computer that screams when a thief strikes? Or a personal tracking unit in case you get kidnapped? | eng_Latn | 4,501 |
AONT-RS: Blending security and performance in dispersed storage systems | A Performance Evaluation and Examination of Open-Source Erasure Coding Libraries for Storage | Fabric Defect Detection Based on Wavelet Decomposition with One Resolution Level | eng_Latn | 4,502 |
Improved Inference for Unlexicalized Parsing | Coarse-To-Fine N-Best Parsing And MaxEnt Discriminative Reranking | Malware encryption schemes - rerandomizable ciphertexts encrypted using environmental keys | eng_Latn | 4,503 |
Physically Based Deformable Models in Computer Graphics | Real-Time subspace integration for St. Venant-Kirchhoff deformable models | Software engineering for security: a roadmap | eng_Latn | 4,504 |
approximating mutual information by maximum likelihood density ratio estimation . | learning with kernels . | Automated procedure clustering for reverse engineering PL/SQL programs | eng_Latn | 4,505 |
Architectural Data Flow Analysis | Challenges in Secure Software Evolution - The Role of Software Architecture | A deep bidirectional long short-term memory based multi-scale approach for music dynamic emotion prediction | kor_Hang | 4,506 |
Watermarking, Tamper-Proofing, and Obfuscation -- Tools for Software Protection | A Taxonomy of Obfuscating Transformations | LPC and LPCC method of feature extraction in Speech Recognition System | eng_Latn | 4,507 |
Validation and verification of computer forensic software tools d Searching Function | An Examination of Digital Forensic Models | Open information extraction using constraints over part-of-speech sequences T E S I S | eng_Latn | 4,508 |
SoK: Exploiting Network Printers | Portable Document Format ( PDF ) Security Analysis and Malware Threats | Integration of Decision Support Systems and Data Mining for Improved Decision Making | eng_Latn | 4,509 |
Interactive Principal Component Analysis | Clustrophile: A Tool for Visual Clustering Analysis | De-anonymizing Programmers via Code | eng_Latn | 4,510 |
Identification and Characterization of Virus(es) Infecting Lilium, Tulip and Aletroemeria in H.P. | The geographical distribution of Lilium, Tulip and Alstroemeria. a) Eurasian species range from the Atlantic through Mediterranean and Central Europe to the Caucasus and Ural mountains. b) Most American species are found in an area ranging from the Atlantic to the Midwest. The distribution of the Western species is limited by the Rocky Mountains and the Pacific. c) Eastern Asia. Their distribution ranges from the Pacific to Ural and Caucasus mountains, to the Northern India and Burma in the south and Siberia in the north. | This short paper proposes two different ways for exploiting an evolutionary algorithm to devise malware: the former targeting heuristic-based anti-virus scanner; the latter optimizing a Trojan attack. An extended internal on the same the subject can be downloaded from http://www.cad.polito.it/downloads/ | eng_Latn | 4,511 |
Study on Chinese text digit watermarking algorithm | In order to improve the robustness of watermark,to adapt the text integrity testing needs,many literature advocates multiple watermarking redundancy embedding method,which relate to the blocked text.Based on Chinese characters structure,the design method of blocked text of Chinese characters and watermarking algorithm were put forward.The method has obvious features of Chinese characters,can effectively improve the robustness of watermark,and raise the watermark's recovery ability after being attacked. | Formal methods technique offer a means of verifying the correctness of the design process used to create the security protocol. Notwithstanding the successful verification of the design of security protocols, the implementation code for them may contain security flaws, due to the mistakes made by the programmers or bugs in the programming language itself. We propose an ACG-C# tool, which can be used to generate automatically C# implementation code for the security protocol verified with Casper and FDR. The ACG-C# approach has several different features, namely automatic code generation, secure code, and high confidence. We conduct a case study on the Yahalom security protocol, using ACG-C# to generate the C# implementation code. | eng_Latn | 4,512 |
[RNA editing in different genetic systems]. | One of the significant amendments to the central dogma of the molecular biology was the discovery of the RNA editing process in different genetic systems. Whereas other forms of co- and posttranscriptional modifications of messenger RNA (mRNA) (capping, polyadenilation, splicing) retain the correspondence of the primary structure of exon and final transcript, RNA editing disturbs this correspondence changing the primary structure of mRNA after its transcription. The variants of RNA-editing mechanisms are various and include site-specific insertions and deletions of one or several nucleotides (insertion-deletion editing) as well as specific modifications of nucleosides such as C-->U and A-->I deamination or U-->C transamination (conversion editing). These mechanisms differ greatly in different genetic systems but they always result in synthesis of functionally valuable proteins from "incorrect" genes and, correspondingly, can play a significant role in regulation of their expression. | Software engineers often need to identify and correct design defects, i.e., recurring design problems that hinder development and maintenance by making programs harder to comprehend and/or evolve. While detection of design defects is an actively researched area, their correction- mainly a manual and time-consuming activity- is yet to be extensively investigated for automation. In this paper, we propose an automated approach for suggesting defect-correcting refactorings using relational concept analysis (RCA). The added value of rca consists in exploiting the links between formal objects which abound in a software re-engineering context. We validated our approach on instances of the Blob design defect taken from four different open-source programs. | eng_Latn | 4,513 |
Source Code Analysis and Manipulation | The special section contains nine papers which are extended versions of papers originally published in the proceedings of the IEEE workshop on Source Code Analysis and Manipulation (SCAM 2001). The papers cover the spectrum of analysis and manipulation work from traditional transformation application areas concerned with optimisation through to more novel application areas such as transformation for evolution of websites; they cover the use of linguistic source code aspects which arise from the semantics of the language to more ephemeral, yet higher level domain-related information. The special issue brings together work on algorithms, tools, empirical results and novel approaches to source code analysis and manipulation. There are five papers on analysis and four on manipulation in this special issue. The next two sections describe the papers on analysis and manipulation respectively. | Abstract modENCODE was a 5 year NHGRI funded project (2007–2012) to map the function of every base in the genomes of worms and flies characterizing positions of modified histones and other chromatin marks, origins of DNA replication, RNA transcripts and the transcription factor binding sites that control gene expression. Here we describe the Drosophila modENCODE datasets and how best to access and use them for genome wide and individual gene studies. | eng_Latn | 4,514 |
Dynamic stability of cracked multi-bay frame structures. | ABSTRACTThe effects of crack depth and crack location on the in-plane static and dynamic stability of cracked multi-bay frame structures subjected to periodic loading have been investigated numerically by using the finite element method. For the rectangular cross-section beam, a crack element is developed by using the principles of fracture mechanics. In addition, the effect of the number of spans and static and dynamic load parameters on static and dynamic stability analysis are also investigated. For buckling and dynamic stability analyses, the results obtained by using the present model are presented in three-dimensional graphical forms and tables. | The complexity of modern network architectures and the epidemic diffusion of malware require collaborative approaches for defense. We present a novel distributed system where each component collaborates to the intrusion and malware detection and to the dissemination of the local analyses. The proposed architecture is based on a decentralized, peer-to-peer and sensor-agnostic design that addresses dependability and load unbalance issues affecting existing systems based on centralized and hierarchical schemes. Load balancing properties, ability to tolerate churn, self-organization capabilities and scalability are demonstrated through a prototype integrating different open source defensive software. | eng_Latn | 4,515 |
Computational study of the accuracy of the r-centroid approximation | Abstract The r -centroid approximation, used in the analysis of intensity measurements of electronic band spectra of diatomic molecules, allows a separation of the band strength into a pure vibrational term (the Franck-Condon factor q v ′ v ″ ) and an electronic term [the electronic transition moment Re ( r )]. The r -centroid approximation is known to have limits to its applicability. However, no specific error limits have previously been given. A computational study has been performed using several molecules and analytic curves to determine specific error limits which can be assigned to either a specific band strength, or in estimating the electronic transition moment using the r -centroid approximation. Other techniques suggested for the evaluation of Re ( r ) have also been tested. | Software engineers often need to identify and correct design defects, i.e., recurring design problems that hinder development and maintenance by making programs harder to comprehend and/or evolve. While detection of design defects is an actively researched area, their correction- mainly a manual and time-consuming activity- is yet to be extensively investigated for automation. In this paper, we propose an automated approach for suggesting defect-correcting refactorings using relational concept analysis (RCA). The added value of rca consists in exploiting the links between formal objects which abound in a software re-engineering context. We validated our approach on instances of the Blob design defect taken from four different open-source programs. | eng_Latn | 4,516 |
Ecient, Secure, and Privacy-preserving Distributed Hot Item Identification | Millions of people every day identify many types of popular or widespread items, including interesting entertainment content and malicious network attacks. Unfortunately, much of the information required for these popularity contests has privacy concerns attached to its use. Unless their privacy is preserved, participants may refuse to participate honestly, reducing the quality of the results. Provably ensuring the privacy of participants, while retaining the level of eciency and robustness necessary for a practical protocol, is a serious challenge to privacy-preserving popular item identification. Previous eorts have not obtained the necessary eciency [23] or provide only unproven, heuristic levels of privacy [24, 16, 39, 19]. In this paper, we propose and experimentally evaluate protocols that provably protect the privacy of participants, while adding only a small amount of overhead. | Programmers using software components have to follow protocols that specify when it is legal to call particular methods with particular arguments. For example, one cannot use an iterator over a set once the set has been changed directly or through another iterator. We formalize the notion of dynamic package interfaces (DPI), which generalize state-machine interfaces for single objects, and give an algorithm to statically compute a sound abstraction of a DPI. States of a DPI represent (unbounded) sets of heap configurations and edges represent the effects of method calls on the heap. We introduce a novel heap abstract domain based on depth-bounded systems to deal with potentially unboundedly many objects and the references among them. We have implemented our algorithm and show that it is effective in computing representations of common patterns of package usage, such as relationships between viewer and label, container and iterator, and JDBC statements and cursors. | eng_Latn | 4,517 |
Avrupa Birliği’nin Hedefli Yaptırımları: Temel Hakların Korunması Temelinde Bir Değerlendirme | Targeted sanctions of the European Union (EU) form a part of restrictive measures/sanctions which are adopted within the framework of Common Foreign and Security Policy. Taking into account their way of adoption and contents, EU’s targeted sanctions are among the measures which have high potential for conflict with fundamental rights. The article tries to answer the following research questions: Could EU targeted sanctions be reviewed under fundamental rights, and if yes, how and to what extent could they be reviewed in the light of procedural fundamental rights, such as right to defence, and substantive fundamental rights, such as right to property? Based upon the caselaw of the Court of Justice of the European Union, this article aims to present the relationship between EU targeted sanctions and protection of fundamental rights, and in this regard the standard and intensity of review of EU targeted sanctions in the light of fundamental rights. | We introduce HiPErJiT, a profile-driven Just-in-Time compiler for the BEAM ecosystem based on HiPE, the High Performance Erlang compiler. HiPErJiT uses runtime profiling to decide which modules to compile to native code and which of their functions to inline and type-specialize. HiPErJiT is integrated with the runtime system of Erlang/OTP and preserves aspects of Erlang's compilation which are crucial for its applications: most notably, tail-call optimization and hot code loading at the module level. We present HiPErJiT's architecture, describe the optimizations that it performs, and compare its performance with BEAM, HiPE, and Pyrlang. HiPErJiT offers performance which is about two times faster than BEAM and almost as fast as HiPE, despite the profiling and compilation overhead that it has to pay compared to an ahead-of-time native code compiler. But there also exist programs for which HiPErJiT's profile-driven optimizations allow it to surpass HiPE's performance. | tur_Latn | 4,518 |
Writing Hygienic Macros in Scheme with Syntax-Case | This article describes a pattern-based hygienic macro system for Scheme and provides numerous examples of its use. Macros dened using this system are automatically hygienic and referentially transparent. Unlike earlier hygienic macro systems, this system does not require \low level" macros to be written in a dierent style from \high level" macros. In particular, automatic hygiene, referential transparency, and the ability to use patterns extend to all macro denitions, and there is never any need to explicitly manipulate syntactic environments of any kind. The macro system also supplies a hygiene-preserving mechanism for controlled variable capture, allowing macros to introduce implicit identier bindings or references. | Structure-analyzing metaprograms remain largely type-unsafe. In programming languages that support meta-programming, the type system is not strong enough to guarantee that well-typed metaprograms produce only well-typed programs. Banning facilities for code analysis from the meta-programming toolbox in order to achieve type soundness, robs programmers of useful tools such as ability to specify powerful code transformations. We present code pattern types, types that reason about the structure of programs through pattern matching and supports type safe code analysis. | eng_Latn | 4,519 |
Extended dissipativity-based non-fragile control for multi-area power systems with actuator fault | ABSTRACTThis paper addresses the issue of reliable load frequency control design of an uncertain multi-area power system with constant time delays and disturbances via non-fragile sampled-data control approach. In particular, the parameter uncertainties are assumed to be randomly occurring which are described by the Bernoulli distributed sequences. By constructing a suitable Lyapunov–Krasovskii functional together with Wirtinger-based inequality, a new set of sufficient conditions in terms of linear matrix inequalities is obtained to ensure the asymptotic stability and extended dissipativity of the multi-area power system not only when all actuators are operational, but also in case of some actuator failures. Finally, simulation results are conducted to validate the effectiveness of the proposed control design technique. | The complexity of modern network architectures and the epidemic diffusion of malware require collaborative approaches for defense. We present a novel distributed system where each component collaborates to the intrusion and malware detection and to the dissemination of the local analyses. The proposed architecture is based on a decentralized, peer-to-peer and sensor-agnostic design that addresses dependability and load unbalance issues affecting existing systems based on centralized and hierarchical schemes. Load balancing properties, ability to tolerate churn, self-organization capabilities and scalability are demonstrated through a prototype integrating different open source defensive software. | eng_Latn | 4,520 |
Preventive Primordial Strategies: Times Are Changing | Chronic degenerative diseases represent a major sanitary health problem, destined to grow with aging of the population. The implementation of primordial prevention strategies, beginning with health lifestyle adoption from earlier ages, can improve the health and well-being of future societies predominantly made up of elderly subjects. | This short paper proposes two different ways for exploiting an evolutionary algorithm to devise malware: the former targeting heuristic-based anti-virus scanner; the latter optimizing a Trojan attack. An extended internal on the same the subject can be downloaded from http://www.cad.polito.it/downloads/ | kor_Hang | 4,521 |
Towards automated malware creation: code generation and code integration | This short paper proposes two different ways for exploiting an evolutionary algorithm to devise malware: the former targeting heuristic-based anti-virus scanner; the latter optimizing a Trojan attack. An extended internal on the same the subject can be downloaded from http://www.cad.polito.it/downloads/ | Based on the traditional adaptive multiuser detection method,sum up application of new LMS,RLS,Kalman arithmetics in DS-CDMA Multiuser detection.principles and methods of 3 arithmetics were given and emulation by Matlab.Based on comparing with SIR and errorcode of 3 arrthmetic,Kalman arithmetic show more excellent detection performance. | eng_Latn | 4,522 |
Patch Assessment in Fox Squirrels: The Role of Resource Density, Patch Size, and Patch Boundaries | The finer the scale at which a forager can detect patchiness, the greater is its opportunity to allocate time efficiently in response to spatial heterogeneity in resource abundance. There are three advantages of assessing and responding to patchiness at smaller scales. First, an environment may be rendered profitable only when the forager can separate areas of low and high resource abundance. Second, by placing accurate boundaries on profitable food patches, foragers can eliminate the "cost" of over- and underestimating patch size. Third, by biasing search efforts toward rich food patches, the forager can harvest more resources in the same amount of time. We investigate the ability of fox squirrels, Sciurus niger, to detect patchiness at small spatial scales, using experimental food patches subdivided into micropatches. We manipulated micropatch size, food density, and the occurrence of distinct versus vague boundaries. In accord with the theory, increasing the proportion of vague boundaries increased ass... | Software engineers often need to identify and correct design defects, i.e., recurring design problems that hinder development and maintenance by making programs harder to comprehend and/or evolve. While detection of design defects is an actively researched area, their correction- mainly a manual and time-consuming activity- is yet to be extensively investigated for automation. In this paper, we propose an automated approach for suggesting defect-correcting refactorings using relational concept analysis (RCA). The added value of rca consists in exploiting the links between formal objects which abound in a software re-engineering context. We validated our approach on instances of the Blob design defect taken from four different open-source programs. | eng_Latn | 4,523 |
Veracode debuts system to test source code | Veracode launched its Software Security Ratings Service on June 25, introducing its new system for use in testing the safety of applications development among enterprise customers and third-party software makers. | By this time next year, virtualization users may have their own industry-sanctioned benchmarking software for evaluating various virtualization environments. | eng_Latn | 4,524 |
What sort of DNA repair is created by modern genetic engineering techniques? | Genetic engineering is the modification of an organism's genome through biotechnology. Since the 1970s, a variety of techniques have been developed to specifically add, remove and edit genes in an organism. Recently developed genome engineering techniques use engineered nuclease enzymes to create targeted DNA repair in a chromosome to either disrupt or edit a gene when the break is repaired. The related term synthetic biology is sometimes used to refer to extensive genetic engineering of an organism. | In 1994, over a hundred intrusions were made by unidentified crackers into the Rome Laboratory, the US Air Force's main command and research facility. Using trojan horses, hackers were able to obtain unrestricted access to Rome's networking systems and remove traces of their activities. The intruders were able to obtain classified files, such as air tasking order systems data and furthermore able to penetrate connected networks of National Aeronautics and Space Administration's Goddard Space Flight Center, Wright-Patterson Air Force Base, some Defense contractors, and other private sector organizations, by posing as a trusted Rome center user. | eng_Latn | 4,525 |
Is there any way to hide or encrypt JavaScript code to prevent people from viewing, copying, and/or modifying proprietary programs? | I want to make a JavaScript application that's not open source, and thus I wish to learn how to can obfuscate my JS code? Is this possible? | Particularly, what is the best snippets package out there? Features: easy to define new snippets (plain text, custom input with defaults) simple navigation between predefined positions in the snippet multiple insertion of the same custom input accepts currently selected text as a custom input cross-platform (Windows, Linux) dynamically evaluated expressions (embedded code) written in a concise programming language (Perl, Python, Ruby are preferred) nicely coexists with others packages in Emacs Example of code template, a simple for loop in C: for (int i = 0; i < %N%; ++i) { _ } It is a lot of typing for such common code. I want to invoke a code template or snippet which inserts that boilerplate code for me. Additionally it stops (on TAB or other keystroke) at %N% (my input replaces it) and final position of the cursor is _. | eng_Latn | 4,526 |
Supposed I have written a program, and I want to make sure that its code will not be changed (for now, let's assume we are using an interpreted / scripting language, so "just compile it" is not a valid answer). So I would like to detect if someone changes the code. How can I do this reliably? The most obvious way is to hash the code, put the hash into the code, and verify it - but of course this does not work, as it is pretty easy to simply rehash the code. You would have to know the hash in advance and put it into it while calculating the hash, but this is a chicken-egg problem, obviously. Are there any other options that are reliable? | I need to write a small program that can detect that it has been changed. Please give me a suggestion! Thank you. | The new Top-Bar does not show reputation changes from Area 51. | eng_Latn | 4,527 |
Can an AES-256 key be generated for a large number of cribs? I have a question in regards to Ransomware type viruses. I know that a number of these viruses use the AES-256 algorithm to encrypt user's files using a randomly generated key. I work in IT support and I had one client the other week who had lost a large number of important files this way but one thing which struck me was that we were able to recover a large number of files via DropBox - about 500 files (~2gb worth of data) and because the virus only changed the extension it was clear which unencrypted file corresponded to which encrypted file. What I was wondering is; with a large dataset like this where you have both the encrypted and unencrypted data would it be possible to calculate the encryption key for an AES-256 algorithm in a reasonable time? I don't know how these algorithms work but presumably you would have so much data available to compare that it should at least make the task considerably easier should it not? I'm not intending to rid the world of ransomware but it just interested me! Cheers, Olly | Why is AES resistant to known-plaintext attacks? At least it's my understanding that AES isn't affected by known-plaintext. Is it immune to such an attack, or just resistant? Does this vary for chosen-plaintext? | How to lock compiled Java classes to prevent decompilation? How do I lock compiled Java classes to prevent decompilation? I know this must be very well discussed topic on the Internet, but I could not come to any conclusion after referring them. Many people do suggest obfuscator, but they just do renaming of classes, methods, and fields with tough-to-remember character sequences but what about sensitive constant values? For example, you have developed the encryption and decryption component based on a password based encryption technique. Now in this case, any average Java person can use to decompile the class file and easily retrieve the password value (defined as constant) as well as and in turn can decrypt the data by writing small independent program! Or should such sensitive components be built in native code (for example, VC++) and call them via ? | eng_Latn | 4,528 |
Is imklaunchagent virus or Apple system file? My client suspects the imklaunchagent damages his computer. I did some research but found two explanations. One is Apple's system file and the other is virus. Which one is true? Apple System File? claim 1 man imklaunchagent" in Terminal.app says: imklaunchagent is automatically invoked to launch input methods that are selected via direct user inter- action. It is not intended to be invoked via other means and must not be terminated. imklaunchagent monitors abnormal behavior and will disallow an input method from launching if it repeatedly terminates unexpect- edly within a short timespan. (Reference: ) claim 2 Do you happen to write in, say, Chinese or Japanese? I think the process you are mentioning is part of Apple's Input Method Kit framework ( ), which is used to support languages that use complex scripts. The program itself is located in: /System/Library/Frameworks/InputMethodKit.framework/Versions/A/Resources/imklaun chagent (Reference: ) claim 3 (see answer, not the question) It's a standard macOS process. If you ever google a process name & all you get are 'malware removal sites trying to sell you something'… think twice about why. If the threat was real, the make-a-quick-buck sites would be far far down the list, well below real issues faced by real people. The process is inside a protected area, in the System folder on the System partition. You'd have to try very, very hard to overwrite it with a malicious component - including rebooting to Recovery & manually disabling SIP. macOS simply will not let a random process anywhere near that area, even with admin permission. (Reference: ) Virus? (Reference: ) | Deleting a suspicious malware (imklaunchagent) in Mac I have a MacBook Pro (macOS Mojave) laptop and have recently noticed a suspicious process in Activity Monitor with this name : imklaunchagent I checked this folder: /System/Library/Frameworks/InputMethodKit.framework/Versions/A/Resources/imklaunchagent and it seems imklaunchagent and its related files cannot be removed. I tried to remove it via Terminal and this message showed up: "Operation not permitted". However, in "Security and Privacy" of "System Preferences", I chose Terminal to have full disk access, still can't delete the file and the same message appears. I installed the free version of Combo Cleaner and it detected other viruses, none of which are imklaunchagent. Is imklaunchagent a malware? How can it be deleted? | Impulsioned jumping There's one thing that has been puzzling me, and that is how to implement a 'faux-impulsed' jump in a platformer. If you don't know what I'm talking about, then think of the jumps of Mario, Kirby, and Quote from Cave Story. What do they have in common? Well, the height of your jump is determined by how long you keep the jump button pressed. Knowing that these character's 'impulses' are built not before their jump, as in actual physics, but rather while in mid-air - that is, you can very well lift your finger midway of the max height and it will stop, even if with desacceleration between it and the full stop; which is why you can simply tap for a hop and hold it for a long jump -, I am mesmerized by how they keep their trajetories as arcs. My current implementation works as following: While the jump button is pressed, gravity is turned off and the avatar's Y coordenate is decremented by the constant value of the gravity. For example, if things fall at Z units per tick, it will rise Z units per tick. Once the button is released or the limit is reached, the avatar desaccelerates in an amount that would make it cover X units until its speed reaches 0; once it does, it accelerates up until its speed matches gravity - sticking to the example, I could say it accelerates from 0 to Z units/tick while still covering X units. This implementation, however, makes jumps too diagonal, and unless the avatar's speed is faster than the gravity, which would make it way too fast in my current project (it moves at about 4 pixels per tick and gravity is 10 pixels per tick, at a framerate of 40FPS), it also makes it more vertical than horizontal. Those familiar with platformers would notice that the character's arc'd jump almost always allows them to jump further even if they aren't as fast as the game's gravity, and when it doesn't, if not played right, would prove itself to be very counter-intuitive. I know this because I could attest that my implementation is very annoying. Has anyone ever attempted at similar mechanics, and maybe even succeeded? I'd like to know what's behind this kind of platformer jumping. If you haven't ever had any experience with this beforehand and want to give it a go, then please, don't try to correct or enhance my explained implementation, unless I was on the right way - try to make up your solution from scratch. I don't care if you use gravity, physics or whatnot, as long as it shows how these pseudo-impulses work, it does the job. Also, I'd like its presentation to avoid a language-specific coding; like, sharing us a C++ example, or Delphi... As much as I'm using the XNA framework for my project and wouldn't mind C# stuff, I don't have much patience to read other's code, and I'm certain game developers of other languages would be interested in what we achieve here, so don't mind sticking to pseudo-code. Thank you beforehand. | eng_Latn | 4,529 |
5-letter term for an "infectious" program designed to harm your computer | Timeline of computer viruses and worms - Wikipedia This timeline of computer viruses and worms presents a chronology of noteworthy computer .... Elk Cloner's design combined with public ignorance about what malware was ... Brain is considered the first IBM PC compatible virus, and the program .... May 5: The ILOVEYOU worm, also known as Love Letter, or VBS, or Love... | Jeopary Questions page 1935 - THE 1880S - TriviaBistro.com ITALIAN WORDS & PHRASES: Eye drops are delle gocce per gliocchi & these drops are delle gocce per le orecchie LAKES: Seneca Lake, one of these New... | eng_Latn | 4,530 |
Around 1980/81, a car-pool buddy told me of a story that he had read about a computer virus that constantly evolving. I vaguely remember that it's human programmer had created several early variants that weren't self-sustaining but as they 'died' he would add new characteristics - self-replicating, mirror real code to escape detection, and eventually self-modifying so it could learn and adapt on its own. I don't remember the title or author (or friend, for that matter) but it was the earliest I had heard of a computer virus that evolved. Any thoughts? | This book came out of the 1970s (early 1980's) at the latest. In it the protagonist, a not so diligent student, gets turned on to computer programming and creates (I think..) a weather program. Eventually he moves on and years later the program contacts him. It has become an AI and he is its creator. I forget what the setup is post contact which is not helpful at all.. | The new Top-Bar does not show reputation changes from Area 51. | eng_Latn | 4,531 |
A variety of refinements to the attack have been suggested , including using multiple linear approximations or incorporating non-linear expressions , leading to a generalized partitioning cryptanalysis . | A variety of refinements to the attack have been suggested , including using multiple linear approximations or including non-linear expressions . | PCLinuxOS uses the Advanced Packaging Tool ( or APT ) , a package management system ( originally from the Debian distribution ) , together with Synaptic Package Manager , a GUI front end to APT , in order to add , remove or update packages . | eng_Latn | 4,532 |
I was wondering if it is possible to decompile a .net binary application? and I found out that is easy as a piece of cake! This is wired. why would Microsoft NOT protect customer source code binaries? At least why it is so easy to decompile even with orginal variable names and etc. I know that in PHP there is a way to encode your source code that nobody can read that. I don't know if its impossible to decompile BUT at least it is not as easy as JetBrains or ILSpy So my main Question is here: IS THERE ANY WAY TO ENCODE YOUR SOURCE CODES IN .NET (C#)? | Obfuscation is one way, but it can't protect from breaking the piracy protection security of the application. How do I make sure that the application is not tampered with, and how do I make sure that the registration mechanism can't be reverse engineered? Also it is possible to convert a C# application to native code, and is too costly. C# provides lot of features, and is the ideal language for my code, so writing the whole codebase again in C++ is out of the question. Secure certificates can be easily removed from the signed assemblies in .NET. | Is it possible to write some C or C++ code and compile to binaries, then use those binaries with php? Is it also possible to write a php library using C and C++ ? If so, please tell how can I do so? | eng_Latn | 4,533 |
Is there any way to compile ASP.NET Web Site and make it impossible to decompile (reverse engeenering)? I wrote my own big project in Visual Studio, I want to compile it and sell to the buyer. But I don't want buyer to see/modify the source code in any way. I'm worried because even though I published (compiled) it with "allow this pre-compilled web site to be updatable" unchecked, I heard about something like Reflector and ways to get the source from binaries. Is there any way to make it impossible? It's all about piracy prevention - I added fixed line of code that makes the website working only on ONE particular domain like XXXXXXX.XXX (typed in the code). But I'm worried that it can be decompiled and this line can be removed. Thanks | Obfuscation is one way, but it can't protect from breaking the piracy protection security of the application. How do I make sure that the application is not tampered with, and how do I make sure that the registration mechanism can't be reverse engineered? Also it is possible to convert a C# application to native code, and is too costly. C# provides lot of features, and is the ideal language for my code, so writing the whole codebase again in C++ is out of the question. Secure certificates can be easily removed from the signed assemblies in .NET. | Can I do it with reflection or something like that? | eng_Latn | 4,534 |
It is possible to share a tampermonkey script to someone but to hide the code from it and somehow to secure it. I just don't want not to be possible for anyone to copy/paste the script from there. | I want to make a JavaScript application that's not open source, and thus I wish to learn how to can obfuscate my JS code? Is this possible? | The entire site is blank right now. The header and footer are shown, but no questions. | eng_Latn | 4,535 |
How to evaluate the avalanche effect? How can avalanche effect be calculated? I would in particular want to know what platform or IDE can be used to calculate the same? | Calculation of the avalanche effect coefficient Given a matrix/dependence matrix for a hash function,how do I calculate the avalanche coefficient for it. I want to calculate a single parameter(value) which represents the amount of avalanche effect for the given hash function. I have thought of computing mean all over the matrix but am not sure that's the correct thing to do. The talks about the avalanche coefficient but they haven't mentioned the way they calculate it. | What is syntax highlighting and how does it work? I noticed that sometimes my code gets highlighted in different colors when rendered. What is syntax highlighting? How does it work? Why isn't my code being highlighted correctly? How do I report a bug or request a new language? How do I use syntax highlighting? What languages are currently available on Stack Exchange? | eng_Latn | 4,536 |
I'm asking if the SE sites or new proposals could have code analysis in its scope similar to , or it's against Stack Exchange rules? One example of question is , which was closed as off-topic (code analysis), therefore I've created the new (similar to ) where (malicious) code analysis is on-topic and defining exactly what kind of code it's expected to be analysed. Is that perfectly fine, fine, worth to try or code analysis is not suitable on SE sites at all? | Is it OK to ask on SO for help in explaining someone else's working piece of code, from Open Source projects or library examples etc.? Or does this belong somewhere else? | The new Top-Bar does not show reputation changes from Area 51. | eng_Latn | 4,537 |
What exactly from the source is visible in .net assembly? Using the code analysis tools (FxCop) I'm surprised how much information is visible inside the application exe file: Class names Methods Argument count/types/passing mathods etc I have tried to make the app a release, do not include any debug info, but still, lot of "coding" info is present. Is there any option how to "strip" such meta info? Is this needed for reflection? | Protect .NET code from reverse engineering? Obfuscation is one way, but it can't protect from breaking the piracy protection security of the application. How do I make sure that the application is not tampered with, and how do I make sure that the registration mechanism can't be reverse engineered? Also it is possible to convert a C# application to native code, and is too costly. C# provides lot of features, and is the ideal language for my code, so writing the whole codebase again in C++ is out of the question. Secure certificates can be easily removed from the signed assemblies in .NET. | C# - how can I get owner's name for a Mutex I have a shared mutex between 2 applications. I want to create an administration console that shows the current owner's name of the mutex. How can I get the application name that currently owns the Mutex? | eng_Latn | 4,538 |
Give me a c-program system samples? | int\nmain (void)\n{\nfor(i=0;i<10;i++){\nprintf("some thing output here %d", i)\n}\n} | AVG Free Anti-Virus, \nC Cleaner Registry Cleaner, \nSpybot S & D spyware remover, \nAd-Aware SE Personal adware remover, \nWindows Defender spyware remover,\nZone Alarm Basic Firewall | eng_Latn | 4,539 |
Program hidden beneath an interface in mathematica | How to distribute proprietary Mathematica code | Annoying FrontEnd bugs in Mathematica 10 | eng_Latn | 4,540 |
JSNOSE: Detecting JavaScript Code Smells | JDeodorant: Identification and Removal of Type-Checking Bad Smells | Estimation of the Mathematical Parameters of Double-Exponential Pulses Using the Nelder–Mead Algorithm | eng_Latn | 4,541 |
In addition to individual applications, what modern systems that control the basic functions of a computer typically use UTC? | Some applications standardize on UTC to avoid problems with clock shifts and time zone differences. Likewise, most modern operating systems internally handle and store all times as UTC and only convert to local time for display. | In 1994, over a hundred intrusions were made by unidentified crackers into the Rome Laboratory, the US Air Force's main command and research facility. Using trojan horses, hackers were able to obtain unrestricted access to Rome's networking systems and remove traces of their activities. The intruders were able to obtain classified files, such as air tasking order systems data and furthermore able to penetrate connected networks of National Aeronautics and Space Administration's Goddard Space Flight Center, Wright-Patterson Air Force Base, some Defense contractors, and other private sector organizations, by posing as a trusted Rome center user. | eng_Latn | 4,542 |
Beyond the Interconnections: Split Manufacturing in RF Designs | Securing computer hardware using 3D integrated circuit (IC) technology and split manufacturing for obfuscation | Silencing Hardware Backdoors | eng_Latn | 4,543 |
.Net Obfuscator | .NET obfuscation tools/strategy | .NET obfuscation tools/strategy | deu_Latn | 4,544 |
How to fight against memory editing cheat software? | Strategies to Defeat Memory Editors for Cheating - Desktop Games | Strategies to Defeat Memory Editors for Cheating - Desktop Games | eng_Latn | 4,545 |
What is bug density and how do we calculate it? | A measure of how a buggy your software is.\nBuggy lines divided by total lines. | Get in touch with a psychic and ask Douglas Adams (RIP). (If &) Where he is now, he's bound to know the answer. | eng_Latn | 4,546 |
Formal concept analysis: current trends and directions | Regularized offpolicy TD-learning | MEDUSA: MEtamorphic malware dynamic analysis usingsignature from API | eng_Latn | 4,547 |
Mining Change Patterns in AspectJ Software Evolution | Identifying Syntactic Differences Between Two Programs | A linear space algorithm for computing maximal common subsequences | kor_Hang | 4,548 |
gamer psychology and behavior . | Using heuristics to evaluate the playability of games | Context-sensitive analysis of obfuscated x86 executables | eng_Latn | 4,549 |
Code Transformation by Direct Transformation of ASTs | refactoring improving the design of existing code . | Automatic Melody Generation | eng_Latn | 4,550 |
English shellcode | StackGuard: Automatic Adaptive Detection and Prevention of Buffer-Overflow Attacks | Implementation of a Covert Channel in the 802.11 Header | eng_Latn | 4,551 |
Finding dispatcher gadgets for jump oriented programming code reuse attacks | Defeating return-oriented rootkits with "Return-Less" kernels | Deep ADMM-Net for compressive sensing MRI | eng_Latn | 4,552 |
analyzing the state of static analysis : a large - scale evaluation in open source software . | Would static analysis tools help developers with code reviews? | SURVEY PAPER : MULTI SENSOR DATA FUSION FOR SENSOR VALIDATION | eng_Latn | 4,553 |
Security Against Hardware Trojan Attacks Using Key-Based Design Obfuscation | Watermarking-based copyright protection of sequential functions | Laser technology to manage periodontal disease: a valid concept? | eng_Latn | 4,554 |
Detecting code clones in binary executables | Similarity Search in High Dimensions via Hashing | Dynamic voltage regulator based on PWM AC chopper converter: topology and control | eng_Latn | 4,555 |
Behavioral Clustering of HTTP-Based Malware and Signature Generation Using Malicious Network Traces | Dytan: a generic dynamic taint analysis framework | Finding Groups in Data: An Introduction to Cluster Analysis. | eng_Latn | 4,556 |
a probabilistic software quality model . | A METRICS SUITE FOR OBJECT ORIENTED DESIGN | Relative Entropy Policy Search | eng_Latn | 4,557 |
InputFinder: Reverse Engineering Closed Binaries using Hardware Performance Counters | Dynamic Test Generation to Find Integer Bugs in x86 Binary Linux Programs | Dynamic Instrumentation of Production Systems | eng_Latn | 4,558 |
Hardware trojan attacks in FPGA devices: threat analysis and effective counter measures | MERO: A Statistical Approach for Hardware Trojan Detection | A Transformation System for Developing Recursive Programs | eng_Latn | 4,559 |
Uptane : Securing Software Updates for Automobiles | Secure software updates: disappointments and new challenges | ERICO: Effective Removal of Inline Caching Overhead in Dynamic Typed Languages | eng_Latn | 4,560 |
An Evil Copy: How the Loader Betrays You. | Counterfeit Object-oriented Programming: On the Difficulty of Preventing Code Reuse Attacks in C++ Applications | Biochemical method for inserting new genetic information into DNA of Simian Virus 40: circular SV40 DNA molecules containing lambda phage genes and the galactose operon of Escherichia coli. | eng_Latn | 4,561 |
Grammar-based adaptive fuzzing: Evaluation on SCADA modbus protocol | BAP: A Binary Analysis Platform | Interference Analysis for UAV Connectivity over LTE Using Aerial Radio Measurements | eng_Latn | 4,562 |
software quality attributes and trade - offs . | A framework for classifying and comparing software architecture evaluation methods | Citing for high impact | eng_Latn | 4,563 |
A Hybrid Model to Detect Malicious Executables | Learning to detect malicious executables in the wild | triejoin : a simple , worst - case optimal join algorithm . | eng_Latn | 4,564 |
Effective Function Recovery for COTS Binaries using Interface Verification | Blanket execution: dynamic similarity testing for program binaries and components | Service-Oriented Architecture Maturity | eng_Latn | 4,565 |
A Trusted Safety Verifier for Process Controller Code | Detecting False Data Injection Attacks on DC State Estimation | SSP: Semantic Space Projection for Knowledge Graph Embedding with Text Descriptions | eng_Latn | 4,566 |
A2: Analog Malicious Hardware | Trojan Detection using IC Fingerprinting | On Textual Analysis and Machine Learning for Cyberstalking Detection | eng_Latn | 4,567 |
Do I use the wrong definition?: DeFuse: definition-use invariants for detecting concurrency and sequential bugs | Valgrind: a framework for heavyweight dynamic binary instrumentation | 50-kW 1kV DC bus air-cooled inverter with 1.7 kV SiC MOSFETs and 3D-printed novel power module packaging structure for grid applications | eng_Latn | 4,568 |
Xandra: An Autonomous Cyber Battle System for the Cyber Grand Challenge | Howard: A Dynamic Excavator for Reverse Engineering Data Structures | EEL: machine-independent executable editing | eng_Latn | 4,569 |
Scalable Graph-based Bug Search for Firmware Images | Program-Adaptive Mutational Fuzzing | T- and B-cell subsets in periodontitis | eng_Latn | 4,570 |
Software Crash Analysis for Automatic Exploit Generation on Binary Programs | All You Ever Wanted to Know about Dynamic Taint Analysis and Forward Symbolic Execution (but Might Have Been Afraid to Ask) | Design and control of a three-phase active rectifier under non-ideal operating conditions | kor_Hang | 4,571 |
Benchmarking Static Analysis Tools for Web Security | Pixy: a static analysis tool for detecting Web application vulnerabilities | Seamless Montage for Texturing Models | eng_Latn | 4,572 |
Firmalice - Automatic Detection of Authentication Bypass Vulnerabilities in Binary Firmware. | Statically-directed dynamic automated test generation | Self-adaptive differential evolution with neighborhood search | eng_Latn | 4,573 |
Automatic logging of operating system effects to guide application-level architecture simulation | Pin: building customized program analysis tools with dynamic instrumentation | Temporal Information Retrieval | eng_Latn | 4,574 |
XFI: software guards for system address spaces | Unmodified Device Driver Reuse and Improved System Dependability via Virtual Machines | Fast and Accurate Estimation of Quality of Results in High-Level Synthesis with Machine Learning | eng_Latn | 4,575 |
Security Analysis of PHP Bytecode Protection Mechanisms | A Generic Approach to Automatic Deobfuscation of Executable Code | Newsletter No . 17 , Fall 2006 Geodetic constraints on Rupturing of Continental Lithosphere along the Red Sea | kor_Hang | 4,576 |
Classification of hardware trojan detection techniques | Hardware Trojan Detection by Multiple-Parameter Side-Channel Analysis | Density-Driven Cross-Lingual Transfer of Dependency Parsers | eng_Latn | 4,577 |
SCRAP: Architecture for signature-based protection from Code Reuse Attacks | StackGuard: Automatic Adaptive Detection and Prevention of Buffer-Overflow Attacks | Beyond Bilinear: Generalized Multi-modal Factorized High-order Pooling for Visual Question Answering | eng_Latn | 4,578 |
portable and efficient auto - vectorized bytecode : a look at the interaction between static and jit compilers . | Split Compilation: an Application to Just-in-Time Vectorization | DIABLO: a reliable, retargetable and extensible link-time rewriting framework | eng_Latn | 4,579 |
Pinpointing Vulnerabilities | Non-control-data attacks are realistic threats | Secure Execution via Program Shepherding | eng_Latn | 4,580 |
Learning to target: what works for behavioral targeting | Mining advertiser-specific user behavior using adfactors | Efficient software-based fault isolation | eng_Latn | 4,581 |
Broken Promises: An Experiment | ERC -- A Theory of Equity, Reciprocity and Competition | Algorithmically Generated Domain Detection and Malware Family Classification | deu_Latn | 4,582 |
branch prediction and the performance of interpreters — don ' t trust folklore . | Pin: building customized program analysis tools with dynamic instrumentation | Minimal Narrative Annotation Schemes and Their Applications | eng_Latn | 4,583 |
A similarity metric method of obfuscated malware using function-call graph | A survey of graph edit distance | Automatic detection of body parts in x-ray images | eng_Latn | 4,584 |
On the Feasibility of Malware Authorship Attribution | refactoring improving the design of existing code . | Finding Plagiarisms among a Set of Programs with JPlag | eng_Latn | 4,585 |
Unknown Malcode Detection Using OPCODE Representation | Data mining methods for detection of new malicious executables | Speech and Language Processing | eng_Latn | 4,586 |
Static analysis of Android programs | Precise null-pointer analysis | Graph-Based Algorithms for Boolean Function Manipulation | eng_Latn | 4,587 |
Selecting a set of appropriate metrics for detecting code clones | CCFinder: a multilinguistic token-based code clone detection system for large scale source code | Health Insurance and the Demand for Medical Care : Evidence from a Randomized Experiment | eng_Latn | 4,588 |
on the evolution of lehman ' s laws . | Laws of Software Evolution Revisited | software aging . | eng_Latn | 4,589 |
Predicting change propagation in software systems | CVSSearch: Searching thr ough SourceCodeusingCVS Comments | IT2FS-based ontology with soft-computing mechanism for malware behavior analysis | eng_Latn | 4,590 |
APISan: Sanitizing {API} Usages through Semantic Cross-Checking | Cross-checking semantic correctness: the case of finding file system bugs | Singularity: rethinking the software stack | eng_Latn | 4,591 |
Valgrind: a framework for heavyweight dynamic binary instrumentation | How to shadow every byte of memory used by a program | dynamic binary analysis and instrumentation . | eng_Latn | 4,592 |
Malware detection with quantitative data flow graphs | A survey on automated dynamic malware-analysis techniques and tools | Memory-efficient on-the-fly voxelization of particle data | eng_Latn | 4,593 |
Network Flow Watermarking: A Survey | Automating Network Application Dependency Discovery: Experiences, Limitations, and New Solutions | X-trace: A pervasive network tracing framework | deu_Latn | 4,594 |
JITDefender: A Defense against JIT Spraying Attacks | Address obfuscation: an efficient approach to combat a broad range of memory error exploits | Linked Hypernyms : Enriching DBpedia with Targeted Hypernym Discovery | eng_Latn | 4,595 |
Finding software license violations through binary code clone detection | Clustering by compression | Mammalian Rho GTPases: new insights into their functions from in vivo studies | eng_Latn | 4,596 |
Calipso: physics-based image and video editing through CAD model proxies | Physically Based Deformable Models in Computer Graphics | SCADAVT-A framework for SCADA security testbed based on virtualization technology | eng_Latn | 4,597 |
A 3-D Split Manufacturing Approach to Trustworthy System Development | Yet another MicroArchitectural Attack:: exploiting I-Cache | Differential Power Analysis | eng_Latn | 4,598 |
Towards automated exploit generation for embedded systems | A large-scale analysis of the security of embedded firmwares | On Regularization Parameter Estimation under Covariate Shift | eng_Latn | 4,599 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.