scholarly journals Pattern-Driven Navigation in 2D Multiscale Visualizations with Scalable Insets

2018 ◽  
Author(s):  
Fritz Lekschas ◽  
Michael Behrisch ◽  
Benjamin Bach ◽  
Peter Kerpedjiev ◽  
Nils Gehlenborg ◽  
...  
Keyword(s):  
Visual Search ◽  
User Study ◽  
Frequency Estimation ◽  
Visual Representations ◽  
Data Exploration ◽  
Navigational Cues ◽  
Large Numbers ◽  
Speed Up ◽  
Pattern Comparison ◽  
The Cost

AbstractWe present Scalable Insets, a technique for interactively exploring and navigating large numbers of annotated patterns in multiscale visualizations such as gigapixel images, matrices, or maps. Exploration of many but sparsely-distributed patterns in multiscale visualizations is challenging as visual representations change across zoom levels, context and navigational cues get lost upon zooming, and navigation is time consuming. Our technique visualizes annotated patterns too small to be identifiable at certain zoom levels using insets, i.e., magnified thumbnail views of the annotated patterns. Insets support users in searching, comparing, and contextualizing patterns while reducing the amount of navigation needed. They are dynamically placed either within the viewport or along the boundary of the viewport to offer a compromise between locality and context preservation. Annotated patterns are interactively clustered by location and type. They are visually represented as an aggregated inset to provide scalable exploration within a single viewport. In a controlled user study with 18 participants, we found that Scalable Insets can speed up visual search and improve the accuracy of pattern comparison at the cost of slower frequency estimation compared to a baseline technique. A second study with 6 experts in the field of genomics showed that Scalable Insets is easy to learn and provides first insights into how Scalable Insets can be applied in an open-ended data exploration scenario.

Dispersal of the sugar-cane scale Aulacaspis tegalensis (Zhnt.) (Hem., Diaspididae) by air currents

1972 ◽  
Vol 61 (3) ◽  
pp. 547-558 ◽  
Author(s):  
D. J. Greathead
Keyword(s):  
Sugar Cane ◽  
Laboratory Experiments ◽  
Sticky Trap ◽  
Research Station ◽  
High Humidity ◽  
Dispersal Mechanism ◽  
Large Numbers ◽  
Speed Up ◽  
Trap Catches ◽  
Aulacaspis Tegalensis

By means of sticky traps and a suction trap, it was demonstrated on a plot of sugar-cane at Kawanda Research Station, Uganda, that large numbers of crawlers of Aulacaspis tegalensis (Zhnt.) become airborne (up to 10/m3). The numbers increase with wind speed up to about 2·0 m/s and then remain constant, but are depressed by increasing humidity. In laboratory experiments, crawler survival was reduced by high temperatures (30°C) and low humidities (30% r.h.), but some individuals should survive the extreme conditions sometimes experienced if airborne from morning until evening. On hatching, crawlers move upwards and towards the light, but downwards in the dark; movement is inhibited by high humidity. These behaviour responses indicate hat the presence of crawlers in the air is not accidental but a dispersal mechanism. At Arusha Chini, an isolated sugar estate in Tanzania, sticky-trap catches downwind of a windbreak confirmed that airborne dispersal of crawlers is a major source of infestation. It is shown that air currents could have carried crawlers to Arusha Chini from a source on the Kenya coast, 260 km to the east.

Utilization of Dacite as Alternative Aggregate in Asphalt Mixture

2012 ◽  
Vol 509 ◽  
pp. 209-214
Author(s):  
Shao Peng Wu ◽  
Pan Pan ◽  
Ming Yu Chen
Keyword(s):  
Asphalt Mixture ◽  
Asphalt Mixtures ◽  
Major Objective ◽  
Widespread Application ◽  
Bending Tests ◽  
Three Point Bending ◽  
Large Numbers ◽  
Asphalt Content ◽  
The Cost ◽  
Cost Of Construction

