The impact of computer self-efficacy,situational interest and academic self-concept in virtual communities of inquiry during the distance learning procedures through Second Life

The current study investigates a case where the online learning procedure in three-dimensional (3D) technologically-advanced environments of the Web 2.0 is growing at an exponential rate. In this occasion it is highly imperative need to understand students’ interactions in this innovative mode of e-Education that requires from educators and scholars not only analysis conceptually, but also an empirically-driven optimization. The community of inquiry (CoI) model (or framework) consists to be as one of the most prominent multi-dimensional constructs that it is widely used to represent several distinct dimensions of social presence, teaching presence and cognitive presence, as a unique and fundamental theoretical concept to measure students’ interactions in contemporary electronic environments. Although, the effectiveness of these multi-dimensional constructs creates a dilemma to researchers who want the breadth and comprehensiveness of this model for the precision and clarity of users’ (instructors and students) dimensions with other motivational and learning variables. To address this dilemma, the current empirical study presents statistical analyses from the “trinity” constructs of the CoI model by utilizing correlation and hierarchical regression analyses with two fundamental motivational (computer self-efficacy and situational interest) and another one learning (academic self-concept) variables. This study goes one step further and introduces the conspicuously indisputable intervention of a virtual (V)CoI and its utilization in multi-user virtual worlds, like Second Life (SL). The study findings of one hundred thirty-five (135) participants who enrolled in several online sessions unveiled that the situational interest was the only significant predictor of social presence. The computer self-efficacy was not a significant predictor of the CoI model, while on the other hand academic self-concept was a significant predictor in a revamped attempt to validate the strong relationship among constructs within it. According to the aforementioned reasons, it can be surmised that the successful combination of the VCoI in Second Life, surpassing irrefutable and inherent shortcomings to a future-driven sustainable use and growth.     

Optimization of injection molding design. Part I: Gate location optimization

The placement of a gate in an injection mold is one of the most important variables of the total mold design. The quality of the molded part is greatly affected by the gate location, because it influences the manner in which the plastic flows into the mold cavity. Some defects, such as weldline and overpack, can be effectively controlled only by the gate location. Therefore, the product quality can be greatly improved by determining the optimum gate location. In this paper, we develop a general methodology for gate location optimization. We first quantify quality in terms of flow simulation outputs. We can thus assess detrimental effects such as warpage and dimensional instability as a function of the independent variable, which is in this case the gate location. Next we develop methods to search for the optimum gate location. The search method introduced in this paper is a method that combines a deterministic hill climbing search with a stochastic annealing search method. The method is appropriately called simulated annealing and hill climbing (SANHIL). The criteria used for evaluation during the search process are a function of the flow simulation outputs. We demonstrate the success of the method for a complex industrial mold. The approach is applicable to any complex mold geometry and any plastic.     

Modeling drop breakage using the full energy spectrum and a specific realization of turbulence anisotropy

The assumption of homogeneous isotropic turbulence when modeling drop breakage in industrially relevant geometries is questionable. We describe the development of an anisotropic breakage model, where the anisotropy is introduced via the inclusion of a perturbed turbulence spectrum. The selection of the perturbed spectrum is itself motivated by our previous large-eddy simulations of high-pressure homogenizers. The model redistributes energy from small to large scales, and assumes that the anisotropic part of the Reynolds stresses is confined to the energy-containing range. The second-order structure function arising from the perturbed spectrum is used in the standard framework of Coulaloglou and Tavlarides to calculate breakage frequency. While the base model exhibits non-monotonic behavior (by predicting a maximum value for a certain drop size), the effect of anisotropy is shown to increase breakage frequency in length scales larger than this peak, thereby reducing non-monotonicity. This effect is more pronounced for small turbulence Reynolds numbers.     

Enforcing Efficient Equilibria in Network Design Games via Subsidies

The efficient design of networks has been an important engineering task that involves challenging combinatorial optimization problems. Typically, a network designer has to select among several alternatives which links to establish so that the resulting network satisfies a given set of connectivity requirements and the cost of establishing the network links is as low as possible. The Minimum Spanning Tree problem, which is well-understood, is a nice example.In this paper, we consider the natural scenario in which the connectivity requirements are posed by selfish users who have agreed to share the cost of the network to be established according to a well-defined rule. The design proposed by the network designer should now be consistent not only with the connectivity requirements but also with the selfishness of the users. Essentially, the users are players in a so-called network design game and the network designer has to propose a design that is an equilibrium for this game. As it is usually the case when selfishness comes into play, such equilibria may be suboptimal. In this paper, we consider the following question: can the network designer enforce particular designs as equilibria or guarantee that efficient designs are consistent with users’ selfishness by appropriately subsidizing some of the network links? In an attempt to understand this question, we formulate corresponding optimization problems and present positive and negative results.     

