{% extends 'pbl/base.html' %} {% block content %} {% if messages %}
This challenge tries to introduce the JavaScript function and base encoding for encrypting the password.


transport: Optimal Transport in Various Forms
Solve optimal transport problems. Compute Wasserstein distances (a.k.a. Kantorovitch, Fortet–Mourier, Mallows, Earth Mover's, or minimal L_p distances), return the corresponding transference plans, and display them graphically. Objects that can be compared include grey-scale images, (weighted) point patterns, and mass vectors.
| Version: |
0.9-4 |
| Depends: |
R (≥ 3.0.0) |
| Imports: |
grDevices, graphics, stats, Rcpp (≥ 0.12.10) |
| LinkingTo: |
Rcpp |
| Suggests: |
animation, ks |
| Published: |
2017-10-03 |
| Author: |
Dominic Schuhmacher [aut, cre],
Björn Bähre [aut] (aha and power diagrams),
Carsten Gottschlich [aut] (simplex and shortlist),
Florian Heinemann [aut] (transport_track),
Bernhard Schmitzer [aut] (shielding),
Timo Wilm [ctb] (wpp) |
| Maintainer: |
Dominic Schuhmacher <dominic.schuhmacher at mathematik.uni-goettingen.de> |
| License: |
GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
| URL: |
http://www.dominic.schuhmacher.name |
| NeedsCompilation: |
yes |
| Citation: |
transport citation info |
| Materials: |
NEWS INSTALL |
| CRAN checks: |
transport results |
Downloads:
Reverse dependencies:
Linking:
Please use the canonical form
https://CRAN.R-project.org/package=transport
to link to this page.


--- layout: template menu : gettingStarted title : Getting started ---
Easy Batch requires a Java 1.6+ runtime.
Easy Batch uses Git as source control manager and is hosted on GitHub. To download Easy Batch source code, clone it's git repository as follows :
git clone https://github.com/benas/easy-batch.git
You can also get the source code in a zip file from the home page of the project on GitHub: https://github.com/benas/easy-batch
Easy Batch uses maven as build tool. To build Easy Batch with maven, use the following command from the root directory of the project :
mvn install
To use Easy Batch, you have to add easybatch-core-{{ site.version }}.jar to your application's classpath.
If you use maven, add the following dependency to your project pom :
<dependency>
<groupId>org.easybatch</groupId>
<artifactId>easybatch-core</artifactId>
<version>{{ site.version }}</version>
</dependency>


Bahir Dar
Bahir Dar is the third largest city in Ethiopia, after Addis Ababa and Dire Dawa, and has a population of 201,450. It is the capital of the Amhara region, inhabited by the Amhara people, the country's ethnically and geographically second largest group. The Ethiopian official language is Amharic.
Bahir Dar is a clean and well-maintained city by African city standards. It got somewhat popular with national tourists as also the lake and easy climate had made it even the emperor's choice for his summer residence. The result are numerous places to play pool, enjoy draft beer in garden style bars and have fresh fruit juices and the choice from big menus in plenty of cafés and restaurants.
Giorgis Road is the main road in north-south direction featuring plenty of shopping and restaurant opportunities. The bus station and markets lie in side roads to this one and anything close to it will allow you to explore the city on foot. Even the basic accommodations have neat, but basic services and often no wifi.
PLACES TO VISIT
1- The Blue Nile Falls or Tis Abay (in Amharic) is about 35 km from Bahir Dar.
2- Bahir Dar is situated on the southern shore of Lake Tana. On the islands in the lake there are some rural churches and monasteries. There are plenty of boat tours available to the monasteries; these range from 2 to 12 hours in length and can be booked through your hotel or by one of the many touts in the city. In some of these monasteries, women are not allowed to enter. Be cautious and aware of the traditions and rules of the Ethiopian Orthodox church when you visit. A boat is 950 Birrs for the 1/2 day trip. It's the official price for a boat, without guide services and without entrance fees.
There are also long trips to the churches far away (3 hours by boat to reach them). The prices are much higher (3 times more).
3-
Bahir Dar grew around a Jesuit settlement, founded in the sixteenth or seventeenth century, from which time the Pedro Páez building dates.
4- One of Emperor Haile Selassie's palaces is located near the city, and the Emperor considered moving the national capital to the town. It is a rather small and ordinary italian built house with the lion of Juda in front of it. It lies at the end of an alley inside a park on top of a hill south east of the city.
5- Lake Tana is not the source of the Blue Nile, it's before. The Blue Nile goes out of the lake up to Tis Abay (waterfall). If you take a boat trip ask the 'driver' to take you to the place where the river flows out of the lake.
6- Every evening local boatsmen feed the pelicans in front of the lakeside "promenade" just before sunset. Reach this by following Giorgis St all the way through, it's close to the harbour. There is also a swimming restaurant. The whole setting is a nice opportunity to get lost between national tourists
Elevation: 1,800 m
Area: 28 km²
Weather: 20°C, Wind W at 6 km/h, 69% Humidity
Population: 649,429 (2012)


Good Evening
WebGL
Line-up
- What is WebGL?
- Why learn it?
- WebGL Fundamentals
- Making something cool
- Making something cooler
What is WebGL
- OpenGL ES (embedded systems) 2.0 for the web
- GPU accelerated graphics, image processing & physics
- Based on OpenGL ~ creating juicy graphics since 1992
- Released in March 2011 ~ tried & tested
- Good browser support across desktop & mobile
- Programmable pipeline (vertex & fragment shaders)
- Exposed through the HTML5 canvas ~ no plugins!

Mobile
- Chrome for Android (v25+)
- Firefox for Android (v19+)
- Opera (v12+)
- Blackberry (v10+)
- iOS 7?
Why learn WebGL?
“ It looks weird and doesn't feel like JavaScript :`( ”
Quit your jibber jabber
- It's good to learn new things
- It's ridiculously fast
- (Thousands of times faster than 2D canvas)
- Not just for 3D ~ WebGL is a 2D API
- Increasing browser support and, and… mobile!Just think, apps and games at near native speeds
- It's the future (OK, maybe a tiny part of it)
And- some better reasons, from a few friends…
Frameworks
Butlers to bind your buffers…
- THREE.js Popuar, free & well supported. Can also render to Canvas, CSS & SVG
- Turbulenz Full game engine
- ProcessingJS Processing in the browser!
- CubicVR
- Copperlicht
- SpiderGL
- PhiloGL
- A3, GLGE, GLOW, J3D, LightGL, o3D, MathBox…
2D
Don't worry, we're about to see some code
Just a quick note about…
The GPU
- CPU ~ a few cores, optimised for serial processing
- GPU ~ thousands of cores, optimised for parallel processing
- Parallelism gives us speed
- Speed + graphics = ♥
OK
Let's get started
WebGL Fundamentals
The leprechaun's organs
- Context The leprechaun's ears ~ Holds the API & state
Retrieved from an HTML5 canvas - Buffer (VBO)The leprechaun's stomach ~ holds vertex & index data
Is the input to the pipeline - Framebuffer (FBO)An alternative render target, used for drawing off screen
The default rendering buffer is an FBO - Renderbuffer Can be attached to an FBO and rendered to
- Texture Image data I/O ~ can be read from in shaders
Can also be rendered to from an FBO - Program A Vertex + Fragment shader linked together
- Vertex Shader Runs on each vertex ~ outputs the final vertex position
Gets attached to a program - Fragment Shader Runs on every fragment (a sort of pixel) ~ outputs the final color
Gets attached to a program - UniformLocation Used to set constants in a program
Uniforms can be accessed in vertex & fragment shaders
<3
( As in, less than THREE.js )
Bare-metal WebGL ~ No pain, no gain…
Hello World!
Check this out…
// Retrieve and setup the canvas we'll be using for rendering var canvas = document.getElementById( 'canvas' ); // Retrieve the WebGL context from the canvas var gl = canvas.getContext( 'webgl' ) || canvas.getContext( 'experimental-webgl' ); // If the context doesn't exist, we don't have WebGL. Tears. if ( !gl ) throw "This is not the WebGL context you're looking for"; // Set the clearColor attribute gl.clearColor( 0.82, 0.28, 0.35, 1.0 ); // Clear the color component of the screen buffer gl.clear( gl.COLOR_BUFFER_BIT );
Thank you, goodnight!
Shaders
Written in GLSL ES
The OpenGL ES Shading Language
Based on the syntax of the C
Shaders
Vertex + Fragment = Program
Vertex Shader
attribute vec3 aVertexPosition; void main() { gl_Position = vec4( aVertexPosition, 1.0 ); }
Fragment Shader
void main() { gl_FragColor = vec4( 1.0, 0.0, 1.0, 1.0 ); }
Shaders & Programs
var vs = gl.createShader( gl.VERTEX_SHADER ); var fs = gl.createShader( gl.FRAGMENT_SHADER ); gl.shaderSource( vs, document.getElementById( 'vs' ).textContent ); gl.shaderSource( fs, document.getElementById( 'fs' ).textContent ); gl.compileShader( vs ); gl.compileShader( fs ); var program = gl.createProgram(); gl.attachShader( program, vs ); gl.attachShader( program, fs ); gl.linkProgram( program ); gl.useProgram( program );
Debugging Shaders
Querying the state machine
// Check that a shader compiled correctly if ( !gl.getShaderParameter( vs, gl.COMPILE_STATUS ) ) { throw gl.getShaderInfoLog( vs ); } // Check that a program linked correctly if ( !gl.getProgramParameter( program, gl.LINK_STATUS ) ) { throw gl.getProgramInfoLog( program ); }
Attributes
Unique for each vertex
// Get the address of the attribute in the shader program var aVertexPositionLoc = gl.getAttribLocation( program, 'aVertexPosition' ); // Enable this array for vertex data gl.enableVertexAttribArray( aVertexPositionLoc ); // Describe the data: 3 x float, not normalised or interleaved, no offset gl.vertexAttribPointer( aVertexPositionLoc, 3, gl.FLOAT, false, 0, 0 ); // Buffer in vertex data...
Uniforms
Constant for every vertex / fragment
// Get the address of the uniform in the shader program var uMyUniformLoc = gl.getUniformLocation( program, 'uMyUniform' ); // Set uniform value: in this case a 4 component vector of floats (4f) gl.uniform4f( uMyUniformLoc, 1.0, 1.0, 1.0, 1.0 );
Varyings
Interpolated from vertex to fragment shaders
// Vertex shader attribute vec3 aVertexPosition; varying float vTheGreenValue; void main() { vTheGreenValue = aVertexPosition.x; gl_Position = vec4( aVertexPosition, 1.0 ); } // Fragment shader varying float vTheGreenValue; void main() { gl_FragColor = vec4( 1.0, vTheGreenValue, 1.0, 1.0 ); }
Geometry
Vertex Buffers
(VBO)
Filling vertex buffers
// Create a buffer to hold the geometry var vertexBuffer = gl.createBuffer(); // Bind the buffer to the ARRAY_BUFFER bind point gl.bindBuffer( gl.ARRAY_BUFFER, vertexBuffer ); // Fill the buffer with the vertex data gl.bufferData( gl.ARRAY_BUFFER, vertices, gl.STATIC_DRAW );
Drawing Modes
The Pipeline
Transform
ModelView Matrix
Local > world > view transform
Perspective
The Projection Matrix
Converts the viewing frustum into a cuboid,
shrinking distant objects
Lights
Phong Shading
Phong-Lambert illumination
Texture
Loading and sampling textures
Cranking it up a notch
Getting physical with Framebuffers
Physics
Preserving state on with the GPU
We need to…
- Upload particles once ~ compute all physics on the GPU
- Use an emitter and keep inactive particles off the screen
- Enable OES_texture_float to use floats in textures
- Use a texture to preserve position & velocity
- Provide 2 data slots per particle to do this
- Use an FBO to render off screen to the data texture


Ramapuram temple is situated at Ramapuram near Palai, located about 40 km from Kottayam and is well connected by bus. Devottees can reach here from Koothattukulam in M.C road. Main deity is Rama. This temple is managed by a Temple Trust called Ramapuram Devaswom of 3 Nampoothiri families on rotation, viz. Amanakara mana, Kunnoor mana and Karanattu mana.
Nalambalam is a set of four Hindu temples dedicated to Lord Ram and his brothers of Ramayana. The Nalambalams in Ramapuram Kottayam are within a radius of just 3.5 km. The devotees first visit Lord Rama at Sreerama Temple, Ramapuram, Lord Bharatha in Amanakara Temple, Lord Lakshmana in Koodapulam Temple and Lord Shatrugna in Methiri Temple. Having the Darshan of four brothers in a same day is called “Nalambala Darshanam”. Visiting Ramapuram Sreerama Temple during the period of Karkitakam (July – August) as part of Nalambala Yatra is considered to be very auspicious.
Lord Rama’s wife Sitadevi was taken away by the devil king Ravana who was the King of Lanka. Lord Ram in search of his wife started his journey to the South. It is said that the temple is built in the place where Lord Rama rested on his way to Lanka.
Sreerama Temple at Ramapuram is an ancient Lord Rama Temple situated 12 km from Pala town and around 40 km from Kottayam in Kerala, India. The main deity being Lord Ram this temple evolved almost 1000 years ago. Ramapuram Sreerama Temple is part of Nalambalam Yatra Temples in Kottayam district.
Temple Features
To the right of the idol of Lord Rama is the idol of Shiva Parvathi. Near to this is the idol of Sree Dharma Sastha. Other deities (Upadevathas) worshipped at Ramapuram Sreeram Temple are Goddess Bhadrakali, Lakshmi Bhagavathi, Maha Ganapathi, Sree Hanuman, and Nagaraja. Bhadrakali is worshipped in a fearful form with the beheaded head of Darika, the demon. To the southern side of the Kali temple is the idols of Nagas (serpents) where during the day of Aayilyam devotees offer milk, turmeric and rice to the snakes. There is a small Ganapathi temple to the Western side of the temple and is believed to be very powerful. Appam, ada, coconut are main offerings of Ganesha. The shrine of Lord Hanuman is at the entrance of the temple. Lord Hanuman Swamy is worshipped for physical fitness, and intelligence. The shrine of Rekshas and Yakshi are installed near to Hanuman temple.
Ambalakkulam or the temple pond is in the northern side of the temple and there is 8 day festival during the Malayalam month of Meenam (March – April).


{% extends "horizon/common/_modal_form.html" %} {% load i18n %} {% load url from future %} {% block form_id %}security_group_AddPort_form{% endblock %} {% block form_action %}{% url 'horizon:cnext:securitygroups:add_port' security_group_id %}{% endblock %} {% block modal-header %}{% trans "Add Port" %}{% endblock %} {% block modal_id %}create_security_group_port_modal{% endblock %} {% block modal-body %}
{% blocktrans %}Rules define which traffic is allowed to instances assigned to the security group. A security group rule consists of three main parts:{% endblocktrans %}
{% trans "protocol" %}: {% blocktrans %}You can specify the desired rule template or use custom rules, the options are Custom TCP Rule, Custom UDP Rule.{% endblocktrans %}
{% trans "port" %}: {% blocktrans %}For TCP and UDP rules you may choose to open either a single port or a range of ports.{% endblocktrans %}
{% trans "cidr_ip" %}: {% blocktrans %}You must specify the source of the traffic to be allowed via this rule. You may do so either in the form of an IP address block (CIDR) or via a source group (Security Group). Selecting a security group as the source will allow any other instance in that security group access to any other instance via this rule.{% endblocktrans %}


Steps to submit a report
- Select "Submit Report" tab
- Drop a pin on the map (or enter location in the search bar)
- Fill out report title & description
- Select the level of urgency
- Hit Submit!


--- layout: page title: CATEGORY INDEX permalink: /projects/index.html title: Projects and Publications tags: [Categories] description: "An archive of project and publication details." ---
Naveen Namashivayam, Sayan Ghosh, Dounia Khaldi, Deepak Eachempati, and Barbara Chapman. "Native Mode-Based Optimizations of Remote Memory Accesses in OpenSHMEM for Intel Xeon Phi". In 8th International Conference on Partitioned Global Address Space Programming Models (PGAS 2014), October, 2014, Eugene, Oregon, USA – Awarded with the Best Paper award
Fortran Coarray – Open Source Contribution(work in-progress)
Created OpenSHMEM and UCCS communication layer support for Fortran Coarray library in OpenUH open source compiler. UCCS is a low-level communication substrate developed at Oak Ridge National Lab.
Performance Analysis for Intel Xeon Phi using hybrid models
Performed analysis on Intel Xeon Phi co-processors using Stampede Supercomputer in Texas Advanced Computing
Center (TACC) to understand different performance tuning and optimizations for MPI, OpenMP and OpenSHMEM.
Compiler Intermediate Representation (IR) analysis
Developed various iterative data flow analysis algorithms for analyzing Open64 compiler Intermediate Representation. The IR for Open64 compiler is called WHIRL (Winning Hierarchical Intermediate Representation Language).
OpenMP and Image Processing
Parallelized the Optical Character Recognition application code for Vehicle Number plate analysis using OpenMP. Identified the hotspots in the OCR source code and parallelized those regions using OpenMP.
Software Design Pattern Implementation
Implementing a number of software design patterns like Facade, Abstract Factory and Observer to provide solutions to various software design problems using Test Driven Development in Java with JUnit and Mockito as testing framework.
Amazon AWS(work in-progress)
Created and hosted a web based movie data analysis application with automatic caching, load balancing and application abstraction in AWS cloud service using EC2, DynamoDB and Elastic MapReduce.
Bigdata Analytics
Various analysis and simulation were done on the US Flight data set using Hadoop modules like MapReduce, HDFS,
YARN and HBase
Parallelizing Algorithms
Converted sequential versions of Image Smoothing, Jacobi, FFT and MD algorithms into parallel algorithms using OpenMP and OpenSHMEM.


Controller
Ensure web servers and application servers are hardened
XML: Ensure common web attacks (remote XSLT transforms, hostile XPath queries, recursive DTDs, and so on) are protected by your XML stack. Do not hand craft XML documents or queries – use the XML layer.


The Java Sound API fulfills the needs of a wide range of application developers. Potential application areas include:
The Java Sound API provides the lowest level of sound support on the Java platform. It provides application programs with a great amount of control over sound operations, and it is extensible. For example, the Java Sound API supplies mechanisms for installing, accessing, and manipulating system resources such as audio mixers, MIDI synthesizers, other audio or MIDI devices, file readers and writers, and sound format converters. The Java Sound API does not include sophisticated sound editors or graphical tools, but it provides capabilities upon which such programs can be built. It emphasizes low-level control beyond that commonly expected by the end user.
The Java Sound API includes support for both digital audio and MIDI data. These two major modules of functionality are provided in separate packages:
javax.sound.sampled
–
This package specifies interfaces for capture, mixing, and playback of digital (sampled) audio.
javax.sound.midi
–
This package provides interfaces for MIDI synthesis, sequencing, and event transport.
The
javax.sound.sampled
package handles digital audio data, which the Java Sound API refers to as sampled audio. Samples are successive snapshots of a signal. In the case of audio, the signal is a sound wave. A microphone converts the acoustic signal into a corresponding analog electrical signal, and an analog-to-digital converter transforms that analog signal into a sampled digital form. The following figure shows a brief moment in a sound recording.
A Sampled Sound Wave
The term "sampled audio" is used here slightly loosely. A sound wave could be sampled at discrete intervals while being left in an analog form. For purposes of the Java Sound API, however, "sampled audio" is equivalent to "digital audio."
Typically, sampled audio on a computer comes from a sound recording, but the sound could instead be synthetically generated (for example, to create the sounds of a touch-tone telephone). The term "sampled audio" refers to the type of data, not its origin.
The Java Sound API does not assume a specific audio hardware configuration; it is designed to allow different sorts of audio components to be installed on a system and accessed by the API. The Java Sound API supports common functionality such as input and output from a sound card (for example, for recording and playback of sound files) as well as mixing of multiple streams of audio. Here is one example of a typical audio architecture:
A Typical Audio Architecture
The javax.sound.midi package contains APIs for transporting and sequencing MIDI events, and for synthesizing sound from those events.
Whereas sampled audio is a direct representation of a sound itself, MIDI data can be thought of as a recipe for creating a sound, especially a musical sound. MIDI data, unlike audio data, does not describe sound directly. Instead, it describes events that affect the sounds (or actions) performed by a MIDI-enabled device or instrument, such as a synthesizer. MIDI data is analogous to a graphical user interface's keyboard and mouse events. In the case of MIDI, the events can be thought of as actions upon a musical keyboard, along with actions on various pedals, sliders, switches, and knobs on that musical instrument. These events need not actually originate with a hardware musical instrument; they can be simulated in software, and they can be stored in MIDI files. A program that can create, edit, and perform these files is called a sequencer. Many computer sound cards include MIDI-controllable music synthesizer chips to which sequencers can send their MIDI events. Synthesizers can also be implemented entirely in software. The synthesizers interpret the MIDI events that they receive and produce audio output. Usually the sound synthesized from MIDI data is musical sound (as opposed to speech, for example). MIDI synthesizers are also capable of generating various kinds of sound effects.Some sound cards include MIDI input and output ports to which external MIDI hardware devices (such as keyboard synthesizers or other instruments) can be connected. From a MIDI input port, an application program can receive events generated by an external MIDI-equipped musical instrument. The program might play the musical performance using the computer's internal synthesizer, save it to disk as a MIDI file, or render it into musical notation. A program might use a MIDI output port to play an external instrument, or to control other external devices such as recording equipment.
The following diagram illustrates the functional relationships between the major components in a possible MIDI configuration based on the Java Sound API. (As with audio, the Java Sound API permits a variety of MIDI software devices to be installed and interconnected. The system shown here is just one potential scenario.) The flow of data between components is indicated by arrows. The data can be in a standard file format, or (as indicated by the key in the lower right corner of the diagram), it can be audio, raw MIDI bytes, or time-tagged MIDI messages.
A Possible MIDI Configuration
As illustrated, the MIDI events must be translated into raw (non-time-tagged) MIDI before being sent through a MIDI output port to an external MIDI instrument. Similarly, raw MIDI data coming into the computer from an external MIDI source (a keyboard instrument, in the diagram) is translated into time-tagged MIDI messages that can control a synthesizer, or that a sequencer can store for later use.
The
javax.sound.sampled.spi
and
javax.sound.midi.spi
packages contain APIs that let software developers create new audio or MIDI resources that can be provided separately to the user and "plugged in" to an existing implementation of the Java Sound API. Here are some examples of services (resources) that can be added in this way:
In some cases, services are software interfaces to the capabilities of hardware devices, such as sound cards, and the service provider might be the same as the vendor of the hardware. In other cases, the services exist purely in software. For example, a synthesizer or a mixer could be an interface to a chip on a sound card, or it could be implemented without any hardware support at all.
An implementation of the Java Sound API contains a basic set of services, but the service provider interface (SPI) packages allow third parties to create new services. These third-party services are integrated into the system in the same way as the built-in services. The
AudioSystem
class and the
MidiSystem
class act as coordinators that let application programs access the services explicitly or implicitly. Often the existence of a service is completely transparent to an application program that uses it. The service-provider mechanism benefits users of application programs based on the Java Sound API, because new sound features can be added to a program without requiring a new release of the
JDK or runtime environment, and, in many cases, without even requiring a new release of the application program itself.


Marion Barry Smokes Crack
rotten.com
|
After 8pm, January 18 1990, Washington DC Mayor Marion Barry was arrested
on cocaine possession charges at Vista International Hotel. This is a
video snapshot of the mayor toking a crack pipe, taken from the
surveillance film. His arrest was part of a joint FBI - DC police undercover
operation, which earned him prison time. Despite this incident, Barry
was able to gain reelection to office after serving his sentence.
|
|


{{ _('Flicks Partners') }}
{% trans %} We recognize our partners for their generous contributions to making the 2013 Firefox Flicks contest a hit. {% endtrans %}
{% extends 'base.html' %} {% block page_title %}{{ _('Partners') }}{% endblock %} {% set meta_description = _( 'Firefox Flicks FAQ — Your questions answered. Our FAQ covers all the ' 'details on how to enter the video contest and win prizes.' ) %} {% block content %}
{% endblock %}


Max
Problem 8. Find the Largest from Undefined Count of Numbers
Add array example 10,-15,19,14,14
Max


Peruvian Inca Orchid
| Peruvian Inca Orchid Picture | |
| Breed Information | |
|---|---|
| Popularity | # |
| Name | Peruvian Inca Orchid |
| Other names | Flower Dog, Inca Hairless Dog, Viringo, Dielmatian, Perro Sin Pelo del Per |
| Origin | Peru |
| Breed Group | Hound |
| Size | Medium |
| Type | Purebred |
| Life span | 11-13 years |
| Temperament | AffectionateAlertIntelligentLivelyNobleProtective |
| Height | Small: 25–40 cm (10–16 inches)Medium: 40–50 cm (16–20 inches)Large: 50–65 cm (20–26 inches) |
| Weight | Small: 4–8 kg (9–18 lbs)Medium: 8–12 kg (18–26 lbs)Large: 12–25 kg (26–55 lbs) |
| Colors | BlackBrownPinkGrayTanWhite |
| Litter Size | 3-5 puppies |
| Puppy Price | Average $400 - $600 USD |
| Breed Characteristics | |
| Adaptability | 4 stars |
| Apartment Friendly | 3 starsThe PIO will do OK in an apartment. A fenced-in yard is recommended as the PIO is a sighthound and may take off chasing a small animal at any time. This breed should live indoors and be protected from the elements. The PIO sunburns very quickly. It should have a sweater in the winter and be kept at a comfortable temperature in the summer. Keep in mind this breed does not have hair to protect it from the weather and is basically naked. |
| Barking Tendencies | 2 starsOccassional |
| Cat Friendly | 3 stars |
| Child Friendly | 4 starsGood with Kids: This is a suitable breed for kids and is known to be playful, energetic, and affectionate around them. It is also friendly toward other pets. |
| Dog Friendly | 4 stars |
| Exercise Needs | 3 starsThis breed needs to be taken on a daily walk. While out on the walk the dog must be made to heel beside or behind the person holding the lead, as in a dog's mind the leader leads the way, and that leader needs to be the human. If under-exercised, this breed can become nervous and anxious. |
| Grooming | 1 starsLow Maintenance: The Peruvian Inca Orchid is easy to care for. A quick bath is all that is needed but the hairless breed must be have lotion applied afterwards. If the hairless is lighter in color, sunscreen may be needed as they can burn. The coated needs to be bathed every 1-2 months. |
| Health Issues | 3 starsProne to skin and teeth problems.Hypoallergenic: Yes |
| Intelligence | 3 starsRanking: (#). (See All Rankings) |
| Playfulness | 2 stars |
| Shedding Level | 1 starsMinimal Shedding: Recommended for owners who do not want to deal with hair in their cars and homes. |
| Stranger Friendly | 3 stars |
| Trainability | 5 starsEasy Training: The Peruvian Inca Orchid is easy to train but they must have a gentle hand when training as they are very sensitive. They are smart and very willing to please. |
| Watchdog Ability | 4 stars |
| Peruvian Inca Orchid Puppy Picture | ||
| Puppy Names | ||
|---|---|---|
| Rank | Male | Female |
| 01 | Buddy | Chloe |
| 02 | Charlie | Luna |
| 03 | Toby | Coco |
| 04 | Cooper | Zoey |
| 05 | Louie | Abbie |
| 06 | Tucker | Penny |
| 07 | Oliver | Lola |
| 08 | Oscar | Ginger |
| 09 | Riley | Rosie |
| 10 | Buster | Penny |
| See All Names › |
| Overview |
|---|
|
The Peruvian Inca Orchid is a medium-sized, elegant Sighthound breed. They give the appearance of speed, strength and stamina, with no trace of coarseness. They are square in proportion, though females may be slightly longer in body, with good length of leg. The hairless and the coated dogs are identical except for ear carriage, and they can be born in the same litter. The breed comes in many skin and coat color combinations. Peruvian Hairless dogs are affectionate with family but wary of strangers. They tend to be very protective of women and children in the family. They are typically lively, alert and friendly with other dogs. They are agile and fast, and many of them enjoy sight-hunting small rodents. These dogs do not like to be alone, but when trained, can do well. They tend to know their allowed territories and respect it. These dogs are intolerant of extreme temperatures, although they are quite comfortable wearing clothing and will even play in the snow if dressed warmly. They generally require an owner that understands dog language and are not recommended for beginners. They learn fast, and they are very smart, but get bored easily with repetitious games like "fetch". |
| History |
| The Peruvian Inca Orchid is an ancient breed, thought to have been in existence since A.D 750. When the Spanish conquered Peru, these hairless dogs were found in the Inca homes amidst the Orchids, therefore the Spanish named them “Perros Flora”, or “flower dog”. Little has changed about the breed since it was first discovered. The Peruvian Inca Orchid was recognized by the United Kennel Club in 1996. |


cvpr cvpr2013 cvpr2013-369 cvpr2013-369-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Laurent Sifre, Stéphane Mallat
Abstract: An affine invariant representation is constructed with a cascade of invariants, which preserves information for classification. A joint translation and rotation invariant representation of image patches is calculated with a scattering transform. It is implemented with a deep convolution network, which computes successive wavelet transforms and modulus non-linearities. Invariants to scaling, shearing and small deformations are calculated with linear operators in the scattering domain. State-of-the-art classification results are obtained over texture databases with uncontrolled viewing conditions.
[1] Jw.o Brkrusn”,a I,E SE.E M Tarl a nts,. “ oIn v PaAriManIt, t Soc a pt pe rianr.g Convolution Net[2] T. Serre, L. Wolf, S. Bileschi, M. Riesenhuber, and T. Poggio, “Robust object recognition with cortex-like mechanisms,” IEEE Trans. on Pattern Analysis and Machine Intelligence, 29:41 1-426, 2007.
[3] T. Poggio, J. Mutch, F. Anselmi, L. Rosasco, J.Z. Leibo, and A. Tacchetti, “The computational magic of the ventral stream: sketch of a theory”, MIT-CSAIL-TR-2012-035, December 2012.
[4] G. E. Hinton and R. R. and Salakhutdinov, “Reducing the dimensionality of data with neural networks”, Science, Vol. 313. no. 5786, pp. 504 - 507, 28 July 2006.
[5] Y. LeCun, K. Kavukvuoglu and C. Farabet: “Convolutional Networks and Applications in Vision”, Proc. of ISCAS 2010.
[6] G. Citti, A. Sarti, “A Cortical Based Model of Perceptual Completion in the Roto-Translation Space”, Journal of Mathematical Imaging and Vision archive, Vol. 24, no. 3, p.
[18] UIUC : http://www-cvr.ai.uiuc.edu/ponce grp/data/
[19] UteMxtuDre.htm: http:/ www.cfar.umd.edu/∼fer/website-texture/ 307=326, May 2006.
[7] U. Boscain, J. Duplaix, J.P. Gauthier, F. Rossi “Anthropomorphic Image Reconstruction via Hypoelliptic Diffusion”, SIAM Journal on Control and Optimization, to appear.
[8] R. Duits, B. Burgeth, “Scale Spaces on Lie Groups”, in Scale Space and Variational Methods in Computer Vision, Springer Lecture Notes in Computer Science, Vol. 4485, 2007, pp 300-312.
[9] S. Mallat “Group Invariant Scattering”, Communications in Pure and Applied Mathematics, vol. 65, no. 10. pp. 13311398, October 2012.
[10] S. Lazebnik, C. Schmid and J. Ponce, “A sparse texture representation using local affine regions”, IEEE Trans. on PAMI, vol. 27, no. 8, pp. 1265-1278, August 2005.
[11] Huu-Giao Nguyen, R, Fablet, and J.-M. Boucher, “Visual textures as realizations of multivariate log-Gaussian Cox processes”, Proc. of CVPR, June 2011
[12] M. Crosier and L.D. Griffin, “Texture classification with a dictionary of basic image features”, Proc. of CVPR, June 2008
[13] Y. Xu, X. Yang, H. Ling and H. Ji, “A new texture descriptor using multifractal analysis in multi-orientation wavelet pyramid”, Proc. of CVPR, June 2010
[14] L. Liu, P. Fieguth, G. Kuang, H. Zha, “Sorted Random Projections for Robust Texture Classification”, Proc. of ICCV, 2011
[15] D. Lowe. “Distinctive image features from scale-invariant keypoints”, IJCV, 60(4):91 110, 2004
[16] S. Lazebnik, C. Schmid and J. Ponce, “Beyond Bags of Features: Spatial Pyramid Matching for Recognizing Natural Scene Categories”, Proc. of CVPR, 2006
[17] KTH-TIPS: http://www.nada.kth.se/cvap/databases/ kth-tips/ 1 1 12 2 23 34 80 8


gs location changer options
settings
number of places in context menu
set
number of places to remember
set
known locations
location
lat
lng
hl
gl
consent cookie
set cookie CONSENT=
set
YES+US.en+V14+BX


This indicates to Xyla how to tag your {{ entityLevel | entityDisplayName:channel:'plural'}}.
It must be included at the {{ parserKeyPatternPosition === PatternPosition.Prefix ? 'beginning' : 'end' }} of each {{ entityLevel | entityDisplayName:channel }} name
that uses this naming convention.


Welcome to the JavaScript
We are learning JavaScript!!
Let us know if you are interested in Javascript Too!!


{% feed_meta %} {%- include polyfills.html -%} {%- include layout-page-styles.html -%} {%- include layout-page-scripts.html -%}


--- title: Bedework Contributors menuTitle: Contributors menuRoot: Community layout: default permalink: /community/contributors ---
The following organizations and individuals have contributed to Bedework through direct involvment with the project, through code contributions, or both. Bedework is indebted to all its contributors without whom the project could not thrive.


Clear this form
Last Name
First Name
Address
City
State
Zip/Postal Code
Country
Bulgaria
England
Italy
Macedonia
Spain
Ukraine
Phone(country code,
area code, number)
+(
)
-
E-mail
Birth date
Month
Day
Year(4 digit)
Gender
Male
Female
Starting date
Spring 2006
Summer 2006
Comments/Questions


Special Events the plugin deliver like onJob and JobFinished
Event flag that displays if a driver is doing a job
Event flag that displays (for some ticks) that a job was finished, doesn't matter how (cancelled, delivered, ...) Deprecated for Version 1.35 of both games. Use JobCancelled and JobDelivered Event for version starting with 1.35+ But should still work


{% extends 'base.html' %} {% block title %}About{% endblock %} {% block content %}
This website is a capstone project for Springboard's software engineering curriculum. It is built with Flask, SQLAlchemy and a PostgreSQL database.
The plant data comes from Trefle, a global plants API. Accuracy of the data is not guaranteed. Plant image copyrights remain with the original copyright holder.
The site uses Heroku's free hosting and database options, so load time may be long. Accounts may be deleted without notice for any reason, including limited storage space.
This site collects no personal data. There is no way to recover a lost password.
{% endblock %}


Kia ora Taiao! You have entered Tess' blog
Home
About me
Blog
Pictures of Dogs
Contact
Sprint 1 Cultural
Sprint 1 Technical
Sprint 2 Cultural
Sprint 2 Technical
Sprint 3 Cultural
Sprint 3 Technical
Sprint 4 Cultural
Sprint 4 Technical
Sprint 5 Cultural


BOOM! BOOM! BOOM! BEAT! BEAT! BEAT! Listen to Nischergurgje!
Far, far away in Lapland of the Many Wizards, beyond the Arctic Circle, in mid-winter, it is one Long Night. But what a night!
There is silence. The stars sparkle in the vast, dark sky. A soft white shimmer glows over the fields of ice and snow covering tundra, valley, and hill. Deep ice binds the lakes and streams.
Then see! Upward across the sky sweep wondrous lights.
And the little, dark children of Lapland of the many Wizards and much Magic, are filled with mystery. They listen for the Call of the Magic Drum, and they watch the Aurora Lights, and say:
"See! the warriors are fighting!"
In the long, long ago, the Wizard Nischergurgje, chanting Magic Spells with whistlings and drum-beatings, came wandering over the frozen marshes. Under a crooked pine tree he sat down to rest, and to boil his dinner of reindeer flesh.
And while he was waiting for the cooking pot to simmer, he heard something creak--crack--creak above his head. He looked up. Through the crooked boughs, an evil face grinned at him. It was Schlipme's--the Wicked Wizard of the Wicked Moon Daughter.
Then Nischergurgje quickly muttered a Spell, and the Wicked Wizard tumbled to the ground.
"Wicked Schlipme," said the Great Wizard, "Servant of the Wicked Moon Daughter, of the caved-in forehead, crooked mouth, and pale, cruel lips that splutter curses! See! My Spell has taken from you all your power."
"Nischergurgje," snarled the Wicked Wizard, "my Magic is still strong. I can call on the Moon Spirits to destroy you."
"Your Black Art does not frighten me," answered Nischergurgje.
Then the Wicked Schlipme stood up, and by his Black Art grew and grew, taller and taller, to great stature. In his hand he swung a terrible club made of a spruce tree.
"I will grind you to powder as fine as the snow on the hillside," he roared. "Tremble before me!"
"See what my Good Magic will do!" said Nischergurgje.
And he muttered a Spell, and he, too, grew and grew, taller and taller and yet taller. Greater he was than the Wicked Wizard. The tallest pines in the forest scarce reached his knees. The highest peaks of the mountains scarce touched his waist. His chest and shoulders were hid among the clouds. His chin pushed the moon. His eyes glared into the sun.
"You have taken my strength from me!" cried Schlipme in fear.
Then they changed themselves into dreadful Storm Clouds. They rushed upon each other. They closed in fierce combat. A mighty roaring was heard. The sky was black.
Nischergurgje uttered a terrible Spell, and Schlipme fell in a heap to earth.
"Again you have taken my strength from me!" cried the Wicked Wizard.
Once more the two Wizards changed their forms. They became two great, horned reindeer. They battled over the frozen snow of the hillside. The whole forest echoed with the loud clashing of their antlers. The trampling of their hoofs shook the earth.
Then the Wicked Wizard was too weak to fight more. He changed himself into a great snake writhing on the ground. Nischer gurgje, too, became a snake. They twined and twisted. Their angry hissing could be heard afar off. Their dripping fangs were dreadful to see.
Then suddenly the Wicked Wizard stretched himself upon the ground as if dead. In the twinkling of an eye he became a mighty bird. He soared in wide circles about the Great Wizard, who was still a snake.
But Nischergurgje took the form of an eagle. He rose swiftly in the air. He overtook the Wicked Schlipme, and sank his claws into his back. He brought him down to earth.
Then Wicked Schlipme, bleeding and torn, howled:
"Now you have taken all my strength!"
And he sank down, down, into the dark Under Earth Land.
Nischergurgje went back to beat his Magic Drum and to cook his supper of reindeer flesh.
While over his head, across the deep dark sky, flashed and shimmered the many colored Northern Lights red, orange, yellow, green, blue, and violet. And the little brown Children of Lapland cried out:
"See! The warriors are fighting!"


pyDNTNK package¶
Submodules¶
pyDNTNK.TN_data_generator module¶
- class pyDNTNK.TN_data_generator.data_generator(args)¶
Bases:
object
Generates synthetic data for tensor networks. THe factors are generated randomly and then taken product into TT format.
- fit()¶
generates and save factors into Zarr file
- pyDNTNK.TN_data_generator.parser()¶
Reads the input arguments from the user and parses the parameters to the data generator module.
pyDNTNK.pyDNTNK module¶
- class pyDNTNK.pyDNTNK.pyDNTNK(fpath, params, model='tt')¶
Bases:
object
Performs the distributed Hierrachial Tensor decomposition of given matrix Tensor X into factors/tensor cores
- Parameters
fpath (str) – Path to the tensor file
model (str (optional)) – Tensor networks model (TT/TK) where TT-Tensor train and TK-Tucker
params (class) – Class which comprises following attributes
params.routine (str(optinal)) – Decomposition method (NMF/SVD)
params.init (str) – NMF initialization(rand/nnsvd)
params.err (float) – Error criteria for automating estimating ranks with SVD
params.ranks (list) – List of ranks for decomposition
params.comm (object) – Modified communicator object
params.norm (str) – NMF norm to be minimized
params.method (str) – NMF optimization method
params.eps (float) – Epsilon value
params.verbose (bool) – Flag to enable/disable display results
params.save_factors (bool) – Flag to enable/disable saving computed factors
- compute_svd(data, k)¶
Computes distributed SVD for given data and then returns the factors
- Parameters
data (ndarray) – Data to be decomposed via SVD
k (int) – Rank for decomposition
- Returns
singularValues (list) – A list of singular values
U (ndarray) – U matrix
V (ndarray) – V matrix
rel_error (float) – Relative error of decomposition
- determine_rank(X, err)¶
Automatically estimates the rank for each stage of decomposition with some error criteria
- Parameters
X (ndarray) – Matrix of whose rank is to be estimated
err (float) – Error for estimation
- Returns
rank – Estimated rank of decomposition
- Return type
int
- error_compute()¶
Computes the final decomposition error as a upper bound
- fit()¶
Calls the sub routines to perform distributed Tensor network decomposition with NMF/SVD decomposition for a given TT/TK based method Supports Tensor train and Tucker based Tensor networks decomposition. THe decomposition can be carried out via SVD/NMF. The ranks can be provided by user or can be automatically estimated with SVD.
- lazy_read_file()¶
Reads file from the Zarr file system to each MPI rank and then handles the object to dask array
- Parameters
fpath (str) – File path to the Zarr Tensor File
- return_factors()¶
Returns the factors after decomposition
pyDNTNK.tt_utils module¶
- pyDNTNK.tt_utils.glob_rank_to_ND_rank(p_grid, glob_RANK)¶
Converts global rank to cartesian coordinates i.e 0 -> (0,0,0)
- class pyDNTNK.tt_utils.tn_data_operations(comm, fpath=None, data=None)¶
Bases:
object
Perform various data opetations on TN data
- data_block_idx_range(chunk_size)¶
Computes the block index range of data for each MPI rank
- Parameters
chunk_size (tuple) – Total data size based on which the index range is determined
- Returns
dtr_blk_idx – List of index range for each MPI rank
- Return type
list
- dist_reshape(target_shape)¶
Computes the Distributed reshape operation with the DASK object
- Parameters
data (DASK object) – Data stored into DASK format
target_shape (tuple) – Desired data shape
- Returns
data – Reshapes the dask array into desired shape and then computes the chunk of data for each MPI rank
- Return type
ndarray
- lazy_read_file()¶
Reads file from the Zarr file system to each MPI rank and then handles the object to dask array
- Parameters
fpath (str) – File path to the Zarr Tensor File
- lazy_store_file()¶
Stores the ndarray from each MPI rank into a shared file system
- Parameters
data (ndarray) – Data to be stored from each MPI rank
target_shape (fpath) – Path to which file to be stored


Audience Display Server Address:
Save
Audience Display - Proudly created by
Cussa
@
Hod Studio
Contribute with code at GitHub:
Repository


Latest Version: 0.6.1 (Dated: 20-05-2015)
Titanium View with the background image sourced directly from the Android camera.
To access this module from JavaScript, you would do the following:
var androidcamera = require("pw.custom.androidcamera");
The androidcamera variable is a reference to the Module object.
The cameraview takes the same properties and methods as the standard titanium view.
Create a new instance of the camera view. The method takes a dictionary of the following arguments:
arguments
Capture the image currently on screen and save to the filesystem
Returns a dictionary containing the following:
The following permissions need to be added to the manifest tag in tiapp.xml
<!-- Camera Permissions -->
<uses-permission android:name="android.permission.CAMERA"/>
<uses-feature android:name="android.hardware.camera"/>
<uses-feature android:name="android.hardware.camera.autofocus"/>
Then, to use the module in app, do something like the following:
var win = Ti.UI.createWindow({
navBarHidden: true,
fullscreen: true,
backgroundColor:'white'
});
win.orientationModes = [Ti.UI.PORTRAIT];
win.open();
if( Ti.Media.isCameraSupported ) {
var androidcamera = require("pw.custom.androidcamera");
var camera = androidcamera.createCameraView({
save_location: "pharmacy"
useFrontCamera: false,
pictureTimeout: 1000
});
var btSnap = Ti.UI.createButton({
title: "Capture",
bottom: "10dp",
height: "80dp",
width: "80dp",
zIndex: 2
});
btSnap.addEventListener("click", function(){
camera.snapPicture();
});
camera.addEventListener("picture_taken", function(evt){
alert("Image saved to "+evt.path);
});
win.addEventListener("close", function(){
camera = null;
});
win.add(camera);
win.add(btSnap);
} else {
alert("No camera found!");
}
Michael Browne


We consider balloon drawings of trees, in which each subtree of the root is drawn recursively within a disk, and these disks are arranged radially around the root, with the edges at each node spaced equally around the node so as to achieve the best possible angular resolution. If we are allowed to permute the children of each node, then we show that a drawing of this type can be made in which all edges are straight line segments and the area of the drawing is a polynomial multiple of the shortest edge length. However, if the child ordering is prescribed, exponential area might be necessary. We show that, if we relax the requirement of straight line edges and draw the edges as circular arcs (a style we call Lombardi drawing) then even with a prescribed child ordering we can achieve polynomial area.
\- \!all \!a:loffler \!a:mumford \!a:nollenburg \!geom:all \!graph:all \!gdraw \!c:gd \!j:jga \!y:2010 \!y:2013 \# esub JGAA July 2011, recd reports May 2012, accepted after revn Feb 2013
We show how to draw any graph of maximum degree three in three dimensions with 120 degree angles at each vertex or bend, and any graph of maximum degree four in three dimensions with the angles of the diamond lattice at each vertex or bend. In each case there are no crossings and the number of bends per edge is a small constant.
\- \!all \!graph:all \!graph:dyn \!graph:sgi \!a:goodrich \!a:strash \!a:trott \!c:other \!j:tcs \!y:2010 \!y:2012 \# sub to TCS special issue from COCOA Jan 2011?
An earlier paper with Spiro at WADS 2009 provided dynamic graph algorithms for counting how many copies of each possible type of subgraph there are in a larger undirected graph, when the subgraphs have at most three vertices. This paper extends the method to directed graphs and to larger numbers of vertices per subgraph.
\- \!all \!geom:all \!geom:misc \!a:goodrich \!a:tamassia \!c:other \!j:no \!y:2010 \# esub to SoCG 2010, rejected \# esub to ESA 2010, rejected \# esub to GIS 2010
An algorithm is data-oblivious if the memory access patterns it makes depend only on the input size and not on the actual input values; data-oblivious algorithms are an important building block of cryptographic protocols that allow algorithmic tasks to be solved by parties who each have some subset of the input data that they do not wish to reveal. We show how to solve several basic geometric problems data-obliviously, including construction of convex hulls, quadtrees, and well-separated pair decompositions, and computation of closest pairs and all nearest neighbors.
\- \!all \!graph:all \!graph:minor \!pure \!a:solo \!c:no \!j:other \!y:2010 \# esub to EJC 1 Jul 2010
For every minor-closed graph family (such as the family of planar graphs), there is a constant c such that the maximum number of edges in an n-vertex graph in the family is c(n + o(n); for instance, for planar graphs, c = 3. We call c the limiting density of the family, and we study the set of all limiting densities of all minor-closed graph families. We show that this set of limiting densities is closed and well-ordered, with order type at least ωω, and we find an exact description of the members of this set up to its first two cluster points 1 and 3/2.
\- \!all \!misc
An overview of the Theoretical Computer Science question and answer exchange web site.
\- \!all \!geom:all \!geom:misc \!pure \!a:loffler \!c:scg \!j:dcg \!y:2011 \!y:2013 \# submitted to DCG, September 2011
Suppose that P is the intersection of n halfspaces in D dimensions, but that the bounded faces of P are at most d-dimensional, for some d that is much smaller than D. Then in this case we show that the number of vertices of P is O(nd), independent of D. We also investigate related bounds on the number of bounded faces of all dimensions of P, and algorithms for efficiently listing the vertices and bounded faces of P. \- \!all \!geom:all \!geom:misc \!a:barequet \!a:dickerson \!a:hodorkovsky \!a:vyatkina \!c:other \!j:other \!y:2011 \!y:2013
We study the combinatorial complexity of generalized Voronoi diagrams that determine the closest two point sites to a query point, where the distance from the query point to a pair of sites is a combination of the individual distances to the sites and the distance from one site in the pair to the other.
\- \!all \!exponential \!graph:all \!graph:sgi \!a:strash \!c:other \!j:no \!y:2011
We experiment with our degeneracy-based algorithm for listing maximal cliques in sparse graphs and show that it works well on large graphs drawn from several repositories of real-world social networks and bioinformatics networks.
For the journal version, see "Listing all maximal cliques in large sparse real-world graphs in near-optimal time", which combines results from this and a different conference paper.
\- \!all \!geom:all \!graph:all \!gdraw \!a:gansner \!c:no \!j:jga
\- \!all \!geom:all \!geom:misc \!a:buchin \!a:loffler \!a:nollenburg \!a:silveira \!c:wads \!j:jocg \!y:2011 \!y:2016 \# esub to WADS 2011; sub JoCG 10 May 2015
We study the recursive partitions of rectangles into sets of rectangles, and partitions of those rectangles into smaller rectangles, to form stylized visualizations of hierarchically subdivided geographic regions. There are several variations of varying difficulty depending on how much of the geographic information from the input we require the output to preserve.
\- \!all \!geom:all \!geom:misc \!a:goodrich \!a:loffler \!c:wads \!j:no \!y:2011 \# sub to SoCG 2011, rejected \# sub to WADS 2011
We apply competitive analysis to the problem of deciding online which cell phone tower to change to when a phone moves out of the coverage region of the tower it is connected to. We show that, when the coverage regions have constant ply (at most a constant number of them overlap any point of the plane) it is possible to get within a constant factor of the minimum possible number of handovers that an offline algorithm could achieve.
\- \!all \!compress \!a:goodrich \!a:uyeda \!a:varghese \!c:other \!j:no \!y:2011 \# esub to SIGCOMM
We determine the symmetric difference between two similar sets of items, held by different machines on the internet, using an amount of communication bandwidth that is proportional only to the difference between the sets and with low computational overhead. Our solution technique combines the invertible Bloom filter data structure from our previous work on streaming straggler detection with a randomized sampling scheme that allows us to accurately and efficiently estimate the size of the difference.
\- \!all \!graph:all \!graph:path \!a:goodrich \!a:loffler \!a:strash \!a:trott \!c:other \!j:tcs \!y:2011 \!y:2013
We investigate greedy routing schemes for social networks, in which participants know categorical information about some other participants and use it to guide message delivery by forwarding messages to neighbors that have more categories in common with the eventual destination. We define the membership dimension of such a scheme to be the maximum number of categories that any individual belongs to, a natural measure of the cognitive load of greedy routing on its participants. And we show that membership dimension is closely related to the small world phenomenon: a social network can be given a category system with polylogarithmic membership dimension that supports greedy routing if, and only if, the network has polylogarithmic diameter.
\- \!all \!geom:all \!graph:all \!graph:planar \!gdraw \!a:simons \!c:gd \!j:jga \!y:2011 \!y:2012 \!y:2013
We show that a partial order has a non-crossing upward planar drawing if and only if it has order dimension two, and we use the Dedekind-MacNeille completion to find a drawing with the minimum possible number of confluent junctions.
\- \!all \!geom:all \!graph:all \!gdraw \!a:bannister \!c:gd \!p:hard-compact \!y:2011 \!y:2012 \# see "Inapproximability of orthogonal compaction" later for journal version
We show that, for several variants of the problem of compacting a grid drawing of a graph to use the minimum number of rows or minimum area, no good approximation algorithm is possible. We also develop fixed-parameter tractable algorithms and approximation algorithms showing that some of our inapproximability bounds are tight. See the journal version, "Inapproximability of orthogonal compaction", for some improvements and corrections.
\- \!all \!geom:all \!graph:all \!graph:planar \!gdraw \!a:duncan \!a:goodrich \!a:kobourov \!a:loffler \!c:gd \!j:no \!y:2011 \!y:2012
We extend Lombardi drawing (in which each edge is a circular arc and the edges incident to a vertex must be equally spaced around it) to drawings in which edges are composed of multiple arcs, and we investigate the graphs that can be drawn in this more relaxed framework.
\- \!all \!graph:all \!graph:path \!a:bannister \!c:other \!j:no \!y:2011 \!y:2012
The Bellman–Ford algorithm for single-source shortest paths in graphs that may have negatively weighted edges but no negative cycles can be sped up by a technique of Yen in which the graph is partitioned into two directed acyclic subgraphs and edge relaxations alternate between these two subgraphs. We show that choosing this partition randomly gains an additional factor of 2/3 in running time.
\- \!all \!geom:all \!geom:misc \!a:kreveld \!a:speckmann \!a:staals \!c:other \!j:ijcga \!y:2012 \!y:2013 \!y:2015 \# sub to GD 2012 as "Algorithms for grid map layout", rejected \# acc to IJCGA 14 Mar 2015
We study the problem of matching geographic regions to points in a regular grid, minimizing the distance between each region's centroid and the corresponding grid point, and preserving as much as possible the relative orientations between pairs of regions.
\- \!all \!geom:all \!graph:all \!gdraw \!a:bannister \!a:simons \!c:no \!j:jga \!p:inapprox-compact \!y:2012 \# submitted to special issue of JGAA (Marc van Kreveld ed), Nov 2011 \# accepted Feb 2012
This is the journal version of "Hardness of approximate compaction for nonplanar orthogonal graph drawings". It has stronger inapproximability bounds, and more variations of the compaction problem that are hard to approximate. In addition it includes a retraction of a buggy approximation algorithm from the conference version.
\- \!all \!misc \!a:baldi \!a:goodrich \!c:no \!j:no \!y:2011
\- \!all \!geom:all \!geom:misc \!graph:all \!graph:cube \!graph:planar \!a:mumford \!a:speckmann \!a:verbeek \!c:no \!j:sjc \!p:aucrl \!y:2012 \# submitted to SICOMP, May 2011; revision 30 Jan 2012; accept 6 Feb 2012
A combined journal version of "Area-universal rectangular layouts" and "Orientation-constrained rectangular layouts".
\- \!all \!rec \!graph:all \!graph:path \!a:solo \!c:other \!j:no \!y:2012 \# sub to FUN 22 Jan 2012
We find an algorithm for making all possible deductions based on the set of candidate locations for a single digit in a Sudoku puzzle; the problem is NP-hard, and our algorithm takes exponential time, but the mild form of the exponential allows it to be fast for practical problem sizes.
(Slides)
\- \!all \!geom:all \!geom:path \!graph:all \!graph:path \!a:borradaile \!c:cccg \!j:cgta \!y:2012 \!y:2015 \# sub to CGTA 2012? Revised 29 May 2013, accepted 5 Sep 2013
When a planar point set has the property that its Delaunay triangulation has no large angles, we show how to connect it by a plane graph (having linearly many additional Steiner vertices) in which the distances between the original points are approximations to their Euclidean distance, and in which the total graph weight is at most a constant times the minimum spanning tree weight. The time to construct this graph is near-linear, the same as for integer sorting. We use this result to approximate the traveling salesman problem, for these point sets, in the same time bound.
\- \!all \!geom:all \!geom:misc \!a:amato \!a:thomas \!a:yeh \!c:other \!j:no \!y:2012 \# sub to ICRA 2012, Sep. 2011, rejected \# sub to IROS 2012, Mar. 2012, //www.iros2012.org/site/
We use a method based on intersecting obstacles with line segments in order to uniformly sample from obstacle surfaces in the probabilistic roadmap method for robot motion planning.
\- \!all \!geom:all \!geom:circle \!geom:qt \!geom:tri \!a:solo \!c:imr \!j:other \!y:2012 \!y:2014 \# sub to special issue of Engineering with Computers 7 Jan 2013 \# minor revisions 15 Apr 2013
We describe a recursive subdivision of the plane into quadrilaterals in the form of rhombi and kites with 60, 90, and 120 degree angles. The vertices of the resulting quadrilateral mesh form the centers of a set of circles that cross orthogonally for every two adjacent vertices, and it has many other properties that are important in finite element meshing.
(Slides)
\- \!all \!geom:all \!geom:circle \!geom:hyperbolic \!gdraw \!a:solo \!c:other \!j:dcg \!p:lombardi-soap \!y:2012 \!y:2014 \!selected \# submitted combined journal paper to DCG special for SoCG, 26 Aug 2013 \# revised 26 Feb 2014, accepted 8 Jul 2014
This talk and journal paper combines the results from "Planar Lombardi drawings for subcubic graphs" and "The graphs of planar soap bubbles". It uses three-dimensional hyperbolic geometry to define a partition of the plane into cells with circular-arc boundaries, given an input consisting of (possibly overlapping) circular disks and disk complements, which remains invariant under Möbius transformations of the input. We use this construction as a tool to construct planar Lombardi drawings of all 3-regular planar graphs; these are graph drawings in which the edges are represented by circular arcs meeting at equal angles at each vertex. We also use it to characterize the graphs of two-dimensional soap bubble clusters as being exactly the 2-vertex-connected 3-regular planar graphs.
\- \!all \!geom:all \!geom:circle \!geom:hyperbolic \!graph:all \!graph:planar \!gdraw \!a:solo \!c:gd \!p:lombardi-subcubic \!y:2012 \!y:2013
We show that every planar graph of maximum degree three has a planar Lombardi drawing and that some but not all 4-regular planar graphs have planar Lombardi drawings. The proof idea combines circle packings with a form of Möbius-invariant power diagram for circles, defined using three-dimensional hyperbolic geometry.
For the journal version, see "A Möbius-invariant power diagram and its applications to soap bubbles and planar lombardi drawing.".
(Slides)
\- \!all \!geom:all \!graph:all \!gdraw \!a:bannister \!a:goodrich \!a:trott \!c:gd \!j:no \!y:2012 \!y:2013
We extend force-directed methods of graph drawing by adding a force that pulls vertices towards the center of the drawing, with a strength proportional to the centrality of the vertex. Gradually scaling up this force helps avoid the tangling that would otherwise result from its use.
\- \!all \!geom:all \!graph:all \!graph:planar \!gdraw \!pure \!a:brandenburg \!a:gleissner \!a:goodrich \!a:hanauer \!a:reislhuber \!c:gd \!j:no \!y:2012 \!y:2013
A graph is 1-planar if it can be drawn in the plane with at most one crossing per edge, and maximal 1-planar if it is 1-planar but adding any edge would force more than one crossing on some edge or edges. Although maximal 1-planar graphs on n vertices may have as many as 4n − 8 edges, we show that there exist maximal 1-planar graphs with as few as 45n/17 + O(1) edges.
\- \!all \!graph:all \!graph:misc \!a:bannister \!a:dubois \!a:smyth \!c:soda \!j:no \!y:2012 \!y:2013 \# rejected from ESA 2012
We study relational event data in which a collection of actors in a social network have a sequence of pairwise interactions. Contiguous subsequences of these interactions form graphs, and we develop efficient data structures for querying the parameters of these graphs.
\- \!all \!geom:all \!geom:circle \!graph:all \!graph:planar \!gdraw \!pure \!a:solo \!c:scg \!p:planar-soap \!y:2012 \!y:2013 \# rejected from SODA 2013
We characterize the graphs of two-dimensional soap bubble clusters as being exactly the bridgeless 3-regular planar graphs. The proof uses the Möbius invariance of the properties characterizing these clusters together with our previous circle packing method for constructing Lombardi drawings of graphs.
For the journal version, see "A Möbius-invariant power diagram and its applications to soap bubbles and planar lombardi drawing.".
(Slides)
\- \!all \!graph:all \!graph:cube \!pure \!a:solo \!a:wiechert \# yes, both solo and wiechert \!c:no \!j:other \!y:2013 \!y:2014 \# sub to Order, 18 Jan 2011 \# req major revision, 9 Dec 2011 \# revised 29 Jan 2012 and again 23 Feb 2013
We generalize the 1/3-2/3 conjecture, according to which every partial order should have a pair of items that are nearly equally likely to appear in either order in a random linear extension, to antimatroids, and we prove it for several specific types of antimatroid.
\- \!all \!graph:all \!graph:misc \!pure \!a:solo \!c:no \!j:other \!y:2013 \!y:2014 \# sub to WADS13, rejected \# sub to SIDMA 17 Apr 2013, rejected \# sub to EJC 6 Nov 2013, rev 19 Jul 2014, acc w/minor rev & 2nd rev 24 Jul
We give tight bounds on the size of the largest remaining grid minor in a grid graph from which a given number of vertices have been deleted, and study several related problems.
\- \!all \!misc \!edu \!a:goodrich \!a:hirschberg \!c:wads \!y:2013
We study the problem of distinguishing workers (people who complete their assigned tasks) from slackers (people who do not contribute towards the completion of their tasks) by grouping people in pairs and assigning a task to each group.
\- \!all \!graph:all \!graph:planar \!geom:all \!gdraw \!a:bannister \!a:cabello \!c:wads \!j:no \!y:2013
We show that testing whether a graph is 1-planar (drawable with at most one crossing per edge) may be performed in polynomial and fixed-parameter tractable time for graphs of bounded circuit rank, vertex cover number, or tree-depth. However, it is NP-complete for graphs of bounded treewidth, pathwidth, or bandwidth.
(Slides)
\- \!all \!graph:all \!graph:cube \!edu \!a:albert \!a:doble \!a:falmagne \!a:hu \!y:2013
This edited volume collects experiences with automated learning systems based on the theory of knowledge spaces, and mathematical explorations of the theory of knowledge spaces and their efficient implementation.
\- \!all \!graph:all \!graph:cube \!edu \!a:solo \!y:2013 \j:no \!c:no
We show how to represent a learning space by a small family of learning sequences, orderings of the items in a learning sequence that are consistent with their prerequisite relations. This representation allows for the rapid generation of the family of all consistent knowledge states and the efficient assessment of the state of knowledge of a human learner.
\- \!all \!graph:all \!graph:cube \!edu \!a:solo \!y:2013 \j:no \!c:no
In another chapter of the same book we used learning sequences to represent learning spaces and perform efficient knowledge assessment of a human learning. In this chapter we show how to use the same data structure to build learning spaces on a sample of the items of a larger learning space (an important subroutine in knowledge assessment) and to modify a learning space to more accurately model students.
\- \!all \!graph:all \!geom:all \!gdraw \!a:solo \!j:no \!c:other \!y:2013
(Slides)
\- \!all \!compress \!geom:all \!geom:misc \!a:goodrich \!a:simons \!c:cccg \!j:no \!y:2013 \# rejected from ICALP'11, ESA'11, WADS'11, SODA'12, ESA'12, ISAAC'12
We show how to use invertible Bloom filters as part of range searching data structures that determine the differences between the members of two sets that lie in a given query range.
(Slides)
\- \!all \!graph:all \!graph:planar \!geom:all \!gdraw \!pure \!a:angelini \!a:frati \!a:kaufmann \!a:lazard \!a:mchedlidze \!a:teillaud \!a:wolff \!c:cccg \!j:jga \!y:2013 \!y:2014 \# sub JGAA October 2013; Revised and accepted April 2014
For every positive integer n, there exists a set of n points on a parabola, with the property that every n-vertex planar graph can be drawn without crossings with its vertices at these points and with its edges drawn as circular arcs.
(Slides)
\- \!all \!geom:all \!graph:all \!gdraw \!a:bannister \!a:simons \!c:gd \!j:no \!y:2013 \# sub to GD 2012, rejected, significantly rewritten since \# sub to GD 2013
Many real-world graphs are k-almost-trees for small values of k: graphs in which, in every biconnected component, removing a spanning tree leaves at most k edges. We use kernelization methods to show that in such graphs, the 1-page and 2-page crossing numbers can be computed quickly.
\- \!all \!geom:all \!graph:all \!graph:planar \!gdraw \!pure \!a:bannister \!a:cheng \!a:devanny \!c:gd \!j:jga \!y:2013 \!y:2014 \# sub to JGAA special issue 13 Dec 2013; revised 15 Mar 2014
A superpattern of a set of permutations is a permutation that contains as a pattern every permutation in the set. Previously superpatterns had been considered for all permutations of a given length; we generalize this to sets of permutations defined by forbidden patterns; we show that the 213-avoiding permutations have superpatterns half the length of the known bound for all permutations, and that any proper permutation subclass of the 213-avoiding permutations has near-linear superpatterns. We apply these results to the construction of universal point sets, sets of points that can be used as the vertices of drawings of all n-vertex planar graphs. We use our 213-avoiding superpatterns to construct universal sets of size approximately n2/4, and we also construct near-linear universal sets for graphs of bounded pathwidth.
\- \!all \!geom:all \!graph:all \!graph:planar \!gdraw \!rec \!a:solo \!c:gd \!j:jga \!y:2013 \!y:2014 \# sub to JGAA special issue 12 Dec 2013, revised 20 Feb 2014
The planarity game involves rearranging a scrambled line arrangement graph to make it planar. We show that the resulting graphs have drawings in grids of area n7/6, much smaller than the quadratic size bound for grid drawings of planar graphs, and we provide a strategy for planarizing these graphs that is simple enough for human puzzle solving.
\- \!all \!geom:all \!geom:circle \!graph:all \!graph:planar \!gdraw \!a:holten \!a:loffler \!a:nollenburg \!a:speckmann \!a:verbeek \!c:gd \!j:jocg \!y:2013 \!y:2016 \# sub to GD 2013 \# sub to JoCG, 24 Aug 2014
A confluent drawing of a graph is a set of points and curves in the plane with the property that two vertices are adjacent in the graph if and only if the corresponding points can be connected to each other by smooth paths in the drawing. We define a variant of confluent drawing, strict confluent drawing, in which a smooth path between two vertices (if it exists) must be unique. We show that it is NP-complete to test whether such drawings exist, in contrast to unrestricted confluence for which the complexity remains open. Additionally, we show that finding outerplanar drawings (in which the points are on the boundary of a disk and the curves are interior to it) with a fixed cyclic vertex ordering can be performed in polynomial time. We use circle packings to find nice versions of these drawings in which all tracks are represented by piecewise-circular curves.
\- \!all \!geom:all \!geom:hyperbolic \!graph:all \!gdraw \!a:vangarderen \!a:speckmann \!a:ueckerdt \!c:gd \!j:sub \!y:2013 \!y:2016 \# submitted to Ars Math Contemp 6 Oct 2014
We show that every outerplanar weak pseudoline arrangement (a collection of curves topologically equivalent to lines, each crossing at most once but possibly zero times, with all crossings belonging to an infinite face) can be straightened to a hyperbolic line arrangement. As a consequence such an arrangement can also be drawn in the Euclidean plane with each pseudoline represented as a convex piecewise-linear curve with at most two bends. In contrast, for arbitrary pseudoline arrangements, a linear number of bends is sufficient and sometimes necessary.
\- \!all \!geom:all \!graph:all \!gdraw \!pure \!a:bannister \!a:devanny \!c:other \!j:no \!y:2013 \!y:2014
We construct small universal point sets for dominance drawings of classes of acyclic graphs, by finding forbidden patterns in the permutations determined by these drawings and proving the existence of small superpatterns for the permutations with these patterns forbidden. In particular, dominance drawings of the Hasse diagrams of width-2 partial orders have universal point sets of size O(n3/2), derived from superpatterns of the same size for the 321-avoiding permutations, and dominance drawings of st-planar graphs have universal point sets of size O(n log n), derived from superpatterns for riffle shuffles.
\- \!all \!a:solo \!c:other \!graph:all \!graph:cube \!j:no \!y:2014
This talk surveys my work on rectangular cartograms, the 1/3-2/3 conjecture for antimatroids, and flip distance for triangulations of point sets with no empty pentagon, and how this line of research stemmed from the work of Jean-Claude Falmagne on learning spaces.
\- \!all \!a:aronov \!a:deberg \!a:roeloffzen \!a:speckmann \!c:other \!j:cgta \!y:2014 \!y:2016
We use quadtrees to handle point location queries in an amount of time that depends on the distance of the query point to the nearest region boundary.
\- \!all \!exponential \!graph:all \!graph:sgi \!a:loffler \!a:strash \!c:no \!j:other \!p:clique-journal \!y:2013 \# sub to JEA special for SEA 16 Aug 2011, rev 7 Nov 2013, acc 11 Nov 2013
This paper combines our theoretical results on clique-finding algorithms from ISAAC 2010 with our experimental results on the same algorithms from SEA 2011.
\- \!all \!misc \!a:goodrich \!a:mitzenmacher \!a:pszona \!c:other \!j:no \!y:2014
We study cuckoo hashing data structures in a model of flash memory in which each memory cell has a limited number of times it can be changed, so the goal is to prevent hot spots that change many times.
\- \!all \!graph:all \!graph:misc \!a:mccarthy \!a:parrish \!c:other \!j:other \!y:2014 \!y:2015
This paper reports on an implementation of an algorithm for constructing the configuration space of two-dimensional linkages with one degree of freedom.
(eScholarship conference version -- eScholarship journal version)
\- \!all \!graph:all \!graph:planar \!graph:sgi \!gdraw \!a:borradaile \!a:zhu \!c:gd \!j:jga \!y:2014 \!y:2015
We investigate the number of vertices that must be deleted from an arbitrary graph, in the worst case as a function of the number of edges, in order to planarize the remaining graph. We show that m/5.22 vertices are sufficient and m/(6 − o(1)) are necessary, and we also give bounds for the number of deletions needed to achieve certain subclasses of planar graphs.
\- \!all \!geom:all \!geom:circle \!graph:all \!gdraw \!a:bannister \!a:devanny \!a:goodrich \!c:gd \!j:jga \!y:2014 \!y:2015 \# sub to JGAA (special issue for GD) 31 Oct 2014
We show that many standard graph drawing methods have algebraic solutions described by polynomials that can have unsolvable Galois groups, and that can have Galois groups whose order is divisible by large prime numbers. As a consequence certain models of exact algebraic computation are unable to construct these drawings.
\- \!all \!geom:all \!graph:all \!gdraw \!a:bannister \!c:gd \!j:no \!y:2014
We show how to express in monadic second-order logic the problems of drawing a graph with a fixed number of crossings on a one or two page book layout. By applying Courcelle's theorem, we obtain fixed-parameter tractable algorithms for these problems, parameterized by treewidth.
\- \!all \!geom:all \!geom:circle \!graph:all \!graph:planar \!gdraw \!a:alam \!a:goodrich \!a:kobourov \!a:pupyrev \!c:gd \!j:no \!y:2014 \# sub JoCG 15 Mar 2016, rejected
The balanced circle packings of the title are systems of interior-disjoint circles, whose tangencies represent the given graph, and whose radii are all within a polynomial factor of each other. We show that these packings always exist for trees, cactus graphs, outerpaths, k-outerplanar graphs of bounded degree when k is at most logarithmic, and planar graphs of bounded treedepth. The treedepth result uses a new construction of inversive-distance circle packings.
\- \!all \!geom:all \!graph:all \!graph:planar \!gdraw \!a:abel \!a:demaine \!a:mdemaine \!a:lubiw \!a:uehara \!c:gd \!j:sub \!y:2014 \# sub to JoCG 11 Jan 2015; revised Jul 2016
Given a plane graph with fixed edge lengths, and an assignment of the angles 0, 180, and 360 to the angles between adjacent edges, we show how to test whether the angle assignment can be realized by an embedding of the graph as a flat folding on a line. As a consequence, we can determine whether two-dimensional cell complexes with one vertex can be flattened. The main idea behind the result is to show that each face of the graph can be folded independently of the other faces.
\- \!all \!graph:all \!graph:path \!kbest \!a:solo \!y:2014 \!y:2015
A brief survey of algorithms for finding the k shortest paths and related k-best enumeration problems. The arXiv/EATCS version is significantly longer and with more references than the Springer version.
\- \!all \!misc \!a:cheng \!c:other \!j:no \!y:2014 \# sub to ICALP, 13 Feb 2014, rejected \# sub to ISAAC, 17 Jun 2014
We consider a broad class of highest averages methods for proportional allocation (the problems of allocating seats to parties after a parliamentary election, or of allocating congressmen to states based on total population). We show that these methods can be simulated by an algorithm whose running time is proportional only to the number of parties or states, independent of the number of seats allocated or the number of voters.
\- \!all \!graph:all \!graph:color \!geom:all \!geom:misc \!a:ballinger \!a:damian \!a:flatland \!a:ginepro \!a:hull \!c:soda \!j:no \!y:2014 \!y:2015
A forcing set for an origami crease pattern is a subset of the folds with the property that, if these folds are folded the correct way (mountain vs valley) the rest of the pattern also has to be folded the correct way. We use a combinatorial equivalence with three-colored grids to construct minimum-cardinality forcing sets for the Miura-ori folding pattern and for other patterns with differing folds along the same line segments.
(Slides)
\- \!all \!geom:all \!geom:misc \!a:demaine \!a:hesterberg \!a:ito \!a:lubiw \!a:uehara \!a:uno \!c:other \!j:other \!y:2014 \!y:2015 \!y:2016 \# submitted to special issue JDA for WALCOM, 15 Mar 2015
If a folding pattern for a flat origami is given, together with a mountain-valley assignment, there might still be multiple ways of folding it, depending on how some flaps of the pattern are arranged within pockets formed by folds elsewhere in the pattern. It turns out to be hard (but fixed-parameter tractable) to determine which of these ways is best with respect to minimizing the thickness of the folded pattern.
\- \!all \!graph:all \!graph:planar \!a:borradaile \!a:nayyeri \!a:wulffnilsen \!c:scg \!j:no \!y:2014 \!y:2016 \# rejected from SODA 2015 and STOC 2015; submitted to FOCS 2015
We give the first known near-linear algorithms for constructing Gomory–Hu trees of bounded-genus graphs, and we shave a log off the time for the same problem on planar graphs.
\- \!all \!graph:all \!graph:misc \!a:bannister \!a:devanny \!c:no \!j:no \!y:2014 \# rejected from SODA 2015, STOC 2015, and COLT 2015
ERGMs (exponential random graph models) are used in social science to describe probability distributions on graphs that are supposed to mimic real-world social networks. However, we show that (with features that are standard in the social science application) the distributions given by these models can be computationally infeasible to sample from or to approximate the probability of seeing a given graph.
\- \!all \!graph:all \!geom:all \!graph:planar \!gdraw \!a:alam \!a:kaufmann \!a:kobourov \!a:pupyrev \!a:schulz \!a:ueckerdt \!c:wads \!j:no \!y:2015 \# rejected from SODA 2015 and SoCG 2015; sub WADS 2015
We study the graphs formed by non-crossing circular arcs in the plane, having a vertex for each arc and an edge for each point where an arc endpoint touches the interior of another arc.
(Slides)
\- \!all \!graph:all \!graph:planar \!a:solo \!c:no \!j:jga \!y:2015 \!y:2016 \# was intended for Halin special issue before Bandelt lost control of that \# submitted to JGAA 17 Nov 2015, revised 16 May 2016
We describe and implement a simple linear time algorithm for recognizing Halin graphs based on two simplifications of triples of degree-three vertices in such graphs. Removing some auxiliary data from the algorithm causes it to recognize a broader class of graphs that we call the D3-reducible graphs. We study the properties of these graphs, showing that they share many properties with the Halin graphs.
\- \!all \!geom:all \!geom:misc \!geom:dyn \!a:bokal \!a:cabello \!c:scg \!j:no \!y:2015 \# sub to SoCG 2015
We study problems in which the input is a sequence of points in the plane and we wish to find, for each position in the sequence, the longest contiguous subsequence that begins at that position and has some geometric property. For many natural properties we can find all such maximal subsequences in linear or near-linear time.
(Slides)
\- \!all \!graph:all \!graph:path \!a:mccarthy \!a:parrish \!c:wads \!j:sub \!y:2015 \# rejected from SODA 2015; submitted to WADS 2015 \# submitted to ACM TALG 6 Jul 2016, rejected 2 Jan 2017 \# submitted to JGAA 9 Feb 2017
We consider the problem of finding a cycle basis for a graph in which all basis cycles contain a specified edge. We characterize the graphs having such a basis in terms of their vertex connectivity, we show that the minimum weight cycle basis with this constraint can be found in polynomial time and is weakly fundamental, and we show that finding a fundamental cycle basis with this constraint is NP-hard but fixed-parameter tractable.
(Slides)
\- \!all \!graph:all \!geom:all \!param \!a:solo \!c:wads \!j:sub \!y:2015 \# sub TALG 17 Aug 2016
We consider the minimum weight closure problem for a partially ordered set whose elements have weights that vary linearly as a function of a parameter. For several important classes of partial orders the number of changes to the optimal solution as the parameter varies is near-linear, and the sequence of optimal solutions can be found in near-linear time.
(Slides)
\- \!all \!graph:all \!graph:misc \!a:solo \!c:no \!j:jga \!y:2015
We prove that when a graph of bounded size has its edges subdivided to form a larger graph, it is still possible to find its metric dimension by a fixed-parameter tractable algorithm, parameterized by the pre-subdivision size of the graph.
\- \!all \!geom:all \!geom:misc \!a:aichholzer \!a:biro \!a:demaine \!a:mdemaine \!a:fekete \!a:hesterberg \!a:kostitsyna \!a:schmidt \!c:cccg \!j:sub \!y:2015 \# sub IJCGA 2 Feb 2017
We classify the polyominoes that can be folded to form the surface of a cube or polycube, in multiple different folding models that incorporate the type of fold (mountain or valley), the location of a fold (edges of the polycube only, or elsewhere such as along diagonals), and whether the folded polyomino is allowed to pass through the interior of the polycube or must stay on its surface.
\- \!all \!graph:all \!gdraw \!a:dujmovic \!a:wood \!c:gd \!j:sub \!y:2015 \# sub to SIDMA 22 Feb 2016, revised 14 Sep 2016
The Graph Drawing version used the alternative title "Genus, treewidth, and local crossing number". We prove tight bounds on the treewidth of graphs embedded on low-genus surfaces with few crossings per edge, and nearly tight bounds on the number of crossings per edge for graphs with a given number of edges embedded on low-genus surfaces.
(Slides)
\- \!all \!graph:all \!gdraw \!a:bannister \!a:devanny \!a:dujmovic \!a:wood \!c:gd \!j:no \!y:2015 \!y:2016 \# submitted to GD 2015, rejected; refactored and resub GD 2016
We introduce the concept of a layered path decomposition, and show that the layered pathwidth can be used to characterize the leveled planar graphs. As a consequence we show that finding the minimum number of tracks in a track layout of a given graph is NP-complete. The GD version includes only the parts concerning track layout, and uses the title "Track Layout is Hard".
\- \!all \!geom:all \!geom:misc \!graph:all \!graph:path \!a:har-peled \!a:sidiropoulos \!c:no \!j:no \!y:2015 \# rejected from SODA 2015, STOC 2015, SODA 2016, and ICALP 2016
We provide fast approximation algorithms for the farthest-first traversal of graph metrics.
\- \!all \!geom:all \!geom:misc \!a:abel \!a:cantarella \!a:demaine \!a:hull \!a:ku \!a:lang \!a:tachi \!c:no \!j:jocg \!y:2015 \!y:2016 \# submitted to DCG 7/15, reject 10/15; sub JoCG 11/15, acc 04/16
We give an exact characterization of the one-vertex origami folding patterns that can be folded rigidly, without bending the parts of the paper between the folds.
\- \!all \!graph:all \!gdraw \!a:bannister \!a:brown \!c:gd \!j:no \!y:2015
We describe a system for transforming context-free grammars into human-readable syntax diagrams, including optimizations that change the structure of the grammar to make it more readable without affecting the language described by the grammar.
\- \!all \!graph:all \!graph:planar \!geom:all \!gdraw \!a:solo \!c:soda \!j:no \!y:2015 \!y:2016
We describe a class of polytopes of varying dimensions, whose restriction to three dimensions is the class of roofless polyhedra (Halin graphs). We call these polytopes treetopes. We show that the four-dimensional treetopes are closely related to clustered planar graph drawings, and we use this connection to recognize the graphs of four-dimensional treetopes in polynomial time.
(Slides)
\- \!all \!graph:all \!graph:planar \!a:kindermann \!a:kobourov \!a:liotta \!a:lubiw \!a:maignan \!a:mondal \!a:vosoughpour \!a:whitesides \!a:wismath \!c:other \!j:sub \!y:2015 \!y:2016 \# sub to WG 2015, ISAAC 2015, LATIN 2016 \# sub to Algorithmica special issue June 30 2016
We study the problem of splitting the vertices of a given graph into a bounded number of sub-vertices (with each edge attaching to one of the sub-vertices) in order to make the resulting graph planar. It is NP-complete, but can be approximated to within a constant factor, and is fixed-parameter tractable in the treewidth.
(Slides)
\- \!all \!misc \!a:hirschberg \!c:other \!j:sub \!y:2015 \!y:2016 \# submitted to Algorithmica 28 Jul 2016
We provide upper and lower bounds on the query complexity of a problem in which the input is a collection of two-colored items, and the problem is to either find an item of the majority color or to determine that there is no majority, by performing queries that determine the discrepancy of fixed-size subsets of the items.
(Slides)
\- \!all \!misc \!a:solo \!c:swat \!j:no \!y:2016
A cuckoo filter is an approximate set data structure that can be used in place of a Bloom filter, but with several practical advantages: it uses less space, has better locality of reference, and can handle element deletions. We provide the first theoretical analysis of a simplified variation of cuckoo filters, showing that these advantages can be guaranteed to hold theoretically and not just experimentally.
(Slides)
\- \!all \!graph:all \!graph:misc \!a:devanny \!a:tilman \!c:other \!j:no \!y:2016
The dK-series is an extension of the degree sequence of a graph to a d-dimensional tensor, describing the number of d-tuples of vertices with each possible combination of degrees and adjacencies. As we show, it is NP-hard to determine whether such a tensor represents a valid graph, for any d ≥ 3, or for d = 2 if the number of triangles in the graph is also specified (or constrained to be zero).
\- \!all \!graph:all \!graph:misc \!a:goodrich \!a:lam \!a:mamano \!a:mitzenmacher \!a:torres \!c:other \!j:no \!y:2016 \# rejected from Financial Crypto 2016
We show how to modify a small number of edges in a large social network in order to make the modified copy easy to identify, even if an adversary tries to hide the modification by permuting the vertices and flipping a much larger number of edges. The result depends on the random fluctuation of vertex degrees in such networks, and the ability to uniquely identify vertices by their adjacencies to a small number of high-degree landmark vertices. This paper won the best student paper award at ISC for its student co-authors Lam, Mamano, and Torres.
\- \!all \!geom:all \!geom:circle \!a:solo \!c:cccg \!j:sub \!y:2016 \# sub JoCG 26 Aug 2016; returned "resubmit for review" 24 Dec 2016
We show how to find a system of disjoint balls with given centers, maximizing the sum of radius of the balls. Our algorithm takes cubic time in arbitrary metric spaces and can be sped up to subquadratic time in Euclidean spaces of any bounded dimension.
(Slides)
\- \!all \!misc \!a:besa \!a:devanny \!a:goodrich \!c:other \!j:no \!y:2016 \# sub ATMOS 14 Jun 2016
We consider a model of vehicle scheduling in which vehicles arrive at an intersection in indivisible platoons (or individual vehicles of variable length) and the goal is to find a schedule for them to all cross the intersection without collisions, minimizing the maximimum delay incurred by any platoon. We show that for many types of intersections, an optimal schedule can be found in polynomial time by a combination of dynamic programming and parametric search.
\- \!all \!geom:all \!geom:mst \!a:biniaz \!a:bose \!a:maheshwari \!a:morin \!a:smid \!y:2016 \# sub Algorithmica 9 Nov 2016
\- \!all \!graph:all \!graph:path \!kbest \!a:kurz NOT YET SET UP! \!c:sub \!j:no \# sub STOC 2017 \-
\- \!all \!geom:all \!geom:misc \!a:deberg \!a:cabello \!a:cheong \!a:knauer \!c:sub \!j:no \!y:2016 \# sub SoCG 2017
\- \!all \!geom:all \!geom:misc \!a:goodrich \!c:sub \!j:no \# sub SoCG 2017 \-
\- \!all \!graph:all \!graph:sgi \!a:goodrich \!a:mitzenmacher \!a:torres \!c:sub \!j:no \# sub PODS 2017 \-
\- \!all \!geom:all \!geom:nn \!a:goodrich \!a:mamano \!c:no \!j:no \# rejected from ALENEX 2017 \-
\- \!all \!graph:all \!graph:path \!geom:all \!geom:path \!a:gupta NOT YET SET UP! \!c:no \!j:no \# rejected from ACM SIGSPATIAL 2016 \-
\- \# finish off list of papers, if keyword was one that included some papers \+ \!top \!geom \!auth \!graph \!subj \!year \!conf \!jour
\- \!a:* Co-authors -- \- \!geom:* Geometry -- \- \!c:* Conferences -- \- \!j:* Journals -- \- \!y:* Years -- \- \!graph:* Graph Theory -- \+ \!top Publications -- \!top David Eppstein -- Theory Group -- Inf. & Comp. Sci. -- UC Irvine
Semi-automatically filtered from a common source file.


Safety Phrases：Check the visit url to open the secondary verification.
Do not install any browser plug-ins that are claimed and related.
Don’t reveal password information and Google verification codes and Google keys to anyone.
Don't transfer money to anyone who claims to be a staff member.
Be sure to pay attention to safety and protect yourself.
Please do not disclose SMS and verification code to anyone, including customer service.
Security Level
:| Login Type | Time | IP Address | Location |
|---|


Switch
Switch
Switch
Switch (checked)
Switch (disabled)
Switch (disabled, checked)
Switch state:
false


You will now have the ability to push your git repository to an external git provider. Most commenly used https://github.com. You have to create an account and a new repository with the same name. Once this is done you are ready to push your repository to the external provider.
You can try by typing:git push


Home
Projects
About
Other
Blog Header
P
lease be patient. Images, titles, and other design elemts are still in the works!
Entry Title
Date of Entry


package moleculesampleapp
- Alphabetic
- Public
- All
Type Members
-
class
MoleculeSampleApp
extends Application
The
MoleculeSampleApp
class illustrates the creation of 3D objects (a representation of a Hydrogen molecule) as well as how to rotate them using the mouse.The
MoleculeSampleApp
class illustrates the creation of 3D objects (a representation of a Hydrogen molecule) as well as how to rotate them using the mouse. It support the following keyboard commands as well: 'V' toggles the visibility of the Hydrogen molecule, 'X' toggles the visibility of the coordinate axes, 'Z' restores original locations. -
class
Xform
extends Group
The
Xform
class supports custom transforms (Translate, Rotate and Scale).
Value Members
-
object
MoleculeSampleApp
The
MoleculeSampleApp
object is used to launch the javafx application. -
object
PerspectiveCamera
The
PerspectiveCamera
object provides factory methods for building cameras. -
object
PhongMaterial
The
PhongMaterial
object provides factory methods for building materials shaded according the Phong reflection model. -
object
RotateOrder
extends Enumeration
The
RotateOrder
object enumerates possible rotation orders, e.g., XYZ mean rotate on x-axis, then y-axis and then on z-axis.


Login
Register
Log in
Email address
Password
Log in
Log in with Facebook
Register
Email address
Password
Confirm Password
Register


Icons are used throughout the UI to save space, allow for visual clarity and focus, and for fun. Icons can
be used adaptively
if desired, but at this point they are used more as visual elements within other components.
<fd-icon>
The inputs for fd-icon
will be translated into classes attributed to fiori-fundamentals
guidelines.
For example:
if it is passed accept
for glyph the class sap-icon--accept
will be added to the
element.
if it is passed xs
for size the class sap-icon--xs
will be added to the element.
Extensibility
The icon implementation allows certain extensibility in terms of options for the inputs. fd-icon
inputs doesn't have a restriction for the predefined values.
The predefined values for the input size
are xs
, s
, l
, xl
,
but size
can accept any other string, for example xxs
, which will be translated into class
sap-icon--xxs
.


Legion Overlay Cliques example
This page contains examples of using the Legion framework.
Warning! This page is currently being worked on.
Usage
var options = { clientID: randInt(1000, 9000), overlayProtocol: {type: CliquesOverlay} }; var objectStore, map; var legion = new Legion(options); legion.overlay.setOnChange(function(change, peerIds, serverIds){ if(map) map.set(clientID, {peers: peerIds, servers: serverIds}); }); legion.join(); legion.onJoin(function () { objectStore = legion.getObjectStore(); map = objectStore.get("overlay_map", Legion.OPERATIONS_Map); map.setOnStateChange(function (updates, meta) { resetGraph(map.asArray()); }); }
Network
Both buttons start a client in this browser tab. Only the first button keeps networking visualization active. If you wish to run multiple clients it is suggested to run with no visualization in the other tabs.


Jeep Wrangler
Comprar
€ 150,000
Dodge Challenger
Comprar
€ 139,000
Ford Mustang
Comprar
€ 123,000
This is a wider card with supporting text below as a natural lead-in to additional content. This content is a little bit longer.
This is a wider card with supporting text below as a natural lead-in to additional content. This content is a little bit longer.
This is a wider card with supporting text below as a natural lead-in to additional content. This content is a little bit longer.


Scientific Advisory Board
The Ensembl Genomes project receives advice and guidance from our Scientific Advisory Board (SAB). Our current SAB members are:
- Anne-Francoise Adam-Blondin, URGI, INRA, France
- Mario Caccamo, National Institute for Agronomical Botany, UK
- Dick de Ridder, University of Wageningen, NL (chair)
- Alexander Goesmann, Juastus Liebig University, Giessen, Germany
- Inge Jonassen, University of Bergen, Norway
- Mara Lawinczak, Sanger Institute, UK
- Claudine Medigue, Genoscope, Evry, France
- Jason Staijich, University of Riverside, USA
We thank the previous members of the Ensembl Genomes SAB for their contributions to the project:
- Detlev Arendt, EMBL, Heidelberg, Germany
- Michael Bevan, John Innes Institute, Norwich, UK
- Michele Clamp, Bioteam, Boston, USA
- Martin Donnelly, University of Liverpool, UK
- Michael Eisen, University of California, Berkeley, USA
- Klaus Mayer, Helmholtz Institute, Munich, Germany
- Allison Miller, University of St. Louis, USA
- Rolf Mueller, Helmholtz Institute, Bonn, Germany
- Stephen Oliver, University of Cambridge, UK
- Julian Parkhill, Wellcome Trust Sanger Institute, Hinxton, UK
- Chris Rawlings, Rothamsted Research, UK
- Jane Rogers, The Genome Analysis Centre, Norwich, UK
- Denis Tagu, INRA, Rennes, France
- Doreen Ware, Cold Spring Harbor Laboratory, USA