Does activity in computer game play have an impact on creative behavior?

This paper describes a behaviour analysis designed to measure the creative potential of computer game activities. The research approach applies a behavioural and verbal protocol to analyze the factors that influence the creative processes used by people as they play computer games from the puzzle genre. Creative components are measured by examining task motivation as well as domain-relevant and creativity-relevant skills factors. This paper focuses on how three puzzle games embody activity that might facilitate creative processes. The findings show that game playing activities significantly impact upon creative potential of computer games.

Shrinking the keys of discrete-log-type lossy trapdoor functions

To this day, realizations in the standard-model of (lossy) trapdoor functions from discrete-log-type assumptions require large public key sizes, e.g., about Θ(λ 2) group elements for a reduction from the decisional Diffie-Hellman assumption (where λ is a security parameter). We propose two realizations of lossy trapdoor functions that achieve public key size of only Θ(λ) group elements in bilinear groups, with a reduction from the decisional Bilinear Diffie-Hellman assumption. Our first construction achieves this result at the expense of a long common reference string of Θ(λ 2) elements, albeit reusable in multiple LTDF instantiations. Our second scheme also achieves public keys of size Θ(λ), entirely in the standard model and in particular without any reference string, at the cost of a slightly more involved construction. The main technical novelty, developed for the second scheme, is a compact encoding technique for generating compressed representations of certain sequences of group elements for the public parameters.

Human errors in computer related abuses

The term “Human error” can simply be defined as an error which made by a human. In fact, Human error is an explanation of malfunctions, unintended consequents from operating a system. There are many factors that cause a person to have an error due to the unwanted error of human. The aim of this paper is to investigate the relationship of human error as one of the factors to computer related abuses. The paper beings by computer-relating to human errors and followed by mechanism mitigate these errors through social and technical perspectives. We present the 25 techniques of computer crime prevention, as a heuristic device that assists. A last section discussing the ways of improving the adoption of security, and conclusion.

Applying POVM to model non-orthogonality in quantum cognition

Much of the work currently occurring in the field of Quantum Interaction (QI) relies upon Projective Measurement. This is perhaps not optimal, cognitive states are not nearly as well behaved as standard quantum mechanical systems; they exhibit violations of repeatability, and the operators that we use to describe measurements do not appear to be naturally orthogonal in cognitive systems. Here we attempt to map the formalism of Positive Operator Valued Measure (POVM) theory into the domain of semantic memory, showing how it might be used to construct Bell-type inequalities.

Identification of a discrete intermediate in the assembly disassembly of physalis mottle tymovirus through mutational analysis

Assembly intermediates of icosahedral viruses are usually transient and are difficult to identify. In the present investigation, site-specific and deletion mutants of the coat protein gene of physalis mottle tymovirus (PhMV) were used to delineate the role of specific amino acid residues in the assembly of the virus and to identify intermediates in this process. N-terminal 30, 34, 35 and 39 amino acid deletion and single C-terminal (N188) deletion mutant proteins of PhMV were expressed in Escherichia coli. Site-specific mutants H69A, C75A, W96A, D144N, D144N-T151A, K143E and N188A were also constructed and expressed. The mutant protein lacking 30 amino acid residues from the N terminus self-assembled to T = 3 particles in vivo while deletions of 34, 35 and 39 amino acid residues resulted in the mutant proteins that were insoluble. Interestingly, the coat protein (pR PhCP) expressed using pRSET B vector with an additional 41 amino acid residues at the N terminus also assembled into T = 3 particles that were more compact and had a smaller diameter. These results demonstrate that the amino-terminal segment is flexible and either the deletion or addition of amino acid residues at the N terminus does not affect T = 3 capsid assembly, in contrast, the deletion of even a single residue from the C terminus (PhN188 Delta 1) resulted in capsids that were unstable. These capsids disassembled to a discrete intermediate with a sedimentation coefficent of 19.4 S. However, the replacement of C-terminal asparagine 188 by alanine led to the formation of stable capsids. The C75A and D144N mutant proteins also assembled into capsids that were as stable as the pR PhCP, suggesting that C75A and D144 are not crucial for the T = 3 capsid assembly. pR PhW96A and pR PhD144N-T151A mutant proteins failed to form capsids and were present as heterogeneous aggregates. Interestingly, the pR PhK143E mutant protein behaved in a manner similar to the C-terminal deletion protein in forming unstable capsids. The intermediate with an s value of 19.4 S was the major assembly product of pR PhH69A mutant protein and could correspond to a 30mer. It is possible that the assembly or disassembly is arrested at a similar stage in pR PhN188 Delta 1, pR PhH69A and pR PhK143E mutant proteins.

