973 resultados para Computer Sciences
Resumo:
Human age is surrounded by assumed set of rules and behaviors imposed by local culture and the society they live in. This paper introduces software that counts the presence of a person on the Internet and examines the activities he/she conducts online. The paper answers questions such as how "old" are you on the Internet? How soon will a newbie be exposed to adult websites? How long will it take for a new Internet user to know about social networking sites? And how many years a user has to surf online to celebrate his/her first "birthday" of Internet presence? Paper findings from a database of 105 school and university students containing their every click of first 24 hours of Internet usage are presented. The findings provide valuable insights for Internet Marketing, ethics, Internet business and the mapping of Internet life with real life. Privacy and ethical issues related to the study have been discussed at the end. © Springer Science+Business Media B.V. 2010.
Resumo:
Periodic-finite-type shifts (PFT's) are sofic shifts which forbid the appearance of finitely many pre-specified words in a periodic manner. The class of PFT's strictly includes the class of shifts of finite type (SFT's). The zeta function of a PET is a generating function for the number of periodic sequences in the shift. For a general sofic shift, there exists a formula, attributed to Manning and Bowen, which computes the zeta function of the shift from certain auxiliary graphs constructed from a presentation of the shift. In this paper, we derive an interesting alternative formula computable from certain ``word-based graphs'' constructed from the periodically-forbidden word description of the PET. The advantages of our formula over the Manning-Bowen formula are discussed.
Resumo:
Interpolation attack was presented by Jakobsen and Knudsen at FSE'97. Interpolation attack is effective against ciphers that have a certain algebraic structure like the PURE cipher which is a prototype cipher, but it is difficult to apply the attack to real-world ciphers. This difficulty is due to the difficulty of deriving a low degree polynomial relation between ciphertexts and plaintexts. In other words, it is difficult to evaluate the security against interpolation attack. This paper generalizes the interpolation attack. The generalization makes easier to evaluate the security against interpolation attack. We call the generalized interpolation attack linear sum attack. We present an algorithm that evaluates the security of byte-oriented ciphers against linear sum attack. Moreover, we show the relationship between linear sum attack and higher order differential attack. In addition, we show the security of CRYPTON, E2, and RIJNDAEL against linear sum attack using the algorithm.
Resumo:
We focus on the relationship between the linearization method and linear complexity and show that the linearization method is another effective technique for calculating linear complexity. We analyze its effectiveness by comparing with the logic circuit method. We compare the relevant conditions and necessary computational cost with those of the Berlekamp-Massey algorithm and the Games-Chan algorithm. The significant property of a linearization method is that it needs no output sequence from a pseudo-random number generator (PRNG) because it calculates linear complexity using the algebraic expression of its algorithm. When a PRNG has n [bit] stages (registers or internal states), the necessary computational cost is smaller than O(2n). On the other hand, the Berlekamp-Massey algorithm needs O(N2) where N ( 2n) denotes period. Since existing methods calculate using the output sequence, an initial value of PRNG influences a resultant value of linear complexity. Therefore, a linear complexity is generally given as an estimate value. On the other hand, a linearization method calculates from an algorithm of PRNG, it can determine the lower bound of linear complexity.
Resumo:
This is a study on a certain group theoretic property of the set of encryption functions of a block cipher. We have shown how to construct a subset which has this property in a given symmetric group by a computer algebra software GAP4.2 (Groups, Algorithms, and Programming, Version 4.2). These observations on group structures of block ciphers suggest us that we may be able to set a trapdoor based on meet-in-the-middle attack on block ciphers.
Resumo:
To simplify the abstraction of descriptors, for the correlation analysis of the stability constants of gadolinium(III) complexes and their ligand structures, aiming at gadolinium(III) complexes, we only considered the ligands and ignored the common parts of the structures, i.e., the metal ions. Quantum-chemical descriptors and topological indices were calculated to describe the structures of the ligands. Multiple regression analysis and neural networks were applied to construct the models between the ligands and the stability constants of gadolinium(III) complexes and satisfactory results were obtained.
Resumo:
In this research. we found CoMFA alone could not obtain sufficiently a strong equation to allow confident prediction for aminobenzenes. When some other parameter. such as heat of molecular formation of the compounds, was introduced into the CoMFA model, the results Were improved greatly. It gives us a hint that a better description for molecular structures will yield a better prediction model, and this hint challenged us to look for another method-the projection areas of molecules in 3D space for 3D-QSAR. It is surprising that much better results than that obtained by using CoMFA Were achieved. Besides the CoMFA analysis. multiregression analysis and neural network methods for building the models were used in this paper.
Resumo:
A new topological index is devised from an all-paths method. This molecular topological index has highly discriminating power for various kinds of organic compounds such as alkane trees, complex cyclic or polycyclic graphs, and structures containing heteroatoms and thus can be used as a Molecular IDentification number (MID) for chemical documentation. Some published MIDs derived from an all-paths method and their structural selectivity for alkane trees are also reviewed.
Resumo:
A highly discriminating molecular topological index, EAID, is proposed based on the extended adjacency matrix. A systematic search for degeneracy was performed for 3 807 434 alkane trees, 202 558 complex cyclic or polycyclic graphs, and 430 472 structures containing heteroatoms. No counterexamples (two or more nonisomorphic structures with the same EAID number) were found. This is a hitherto unheard of power of discrimination. Thus EAID might be possibly used as supplementary reference for CAS Registry Numbers for structure documentation.
Resumo:
The applications of new topological indices A(x1)-A(x3) suggested in our laboratory for the prediction of Gibbs energy values of phase transfer (water to nitrobenzene) of amine ions are described with satisfactory results. Multiple regression analysis and neural network were employed simultaneously in this study.
Resumo:
The topological state and the total topological index, tau, have been tested systematically. Counterexamples are provided proving that the topological state method cannot determine classes of symmetrically equivalent atoms in a molecule fully correct. The
Resumo:
In this paper, new topological indices, EA Sigma and EAmax, are introduced. They are based on the extended adjacency matrices of molecules, in which the influences of factors of heteroatoms and multiple bonds were considered. The results show that EA Sigm
Resumo:
A new algorithm for deriving canonical numbering of atoms in a molecular graph has been developed. Some graph invariants, such as node properties, degree (connectivity), topological path, the smallest node ring index, etc., are encoded together to partit