Accelerating network applications by distributed interfaces on heterogeneous multiprocessor architectures

Hosts with several, possibly heterogeneous and/or multicore, processors provide new challenges and opportunities to accelerate applications with high communications bandwidth requirements. Many opportunities to scale these network applications with the increase in the link bandwidths are related to the exploitation of the available parallelism provided by the presence of several processing cores in the servers, not only for computing the workload of the user application but also for decreasing the overhead associated to the network interface and the system software.     

The effects of the number of links and navigation support on cognitive load and learning with hypertext: The mediating role of reading order

Problems in learning with hypertext systems have been claimed to be caused by high levels of disorientation and cognitive load. This was recognized by DeStefano and LeFevre [DeStefano, D., & LeFevre, J. -A., (2007). Cognitive load in hypertext reading: A review. Computers in Human Behavior, 23(3), 1616–1641.] who predicted an increase of cognitive load and impairment of learning for hypertexts with a higher number of links per page. From a practical perspective, several navigation support techniques, such as providing link suggestions, have been proposed for guiding learners and reducing cognitive overload. In an experiment, we tested DeStefano and LeFevre’s predictions as well as the usefulness of link suggestions. Participants used different versions of a hypertext, either with 3-links or 8-links per page, presenting link suggestions or not. We tested their cognitive load and learning outcomes. Results showed that there was a benefit of using link suggestions for learning, but no effect of number of links on learning was found. Moreover, the effects of our manipulations on cognitive load were mediated by the reading order that participants selected. Implications for research and the design of navigation support systems are discussed.     

Analysis of weight distribution strategies in unilateral transtibial amputees during the stand-to-sit activity.

Current methods of quantifying the stand-to-sit activity (StTS) are resource intensive and have not been applied to unilateral transtibial amputees (TTAs). The purpose of this study is to define five phases of arm-rest assisted and unassisted StTS using simple instrumentation and implement this method for assessing TTA movement patterns. Twelve TTAs and 12 age-matched non-amputees performed StTS with and without arm-rest support. Symmetry of weight distribution between lower limbs was calculated for five StTS phases: Descent Initiation; Descent Deceleration; Seat-Contact; Stabilisation and Sitting. TTAs demonstrated an asymmetrical weight distribution pattern and a tendency to transfer weight to the intact limb during the course of the activity. Non-amputees had relatively higher symmetry and did not exhibit substantial weight shifts during the activity. Symmetry indices were similar for assisted and unassisted sitting in both subject groups. These results highlight a need for therapeutic interventions in TTAs for reducing loading asymmetries and associated co-morbidities.     

Co-design of H∞ jump observers for event-based measurements over networks

This work presents a strategy to minimise the network usage and the energy consumption of wireless battery-powered sensors in the observer problem over networks. The sensor nodes implement a periodic send-on-delta approach, sending new measurements when a measure deviates considerably from the previous sent one. The estimator node implements a jump observer whose gains are computed offline and depend on the combination of available new measurements. We bound the estimator performance as a function of the sending policies and then state the design procedure of the observer under fixed sending thresholds as a semidefinite programming problem. We address this problem first in a deterministic way and, to reduce conservativeness, in a stochastic one after obtaining bounds on the probabilities of having new measurements and applying robust optimisation problem over the possible probabilities using sum of squares decomposition. We relate the network usage with the sending thresholds and propose an iterative procedure for the design of those thresholds, minimising the network usage while guaranteeing a prescribed estimation performance. Simulation results and experimental analysis show the validity of the proposal and the reduction of network resources that can be achieved with the stochastic approach.     

Computerized design of advanced straight and skew bevel gears produced by precision forging

The computerized design of advanced straight and skew bevel gears produced by precision forging is proposed. Modifications of the tooth surfaces of one of the members of the gear set are proposed in order to localize the bearing contact and predesign a favorable function of transmission errors. The proposed modifications of the tooth surfaces will be computed by using a modified imaginary crown-gear and applied in manufacturing through the use of the proper die geometry. The geometry of the die is obtained for each member of the gear set from their theoretical geometry obtained considering its generation by the corresponding imaginary crown-gear. Two types of surface modification, whole and partial crowning, are investigated in order to get the more effective way of surface modification of skew and straight bevel gears. A favorable function of transmission errors is predesigned to allow low levels of noise and vibration of the gear drive. Numerical examples of design of both skew and straight bevel gear drives are included to illustrate the advantages of the proposed geometry.     

