What can possibly go wrong? Anticipatory work in space operations

This paper explores how different forms of anticipatory work contribute to reliability in high-risk space operations. It is based on ethnographic field work, participant observation and interviews supplemented with video recordings from a control room responsible for operating a microgravity greenhouse at the International Space Station (ISS). Drawing on examples from different stages of a biological experiment on the ISS, we demonstrate how engineers, researchers and technicians work to anticipate and proactively mitigate possible problems. Space research is expensive and risky. The experiments are planned over the course of many years by a globally distributed network of organizations. Owing to the inaccessibility of the ISS, every trivial detail that could possibly cause a problem is subject to scrutiny. We discuss what we label anticipatory work: practices constituted of an entanglement of cognitive, social and technical elements involved in anticipating and proactively mitigating everything that might go wrong. We show how the nature of anticipatory work changes between planning and the operational phases of an experiment. In the planning phase, operators inscribe their anticipation into technology and procedures. In the operational phase, we show how troubleshooting involves the ability to look ahead in the evolving temporal trajectory of the ISS operations and to juggle pre-planned fixes along these trajectories. A key objective of this paper is to illustrate how anticipation is shared between humans and different forms of technology. Moreover, it illustrates the importance of including considerations of temporality in safety and reliability research.     

Exploring and exploiting a historical corpus for Arabic

This paper presents a historical Arabic corpus named HAC. At this early embryonic stage of the project, we report about the design, the architecture and some of the experiments which we have conducted on HAC. The corpus, and accordingly the search results, will be represented using a primary XML exchange format. This will serve as an intermediate exchange tool within the project and will allow the user to process the results offline using some external tools. HAC is made up of Classical Arabic texts that cover 1600 years of language use; the Quranic text, Modern Standard Arabic texts, as well as a variety of monolingual Arabic dictionaries. The development of this historical corpus assists linguists and Arabic language learners to effectively explore, understand, and discover interesting knowledge hidden in millions of instances of language use. We used techniques from the field of natural language processing to process the data and a graph-based representation for the corpus. We provided researchers with an export facility to render further linguistic analysis possible.     

Cross level semantic similarity: an evaluation framework for universal measures of similarity

Semantic similarity has typically been measured across items of approximately similar sizes. As a result, similarity measures have largely ignored the fact that different types of linguistic item can potentially have similar or even identical meanings, and therefore are designed to compare only one type of linguistic item. Furthermore, nearly all current similarity benchmarks within NLP contain pairs of approximately the same size, such as word or sentence pairs, preventing the evaluation of methods that are capable of comparing different sized items. To address this, we introduce a new semantic evaluation called cross-level semantic similarity (CLSS), which measures the degree to which the meaning of a larger linguistic item, such as a paragraph, is captured by a smaller item, such as a sentence. Our pilot CLSS task was presented as part of SemEval-2014, which attracted 19 teams who submitted 38 systems. CLSS data contains a rich mixture of pairs, spanning from paragraphs to word senses to fully evaluate similarity measures that are capable of comparing items of any type. Furthermore, data sources were drawn from diverse corpora beyond just newswire, including domain-specific texts and social media. We describe the annotation process and its challenges, including a comparison with crowdsourcing, and identify the factors that make the dataset a rigorous assessment of a method’s quality. Furthermore, we examine in detail the systems participating in the SemEval task to identify the common factors associated with high performance and which aspects proved difficult to all systems. Our findings demonstrate that CLSS poses a significant challenge for similarity methods and provides clear directions for future work on universal similarity methods that can compare any pair of items.     

A noninvasive method to predict fluid viscosity and nanoparticle size using total internal reflection fluorescence microscopy (TIRFM) imaging

This study examines the development of an automated particle tracking algorithm to predict the hindered Brownian movement of fluorescent nanoparticles within an evanescent wave field created using total internal reflection fluorescent microscopy. The two-dimensional motion of the fluorescent nanoparticles was tracked, with sub-pixel resolution, by fitting the intensity distribution of the particles to a known Gaussian distribution, thus providing the particle center within a single pixel. Spherical yellow-green polystyrene nanoparticles (200, 500, and 1000 nm in diameter) were suspended in deionized water (control), 10 wt% d-glucose, and 10 wt% glycerol solutions, with 1 mM of NaCl added to each. The motion of tracked nanoparticles was compared with the theoretical tangential hindered Brownian motion to estimate particle diameters and fluid viscosity using a nonlinear regression technique. The automatic tracking algorithm was initially validated by comparing the automated results with manually tracked particles, 1 µm in size. Our results showed that both particle size and solution viscosity were accurately predicted from the experimental mean square displacement. Specifically, the results show that the error of particle size prediction is below 10 % and the error of solution viscosity prediction is less than 1 %. The proposed automatic analysis tool could prove to be useful in bio-application fields for examination of single protein tracking, drug delivery, and cytotoxicity. Furthermore, the proposed tool could be useful in microfluidic areas such as particle tracking velocimetry and noninvasive viscosimetry.     

