Partially balanced network designs and graph codes generation

<abstract> <p>Partial balanced incomplete block designs have a wide range of applications in many areas. Such designs provide advantages over fully balanced incomplete block designs as they allow for designs with a low number of blocks and different associations. This paper introduces a class of partially balanced incomplete designs. We call it partially balanced network designs (PBNDs). The fundamentals and properties of PBNDs are studied. We are concerned with modeling PBNDs as graph designs. Some direct constructions of small PBNDs and generalized PBNDs are introduced. Besides that, we show that our modeling yields an effective utilization of PNBDs in constructing graph codes. Here, we are interested in constructing graph codes from bipartite graphs. We have proved that these codes have good characteristics for error detection and correction. In the end, the paper introduces a novel technique for generating new codes from already constructed codes. This technique results in increasing the ability to correct errors.</p> </abstract>

Graph and chart aesthetics for experts and laymen in design: The role of familiarity and perceived ease of use

We investigated the relationship between familiarity, perceived ease of use, and attractiveness of graph designs in two target groups: experts and laymen in design. In the first study, we presented them with a variety of more or less common graph designs and asked them without any additional task to evaluate their familiarity, attractiveness, and perceived ease of use. They judged the familiarity and ease of use of the graphs similarly, but they differed in their attractiveness judgments. Familiarity and perceived ease of use appeared to predict attractiveness, but stronger for laymen than for designers. Laymen are attracted to designs they perceive as familiar and easy to use. Designers are attracted to designs between familiar and novel. In the second study, we asked designers and laymen to first perform an information retrieval task with the same graphs and then rate their attractiveness. Laymen’s appreciations remained the same, but the designers’ judgments of attractiveness were different from those in study 1. Correlational analyses suggest that their attractiveness judgments after use were affected not by actual usability but by perceived ease of use of the graphs.

Traffic Groomings and Graph Designs

Wavelength Division Networks (WDM) rings is a very attractive network. The key terminating equipments are add-drop multiplexers (ADMs) on the WDM networks. It is essential to find an efficient routing and wavelength assignment to a given set of traffic streams such that the total ADM cost is minimal. In this paper, we will obtain the minimal ADM number A(12,v)=v (v-1)/4 when v≡1,9 (mod 24) and v≥25.