A comparison of finite elements for nonlinear beams: the absolute nodal coordinate and geometrically exact formulations

Two of the most popular finite element formulations for solving nonlinear beams are the absolute nodal coordinate and the geometrically exact approaches. Both can be applied to problems with very large deformations and strains, but they differ substantially at the continuous and the discrete levels. In addition, implementation and run-time computational costs also vary significantly. In the current work, we summarize the main features of the two formulations, highlighting their differences and similarities, and perform numerical benchmarks to assess their accuracy and robustness. The article concludes with recommendations for the choice of one formulation over the other.     

Guidance of a mobile robot using an array of static cameras located in the environment

This paper presents a new proposal for positioning and guiding mobile robots in indoor environments. The proposal is based on the information provided by static cameras located in the movement environment. This proposal falls within the scope of what are known as intelligent environments; in this case, the environment is provided with cameras that, once calibrated, allow the position of the robots to be obtained. Based on this information, control orders for the robots can be generated using a radio frequency link. In order to facilitate identification of the robots, even under extremely adverse ambient lighting conditions, a beacon consisting of four circular elements constructed from infrared diodes is mounted on board the robots. In order to identify the beacon, an edge detection process is carried out. This is followed by a process that, based on the algebraic distance, obtains the estimated ellipses associated with each element of the beacon. Once the beacon has been identified, the coordinates of the centroids for the elements that make up the beacon are obtained on the various image planes. Based on these coordinates, an algorithm is proposed that takes into account the standard deviation of the error produced in the various cameras in ascertaining the coordinates of the beacon’s elements. An odometric system is also used in guidance that, in conjunction with a Kalman Filter, allows the position of the robot to be estimated during the time intervals required to process the visual information provided by the cameras.

Protein radial distribution function (P-RDF) and Bayesian-Regularized Genetic Neural Networks for modeling protein conformational stability: chymotrypsin inhibitor 2 mutants

Development of novel computational approaches for modeling protein properties is a main goal in applied Proteomics. In this work, we reported the extension of the radial distribution function (RDF) scores formalism to proteins for encoding 3D structural information with modeling purposes. Protein-RDF (P-RDF) scores measure spherical distributions on protein 3D structure of 48 amino acids/residues properties selected from the AAindex data base. P-RDF scores were tested for building predictive models of the change of thermal unfolding Gibbs free energy change (DeltaDeltaG) of chymotrypsin inhibitor 2 upon mutations. In this sense, an ensemble of Bayesian-Regularized Genetic Neural Networks (BRGNNs) yielded an optimum nonlinear model for the conformational stability. The ensemble predictor described about 84% and 70% variance of the data in training and test sets, respectively.     

A case study on business process recovery using an e‐government system

Business processes have become one of the key assets of organization, since these processes allow them to discover and control what occurs in their environments, with information systems automating most of an organization's processes. Unfortunately, and as a result of uncontrolled maintenance, information systems age over time until it is necessary to replace them with new and modernized systems. However, while systems are aging, meaningful business knowledge that is not present in any of the organization's other assets gradually becomes embedded in them. The preservation of this knowledge through the recovery of the underlying business processes is, therefore, a critical problem. This paper provides, as a solution to the aforementioned problem, a model‐driven procedure for recovering business processes from legacy information systems. The procedure proposes a set of models at different abstraction levels, along with the model transformations between them. The paper also provides a supporting tool, which facilitates its adoption. Moreover, a real‐life case study concerning an e‐government system applies the proposed recovery procedure to validate its effectiveness and efficiency. The case study was carried out by following a formal protocol to improve its rigor and replicability. Copyright © 2011 John Wiley & Sons, Ltd.     

Use of discrete gradient operators for the automatic determination of vanishing points: Comparative analysis

Thales’ second theorem can be used for the automatic detection of the vanishing points of an image. This paper explores its reliability and accuracy according to the type of operator used for the detection of edges. An algorithm has been used which processes a photographic image according to the operator selected. The result is a point cloud which is then used to find the desired solution. The comparison between the four discrete gradient operators (Frei-Chen, Prewitt, Roberts and Sobel) has been made taking into account the resolution of the image and the number of vanishing points. The results obtained show that Frei-Chen’s operator shows good performance in determining vanishing points with respect to the spatial X axis, Sobel’s operator is the best for determining the vanishing point with respect to the spatial Y axis, Roberts’ operator gives good results for calculating vanishing points in both spatial axes, and Prewitt’s operator is not appropriate for processing this type of image.