PedVis: a structured, space-efficient technique for pedigree visualization

Public genealogical databases are becoming increasingly populated with historical data and records of the current population's ancestors. As this increasing amount of available information is used to link individuals to their ancestors, the resulting trees become deeper and more dense, which justifies the need for using organized, space-efficient layouts to display the data. Existing layouts are often only able to show a small subset of the data at a time. As a result, it is easy to become lost when navigating through the data or to lose sight of the overall tree structure. On the contrary, leaving space for unknown ancestors allows one to better understand the tree's structure, but leaving this space becomes expensive and allows fewer generations to be displayed at a time. In this work, we propose that the H-tree based layout be used in genealogical software to display ancestral trees. We will show that this layout presents an increase in the number of displayable generations, provides a nicely arranged, symmetrical, intuitive and organized fractal structure, increases the user's ability to understand and navigate through the data, and accounts for the visualization requirements necessary for displaying such trees. Finally, user-study results indicate potential for user acceptance of the new layout.     

Performance analysis of the IEEE 802.11 DCF in the presence of the hidden stations

In this paper, we present an analytical model to evaluate the hidden station effect on the performance of the IEEE 802.11 Distributed Coordination Function (DCF) in both non-saturation and saturation condition. DCF is a random channel-access scheme based on Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) method and the exponential backoff procedure. DCF is widely used and can support both wireless network with an access point and ad hoc wireless network because of its random channel-access method. On the other hand, this method unavoidably suffers the hidden station effect that causes significant performance degradation. As shown in this paper, hidden stations occur frequently in real-world settings, and the performance impact on the 802.11 DCF is a significant concern, but it has not been adequately studied. We study this problem through a spatial–temporal analysis and a Markov chain model. Our model generalizes the existing work on the performance modeling of 802.11 DCF for both non-saturation and saturation conditions. The scenario of no hidden station can be considered as a special case in our model. The performance of our model is evaluated by comparison with ns-2 simulations.     

A generalization of Paillier’s public-key system with applications to electronic voting

We propose a generalization of Paillier’s probabilistic public-key system, in which the expansion factor is reduced and which allows to adjust the block length of the scheme even after the public key has been fixed, without losing the homomorphic property. We show that the generalization is as secure as Paillier’s original system and propose several ways to optimize implementations of both the generalized and the original scheme. We construct a threshold variant of the generalized scheme as well as zero-knowledge protocols to show that a given ciphertext encrypts one of a set of given plaintexts, and protocols to verify multiplicative relations on plaintexts. We then show how these building blocks can be used for applying the scheme to efficient electronic voting. This reduces dramatically the work needed to compute the final result of an election, compared to the previously best known schemes. We show how the basic scheme for a yes/no vote can be easily adapted to casting a vote for up to t out of L candidates. The same basic building blocks can also be adapted to provide receipt-free elections, under appropriate physical assumptions. The scheme for 1 out of L elections can be optimized such that for a certain range of the other parameter values, the ballot size is logarithmic in L.     

SVM practical industrial application for mechanical faults diagnostic

A large percentage of the total induction motor failures are due to mechanical faults. It is well known that, machine’s vibration is the best indicator of its overall mechanical condition, and an earliest indicator of arising defects. Support vector machines (SVM) is also well known as intelligent classifier with strong generalization ability. In this paper, both, machine‘s vibrations and SVM are used together for a new intelligent mechanical fault diagnostic method. Using only one vibration sensor and only four SVM’s it was achieved improved results over the available approaches for this purpose in the literature. Therefore, this method becomes more attractive for on line monitoring without maintenance specialist intervention. Vibration signals turns out to occur in different directions (axial, horizontal or vertical) depending on the type of the fault. Thus, to diagnose mechanical faults it is necessary to read signals at various positions or use more them one accelerometer. From this work we also determined the best position for signals acquisition, which is very important information for the maintenance task.     

Step sequence planning for a biped robot by means of a cylindrical shape model and a high-resolution 2.5D map

A novel step sequence planning (SSP) method for biped-walking robots is presented. The method adopts a free space representation custom-designed for efficient biped robot motion planning. The method rests upon the approximation of the robot shape by a set of 3D cylindrical solids. This feature allows efficient determination of feasible paths in a 2.5D map, comprising stepping over obstacles and stair climbing. A SSP algorithm based on A^∗-search is proposed which uses the advantages of the aforementioned environment representation. The efficiency of the proposed approach is evaluated by a series of simulations performed for eight walking scenarios.     

Two-way D algorithm for path planning and replanning

Inspired by the Witkowski’s algorithm, we introduce a novel path planning and replanning algorithm — the two-way D^∗ (TWD^∗) algorithm — based on a two-dimensional occupancy grid map of the environment. Unlike the Witkowski’s algorithm, which finds optimal paths only in binary occupancy grid maps, the TWD^∗ algorithm can find optimal paths in weighted occupancy grid maps. The optimal path found by the TWD^∗ algorithm is the shortest possible path for a given occupancy grid map of the environment. This path is more natural than the path found by the standard D^∗ algorithm as it consists of straight line segments with continuous headings. The TWD^∗ algorithm is tested and compared to the D^∗ and Witkowski’s algorithms by extensive simulations and experimentally on a Pioneer 3DX mobile robot equipped with a laser range finder.     

