Algorithm for the extraction of page-formatted binary digital data

We present an algorithm for fast and reliable extraction of page-formatted binary digital data. The advantages of the algorithm include a low raw bit-error rate, fast extraction speed, the use of a simple and density-efficient coding scheme, and large tolerance to a change of the signal-to-noise ratio. We used this algorithm to analyze shot-noise-limited binary data that had large interpage and intrapage intensity variations and obtained an improvement in the bit-error rate of 3-4 orders of magnitude compared with that in a single-threshold-detection scheme. Implications of our results for the development of high-speed, high-density holographic memories are discussed.     

An efficient microfluidic sorter: implementation of double meandering micro striplines for magnetic particles switching

The ability to trap, manipulate, and separate magnetic beads has become one of the key requirements in realizing an integrated magnetic lab-on-chip biosensing system. In this article, we present the design and fabrication of an integrated magneto-fluidic device for sorting magnetic particles with a sorting efficiency of up to 95%. The actuation and manipulation of magnetic beads are realized using microfabricated square meandering current-carrying micro striplines. The current is alternated between two neighboring micro striplines to switch the magnetic beads to either one of the two outlets. We performed a series of parametric study to investigate the effect of applied current, flow rate, and switching frequency on the sorting efficiency. Experimental results reveal that the sorting efficiency is proportional to the square of current applied to the stripline, and decreases with increasing buffer flow rate and switching frequency. Such phenomena agree well with our theoretical analysis and simulation result. The fastest switching rate, which is limited by the microchannel geometry and bead velocity, is 2 Hz.     

Solving the Matrix Differential Riccati Equation: A Lyapunov Equation Approach

In this technical note, we investigate a solution of the matrix differential Riccati equation that plays an important role in the linear quadratic optimal control problem. Unlike many methods in the literature, the approach that we propose employs the negative definite anti-stabilizing solution of the matrix algebraic Riccati equation and the solution of the matrix differential Lyapunov equation. An illustrative numerical example is provided to show the efficiency of our approach.      

A framework for linguistic logic programming

Lawry's label semantics for modeling and computing with linguistic information in natural language provides a clear interpretation of linguistic expressions and thus a transparent model for real‐world applications. Meanwhile, annotated logic programs (ALPs) and its fuzzy extension AFLPs have been developed as an extension of classical logic programs offering a powerful computational framework for handling uncertain and imprecise data within logic programs. This paper proposes annotated linguistic logic programs (ALLPs) that embed Lawry's label semantics into the ALP/AFLP syntax, providing a linguistic logic programming formalism for development of automated reasoning systems involving soft data as vague and imprecise concepts occurring frequently in natural language. The syntax of ALLPs is introduced, and their declarative semantics is studied. The ALLP SLD‐style proof procedure is then defined and proved to be sound and complete with respect to the declarative semantics of ALLPs. © 2010 Wiley Periodicals, Inc.     

Design and implementation of look-ahead linear jerk filter for a computerized numerical controlled machine

In this study, an open programmable logic controller (PLC) from Fuji electric prescribed in the Structured Text program was applied to develop a look-ahead linear jerk filter (LALJF) for a computerized numerically controlled (CNC) machine. To ensure the smooth and accurate motion of a tool with a linear change in jerk during real-time machining, the proposed filter was formed by combining a look-ahead algorithm with three modified moving average filters (3MMAF). The look-ahead algorithm performed a single look-ahead step-change in the speed of the speed curve. Based on a step-changing speed profile, given maximal acceleration/deceleration and maximum jerk, the speed curve was modified before it was passed through a linear jerk filter to reduce machining time. The speed commands filtered by the proposed filter stabilize machine table at the beginning and end of its motion, and at any point at which its speed exhibits a step-change. The theoretical and computational aspects of the LALJF are presented together with experimental results of its implementation on an X–Y table. The multiple-step-changing speed curve of a CNC machine and the speed curve of a high-speed measurement system were constructed in order to verify the feasibility and precision of the proposed method.     

Design of a sliding mode controller for an automatic guided vehicle and its implementation

In this paper, a control scheme that combines a kinematic controller and a sliding mode dynamic controller with external disturbances is proposed for an automatic guided vehicle to track a desired trajectory with a specified constant velocity. It provides a method of taking into account specific mobile robot dynamics to convert desired velocity control inputs into torques for the actual mobile robot. First, velocity control inputs are designed for the kinematic controller to make the tracking error vector asymptotically stable. Then, a sliding mode dynamic controller is designed such that the mobile robot’s velocities converge to the velocity control inputs. The control law is obtained based on the backstepping technique. System stability is proved using the Lyapunov stability theory. In addition, a scheme for measuring the errors using a USB camera is described. The simulation and experimental results are presented to illustrate the effectiveness of the proposed controller.     

Development of a sequential robust–tolerance design model for a destructive quality characteristic

Robust design (RD) and tolerance design (TD) have received much attention from researchers and practitioners for more than two decades, and a number of methodologies for modeling and optimizing the RD and TD processes have been studied. However, there is ample room for improvement. Because most existing research considers RD and TD as separate research fields, the primary objective of this paper is to develop a sequential robust–tolerance design method to jointly determine the best factor settings and the closed-form solutions for the optimal specification limits. We then apply the proposed method to a destructive quality characteristic. Finally, a case study and sensitivity analyses are performed for verification purposes, and further studies are discussed.     

Partnering effects on user-developer conflict and role ambiguity in information system projects

Context

Information system development (ISD) has been plagued with high failure rates. This is partially due to the activities being a combination of both a technical and social processes involving stakeholders with conflicting interests.

Objective

Existing software risk management theories and frameworks offer limited suggestions for actions that can be taken to reduce the chance of failure of ISD projects. Our objective is to examine the connections among some of the more important user related risks in order to shed light on how specific strategies enhance the chance of project success.

Method

We conducted a sample of information systems project managers to test a multivariate model to explain the impact of pursuing a partnership with users on the conflicts that arise between users and developers, role ambiguity, and subsequent impact on project performance.

Results

The proposed model was supported, suggesting that user-developer conflict and role ambiguity have a negative impact on performance estimation difficulty, which negatively affects project performance.

Conclusion

Pursuit of project partnering yields a number of significant relationships in the model indicating an organization can implement practices that reduce risks associated with role ambiguity and conflict in system development projects.     

Robust self-stabilizing weight-based clustering algorithm

Ad hoc networks consist of wireless hosts that communicate with each other in the absence of a fixed infrastructure. Such networks cannot rely on centralized and organized network management. The clustering problem consists of partitioning network nodes into non-overlapping groups called clusters. Clusters give a hierarchical organization to the network that facilitates network management and that increases its scalability.In a weight-based clustering algorithm, the clusterheads are selected according to their weight (a node’s parameter). The higher the weight of a node, the more suitable this node is for the role of clusterhead. In ad hoc networks, the amount of bandwidth, memory space or battery power of a node could be used to determine weight values.A self-stabilizing algorithm, regardless of the initial system configuration, converges to legitimate configurations without external intervention. Due to this property, self-stabilizing algorithms tolerate transient faults and they are adaptive to any topology change.In this paper, we present a robust self-stabilizing weight-based clustering algorithm for ad hoc networks. The robustness property guarantees that, starting from an arbitrary configuration, after one asynchronous round, the network is partitioned into clusters. After that, the network stays partitioned during the convergence phase toward a legitimate configuration where the clusters verify the “ad hoc clustering properties”.