Virtual learning environments as sociomaterial agents in the network of teaching practice

This article presents findings related to the sociomaterial agency of educators and their practice in Norwegian education. Using actor-network theory, we ask how Virtual Learning Environments (VLEs) negotiate the agency of educators and how they shape their teaching practice. Since the same kinds of VLE tools have been widely implemented throughout Norwegian education, it is interesting to study how practices are formed in different parts of the educational system. This research is therefore designed as a case study of two different teaching contexts representing lecturers from a higher education institution and teachers from primary schools. Data are collected by means of interviews, online logging of VLE activities and self-reported personal logs. From the analysis of the data, three main networks of aligned interests can be identified. In each of those, the sociomaterial agency of the teaching practice with VLE is crucial in shaping and consolidating the network.     

Design and simulation of a novel metallic microgripper using vibration to release nano objects actively

In this study, we investigate a novel metallic microgripper which is able to grasp and transport nano particles (nano tubes/wires) and release them on desirable substrate by vibrating the gripper arms. This microgripper consists of a chevron actuator to grip nano object electrothermally and interdigited comb drive systems to generate vibration at the gripper arms electrostatically. Metallic (nickel) properties enable the chevron actuator to close the gap and pick the nano particle at low voltage and temperature. In order to reduce the out of plane bending during operation and also increase the gripping force, thickness of the nickel layer must be increased, hence electroplating process is proposed for deposition of nickel layer. To generate vibration at the end effectors, comb drive systems are stimulated by applying two voltage signals at desired resonant frequency to the stators. Practically, by sweeping the frequency of these signals around the resonant frequency the end effectors start vibrating. The vibration results in overcoming the adhesion forces due to inertial effects.     

An analytical hierarchy process-based approach to solve the multi-objective multiple traveling salesman problem

We consider the problem of assigning a team of autonomous robots to target locations in the context of a disaster management scenario while optimizing several objectives. This problem can be cast as a multiple traveling salesman problem, where several robots must visit designated locations. This paper provides an analytical hierarchy process (AHP)-based approach to this problem, while minimizing three objectives: the total traveled distance, the maximum tour, and the deviation rate. The AHP-based approach involves three phases. In the first phase, we use the AHP process to define a specific weight for each objective. The second phase consists in allocating the available targets, wherein we define and use three approaches: market-based, robot and task mean allocation-based, and balanced-based. Finally, the third phase involves the improvement in the solutions generated in the second phase. To validate the efficiency of the AHP-based approach, we used MATLAB to conduct an extensive comparative simulation study with other algorithms reported in the literature. The performance comparison of the three approaches shows a gap between the market-based approach and the other two approaches of up to 30%. Further, the results show that the AHP-based approach provides a better balance between the objectives, as compared to other state-of-the-art approaches. In particular, we observed an improvement in the total traveled distance when using the AHP-based approach in comparison with the distance traveled when using a clustering-based approach.     

A note on finding all homogeneous set sandwiches

A module is a set of vertices H of a graph G=(V,E) such that each vertex of V?H is either adjacent to all vertices of H or to none of them. A homogeneous set is a nontrivial module. A graph G_s=(V,E_s) is a sandwich for a pair of graphs G_t=(V,E_t) and G=(V,E) if E_t⊆E_s⊆E. In a recent paper, Tang et al. [Inform. Process. Lett. 77 (2001) 17-22] described an O(Δn²) algorithm for testing the existence of a homogeneous set in sandwich graphs of G_t=(V,E_t) and G=(V,E) and then extended it to an enumerative algorithm computing all these possible homogeneous sets. In this paper, we invalidate this latter algorithm by proving there are possibly exponentially many such sets, even if we restrict our attention to strong modules. We then give a correct characterization of a homogeneous set of a sandwich graph.     

Semantic partitioning of peer-to-peer search space

Peer-to-peer (P2P) networks are beginning to form the infrastructure of future applications. Computers are organized in P2P overlay networks to facilitate search queries with reasonable cost. So, scalability is a major aim in design of P2P networks. In this paper, to obtain a high factor of scalability, we partition network search space using a consistent static shared upper ontology. We name our approach semantic partition tree (SPT). All resources and queries are annotated using the upper ontology and queries are semantically routed in the overlay network. Also, each node indexes addresses of other nodes that possess contents expressible by the concept it maintains. So, our approach can be conceived as an ontology-based distributed hash table (DHT). Also, we introduce a lookup service for the network which is very scalable and independent of the network size and just depends on depth of the ontology tree. Further, we introduce a broadcast algorithm on the network. We present worst case analysis of both lookup and broadcast algorithms and measure their performance using simulation. The results show that our scheme is highly scalable and can be used in real P2P applications.     

