Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

S. Krishnaswamy

dblp:02/4037 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2019
0000-0002-6797-4614ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2Security and privacy · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
protein structure prediction
0.012000
Profiles from structure based sequence alignment of porins can identify ß stranded integral membrane proteins · Bioinform. 2000
Bioinformatics and computational biology › structural bioinformatics
structure-based sequence alignment
0.012000
Profiles from structure based sequence alignment of porins can identify ß stranded integral membrane proteins · Bioinform. 2000

Methods — techniques the papers use, named apart from their topics

sequence profile · 0.0
YearPublicationVenuePosition
2019 Protein docking using constrained self-adaptive differential evolution algorithm
S. Sudha 0001, S. Baskar 0001, S. Krishnaswamy
Soft Comput.3
2015 Protein structure prediction using diversity controlled self-adaptive differential evolution with local search
S. Sudha 0001, S. Baskar 0001, S. Miruna Joe Amali, S. Krishnaswamy
Soft Comput.4
2000 Experience with Software Watermarking
abstract
There are at least four US patents on software watermarking, and an idea for further advancing the state of the art was presented by C. Collberg and C. Thomborsen (1999). The new idea is to embed a watermark in dynamic data structures, thereby protecting against many program-transformation attacks. Until now there have been no reports on practical experience with this technique. We have implemented and experimented with a watermarking system for Java based on the ideas of Collberg and Thomborsen. Our experiments show that watermarking can be done efficiently with moderate increases in code size, execution times and heap-space usage, while making the watermarked code resilient to a variety of program-transformation attacks. For a particular representation of watermarks, the time to retrieve a watermark is on the order of one minute per megabyte of heap space. Our implementation is not designed to resists all possible attacks; to do that, it should be combined with other protection techniques, such as obfuscation and tamperproofing.
Jens Palsberg, S. Krishnaswamy, Minseok Kwon, Qiuyun Shao
ACSAC2
2000 Profiles from structure based sequence alignment of porins can identify ß stranded integral membrane proteins
abstract
Abstract Supplementary information: http://gene.tn.nic.in/sk/profiles/ Contact: [email protected] To whom correspondence should be addressed.
T. V. Gnanasekaran, Suraj Peri, A. Arockiasamy, S. Krishnaswamy
Bioinform.4