With the widespread application of asphalt mixture, current demand from transportation managers for construction and maintenance of their pavement network consumes large numbers of aggregates. If agencies excessively favor to some certain kinds of excellent aggregates, the cost of construction could be considerably expensive. The major objective of this study is to determine the feasibility of utilizing dacite in asphalt mixtures. By means of Marshall, freeze-thaw, rutting and three-point bending tests, the performances of dacite and basalt asphalt mixture are compared. The results of the testing illustrate that dacite asphalt mixture is more susceptible to gradation and asphalt content than basalt asphalt mixture. Meanwhile it is showed that the performances of dacite asphalt mixture can be improved greatly with the involvement of additives including active mineral powder and cement. Furthermore, it is validated that dacite can be used as alternative aggregate in asphalt mixture.

Sparse Incremental Delta-Bar-Delta for System Identification

2014 ◽  
Vol 665 ◽  
pp. 643-646
Author(s):  
Ying Liu ◽  
Yan Ye ◽  
Chun Guang Li
Keyword(s):  
System Identification ◽  
Cost Function ◽  
Learning Algorithm ◽  
Learning System ◽  
The Other ◽  
Sparse System ◽  
Speed Up ◽  
Sparse System Identification ◽  
The Cost ◽  
Zero Attractor

Metalearning algorithm learns the base learning algorithm, targeted for improving the performance of the learning system. The incremental delta-bar-delta (IDBD) algorithm is such a metalearning algorithm. On the other hand, sparse algorithms are gaining popularity due to their good performance and wide applications. In this paper, we propose a sparse IDBD algorithm by taking the sparsity of the systems into account. Thenorm penalty is contained in the cost function of the standard IDBD, which is equivalent to adding a zero attractor in the iterations, thus can speed up convergence if the system of interest is indeed sparse. Simulations demonstrate that the proposed algorithm is superior to the competing algorithms in sparse system identification.

FPGA Realization of the Reconfigurable Mesh Counting Algorithm

2021 ◽  
pp. 2150157
Author(s):  
Yosi Ben-Asher ◽  
Esti Stein ◽  
Vladislav Tartakovsky
Keyword(s):  
Lower Bound ◽  
Neural Nets ◽  
Processing Elements ◽  
Large Numbers ◽  
Unrealistic Assumption ◽  
Reconfigurable Mesh ◽  
Speed Up ◽  
Optimal Tree ◽  
Pass Transistor ◽  
Signal Switching

Pass transistor logic (PTL) is a circuit design technique wherein transistors are used as switches. The reconfigurable mesh (RM) is a model that exploits the power of PTLs signal switching, by enabling flexible bus connections in a grid of processing elements containing switches. RM algorithms have theoretical results proving that [Formula: see text] can speed up computations significantly. However, the RM assumes that the latency of broadcasting a signal through [Formula: see text] switches (bus length) is 1. This is an unrealistic assumption preventing physical realizations of the RM. We propose the restricted-RM (RRM) wherein the bus lengths are restricted to [Formula: see text], [Formula: see text]. We show that counting the number of 1-bits in an input of [Formula: see text] bits can be done in [Formula: see text] steps for [Formula: see text] by an [Formula: see text] RRM. An almost matching lower bound is presented, using a technique which adds to the few existing lower-bound techniques in this area. Finally, the algorithm was directly coded over an FPGA, outperforming an optimal tree of adders. This work presents an alternative way of counting, which is fundamental for summing, beating regular Boolean circuits for large numbers, where summing a vast amount of numbers is the basis of any accelerator in embedded systems such as neural-nets and streaming. a

scholarly journals Fine-Tuning by Curriculum Learning for Non-Autoregressive Neural Machine Translation

2020 ◽  
Vol 34 (05) ◽  
pp. 7839-7846
Author(s):  
Junliang Guo ◽  
Xu Tan ◽  
Linli Xu ◽  
Tao Qin ◽  
Enhong Chen ◽  
...  
Keyword(s):  
Machine Translation ◽  
Fine Tuning ◽  
Inference Process ◽  
Neural Machine Translation ◽  
Training Strategy ◽  
Speed Up ◽  
Good Improvement ◽  
Tuning Process ◽  
Translation Accuracy ◽  
The Cost