An ergonomic evaluation of infant life jackets: Donning time & donning accuracy

Canada is considering the development of a new standard for infant/child life jackets. Eight currently available (approved and non-approved) infant/child life jackets were procured for evaluation. Fifty-six participants were chosen as a sample of convenience from the general public for testing. The life jackets were divided into two groups of four, which were donned on a soft infant manikin procured from the Red Cross. In 224 attempts at donning, only 43 (19%) attempts resulted in the life jacket being donned correctly in less than 1 min. Only one life jacket came close to a good design and passed the life jacket standard for donning time and accuracy. Failure rates were observed across all the participants irrespective of age, gender, experience with children and experience with recreational marine equipment. Accuracy and speed of donning the life jacket were hampered as the number of donning sub-tasks increased. It was concluded that it is possible to design a life jacket that can be donned correctly in under 1 min. The life jacket must be of simple, intuitive design and fall naturally into the anatomical shape of the child. A minimum number of ties, zips and clips should be used in the design, and if such connectors are used they should be color coded or of different shapes and sizes to avoid confusion.     

Factors that determine residents’ acceptance of smart city technologies

ABSTRACT

While some cities attempt to determine their residents’ demand for smart-city technologies, others simply move forward with smart-related strategies and projects. This study is among the first to empirically determine which factors most affect residents’ and public servants’ intention to use smart-city services. A Smart Cities Stakeholders Adoption Model (SSA), based on Unified Theory of Acceptance and Use of Technology (UTAUT2), is developed and tested on a mid-size U.S. city as a case study. A questionnaire was administered in order to determine the influence of seven factors – effort expectancy, self-efficacy, perceived privacy, perceived security, trust in technology, price value and trust in government – on behaviour intention, specifically the decision to adopt smart-city technologies. Results show that each of these factors significantly influenced citizen intention to use smart-city services. They also reveal perceived security and perceived privacy to be strong determinants of trust in technology, and price value a determinant of trust in government. In turn, both types of trust are shown to increase user intention to both adopt and use smart-city services. These findings offer city officials an approach to gauging residential intention to use smart-city services, as well as identify those factors critical to developing a successful smart-city strategy.     

CDCSS: cluster-based distributed cooperative spectrum sensing model against primary user emulation (PUE) cyber attacks

In cognitive radio network, the secondary users (SUs) use the spectrum of primary users for communication which arises the security issues. The status of SUs as legitimate users is compulsory for the stability of the system. This paper addresses the issue of delay caused by a band-selection decision process that directly affects the security and performance. The model cluster-based distributed cooperative spectrum sensing is proposed. In this model, cluster heads (CHs) exchange control information with other CHs and ordinary nodes. This model significantly reduced the delay, sensing, convergence, routing, in band-selection process. This also reduces the energy consumption while sensing the spectrum which seriously leads to performance upgradation. The simulated results show the improved performance of cognitive radio networks in terms of delay, packet loss ratio and bandwidth usage as compared to cluster-based cooperative spectrum sensing model. The opportunity for primary user emulation attacker is minimized as the overall delay is reduced.     

Optimal path planning in cluttered environment using RRT*-AB

Rapidly exploring Random Tree Star (RRT*) has gained popularity due to its support for complex and high-dimensional problems. Its numerous applications in path planning have made it an active area of research. Although it ensures probabilistic completeness and asymptotic optimality, its slow convergence rate and large dense sampling space are proven problems. In this paper, an off-line planning algorithm based on RRT* named RRT*-adjustable bounds (RRT*-AB) is proposed to resolve these issues. The proposed approach rapidly targets the goal region with improved computational efficiency. Desired objectives are achieved through three novel strategies, i.e., connectivity region, goal-biased bounded sampling, and path optimization. Goal-biased bounded sampling is performed within boundary of connectivity region to find the initial path. Connectivity region is flexible enough to grow for complex environment. Once path is found, it is optimized gradually using node rejection and concentrated bounded sampling. Final path is further improved using global pruning to erode extra nodes. Robustness and efficiency of proposed algorithm is tested through experiments in different structured and unstructured environments cluttered with obstacles including narrow and complex maze cases. The proposed approach converges to shorter path with reduced time and memory requirements than conventional RRT* methods.