We have developed a high-performance parametric font generation system for the creation and commercial supply of digital fonts, and in particular, for generating a wide variety of digital typefaces using a single compact representation of typographic knowledge and characteristics. Typographic feature detail can be added or removed, depending on the application. The system does not rely on maste...

We present a new method for deforming an object in a static real scene, which interacts with animated synthetic characters. Unlike the existing method making a new synthetic object to substitute for the interacting object in the real scene, we directly deform the object in image space using an image-warping technique with assistance from a simplified 3D sub-model. The deformed image sequence is...

In order to avoid being static analyzed, hacker rely on various obfuscation techniques to hide its malicious characters. These techniques are very effective against common disassembles, preventing binary file from being disassembled correctly. The study presents novel disassemble algorithm which based on analyzed Control Flow Graph (CFG) and Data Flow Graph (DFG) information improve the ability...

Studying password-cracking techniques is essential in the information security discipline as it highlights vulnerability of weak passwords and need for stronger measures to protect sensitive information. While both methods aim uncover passwords, approach task different ways. A brute force algorithm generates all possible combinations characters a specified range length, while dictionary attack ...

The fields of succinct data structures and compressed text indexing have seen quite a bit of progress over the last two decades. An important achievement, primarily using techniques based on the Burrows-Wheeler Transform (BWT), was obtaining the full functionality of the suffix tree in the optimal number of bits. A crucial property that allows the use of BWT for designing compressed indexes is ...

Let E be an elliptic curve over Q with complex multiplication by the ring of integers of an imaginary quadratic eld. Let be the Hecke character associated to E by the theory of complex multiplication. Let be the complex conjugate character of. For a pair of integers k and j, deene the Hecke character ' = '(k; j) = k j. Let p be a prime where E has good, ordinary reduction. Let p be a xed prime ...