Bounds on isoperimetric values of trees

Let G = (V, E) be a finite, simple and undirected graph. For S subset of V, let delta(S, G) = {(u, v) is an element of E : u is an element of S and v is an element of V - S} be the edge boundary of S. Given an integer i, 1 <= i <= vertical bar V vertical bar, let the edge isoperimetric value of G at i be defined as b(e)(i, G) = min(S subset of V:vertical bar S vertical bar=i)vertical bar delta(S, G)vertical bar. The edge isoperimetric peak of G is defined as b(e)(G) = max(1 <= j <=vertical bar V vertical bar)b(e)(j, G). Let b(v)(G) denote the vertex isoperimetric peak defined in a corresponding way. The problem of determining a lower bound for the vertex isoperimetric peak in complete t-ary trees was recently considered in [Y. Otachi, K. Yamazaki, A lower bound for the vertex boundary-width of complete k-ary trees, Discrete Mathematics, in press (doi: 10.1016/j.disc.2007.05.014)]. In this paper we provide bounds which improve those in the above cited paper. Our results can be generalized to arbitrary (rooted) trees. The depth d of a tree is the number of nodes on the longest path starting from the root and ending at a leaf. In this paper we show that for a complete binary tree of depth d (denoted as T-d(2)), c(1)d <= b(e) (T-d(2)) <= d and c(2)d <= b(v)(T-d(2)) <= d where c(1), c(2) are constants. For a complete t-ary tree of depth d (denoted as T-d(t)) and d >= c log t where c is a constant, we show that c(1)root td <= b(e)(T-d(t)) <= td and c(2)d/root t <= b(v) (T-d(t)) <= d where c(1), c(2) are constants. At the heart of our proof we have the following theorem which works for an arbitrary rooted tree and not just for a complete t-ary tree. Let T = (V, E, r) be a finite, connected and rooted tree - the root being the vertex r. Define a weight function w : V -> N where the weight w(u) of a vertex u is the number of its successors (including itself) and let the weight index eta(T) be defined as the number of distinct weights in the tree, i.e eta(T) vertical bar{w(u) : u is an element of V}vertical bar. For a positive integer k, let l(k) = vertical bar{i is an element of N : 1 <= i <= vertical bar V vertical bar, b(e)(i, G) <= k}vertical bar. We show that l(k) <= 2(2 eta+k k)

Applying pure mathematics: mathematics in the natural sciences

The book of nature is written in the language of mathematics. This quotation, attributed to Galileo, seemed to hold to an unreasonable1 extent in the era of quantum mechanics.

ISO 13567 - The Proposed International Standard for Structuring Layers in Computer Aided Building Design

