Data Structures and Algorithms

1807 Submissions

[3] viXra:1807.0269 [pdf] submitted on 2018-07-16 11:19:08

Algorithm to Improve Information Security

Authors: George Rajna
Comments: 53 Pages.

Cryptography is a science of data encryption providing its confidentiality and integrity. [33] Researchers at the University of Sheffield have solved a key puzzle in quantum physics that could help to make data transfer totally secure. [32] "The realization of such all-optical single-photon devices will be a large step towards deterministic multi-mode entanglement generation as well as high-fidelity photonic quantum gates that are crucial for all-optical quantum information processing," says Tanji-Suzuki. [31] Researchers at ETH have now used attosecond laser pulses to measure the time evolution of this effect in molecules. [30] A new benchmark quantum chemical calculation of C2, Si2, and their hydrides reveals a qualitative difference in the topologies of core electron orbitals of organic molecules and their silicon analogues. [29] A University of Central Florida team has designed a nanostructured optical sensor that for the first time can efficiently detect molecular chirality—a property of molecular spatial twist that defines its biochemical properties. [28] UCLA scientists and engineers have developed a new process for assembling semiconductor devices. [27] A new experiment that tests the limit of how large an object can be before it ceases to behave quantum mechanically has been proposed by physicists in the UK and India. [26] Phonons are discrete units of vibrational energy predicted by quantum mechanics that correspond to collective oscillations of atoms inside a molecule or a crystal. [25] This achievement is considered as an important landmark for the realization of practical application of photon upconversion technology. [24]
Category: Data Structures and Algorithms

[2] viXra:1807.0090 [pdf] submitted on 2018-07-03 11:17:42

Enhancing Website Navigation by User Experience Design Strategies

Authors: Pedram Ahmadi
Comments: 121 Pages.

Today Designing efficient interfaces plays an important role in world wide web. People are highly attracted to websites that gives them more useful information at lowest time intervals. Websites always have a lack of enough strategies to keep users involved and satisfied. Now user experience design comes up to mind to solve these difficulties with new ideas and practices. The UX Design uses usability and accessibility methods to improve the interaction between users and websites. This thesis focuses on web navigation types to make them more appropriate in the way of providing useful contents.
Category: Data Structures and Algorithms

[1] viXra:1807.0026 [pdf] replaced on 2018-07-12 18:01:28

A Heuristic Algorithm for the Solution of SAT in Polynomial Time

Authors: Valdir Monteiro dos Santos Godoi
Comments: 40 Pages. A primeira versão deste artigo foi meu trabalho de Métodos em Pesquisa Operacional (PM015), IMECC-UNICAMP.

Usando um novo conceito de linguagem variável, já provei anteriormente que P≠NP, mas tal prova não utilizou nenhum dos problemas clássicos conhecidos como NP-completos, a exemplo de SAT (satisfatibilidade, satisfiability), caixeiro-viajante (travelling-salesman), soma de subconjuntos (subset-sum), da mochila (knapsack), programação linear inteira (integer linear programming), etc. Tal prova não implica que sendo P≠NP então devemos ter NP-completo ∉P, ou seja, os mencionados famosos problemas difíceis podem ainda ser resolvidos em tempo polinomial, sem precisar encerrar a pesquisa nesta direção. Tal como ocorre com o método simplex, que pode resolver em tempo polinomial a grande maioria dos problemas de programação linear, também é possível resolver SAT em tempo polinomial na maioria das vezes, que é o que eu mostro neste trabalho.
Category: Data Structures and Algorithms