Non-autoregressive translation (NAT) models remove the dependence on previous target tokens and generate all target tokens in parallel, resulting in significant inference speedup but at the cost of inferior translation accuracy compared to autoregressive translation (AT) models. Considering that AT models have higher accuracy and are easier to train than NAT models, and both of them share the same model configurations, a natural idea to improve the accuracy of NAT models is to transfer a well-trained AT model to an NAT model through fine-tuning. However, since AT and NAT models differ greatly in training strategy, straightforward fine-tuning does not work well. In this work, we introduce curriculum learning into fine-tuning for NAT. Specifically, we design a curriculum in the fine-tuning process to progressively switch the training from autoregressive generation to non-autoregressive generation. Experiments on four benchmark translation datasets show that the proposed method achieves good improvement (more than 1 BLEU score) over previous NAT baselines in terms of translation accuracy, and greatly speed up (more than 10 times) the inference process over AT baselines.

scholarly journals Granulated Rest Frames Outperform Field of View Restrictors on Visual Search Performance

2021 ◽  
Vol 2 ◽  
Author(s):  
Zekun Cao ◽  
Jeronimo Grandi ◽  
Regis Kopper
Keyword(s):  
Visual Search ◽  
Field Of View ◽  
Search Performance ◽  
Within Subjects ◽  
Induced Motion ◽  
Circular Cutout ◽  
Context Specific ◽  
The Cost ◽  
Future Work ◽  
Peripheral Awareness

Dynamic field of view (FOV) restrictors have been successfully used to reduce visually induced motion sickness (VIMS) during continuous viewpoint motion control (virtual travel) in virtual reality (VR). This benefit, however, comes at the cost of losing peripheral awareness during provocative motion. Likewise, the use of visual references that are stable in relation to the physical environment, called rest frames (RFs), has also been shown to reduce discomfort during virtual travel tasks in VR. We propose a new RF-based design called Granulated Rest Frames (GRFs) with a soft-edged circular cutout in the center that leverages the rest frames’ benefits without completely blocking the user’s peripheral view. The GRF design is application-agnostic and does not rely on context-specific RFs, such as commonly used cockpits. We report on a within-subjects experiment with 20 participants. The results suggest that, by strategically applying GRFs during a visual search session in VR, we can achieve better item searching efficiency as compared to restricted FOV. The effect of GRFs on reducing VIMS remains to be determined by future work.

Earthquakes and Ancient Cities: Armageddon—Not the End of the World

2005 ◽  
Author(s):  
Susan Elizabeth Hough ◽  
Roger G. Bilham
Keyword(s):  
San Francisco ◽  
Local Population ◽  
Special Problem ◽  
Large Numbers ◽  
Daunting Task ◽  
New City ◽  
Rebuilding Effort ◽  
Mechanical Devices ◽  
The Cost ◽  
The City

The reduction of an entire city to a pile of rubble poses a special problem for the survivors. Roads are blocked, underground pipes are broken, and disease accompanies the decay of incompletely buried bodies. Fresh water and sewage no longer flow, food becomes scarce, and the absence of shelter from extremes of temperature can make life miserable. In the cities of the ancient world a very real practical problem followed in the months and years after the destruction of a city—a cleanup operation beyond the wildest dreams of the survivors. Although steam shovels had been used for moving heavy materials in building the Suez and Panama canals in 1869 and 1910, respectively, it was not until 1923 that the bulldozer was invented. The even more useful backhoe followed 25 years later. Thus, clearing debris was a daunting task as recently as the 1906 San Francisco earthquake. In his book The City That Is: The Story of the Rebuilding of San Francisco in Three Years, Rufus Steele wrote of the rebuilding effort: . . . First the ground had to be cleared. The task would have baffled Hercules— cleaning out the Augean stables was the trick of a child compared to clearing for the new city. This is a step in the rebuilding which fails entirely to impress the visitor of today. He can form no conception of the waste which had to be reduced to bits and then lifted and carted away to the dumping grounds. The cost of removing it was more than twenty million dollars. . . . Lacking what we would now consider modern machinery to move large volumes of debris, the rebuilders of San Francisco extended railway lines across town, brought in steam and electric cranes, and relied heavily on teams of horses that suddenly found themselves in enormous demand. According to Steele, “Huge mechanical devices for shoveling and loading were invented and set to work.” Formidable as the task may have been, San Francisco tapped into several critical resources in its Herculean efforts: trains, cranes, and, perhaps most important, large numbers of survivors following an earthquake that killed a very small fraction of the local population.