Layering is a widely used method for structuring data in CAD-models. During the last few years national standardisation organisations, professional associations, user groups for particular CAD-systems, individual companies etc. have issued numerous standards and guidelines for the naming and structuring of layers in building design. In order to increase the integration of CAD data in the industry as a whole ISO recently decided to define an international standard for layer usage. The resulting standard proposal, ISO 13567, is a rather complex framework standard which strives to be more of a union than the least common denominator of the capabilities of existing guidelines. A number of principles have been followed in the design of the proposal. The first one is the separation of the conceptual organisation of information (semantics) from the way this information is coded (syntax). The second one is orthogonality - the fact that many ways of classifying information are independent of each other and can be applied in combinations. The third overriding principle is the reuse of existing national or international standards whenever appropriate. The fourth principle allows users to apply well-defined subsets of the overall superset of possible layernames. This article describes the semantic organisation of the standard proposal as well as its default syntax. Important information categories deal with the party responsible for the information, the type of building element shown, whether a layer contains the direct graphical description of a building part or additional information needed in an output drawing etc. Non-mandatory information categories facilitate the structuring of information in rebuilding projects, use of layers for spatial grouping in large multi-storey projects, and storing multiple representations intended for different drawing scales in the same model. Pilot testing of ISO 13567 is currently being carried out in a number of countries which have been involved in the definition of the standard. In the article two implementations, which have been carried out independently in Sweden and Finland, are described. The article concludes with a discussion of the benefits and possible drawbacks of the standard. Incremental development within the industry, (where ”best practice” can become ”common practice” via a standard such as ISO 13567), is contrasted with the more idealistic scenario of building product models. The relationship between CAD-layering, document management product modelling and building element classification is also discussed.

Dynamics of discrete bubble in nucleate pool boiling on thin wires in microgravity

A space experiment on bubble behavior and heat transfer in subcooled pool boiling phenomenon has been performed utilizing the temperature-controlled pool boiling (TCPB) device both in normal gravity in the laboratory and in microgravity aboard the 22(nd) Chinese recoverable satellite. The fluid is degassed R113 at 0.1 MPa and subcooled by 26 degrees C nominally. A thin platinum wire of 60 mu m in diameter and 30 mm in length is simultaneously used as heater and thermometer. Only the dynamics of the vapor bubbles, particularly the lateral motion and the departure of discrete vapor bubbles in nucleate pool boiling are reported and analyzed in the present paper. It's found that these distinct behaviors can be explained by the Marangoni convection in the liquid surrounding vapor bubbles. The origin of the Marangoni effect is also discussed.

Natural versus artificial scene classification by ordering discrete fourier power spectra

Holistic representations of natural scenes is an effective and powerful source of information for semantic classification and analysis of arbitrary images. Recently, the frequency domain has been successfully exploited to holistically encode the content of natural scenes in order to obtain a robust representation for scene classification. In this paper, we present a new approach to naturalness classification of scenes using frequency domain. The proposed method is based on the ordering of the Discrete Fourier Power Spectra. Features extracted from this ordering are shown sufficient to build a robust holistic representation for Natural vs. Artificial scene classification. Experiments show that the proposed frequency domain method matches the accuracy of other state-of-the-art solutions. © 2008 Springer Berlin Heidelberg.

BU Computer Science 1998 Proxy Trace: Release Notes

In a recent paper (Changes in Web Client Access Patterns: Characteristics and Caching Implications by Barford, Bestavros, Bradley, and Crovella) we performed a variety of analyses upon user traces collected in the Boston University Computer Science department in 1995 and 1998. A sanitized version of the 1995 trace has been publicly available for some time; the 1998 trace has now been sanitized, and is available from: http://www.cs.bu.edu/techreports/1999-011-usertrace-98.gz ftp://ftp.cs.bu.edu/techreports/1999-011-usertrace-98.gz This memo discusses the format of this public version of the log, and includes additional discussion of how the data was collected, how the log was sanitized, what this log is and is not useful for, and areas of potential future research interest.

Community-based Data Validation Practices in Citizen Science

Technology-supported citizen science has created huge volumes of data with increasing potential to facilitate scientific progress, however, verifying data quality is still a substantial hurdle due to the limitations of existing data quality mechanisms. In this study, we adopted a mixed methods approach to investigate community-based data validation practices and the characteristics of records of wildlife species observations that affected the outcomes of collaborative data quality management in an online community where people record what they see in the nature. The findings describe the processes that both relied upon and added to information provenance through information stewardship behaviors, which led to improved reliability and informativity. The likelihood of community-based validation interactions were predicted by several factors, including the types of organisms observed and whether the data were submitted from a mobile device. We conclude with implications for technology design, citizen science practices, and research.