A pluggable service platform architecture for e-commerce

In the beginning of the e-commerce era, retailers mostly adopted vertically integrated solutions to control the entire e-commerce value chain. However, they began to realize that to achieve agility, a better approach would be to focus on certain core capabilities and then create a partner ecosystem around them. From a technical point of view, this means it is advised to have a lightweight platform architecture with small core e-commerce functionality which can be extended by additional services from third party providers. In a typical e-commerce ecosystem with diverse information systems of network partners, integration and interoperability become critical factors to enable seamless coordination among the partners. Furthermore an increasing adoption of cloud computing technology could be observed resulting in more challenging integration scenarios involving cloud services. Thus, an e-commerce platform is required that suites the advanced needs for flexible and agile service integration. Therefore, this paper aims to present a reference architecture of a novel pluggable service platform for e-commerce. We investigate on currently available online shop platform solutions and integration platforms in the market. Based on the findings and motivated by literature on service-oriented design, we develop an architecture of a service-based pluggable platform for online retailers. This design is then instantiated by means of a prototype for an e-commerce returns handling scenario to demonstrate the feasibility of our architecture design.     

Distributed formation control with relaxed motion requirements

Heterogeneous formation shape control with interagent bearing and distance constraints involves the design of a distributed control law that ensures the formation moves such that these interagent constraints are achieved and maintained. This paper looks at the design of a distributed control scheme to solve different formation shape control problems in an ambient two‐dimensional space with bearing, distance and mixed bearing and distance constraints. The proposed control law allows the agents in the formation to move in any direction on a half‐plane and guarantees that despite this freedom, the proposed shape control algorithm ensures convergence to a formation shape meeting the prescribed constraints. This work provides an interesting and novel contrast to much of the existing work in formation control where distance‐only constraints are typically maintained and where each agent's motion is typically restricted to follow a very particular path. A stability analysis is sketched, and a number of illustrative examples are also given. Copyright © 2014 John Wiley & Sons, Ltd.     

Safe Autonomous Agent Formation Operations Via Obstacle Collision Avoidance

In this paper, we consider the problem of flocking and shape‐orientation control of multi‐agent systems with inter‐agent and obstacle collision avoidance. We first consider the problem of forcing a set of autonomous agents to form a desired formation shape and orientation while avoiding inter‐agent collision and collision with convex obstacles, and following a trajectory known to only one of the agents, namely the leader of the formation. Then we build upon the solution given to this problem and solve the problem of guaranteeing obstacle collision avoidance by changing the size and the orientation of the formation. Changing the size and the orientation of the formation is helpful when the agents want to go through a narrow passage while the existing size or orientation of the formation does not allow this. We also propose collision avoidance algorithms that temporarily change the shape of the formation to avoid collision with stationary or moving nonconvex obstacles. Simulation results are presented to show the performance of the proposed control laws.     

Short‐Time Linear Quadratic Form Technique for Estimating Fast‐Varying Parameters in Feedback Loops

The precision of a closed‐loop controller system designed for an uncertain plant depends strongly upon the maximum extent to which it is possible to track the trend of time‐varying parameters of the plant. The aim of this study is to describe a new parameter estimation algorithm that is able to follow fast‐varying parameters in closed‐loop systems. The short‐time linear quadratic form (STLQF) estimation algorithm introduced in this paper is a technique for tracking time‐varying parameters based on short‐time analysis of the regressing variables in order to minimize locally a linear quadratic form cost function. The established cost function produces a linear combination of errors with several delays. To meet this objective, mathematical development of the STLQF estimation algorithm is described. To implement the STLQF algorithm, the algorithm is applied to a planar mobile robot with fast‐varying parameters of inertia and viscous and coulomb frictions. Next, performance of the proposed algorithm is assessed against noise effects and variation in the type of parameters.