Improving Matsui’s Search Algorithm For The Best Differential/Linear Trails And Its Applications For DES, DESL And GIFT

2020 ◽  
Author(s):  
Fulei Ji ◽  
Wentao Zhang ◽  
Tianyou Ding
Keyword(s):  
Search Algorithm ◽  
Search Space ◽  
Search Methods ◽  
New Methods ◽  
Linear Layer ◽  
Speed Up ◽  
Automatic Search ◽  
The Cost ◽  
First Time ◽  
Improved Algorithm

Abstract Automatic search methods have been widely used for cryptanalysis of block ciphers, especially for the most classic cryptanalysis methods—differential and linear cryptanalysis. However, the automatic search methods, no matter based on MILP, SMT/SAT or CP techniques, can be inefficient when the search space is too large. In this paper, we propose three new methods to improve Matsui’s branch-and-bound search algorithm, which is known as the first generic algorithm for finding the best differential and linear trails. The three methods, named reconstructing DDT and LAT according to weight, executing linear layer operations in minimal cost and merging two 4-bit S-boxes into one 8-bit S-box, respectively, can efficiently speed up the search process by reducing the search space as much as possible and reducing the cost of executing linear layer operations. We apply our improved algorithm to DESL and GIFT, which are still the hard instances for the automatic search methods. As a result, we find the best differential trails for DESL (up to 14-round) and GIFT-128 (up to 19-round). The best linear trails for DESL (up to 16-round), GIFT-128 (up to 10-round) and GIFT-64 (up to 15-round) are also found. To the best of our knowledge, these security bounds for DESL and GIFT under single-key scenario are given for the first time. Meanwhile, it is the longest exploitable (differential or linear) trails for DESL and GIFT. Furthermore, benefiting from the efficiency of the improved algorithm, we do experiments to demonstrate that the clustering effect of differential trails for 13-round DES and DESL are both weak.

Evaluation of the Mixing Performance of the Micromixers With Grooved or Obstructed Channels

2008 ◽  
Vol 130 (7) ◽  
Author(s):  
Yeng-Yung Tsui ◽  
Ching-Shiang Yang ◽  
Chung-Ming Hsieh
Keyword(s):  
Vertical Plane ◽  
Pressure Head ◽  
Fluid Mixing ◽  
Mixing Performance ◽  
Large Pressure ◽  
Fluid Concentration ◽  
Speed Up ◽  
Periodic Configuration ◽  
The Cost ◽  
Good Agreement

The mixing flows in microchannels were examined using numerical methods. To speed up fluid mixing, it is essential to generate lateral transport of mass. In this study, the mixing flow is disrupted by either placing grooves or block obstacles on the walls of the channels. Since the grooves or the blocks appear in a periodic configuration, the velocity is solved only in a section of the channel. With the repeating cycle of flow velocity field, the fluid concentration can be calculated throughout the entire length of the channel. Good agreement with experiments in the mixing performance justifies the present methodology. Two different channel configurations are under consideration: grooved channels and obstructed channels. The results reveal that with straight grooves, a well organized vortex flow is formed in the vertical plane along the groove, which leads to a helical flow in the channel. The mixing performance can be enhanced by having grooves on both the top and the bottom walls arranged in a staggered manner, by which the transversal velocity is largely increased. It is seen that the strength of the secondary flow and, thus, the mixing can be improved by suitably choosing geometric parameters of the groove, such as the depth, the width, and the oblique angle. It is also shown that the efficient mixing for the staggered herringbone type groove is due to the fluid stratification caused by the exchange of position of the resulted counter-rotating vortices. As for the obstructed channels, the flows are in essence two dimensional. Very strong transversal velocity can be produced by narrowing down the flow passage in the channel. However, the efficient mixing is obtained at the cost of large pressure head loss.

Sign in / Sign up

Export Citation Format

Share Document