Digitally-controlled array of solid-state microcoolers for use in surgery

This paper presents an approach for generating a well-defined cooling pattern over an area of tissue. An array of solid-state microcoolers is used, which could be included in a probe that provides local cooling. This medical instrument can be used for removal of scar tissue in the eye or for the rapid stopping of bleeding due to micro-cuts, which makes it a useful tool to medical doctors and could make surgery more secure to the patient. The array of microcoolers is composed of 64 independent thermo-electric elements, each controlled using an integrated circuit designed in CMOS. The independent control allows the flexible programming of the surface temperature profile. This type of control is very suitable in case abrupt temperature steps should be avoided. Cooling by lateral heat flow was selected in order to minimize the influence of heat by dissipation from the electronic circuits. Moreover, a thermo-electric component with lateral heat allows fabrication of the cooling elements using planar thin-film technology, lithography and wet etching on top of the silicon wafer. This approach is potentially CMOS compatible, which would allow for the fabrication of the thermo-electric elements on top of a pre-fabricated CMOS wafer as a post-process step. Each pixel is composed of thin-films of n-type bismuth telluride, Bi₂Te₃ and p-type antimony telluride, Sb₂Te₃, which are electrically interconnected as thermocouple. These materials have excellent thermoelectric characteristics, such as thermoelectric figures-of-merit, ZT, at room temperatures of 0.84 and 0.5, respectively, which is equivalent to power-factors, PF, of 3.62 × 10⁻³ W K⁻¹ m⁻² and 2.81 × 10⁻³ W K⁻¹ m⁻², respectively. The theoretical study presented here demonstrates a cooling capability of 15°C at room temperature (300 K ≈ 27°C). This cooling performance is sufficient to maintain a local tissue temperature at 25°C, which makes it suitable for the intended application. A first prototype was successfully fabricated to demonstrate the concept.     

A systematic mapping study of software product lines testing

Context

In software development, Testing is an important mechanism both to identify defects and assure that completed products work as specified. This is a common practice in single-system development, and continues to hold in Software Product Lines (SPL). Even though extensive research has been done in the SPL Testing field, it is necessary to assess the current state of research and practice, in order to provide practitioners with evidence that enable fostering its further development.

Objective

This paper focuses on Testing in SPL and has the following goals: investigate state-of-the-art testing practices, synthesize available evidence, and identify gaps between required techniques and existing approaches, available in the literature.

Method

A systematic mapping study was conducted with a set of nine research questions, in which 120 studies, dated from 1993 to 2009, were evaluated.

Results

Although several aspects regarding testing have been covered by single-system development approaches, many cannot be directly applied in the SPL context due to specific issues. In addition, particular aspects regarding SPL are not covered by the existing SPL approaches, and when the aspects are covered, the literature just gives brief overviews. This scenario indicates that additional investigation, empirical and practical, should be performed.

Conclusion

The results can help to understand the needs in SPL Testing, by identifying points that still require additional investigation, since important aspects regarding particular points of software product lines have not been addressed yet.     

New simple and efficient heuristics for the uncapacitated single allocation hub location problem

Hub-and-spoke networks are widely studied in the area of location theory. They arise in several contexts, including passenger airlines, postal and parcel delivery, and computer and telecommunication networks. Hub location problems usually involve three simultaneous decisions to be made: the optimal number of hub nodes, their locations and the allocation of the non-hub nodes to the hubs. In the uncapacitated single allocation hub location problem (USAHLP) hub nodes have no capacity constraints and non-hub nodes must be assigned to only one hub. In this paper, we propose three variants of a simple and efficient multi-start tabu search heuristic as well as a two-stage integrated tabu search heuristic to solve this problem. With multi-start heuristics, several different initial solutions are constructed and then improved by tabu search, while in the two-stage integrated heuristic tabu search is applied to improve both the locational and allocational part of the problem. Computational experiments using typical benchmark problems (Civil Aeronautics Board (CAB) and Australian Post (AP) data sets) as well as new and modified instances show that our approaches consistently return the optimal or best-known results in very short CPU times, thus allowing the possibility of efficiently solving larger instances of the USAHLP than those found in the literature. We also report the integer optimal solutions for all 80 CAB data set instances and the 12 AP instances up to 100 nodes, as well as for the corresponding new generated AP instances with reduced fixed costs.     

A strategy for allowing meaningful and comparable scores in approximate matching

Approximate data matching aims at assessing whether two distinct instances of data represent the same real-world object. The comparison between data values is usually done by applying a similarity function which returns a similarity score. If this score surpasses a given threshold, both data instances are considered as representing the same real-world object. These score values depend on the algorithm that implements the function and have no meaning to the user. In addition, score values generated by different functions are not comparable. This will potentially lead to problems when the scores returned by different similarity functions need to be combined for computing the similarity between records. In this article, we propose that thresholds should be defined in terms of the precision that is expected from the matching process rather than in terms of the raw scores returned by the similarity function. Precision is a widely known similarity metric and has a clear interpretation from the user's point of view. Our approach defines mappings from score values to precision values, which we call adjusted scores. In order to obtain such mappings, our approach requires training over a small dataset. Experiments show that training can be reused for different datasets on the same domain. Our results also demonstrate that existing methods for combining scores for computing the similarity between records may be enhanced if adjusted scores are used.