Comparative Experimental Studies on Spatial Memory and Learning in Rats and Robots

The study of behavioral and neurophysiological mechanisms involved in rat spatial cognition provides a basis for the development of computational models and robotic experimentation of goal-oriented learning tasks. These models and robotics architectures offer neurobiologists and neuroethologists alternative platforms to study, analyze and predict spatial cognition based behaviors. In this paper we present a comparative analysis of spatial cognition in rats and robots by contrasting similar goal-oriented tasks in a cyclical maze, where studies in rat spatial cognition are used to develop computational system-level models of hippocampus and striatum integrating kinesthetic and visual information to produce a cognitive map of the environment and drive robot experimentation. During training, Hebbian learning and reinforcement learning, in the form of Actor-Critic architecture, enable robots to learn the optimal route leading to a goal from a designated fixed location in the maze. During testing, robots exploit maximum expectations of reward stored within the previously acquired cognitive map to reach the goal from different starting positions. A detailed discussion of comparative experiments in rats and robots is presented contrasting learning latency while characterizing behavioral procedures during navigation such as errors associated with the selection of a non-optimal route, body rotations, normalized length of the traveled path, and hesitations. Additionally, we present results from evaluating neural activity in rats through detection of the immediate early gene Arc to verify the engagement of hippocampus and striatum in information processing while solving the cyclical maze task, such as robots use our corresponding models of those neural structures.     

Hydrogen detection using platinum coated graphene grown on SiC

The characteristics of hydrogen detection using epitaxial graphene covered with platinum are reported. The multi-layered graphene was grown by chemical vapor deposition (CVD) on a Si-polar 4H-SiC substrate. Surface morphology was characterized by scanning electron and atomic force microscopy. Current-voltage measurements and real-time monitoring of the current flow through the graphene/platinum device were used to confirm the response to hydrogen gas. The background temperature was varied from room temperature to 175 °C in order to measure the activation energy of hydrogen detection.     

Multiscale computation for bioartificial soft tissues with complex geometries

The mechanical function of soft collagenous tissues is inherently multiscale, with the tissue dimension being in the centimeter length scale and the underlying collagen network being in the micrometer length scale. This paper uses a volume averaging multiscale model to predict the collagen gel mechanics. The model is simulated using a multiscale component toolkit that is capable of dealing with any 3D geometries. Each scale in the multiscale model is treated as an independent component that exchanges the deformation and average stress information through a scale-linking operator. An arterial bifurcation was simulated using the multiscale model, and the results demonstrated that the mechanical response of the soft tissues is strongly sensitive to the network orientation and fiber-to-fiber interactions.     

Fast computation of equispaced Pareto manifolds and Pareto fronts for multiobjective optimization problems

In this paper, we consider the problem of generating a well sampled discrete representation of the Pareto manifold or the Pareto front corresponding to the equilibrium points of a multi-objective optimization problem. We show how the introduction of simple additional constraints into a continuation procedure produces equispaced points in either of those two sets. Moreover, we describe in detail a novel algorithm for global continuation that requires two orders of magnitude less function evaluations than evolutionary algorithms commonly used to solve this problem. The performance of the methods is demonstrated on problems from the current literature.     

Home-based communication system for older adults and their remote family

As in many Latin–American countries, in Mexico many older adults live alone as a result of the migration of one or more of their relatives, mostly to the USA. Thus, not only do they live alone, but they might seldom see these relatives for long periods, even though they often depend on them financially. With the goal of designing appropriate communication technology for seniors and their relatives experiencing this situation, we conducted interviews and evaluated scenarios and prototypes to reveal the practical ways they maintain emotional ties despite the distance. Based on those findings, we envisioned a communication system through which seniors and their relatives can maintain close social ties by sharing information, personal reminiscences and stories. We found that older adults perceived the system as a richer, natural form of communication with their relatives that could facilitate their integration into the networks that currently connect members of their families.     

Two complementary operations inspired by the DNA hairpin formation: Completion and reduction

We consider two complementary operations: Hairpin completion introduced in [D. Cheptea, C. Martin-Vide, V. Mitrana, A new operation on words suggested by DNA biochemistry: Hairpin completion, in: Proc. Transgressive Computing, 2006, pp. 216–228] with motivations coming from DNA biochemistry and hairpin reduction as the inverse operation of the hairpin completion. Both operations are viewed here as formal operations on words and languages. We settle the closure properties of the classes of regular and linear context-free languages under hairpin completion in comparison with hairpin reduction. While the class of linear context-free languages is exactly the weak-code image of the class of the hairpin completion of regular languages, rather surprisingly, the weak-code image of the class of the hairpin completion of linear context-free languages is a class of mildly context-sensitive languages. The closure properties with respect to the hairpin reduction of some time and space complexity classes are also studied. We show that the factors found in the general cases are not necessary for regular and context-free languages. This part of the paper completes the results given in the earlier paper, where a similar investigation was made for hairpin completion. Finally, we briefly discuss the iterated variants of these operations.     

Monochromatic and bichromatic ranked reverse boolean spatial keyword nearest neighbors search

Recently, Reverse k Nearest Neighbors (RkNN) queries, returning every answer for which the query is one of its k nearest neighbors, have been extensively studied on the database research community. But the RkNN query cannot retrieve spatio-textual objects which are described by their spatial location and a set of keywords. Therefore, researchers proposed a RSTkNN query to find these objects, taking both spatial and textual similarity into consideration. However, the RSTkNN query cannot control the size of answer set and to be sorted according to the degree of influence on the query. In this paper, we propose a new problem Ranked Reverse Boolean Spatial Keyword Nearest Neighbors query called Ranked-RBSKNN query, which considers both spatial similarity and textual relevance, and returns t answers with most degree of influence. We propose a separate index and a hybrid index to process such queries efficiently. Experimental results on different real-world and synthetic datasets show that our approaches achieve better performance.     

Physical ergonomic hazards in highway tunnel construction: overview from the Construction Occupational Health Program

This report provides an overview of physical ergonomic exposures in highway construction work across trades and major operations. For each operation, the observational method “PATH” (Posture, Activity, Tools and Handling) was used to estimate the percentage of time that workers spent in specific tasks and with exposure to awkward postures and load handling. The observations were carried out on 73 different days, typically for about 4 h per day, covering 120 construction workers in 5 different trades: laborers, carpenters, ironworkers, plasterers, and tilers. Non-neutral trunk postures (forward or sideways flexion or twisting) were frequently observed, representing over 40% of observations for all trades except laborers (28%). Kneeling and squatting were common in all operations, especially tiling and underground utility relocation work. Handling loads was frequent, especially for plasterers and tilers, with a range of load weights but most often under 15 pounds. The results of this study provide quantitative evidence that workers in highway tunnel construction operations are exposed to ergonomic factors known to present significant health hazards. Numerous opportunities exist for the development and implementation of ergonomic interventions to protect the health and safety of construction workers.     

Controlled linear perturbation

We present an algorithmic solution to the robustness problem in computational geometry, called controlled linear perturbation, and demonstrate it on Minkowski sums of polyhedra. The robustness problem is how to implement real RAM algorithms accurately and efficiently using computer arithmetic. Approximate computation in floating point arithmetic is efficient but can assign incorrect signs to geometric predicates, which can cause combinatorial errors in the algorithm output. We make approximate computation accurate by performing small input perturbations, which we compute using differential calculus. This strategy supports fast, accurate Minkowski sum computation. The only prior robust implementation uses a less efficient algorithm, requires exact algebraic computation, and is far slower based on our extensive testing.