Texture and shape information fusion for facial expression and facial action unit recognition

A novel method based on fusion of texture and shape information is proposed for facial expression and Facial Action Unit (FAU) recognition from video sequences. Regarding facial expression recognition, a subspace method based on Discriminant Non-negative Matrix Factorization (DNMF) is applied to the images, thus extracting the texture information. In order to extract the shape information, the system firstly extracts the deformed Candide facial grid that corresponds to the facial expression depicted in the video sequence. A Support Vector Machine (SVM) system designed on an Euclidean space, defined over a novel metric between grids, is used for the classification of the shape information. Regarding FAU recognition, the texture extraction method (DNMF) is applied on the differences images of the video sequence, calculated taking under consideration the neutral and the expressive frame. An SVM system is used for FAU classification from the shape information. This time, the shape information consists of the grid node coordinate displacements between the neutral and the expressed facial expression frame. The fusion of texture and shape information is performed using various approaches, among which are SVMs and Median Radial Basis Functions (MRBFs), in order to detect the facial expression and the set of present FAUs. The accuracy achieved using the Cohn–Kanade database is 92.3% when recognizing the seven basic facial expressions (anger, disgust, fear, happiness, sadness, surprise and neutral), and 92.1% when recognizing the 17 FAUs that are responsible for facial expression development.     

A study of suspended roofs for near-source seismic motions

The non-linear behavior of multi-suspended roof systems for seismic loads is studied. The study is based on a formulation that can be easily employed for a preliminary design of multi-suspended roofs subjected to seismic loads. Specifically, applying Lagrange’s equations, the corresponding set of equations of motion for discrete models of multiple suspension roofs is obtained and numerical integration of the equations of motion is performed via the Runge–Kutta scheme. For representative realistic combinations of geometric, stiffness and damping parameters, a non-linear analysis is employed to study the behavior of suspended roofs for near-source and far-field seismic motions. The analysis demonstrates that: (i) code-specified design loads could dramatically underestimate the response of suspended roofs subjected to near-source ground motions and (ii) flexible roofing systems are greatly affected by near-source ground motions, a behavior that is not observed for stiff systems.     

Attacking smart card systems: Theory and practice

Smart card technology has evolved over the last few years following notable improvements in the underlying hardware and software platforms. Advanced smart card microprocessors, along with robust smart card operating systems and platforms, contribute towards a broader acceptance of the technology. These improvements have eliminated some of the traditional smart card security concerns. However, researchers and hackers are constantly looking for new issues and vulnerabilities. In this article we provide a brief overview of the main smart card attack categories and their corresponding countermeasures. We also provide examples of well-documented attacks on systems that use smart card technology (e.g. satellite TV, EMV, proximity identification) in an attempt to highlight the importance of the security of the overall system rather than just the smart card.     

An experimental investigation of personality types impact on pair effectiveness in pair programming

In this paper, pair programming is empirically investigated from the perspective of developer personalities and temperaments and how they affect pair effectiveness. A controlled experiment was conducted to investigate the impact of developer personalities and temperaments on communication, pair performance and pair viability-collaboration. The experiment involved 70 undergraduate students and the objective was to compare pairs of heterogeneous developer personalities and temperaments with pairs of homogeneous personalities and temperaments, in terms of pair effectiveness. Pair effectiveness is expressed in terms of pair performance, measured by communication, velocity, design correctness and passed acceptance tests, and pair collaboration-viability measured by developers’ satisfaction, knowledge acquisition and participation. The results have shown that there is important difference between the two groups, indicating better communication, pair performance and pair collaboration-viability for the pairs with heterogeneous personalities and temperaments. In order to provide an objective assessment of the differences between the two groups of pairs, a number of statistical tests and stepwise Discriminant Analysis were used.

Adaptive neighborhood selection in peer-to-peer networks based on content similarity and reputation

To address the two most critical issues in P2P file-sharing systems: efficient information discovery and authentic data acquisition, we propose a Gnutella-like file-sharing protocol termed Adaptive Gnutella Protocol (AGP) that not only improves the querying efficiency in a P2P network but also enhances the quality of search results at the same time. The reputation scheme in the proposed AGP evaluates the credibility of peers based on their contributions to P2P services and subsequently clusters nodes together according to their reputation and shared content, essentially transforming the P2P overlay network into a topology with collaborative and reputed nodes as its core. By detecting malicious peers as well as free-riders and eventually pushing them to the edge of the overlay network, our AGP propagates search queries mainly within the core of the topology, accelerating the information discovery process. Furthermore, the clustering of nodes based on authentic and similar content in our AGP also improves the quality of search results. We have implemented the AGP with the PeerSim simulation engine and conducted thorough experiments on diverse network topologies and various mixtures of honest/dishonest nodes to demonstrate improvements in topology transformation, query efficiency, and search quality by our AGP.