W3C | TAG | www-tag | Agenda
(Member)
Minutes of 16 Jan 2003 discussion on Linking in XML Documents
Participants: Stuart Williams (Chair), Liam Quin, Henry Thompson, Steven
Pemberton, Lloyd Rutledge, Paul Grosso, Tantek Çelik, Jonny Axelsson, Brad
Porter, Micah Dubinko, Tim Bray, Ian Jacobs, Tim Berners-Lee, Norm
Walsh, Chris Lilley, Ian
Jacobs (Scribe)
This meeting was organized as part of discussion of TAG issue xlinkScope-23: What
is the scope of using XLink?
Minutes
- [Ian]
- PG: We should ask ourselves whether links are primitive things or
less primitive (like style). Depending on whether links are
"style-ish", then I think it makes sense to have a language that
applies link-ness. If not, then it makes more sense to have links
hardwired (i.e., in namespace)
- TÇ: I think there's a little of both...both presentation and
fundamental semantics in linking. Some semantics may also depend on the
language instance.
- [TB agrees with TÇ]
- TB: I'd probably be uncomfortable with moving linking info to
external resources (i.e., not right inline)
- HT: Linking semantics is attributed, not intrinsic. Linking is
low-level, but attributed and at user option. Close parallel to
"id-ness" and binding to the letters "I-D".
- [TBray]
- hmm... <img src= is by default on, although in principle at user
option
- [Ian]
- HT: I think that some form of explicit signal is required that
something is a link. A lightweight signal is important. I have a
serious allergy to yet-another-little-language. Whether hidden in a
process inst. or in another doc. Let's use existing languages.
- [Zakim]
- Liam, you wanted to suggest 3 kinds of link, and we don't need to
solve all 3
- [Ian]
- LQ: definitions
- Two or more resources are linked if there's a relationship
between (among) them.
- A "displayed link" is a rendered link.
- A "markup link" is a way of representing a link in markup
(whether explicit or deduced).
- LQ: We don't have to solve all possible ways of deducing links.
- Micah: XForms philosophy regarding author's intent; important to
capture intent in markup. Details like "has to happen on load" is more
related to presentation.
- [Ian]
- TÇ: If something is likely to require
changes for different devices, media,
or users, that is likely to be presentational and should be considered
separate from "content".
- [TBray]
- what Tantek said
- [Tantek]
- Concept: if something is likely to require changes for different
devices, different media, or different users due to disabilities, that
something is very likely presentational, and should remain separate and
distinct from the markup of content.
- [Zakim]
- TimBL, you wanted to suggest a tire hanging from the branch
- [Ian]
- TBL: We need to have a simple solution for authors (e.g., authors
used to HTML). There needs to be a very simple core. No levels of
indirection unless we need them.
- BP: On content v. presentation - In the voice dialog, the active
linking is not exposed to the user at all from a presentation
standpoint. The fact that the user may link between two locations is
transparent to the user. There are other ways to associate resources;
does linking include all mechanisms?
- [ht]
- browsing isn't the only application, and follow-me isn't the only
semantics
- [Zakim]
- TBray, you wanted to ask for briefing on state of discussion in HTML
WG and which direction they think HTML ought to go (after this
thread)
- [Ian]
- TB: HTML WG has a special status, IMO, since HTML so widely
deployed.
- SP: XHTML 2.0 has basically two attributes: (1) href-style and (2)
embedding. The way the xhtml family is designed, another module could
come along and want to add its own linking attributes.
- TB: Do you see urgently needed addition to linking semantics from
xhtml 1.*?
- SP: Fine for the present.
- SW: Relaxed backwards compatibility constraints and impact on this
context?
- SP: Our objections to using XLink were not related to backwards
compatibility.
- LR: The backwards compatibility issue is multiple attributes that
relate to linking. Hard to deprecate due to current deployment. We have
deprecated esoteric features. Primary structural challenge to bringing
XLink into XHTML 2.0 is multiple linking attributes.
- [Zakim]
- TimBL, you wanted to say that from my personal point of view, this
meeting needs to resolve linking from the user experience.
- [Ian]
- TBL: I consider this meeting to be focused on links that are in and
out of user experience. I'm less interested here in general
relationships between resources; out of scope.
- NW: I agree with TBL on scope here: user experience.
- [Zakim]
- Ht, you wanted to say that making easy things easy is fine but hard
things have to be possible
- [Ian]
- HT: Outline of a partial solution: (a) Simple things should be simple
and should stay as simple as
html:a
. (b) I have no problem
with a design that grandfathers in a bare-minimum syntax to allow old
syntax. I think not simple if each WG redefines attribs in local
namespace with same name and semantics. Some grandfathering is good.
XLink should have predefined a linking element. I don't want to see the
multi-ended solution, for links with more complexity, to be completely
divorced from that story. At the end of the day, we may agree that new
infoset properties are the right way to merge the stories we need to
accommodate.
- TB: Another xlink change suggestion: infer xlink type attribute to
reduce verbosity.
- [ht]
- HT endorses TB's suggestion
- [Ian]
- TB: On the question of multiple attributes with linking semantics -
there are some strong motivators for using elements instead when
multiple links required.
- MD: Some complex stuff may not need standardization.
- See Tim
Bray email on inference of xlink:type.
- [Tantek]
- IMHO User experience aspect includes two things: ease or authoring /
usability, and presentation. Current generic solutions are poor
at both. In terms of ease of authoring, the syntactic vinegar and markupJunk
problem has already been documented.
- [ht]
- I agree that committing to supporting multiple attribute-based links
on one element is a corner case that should not be allowed to drive the
solution
- [Tantek]
- In terms of presentation, taking in mind my above straw concept
about separation of presentation and markup, the current generic
solution fails very badly by mixing in linking presentation and linking
semantics. The show and actuate attributes being the prime
offenders.
- [Zakim]
- Steven, you wanted to address attribute/element question
- [Ian]
- SP regarding element approach to multiple links: We should have
solutions that suit various people's style of markup.
- LR: Perhaps we can have a simple xlink attribute, or to provide
guidance on what to do when there are multiple attribs on same element
that have linking semantics. Not sure that always having multiple link
attribs always a problem.
- [Zakim]
- Ht, you wanted to disagree about multiple flowers
- [Ian]
- HT: Design should not try to be all things to all people.
- [steven]
- Not necessarily, but should attempt
- [mdubinko]
- <image src="some URI" href="some URI"/>
- [Ian]
- HT: Corner case of multiple attributes with link semantics on same
element should not drive design.
- SP: I didn't suggest that it should.
- HT: But it may.
- [TBray]
- Just for the record: I am prepared to argue that multiple-attribute
inevitably brings up serious design problems
- [Ian]
- NW: I think 1000-flowers approach not best here. I think there are
some simple linking semantics that are well-entrenched in the Web. I'd
rather see a simple core that will work for the most common use
cases.
- [mdubinko]
- Ian, Norm was referring to my earlier comments: 'simple core applies
horizontally, app-specific markup for vertical bits'
- [steven]
- Designing around half the world's needs will guarantee problems
- [Ian]
- SW: If we ask another group to do more work in this space, what would
we be asking them to address?
- TB notes that XLink WG has closed.
- [jax]
- Adding to the multiple link scenario; HTML 4 example with longdesc
and src
- [TBray]
- jax, I think the src/longdesc design is a real problem, starting with
i18n issues
- [Ian]
- LR: The choice of group that you ask to do this work will greatly
affect the work.
- [steven]
- HTML WG is chartered to do it
- [Ian]
- TÇ: Value to pursuing more than one solution at the same time. Each
solution can benefit from improvements of other approaches. Foolish to
pursue just one solution that tries to satisfy all constraints.
- [Zakim]
- TimBL, you wanted to suggest HTML and SVG and Math are all
relevant.
- [Ian]
- TBL: What ought to happen - solve the mixed namespaces problem. The
solution needs to target more than, say, just XHTML.
- [steven]
- HTML WG would be happy with CLink/CSS-style solution
- [Tantek]
- IMHO a key portion of solving the mixed namespaces problem is solving
the syntactic vinegar / markupJunk problem that comes along with
namespaces. And I agree that the mixed namespaces problem needs to be
solved.
- [Ian]
- MD: Yes to multiple namespace docs (cf Xforms). The new wave of
modular XML vocabs will constrain the way that you can design a linking
language. Need to take into account unforeseen combinations (including
two linking attribs on same element).
- [Zakim]
- Liam, you wanted to agree with Tim, this is the way XML on the web
must go
- [Ian]
- LQ, TB: Yes to multiple namespace concern.
- TB: That suggests that there's a good argument for the existence of
an xlink-like option.
- [Tantek]
- Straw proposal: Simple embed vs. hyperlink distinction as schema
datatypes.
- [Ian]
- TB: Sounds like an xlink approach that removes some presentation
things would be a big win.
- [Zakim]
- Ht, you wanted to say that XML Schema easily provides the resource
(type definitions) to allow a wide range of languages to share a
linking syntax and/or semantics
- [steven]
- No one has argued against a linking vocab to avoid having to design
your own, I think
- [Ian]
- HT: Mechanism of type definition provided by XML Schema gives a way
for many languages to share a resource without committing to what the
names of the elements or even attributes have to be.
- HT: People don't all have to schema-validate!
- HT: Infoset is the place for shared linking semantics. Schema is
the place for shared linking syntax.
- [Zakim]
- TimBL, you wanted to probe a bit where this attribute-oriented
approach is driven by. Mixing attributes is inherently messy in XML,
while element nesting is not. Therefore a linking language fro example
should provide elements rather than attributes. Why not?
- [Ian]
- TBL: Is the issue with element approach verbosity?
- [ht]
- infoset is a way of tying _recs_ together
- [Zakim]
- Liam, you wanted to speak on elements vs attributes
- [Ian]
- LQ on attributes: Philosophical difference depending on how one
perceives the link.
- [TBray]
- What I said: infoset is nice but syntax is essential
- [ht]
- I think Liam has misunderstood Tim's point -- not that you shouldn't
use attributes for links, but that to compose links you have to nest
their signalling elements, not merge them
- [mdubinko]
- Using 'href' or 'someprefix:href' for EVERY kind of link particularly
causes problems in combining languages
- [Ian]
- LQ: Verbosity is important, backwards compatibility important. But
philosophy is important. Neither xml nor namespaces clear about mixing
same attributes on element.
- NW: Problem with infoset solution is that there's no common markup
idiom for users. Not a complete solution if each language chooses
different syntax.
- [Tantek]
- Sacrificing usability for syntactic universality is also bad.
- [Ian]
- LR: Simplicity for authors important. One attribute can be simpler
than nested elements. e.g., deployment of smil may have been easier due
to attribute focus.
- [Zakim]
- Steven, you wanted to talk about content models
- [Ian]
- SP on element v attribute approach: I understand motivation for both
approaches. W3C should not say "This is the only way to design
XML."
- [PGrosso]
- But "allowing different ways to design XML" depends on whether you
think this is a basic thing like xinclude or a variable thing like
style.
- If linking is basic to the Web, then allowing alternate designs may
not be the best way to go.
- [Ian]
- SP: Consider P3P. You can't define a P3P policy for an XML document
today. If we design a language where an element is only allowed to have
one attribute that has a URI value, we might cut off the possibility of
extending XML to add P3P policies. Summary - easier to add attributes
than to add elements.
- TB: See CL and MW comments on problems in doing multiple end links
using attribute syntax. I've not seen responses to those posting. View
source metric important for hyperlinking
- [Zakim]
- TimBL, you wanted to point out that that adding that attribute was
not a link.
- [Ian]
- TBL: We are looking here for a way to include a user-accessible
link.
- [TBray]
- I said that I think you can do an element-based syntax for
multi-ended links that avoids the "longdesc" problems and is still
perfectly comprehensible by ordinary people
- [Ian]
- TBL: I think P3P/XML example out of scope; there are lots of things
that have URIs.
- TÇ: Are attribute args discussed here more hypothetical than
practical?
- TB: I think real problems.
- [Tantek]
- e.g.  seems to work
fine.
- [Ian]
- TB: At the end of the day we want to enrich hyperlinks. If you have
attribute-based hyperlinks, you have attribs about attributes. That is
hairy. Internationalization is another example; when you want to have
more than one instance of something, you should do through elements.
See comments
from Misha Wolf and comments
from Chris Lilley.
- [Zakim]
- Ht, you wanted to say there's a difference between this-is-an-URL and
this-is-a-link
- [Ian]
- HT: At the heart of this issue is acknowledging distinction between
"this is a URI" and "this is a link". Being a URI is not all there is
to being a link. We'd probably agree that xlink went too far by
including presentation info. Can we reach agreement that one needs to
know more than a URI to know about a hyperlink?
- TÇ: Allow multiple solutions to proceed ("1000 flowers"). On tech
args against multiple attributes - most of these arguments seem to
depend on assumption of an ONLY-ATTRIBUTE solution.
- [IJ reminds folks that parallel was drawn to style in HTML: style
attribute, STYLE element, and external style sheets.]
- [TBray]
- TBray: http://lists.w3.org/Archives/Public/www-tag/2002Sep/0121.html
- [Ian]
- HT: We could initiate an effort to design a subset that meets needs
of major players. Issue then of whether to recommend or mandate those
solutions.
- [TBray]
- TBray http://lists.w3.org/Archives/Public/www-tag/2002Sep/0284.html
- [Tantek]
- Using multiple attributes for linking does NOT preclude using
multiple elements for links.
- Allow multiple attributes for simpler cases, and encourage multiple
elements for more complex cases, e.g. links to 20 different natural
language versions of a document.
- [Ian]
- LR: Could allow authors to be attributionists and format designers to
be elementists.
- [Tantek]
- HTML does this today, with various linking attributes and with the
<link> element.
- [Ian]
- LR: I think a mapping between the two would meet the needs of HTML
WG. Add a layer that does mapping from elements to attributes.
- TB proposal:
- Seems to be agreement that mixed namespace docs are a problem we
have to face. Common vocab a good goal.
- Reduce XLink, with more derivation of attributes; radical removal
of presentation/behavior. Would that meet lots of requirements?
TB: Who would do this work?
- [Ian]
- SP: I think that HLink and CLink would be good solutions as well.
- [ht]
- ht agrees with Tim Bray's proposal
- [Ian]
- SP: TB's design not perfect since doesn't fulfill design goal of not
requiring changes to instances (see XLink Requirement
B.2). You should be able to infer links without having to put the
links in the document.
- BP: It's important to specify and evangelize importance of link
metadata .
- [ht]
- there is an integrity issue wrt inline vs. offboard signalling of
linkness
- [TBray]
- problem with CLink is that it's external-only (right?) makes life
harder for spiders
- [Zakim]
- TimBL, you wanted to add another requirement - that you should be
able to infer links with only the document available. Also, you wanted
to note that there is a separate meeting to have about embedded
metatdata in HTML etc
- [Ian]
- TBL: Should be able to infer links with only the document available.
That complements SP's requirement.
- [TBray]
- TBL wants potential for 100% self-descriptive links with no call-out
to another resource
- [ht]
- this is the View Source argument again
- [Ian]
- [TBL recaps view source benefits]
- TBL: I'm in favor of fewer indirections to find out something is a
link. Attempt to meet the requirement of multiple links has been done
through generalization. A new xlink should have a (1) simple syntax
that should be extensible; element-based (2) backwards compatible to
HTML stuff bolted on; don't need to do for other content than HTML.
- SP: You can't do view source easily for presentation stuff. Shouldn't
be a requirement for every piece of information you do in XML. A
layered solution will give you view source possibility.
- [Norm]
- Presentation is not semantics.
- [Tantek]
- And semantics should not require a particular presentation.
- [Norm]
- Yep
- [mdubinko]
- the single main document should express intent, any related resources
ought to be supplemental
- [TimBL]
- To clarify - I was not ruling out style sheets..... for style
- [Zakim]
- Liam, you wanted to urge static semantics ala tim but point out the
style sheets can already impute linkness
- [Ian]
- LQ: I agree with TBL on view source value.
- [Tantek]
- I think it is important not only to tell whether "it is a link", but
whether it is a "hyperlink reference" or an "embed". I'm not sure that
other distinctions are necessary from the view source perspective.
- [steven]
- But I was saying: the show source argument doesn't hold for styling,
so why is show source so important?
- [ht]
- steven: because style is less implicated in document function than
linking is, by a significant amount
- [Tantek]
- Another way to think of it is the "deep copy" example: when
performing a deep copy of a compound document, you need to know which
elements to copy with a document, and which not to. This corresponds
1:1 to the embed/hyperlink distinction.
- [Ian]
- LQ: Multiple vocabs should be able to share static semantics. We
should not rule out style sheet-type mechanism to impute linking
semantics. There's a descriptive value of schemas here; mapping into
xlink. Need to make sure that xlink ends up being power enough to be
mapped into.
- [TimBL]
- re: "But I was saying: the show source argument doesn't hold for
styling, so why is show source so important?" I think that the
community has a fairly well defined concept of separation of form and
content.
- [Liam]
- agreed with separation, understanding of that is growing fast
- [TBray]
- there are no absolutes: separation of form/content brings enough
benefits so as to justify lossage on "view source" front
- but i'm not sure that's true for linkage
- [ht]
- ht agrees
- [Ian]
- Scribe uncertain, but thinks he talked here about analogy with
style sheets in HTML: several mechanisms have proved useful for
different scenarios. Scribe (and HT) believe this point was made by
Michael Sperberg-McQueen.
- [PGrosso]
- Per what Ian is saying, but that depends on whether linking is basic
like xinclude or more like style.
- [Ian]
- IJ: What is drawback to allowing both element and attribute approach?
Do we have documented drawbacks for style flexibility in HTML?
- PG: Gets back to my point about whether linking more like style.
- TB: I like CLink (elegant) but nervous that will make life harder for
robots, spiders.
- [mdubinko]
- a trend towards fewer is better, but not an absolute 'MUST BE ONLY
ONE' requirement
- [Ian]
- LR clarifies use of CSS-like approach of external assignment of
semantics.
- [Norm]
- There's no way to make there only be one, but there could be one that
we agree to use for some kinds of linking.
- [Ian]
- TBL: What's the document for in the case where link semantics applied
externally?
- [TBray]
- the Web brought a new thing into the world: the notion that content
should contain embedded actionable pointers to other content. You don't
hae that it's not the web any more
- [Norm]
- What TBray said.
- [jax]
- It isn't to add the semantics link sheet is useful
- [steven]
- agree with Lloyd
- [jax]
- It is for the user to handle what links to interact with, and how
- [Ian]
- LR: External sheets allow later application of link semantics without
changing content. I think there are situations where people will want
to be able to do external application of semantics.
- [ht]
- Why isn't Schema already sufficient for that goal?
- [jax]
- There *is* a possible downside to link styling in that you could use
link styling in a way that is unobvious
- [Ian]
- LQ: I agree with LR's comments. We also have to bear in mind that
when we designed XML we had lots of experience with documents, less
with data. More research should be done on linking...I'm uneasy with
PG's proposal to have one way...we may need more. Extended XML Schema
better than link sheet.
- [jax]
- that is the same argument as with XML everyone will make their own
tags, and interoperability is out the door. Didn't happen, won't
happen.
- [Lloyd]
- Agree with Liam, but we do want one way to define underlying
*semantics*
- [Ian]
- IJ summarizing a proposal: allow element and attribute approach,
highlight caveats of each approach; forget link sheets for now.
- [Liam]
- hearhear, Ian.
- [ht]
- HLink _is_ a link sheet proposal, you can't argue against link sheets
and for HLink
- [PGrosso]
- Right, what HT just said.
- [Ian]
- IJ: I think that the multiple ways of specifying style in HTML show
that multiple approaches can be valuable.
- HT: I like TB's proposal better than IJ's - I don't think IJ's
analogy to style works.
- [TBray]
- Reminder of part (b) of earlier proposal: Reduce XLink, with more
derivation of attributes; radical removal of presentation/behavior.
Would that meet lots of requirements?
- [ht]
- add built-in element
- [TimBL]
- If you can do it with one method that is a lot better than doing it
with three.
- [ht]
- I don't accept that requirement (don't modify the instance)
- [Ian]
- IJ: The objection to TB's approach was you can't avoid modifying the
instance.
- [Tantek]
- I prefer Ian Jacob's proposal as a starting point. I think he
captured more of what is needed.
- [Ian]
- SP: Current de facto solutions (1) CLink-like [Opera], (2) XBL
[Mozilla], (3) Behaviors [IE]. Advantage to link sheet approach is that
you don't need to build more knowledge into browser.
- TBL: I like TB's proposal. Please add "html:a" to xlink in TB's proposal.
- [steven]
- I don't think that that helps
- [Zakim]
- TimBL, you wanted to ask - Does TB's solution allow one to make a
link:a anchor elements in the xlink namespace
- [TimBL]
- TB: I wouldn't want to define things at such a high level of detail
at this stage.
- [Ian]
- NW: My objection to the CLink/HLink approaches - I want links to be
first class things. As chair of Docbook TC, we've been waiting for
years to adopt an XLink solution. I'd like the solution to not require
an external mechanism for identifying links.
- [steven]
- Sounds like a clear lack of consensus here
- [Norm]
- Lloyd: I don't care if the style is totally lost, I want the link to
persist.
- [steven]
- I don't see how they are different. If you have a clink style, you
can use it to define an xlink: style. End of story
- [Lloyd]
- Norm: Point is style is maintained and dependable. So can links.
- [Ian]
- HT: Please poll folks to find out priority of internal v. external
link info.
- [Norm]
- No, style is not maintained and dependable. And I don't care if style
is lost. But I don't want links to be lost, or confused, or
changed.
- [Ian]
- TB: Summarizing - links self-describing in the instance or preference
for link sheets?
- Internal: TBL, SW, PG, NW, TB, HT
- [Tantek]
- Allow Internal but NOT require.
- [jax]
- second that
- [Ian]
- IJ: Question is PREFERENCE for internal or external (I think)
- [Poll killed]
- TÇ: I think solution of internal link markup is fine, but don't
exclude other approaches.
- [ht]
- Strongly disagree
- [Ian]
- JAX: It's fine to have linking mechanism embedded. What HLink will
add is the ability to say later something that the format didn't or
couldn't say. The ability of styling linking doesn't mean you shouldn't
be able to specify things int he markup.
- [Tantek]
- Some authors (and language designers) wish to keep as much of the
"markupJunk" out of document content as possible. This is a real
need.
- [Zakim]
- Liam, you wanted to claim mixing namespaces is a higher issue
- [ht]
- That's not the way I read HLink -- without the link sheet there is
_no way_ to tell what elements are links
- please can we talk about who does this?
- [Norm]
- Liam: I don't believe I was conflating the two issues
- [Liam]
- Norm, ok, sorry
- [Tantek]
- ht: that's why Steven has said in the past that HLink and XLink are
not different solutions, but part of one solution. (sorry if I
misquoted you Steven).
- [Lloyd]
- also thinks this has been useful.
- [Ian]
- TB: Let's figure out what work we can do to move forward.
- LR: Let HLink go forward with certain requirements or guidelines.
- [PGrosso]
- If we don't decide whether linkness is first class or more like
style, then I don't think we've moved forward.
- [ht]
- I am not happy with that proposal
- [Norm]
- Yeah, what PGrosso said, I think.
- [TBray]
- mark me -1 on that
- [steven]
- I had been told that XML2002 had moved the discussion forward (I
wasn't there)
- [mdubinko]
- links are first-class, link syntax is not (cf historical 'href'
attribute)
- [Ian]
- TBL: Is the HTML WG happy to use a link namespace on things that are
links.
- [steven]
- It is not just about HTML. Also SYMM, XForms. It is about a general
solution
- [Norm]
- steven: the XML2002 discussion was lively, but I don't feel at the
end of the day that we moved very far. Alas, I was chairing and unable
to take minutes.
- [steven]
- Others told me that there was a feeling of generating consensus
- [Norm]
- steven: I fear I failed to detect what that consensus was. Perhaps I
missed it
- [steven]
- OK Norm
- [Ian]
- [IJ: I think HTML WG has said that namespace prefix not a major
problem.]
- [steven]
- Not a problem per se. HTML WG is not against namespaces
- [Ian]
- TBL: Most important is to ensure that simple solution exists.
- HT: The venue for taking this forward?
- [TimBL]
- It is always easier to take a simple thing and add complexity than to
do the reverse.
- [TBray]
- and isolating areas of disagreement is useful!
- [steven]
- And I think that those areas are the source of the problem
- [Norm]
- steven: on reflection, it was probably a failure on my part to do a
good wrap-up at xml 2002 and write down the consensus opinions.
- [Zakim]
- Liam, you wanted to affirm tf
- TBray, you wanted to say we have successfully isolated areas of
technical disagreement (1) linkage in-doc vs external, (2) desirability
of multi-attribute links
- [Ian]
- SW: Where should followup discussion take place?
- Proposed www-tag: +1 from HT, TB, MD
- Proposed BOF during week of technical plenary: TB, HT, TÇ, BP, JAX,
NW
- HT: But during the Wednesday plenary is a bad idea.
- [Zakim]
- Tantek, you wanted to say why only one "venue"? Why not let multiple
solutions move forward for the moment at least?


{% extends 'foundation_tenant/base.html' %} {% load staticfiles i18n compress thumbnail %} {% block content %} {% compress js inline %} {% include 'tenant_customer/entrepreneur/details/js.html' %} {% endcompress %}
{{ me.description }}
{% trans 'Please give this to the client and ask them to change their password.' %}


This is a basic but comprehensite 80s tribute site. Compiled and created through ideas from my friends and I is a meeting place for those that don't quite fit in generation "X"... the "children of the 80s."
This is Jaromir Jagr...the right winger for the Pittsburg Penguins and probably my biggest crush ever. In the future I hope to start posting new Penguins and Jaromir news breaks. some
The best Canadian import since Corey Hart...The Official Site of Hayden
A post-humous site setup by his mom...The Jeff Buckley Website
The sweetest...the cutest...and most likely to make even Julie Andrews throw up...Jewel (if anyone knows of any hate sites let me know)
And of course the man that gave all police fans a slap in the face...Puff Daddy
...
(Powered by Azure Static Web Apps Functions API)
Lynna Jagr@aol.com


Save
Load
your browser doesn't support canvas
your browser doesn't support canvas
your browser doesn't support canvas


This Subnet/CIDR calculator allows you to enter a IPv4 CIDR range and calculates IP addresses, Network Size, Subnet Mask, Min and Max Host etc.


This table contains entries for different ATP synthases from a variety of species in the UniProt database. Links are provided to view the original UniProt protein entries, and their display in InterPro. Further information can be obtained from GOBASE Organelle Genome Database under the ‘Protein’ search, where there is information on each type of subunit for bacterial, chloroplast and mitochondrial ATP synthase listed under ‘Product Name’ in the search.
|
|
|
|
SPTR
|
Protein name |
Organism |
InterPro Domain Architecture |
InterPro Graphical Match |
Function |
|
F‑ATP synthase (mitochondrial) |
F1 catalytic core |
a chain |
ATP synthase alpha chain,
mitochondrial precursor |
Homo sapiens |
The alpha chain is a regulatory
subunit. |
|||
|
|
|
b chain |
ATP synthase beta chain,
mitochondrial precursor |
Homo sapiens |
|
The beta chain is the catalytic subunit. |
||
|
|
|
d chain |
ATP synthase delta chain,
mitochondrial precursor |
Homo sapiens
|
|
|
||
|
|
|
e chain |
ATP synthase epsilon chain,
mitochondrial precursor |
Homo sapiens
|
|
This is the smallest of the 5 chains of the enzymatic component
(coupling factor F1) of the mitochondrial ATPase complex. |
||
|
|
|
g chain |
ATP synthase gamma chain,
mitochondrial precursor |
Homo sapiens
|
|
The gamma chain may help regulate ATPase activity and the
flow of protons through the F0 complex. |
||
|
|
F0 proton channel |
A chain |
ATP synthase A chain |
Homo sapiens |
|
Key component of the proton channel for translocation of
protons across the membrane. |
||
|
|
|
B chain |
ATP synthase B
chain, mitochondrial |
Homo sapiens |
|
|
||
|
|
|
C chain |
ATP synthase lipid‑binding protein, mitochondrial precursor (subunit C) |
Homo sapiens |
|
|
||
|
|
|
|
ATP synthase lipid-binding protein, mitochondrial precursor (subunit C) |
Homo sapiens |
|
|
||
|
|
|
|
ATP synthase lipid-binding protein, mitochondrial precursor (subunit C) |
Homo sapiens |
|
|
||
|
|
|
D chain |
ATP synthase D
chain, mitochondrial |
Homo sapiens |
|
No apparent bacterial homolog and its exact function is
unknown. |
||
|
|
|
E chain |
ATP
synthase E chain, mitochondrial |
Homo sapiens |
|
|
||
|
|
|
F chain |
ATP
synthase F chain, mitochondrial |
Homo sapiens |
None |
None |
|
|
|
|
|
G chain |
ATP synthase
G chain, mitochondrial |
Homo sapiens |
|
|
||
|
|
|
O chain |
ATP
synthase O chain, mitochondrial |
Homo sapiens |
|
Part of stalk linking F0 to F1. Either transmits conformational
changes from F0 into F1 or acts in proton conduction. |
||
|
|
|
F6 chain |
ATP synthase coupling
factor 6, mitochondrial precursor |
Homo sapiens
|
|
F6 part of stalk that links F0 to F1. Also involved in the
restoration of oligomycin-sensitive ATPase activity to depleted F1-F0
complexes. |
||
|
|
|
8 chain |
ATP synthase
protein 8 |
Homo sapiens
|
|
|
||
|
V‑ATP synthase (vacuolar) |
V1 catalytic
core |
|
Vacuolar ATP synthase subunit S1 precursor |
Homo sapiens
|
|
|
||
|
|
|
|
Vacuolar ATP
synthase catalytic subunit A, ubiquitous isoform |
Homo sapiens
|
|
Catalytic subunit of the peripheral V1 complex of vacuolar
ATPase |
||
|
|
|
|
Vacuolar ATP synthase catalytic subunit A, osteoclast isoforms |
Homo sapiens
|
|
Catalytic subunit of the peripheral V1 complex of vacuolar
ATPase. |
||
|
|
|
|
Vacuolar ATP synthase subunit B, kidney isoforms |
Homo sapiens
|
|
Non-catalytic subunit of the peripheral V1 complex of
vacuolar ATPase. |
||
|
|
|
|
Vacuolar ATP synthase subunit B, brain isoforms |
Homo sapiens |
|
Non-catalytic subunit of the peripheral V1 complex of
vacuolar ATPase. |
||
|
|
|
|
Vacuolar ATP synthase subunit C |
Homo sapiens |
|
Subunit of the peripheral V1 complex of vacuolar ATPase.
Subunit C essential for assembly or catalytic function. |
||
|
|
|
|
Vacuolar ATP synthase subunit D |
Homo sapiens |
|
Subunit of the peripheral V1 complex of vacuolar ATPase. |
||
|
|
|
|
Vacuolar ATP
synthase subunit E |
Homo sapiens |
|
Subunit of the peripheral V1 complex of vacuolar ATPase
essential for assembly or catalytic function. |
||
|
|
|
|
Vacuolar ATP synthase subunit F |
Homo sapiens |
|
Subunit of the peripheral V1 complex of vacuolar ATPase
essential for assembly or catalytic function. |
||
|
|
|
|
Vacuolar ATP synthase subunit G 1 |
Homo sapiens |
|
Catalytic subunit of the peripheral V1 complex of vacuolar
ATPase. |
||
|
|
|
|
Vacuolar ATP synthase subunit G 2 |
Homo sapiens |
|
Catalytic subunit of the peripheral V1 complex of vacuolar
ATPase. |
||
|
|
|
|
Vacuolar ATP synthase subunit G 3 |
Homo sapiens |
|
Catalytic subunit of the peripheral V1 complex of vacuolar
ATPase. |
||
|
|
|
|
Vacuolar ATP synthase subunit H |
Homo sapiens |
|
Subunit of the peripheral V1 complex of vacuolar ATPase.
Subunit H activate ATPase activity of the enzyme and couple ATPase activity
to proton flow. |
||
|
|
V0 proton channel |
|
Vacuolar ATP synthase 16 kDa proteolipid subunit |
Homo sapiens
|
|
Proton-conducting pore forming subunit of the membrane
integral V0 complex of vacuolar ATPase. |
||
|
|
|
|
Vacuolar ATP synthase 21 kDa proteolipid subunit |
Homo sapiens
|
|
Proton-conducting pore forming subunit of the membrane
integral V0 complex of vacuolar ATPase. |
||
|
|
|
|
Vacuolar ATP synthase subunit d |
Homo sapiens
|
|
Subunit of the integral membrane V0 complex of vacuolar
ATPase. |
||
|
|
|
|
Vacuolar ATP synthase subunit H |
Homo sapiens
|
|
|
||
|
|
|
|
Vacuolar proton
translocating ATPase 116 kDa subunit a isoform 1 |
Homo sapiens
|
|
Required for assembly and activity of V-ATPase. Potential role in differential targeting and regulation of the enzyme for a specific organelle |
||
|
F‑ATP synthase (chloroplast) |
F1 catalytic core |
a chain |
ATP synthase alpha chain |
Pisum sativumGarden pea |
|
The alpha chain is a regulatory subunit. |
||
|
|
|
b chain |
ATP synthase beta chain |
Pisum sativumGarden pea |
|
The beta chain is the catalytic subunit. |
||
|
|
|
d chain |
ATP synthase delta chain, chloroplast precursor |
Pisum sativum
Garden pea |
|
Part of stalk linking F0 to F1. Either transmits
conformational changes from F0 into F1 or acts in proton conduction. |
||
|
|
|
e chain |
ATP synthase
epsilon chain |
Pisum sativum
Garden pea |
|
|
||
|
|
|
g chain |
ATP synthase gamma chain, chloroplast precursor |
Pisum sativum
Garden pea |
|
The gamma chain is believed to be important in regulating
ATPase activity and the flow of protons through the F0 complex. |
||
|
|
F0 proton channel |
A chain |
Chloroplast ATP synthase A chain precursor |
Pisum sativum
Garden pea |
|
Key component of the proton channel for translocation of
protons across the membrane. |
||
|
|
|
B chain |
ATP synthase B chain |
Pisum sativumGarden pea |
|
|
||
|
|
|
C chain |
|
ATP synthase C
chain |
Pisum sativum
Garden pea |
|
|
|
|
F‑ATP synthase (bacterial) |
F1 catalytic core |
a chain |
ATP synthase
alpha chain |
Haemophilus influenzae
Proteobacteria |
|
The alpha chain is a regulatory subunit. |
||
|
|
|
b chain |
ATP synthase
beta chain |
Haemophilus influenzae
Proteobacteria |
|
The beta chain is the catalytic subunit. |
||
|
|
|
d chain |
ATP synthase delta chain |
Haemophilus influenzae
Proteobacteria |
|
Part of stalk linking F0 to F1. Either transmits
conformational changes from F0 into F1 or acts in proton conduction. |
||
|
|
|
e chain |
ATP
synthase epsilon chain |
Haemophilus influenzae
Proteobacteria |
|
|
||
|
|
|
g chain |
ATP
synthase gamma chain |
Haemophilus influenzae
Proteobacteria |
|
The gamma chain is believed to be important in regulating
ATPase activity and the flow of protons through the F0 complex. |
||
|
|
F0 proton channel |
A chain |
ATP
synthase A chain |
Haemophilus influenzae
Proteobacteria |
|
Key component of the proton channel for translocation of
protons across the membrane. |
||
|
|
|
B chain |
ATP synthase B chain |
Haemophilus influenzae
Proteobacteria |
|
|
||
|
|
|
C chain |
ATP synthase C
chain |
Haemophilus influenzae
Proteobacteria |
|
|
||
|
|
Flagellar enzyme |
|
Flagellum-specific ATP synthase |
Escherichia coli
Enterobacteria |
|
Catalytic
subunit of a protein translocase for flagellum-specific export, or for local circuits
at the flagellum. |


hunch_net hunch_net-2005 hunch_net-2005-144 knowledge-graph by maker-knowledge-mining
Source: html
Introduction: I only managed to make it out to the NIPS workshops this year so I’ll give my comments on what I saw there. The Learing and Robotics workshops lives again. I hope it continues and gets more high quality papers in the future. The most interesting talk for me was Larry Jackel’s on the LAGR program (see John’s previous post on said program). I got some ideas as to what progress has been made. Larry really explained the types of benchmarks and the tradeoffs that had to be made to make the goals achievable but challenging. Hal Daume gave a very interesting talk about structured prediction using RL techniques, something near and dear to my own heart. He achieved rather impressive results using only a very greedy search. The non-parametric Bayes workshop was great. I enjoyed the entire morning session I spent there, and particularly (the usually desultory) discussion periods. One interesting topic was the Gibbs/Variational inference divide. I won’t try to summarize espe
sentIndex sentText sentNum sentScore
1 I only managed to make it out to the NIPS workshops this year so I’ll give my comments on what I saw there. [sent-1, score-0.125]
2 The Learing and Robotics workshops lives again. [sent-2, score-0.068]
3 The most interesting talk for me was Larry Jackel’s on the LAGR program (see John’s previous post on said program). [sent-4, score-0.197]
4 Larry really explained the types of benchmarks and the tradeoffs that had to be made to make the goals achievable but challenging. [sent-6, score-0.182]
5 Hal Daume gave a very interesting talk about structured prediction using RL techniques, something near and dear to my own heart. [sent-7, score-0.207]
6 I enjoyed the entire morning session I spent there, and particularly (the usually desultory) discussion periods. [sent-10, score-0.063]
7 One interesting topic was the Gibbs/Variational inference divide. [sent-11, score-0.08]
8 I won’t try to summarize especially as no conclusion was reached. [sent-12, score-0.057]
9 It was interesting to note that samplers are competitive with the variational approaches for many Dirichlet process problems. [sent-13, score-0.143]
10 One open question I left with was whether the fast variants of Gibbs sampling could be made multi-processor as the naive variants can. [sent-14, score-0.184]
11 I also have a reading list of sorts from the main conference. [sent-15, score-0.059]
12 Most of the papers mentioned in previous posts on NIPS are on that list as well as these: (in no particular order) The Information-Form Data Association Filter Sebastian Thrun, Brad Schumitsch, Gary Bradski, Kunle Olukotun [ps. [sent-16, score-0.117]
13 gz][pdf][bibtex] Divergences, surrogate loss functions and experimental design XuanLong Nguyen, Martin Wainwright, Michael Jordan [ps. [sent-17, score-0.063]
wordName wordTfidf (topN-words)
[('bibtex', 0.615), ('pdf', 0.506), ('larry', 0.119), ('dirichlet', 0.109), ('variants', 0.092), ('interesting', 0.08), ('thrun', 0.068), ('benchmarks', 0.068), ('dear', 0.068), ('dynamical', 0.068), ('hertzmann', 0.068), ('sudderth', 0.068), ('unseen', 0.068), ('wang', 0.068), ('workshops', 0.068), ('lagr', 0.063), ('abbeel', 0.063), ('pieter', 0.063), ('association', 0.063), ('freeman', 0.063), ('gibbs', 0.063), ('jordan', 0.063), ('le', 0.063), ('morning', 0.063), ('nicolas', 0.063), ('niyogi', 0.063), ('partha', 0.063), ('subspace', 0.063), ('surrogate', 0.063), ('variational', 0.063), ('visual', 0.063), ('wainwright', 0.063), ('transformed', 0.06), ('bengio', 0.06), ('yoshua', 0.06), ('scenes', 0.06), ('sebastian', 0.06), ('olivier', 0.06), ('aaron', 0.06), ('alan', 0.06), ('william', 0.06), ('list', 0.059), ('talk', 0.059), ('previous', 0.058), ('summarize', 0.057), ('tradeoffs', 0.057), ('martin', 0.057), ('achievable', 0.057), ('saw', 0.057), ('nips', 0.055)]
simIndex simValue blogId blogTitle
same-blog 1 1.0000004 144 hunch net-2005-12-28-Yet more nips thoughts
Introduction: I only managed to make it out to the NIPS workshops this year so I’ll give my comments on what I saw there. The Learing and Robotics workshops lives again. I hope it continues and gets more high quality papers in the future. The most interesting talk for me was Larry Jackel’s on the LAGR program (see John’s previous post on said program). I got some ideas as to what progress has been made. Larry really explained the types of benchmarks and the tradeoffs that had to be made to make the goals achievable but challenging. Hal Daume gave a very interesting talk about structured prediction using RL techniques, something near and dear to my own heart. He achieved rather impressive results using only a very greedy search. The non-parametric Bayes workshop was great. I enjoyed the entire morning session I spent there, and particularly (the usually desultory) discussion periods. One interesting topic was the Gibbs/Variational inference divide. I won’t try to summarize espe
2 0.091279462 438 hunch net-2011-07-11-Interesting Neural Network Papers at ICML 2011
Introduction: Maybe it’s too early to call, but with four separate Neural Network sessions at this year’s ICML , it looks like Neural Networks are making a comeback. Here are my highlights of these sessions. In general, my feeling is that these papers both demystify deep learning and show its broader applicability. The first observation I made is that the once disreputable “Neural” nomenclature is being used again in lieu of “deep learning”. Maybe it’s because Adam Coates et al. showed that single layer networks can work surprisingly well. An Analysis of Single-Layer Networks in Unsupervised Feature Learning , Adam Coates , Honglak Lee , Andrew Y. Ng (AISTATS 2011) The Importance of Encoding Versus Training with Sparse Coding and Vector Quantization , Adam Coates , Andrew Y. Ng (ICML 2011) Another surprising result out of Andrew Ng’s group comes from Andrew Saxe et al. who show that certain convolutional pooling architectures can obtain close to state-of-the-art pe
3 0.089738801 280 hunch net-2007-12-20-Cool and Interesting things at NIPS, take three
Introduction: Following up on Hal Daume’s post and John’s post on cool and interesting things seen at NIPS I’ll post my own little list of neat papers here as well. Of course it’s going to be biased towards what I think is interesting. Also, I have to say that I hadn’t been able to see many papers this year at nips due to myself being too busy, so please feel free to contribute the papers that you liked 1. P. Mudigonda, V. Kolmogorov, P. Torr. An Analysis of Convex Relaxations for MAP Estimation. A surprising paper which shows that many of the more sophisticated convex relaxations that had been proposed recently turns out to be subsumed by the simplest LP relaxation. Be careful next time you try a cool new convex relaxation! 2. D. Sontag, T. Jaakkola. New Outer Bounds on the Marginal Polytope. The title says it all. The marginal polytope is the set of local marginal distributions over subsets of variables that are globally consistent in the sense that there is at least one distributio
4 0.068852365 140 hunch net-2005-12-14-More NIPS Papers II
Introduction: I thought this was a very good NIPS with many excellent papers. The following are a few NIPS papers which I liked and I hope to study more carefully when I get the chance. The list is not exhaustive and in no particular order… Preconditioner Approximations for Probabilistic Graphical Models. Pradeeep Ravikumar and John Lafferty. I thought the use of preconditioner methods from solving linear systems in the context of approximate inference was novel and interesting. The results look good and I’d like to understand the limitations. Rodeo: Sparse nonparametric regression in high dimensions. John Lafferty and Larry Wasserman. A very interesting approach to feature selection in nonparametric regression from a frequentist framework. The use of lengthscale variables in each dimension reminds me a lot of ‘Automatic Relevance Determination’ in Gaussian process regression — it would be interesting to compare Rodeo to ARD in GPs. Interpolating between types and tokens by estimating
5 0.062213469 188 hunch net-2006-06-30-ICML papers
Introduction: Here are some ICML papers which interested me. Arindam Banerjee had a paper which notes that PAC-Bayes bounds, a core theorem in online learning, and the optimality of Bayesian learning statements share a core inequality in their proof. Pieter Abbeel , Morgan Quigley and Andrew Y. Ng have a paper discussing RL techniques for learning given a bad (but not too bad) model of the world. Nina Balcan and Avrim Blum have a paper which discusses how to learn given a similarity function rather than a kernel. A similarity function requires less structure than a kernel, implying that a learning algorithm using a similarity function might be applied in situations where no effective kernel is evident. Nathan Ratliff , Drew Bagnell , and Marty Zinkevich have a paper describing an algorithm which attempts to fuse A * path planning with learning of transition costs based on human demonstration. Papers (2), (3), and (4), all seem like an initial pass at solving in
6 0.06031302 224 hunch net-2006-12-12-Interesting Papers at NIPS 2006
7 0.060201518 71 hunch net-2005-05-14-NIPS
8 0.059613228 46 hunch net-2005-03-24-The Role of Workshops
9 0.05914928 437 hunch net-2011-07-10-ICML 2011 and the future
10 0.059042044 212 hunch net-2006-10-04-Health of Conferences Wiki
11 0.058851726 474 hunch net-2012-10-18-7th Annual Machine Learning Symposium
12 0.056983661 141 hunch net-2005-12-17-Workshops as Franchise Conferences
13 0.056341611 414 hunch net-2010-10-17-Partha Niyogi has died
14 0.056194145 420 hunch net-2010-12-26-NIPS 2010
15 0.056189664 216 hunch net-2006-11-02-2006 NIPS workshops
16 0.055829838 443 hunch net-2011-09-03-Fall Machine Learning Events
17 0.054247621 385 hunch net-2009-12-27-Interesting things at NIPS 2009
18 0.052617289 285 hunch net-2008-01-23-Why Workshop?
19 0.052430365 444 hunch net-2011-09-07-KDD and MUCMD 2011
20 0.052275248 189 hunch net-2006-07-05-more icml papers
topicId topicWeight
[(0, 0.115), (1, -0.025), (2, -0.028), (3, -0.047), (4, 0.03), (5, 0.085), (6, 0.013), (7, -0.032), (8, 0.072), (9, -0.036), (10, 0.019), (11, 0.002), (12, -0.08), (13, -0.049), (14, 0.013), (15, -0.021), (16, -0.043), (17, 0.052), (18, 0.018), (19, -0.031), (20, -0.011), (21, -0.017), (22, -0.057), (23, -0.078), (24, -0.004), (25, -0.013), (26, -0.001), (27, 0.034), (28, 0.005), (29, 0.05), (30, 0.009), (31, 0.024), (32, 0.034), (33, -0.033), (34, 0.034), (35, 0.048), (36, -0.017), (37, 0.065), (38, -0.009), (39, -0.018), (40, 0.055), (41, 0.008), (42, 0.036), (43, -0.044), (44, 0.019), (45, -0.018), (46, -0.04), (47, 0.037), (48, -0.004), (49, 0.049)]
simIndex simValue blogId blogTitle
same-blog 1 0.96827477 144 hunch net-2005-12-28-Yet more nips thoughts
Introduction: I only managed to make it out to the NIPS workshops this year so I’ll give my comments on what I saw there. The Learing and Robotics workshops lives again. I hope it continues and gets more high quality papers in the future. The most interesting talk for me was Larry Jackel’s on the LAGR program (see John’s previous post on said program). I got some ideas as to what progress has been made. Larry really explained the types of benchmarks and the tradeoffs that had to be made to make the goals achievable but challenging. Hal Daume gave a very interesting talk about structured prediction using RL techniques, something near and dear to my own heart. He achieved rather impressive results using only a very greedy search. The non-parametric Bayes workshop was great. I enjoyed the entire morning session I spent there, and particularly (the usually desultory) discussion periods. One interesting topic was the Gibbs/Variational inference divide. I won’t try to summarize espe
2 0.65551364 139 hunch net-2005-12-11-More NIPS Papers
Introduction: Let me add to John’s post with a few of my own favourites from this year’s conference. First, let me say that Sanjoy’s talk, Coarse Sample Complexity Bounds for Active Learning was also one of my favourites, as was the Forgettron paper . I also really enjoyed the last third of Christos’ talk on the complexity of finding Nash equilibria. And, speaking of tagging, I think the U.Mass Citeseer replacement system Rexa from the demo track is very cool. Finally, let me add my recommendations for specific papers: Z. Ghahramani, K. Heller: Bayesian Sets [no preprint] (A very elegant probabilistic information retrieval style model of which objects are “most like” a given subset of objects.) T. Griffiths, Z. Ghahramani: Infinite Latent Feature Models and the Indian Buffet Process [ preprint ] (A Dirichlet style prior over infinite binary matrices with beautiful exchangeability properties.) K. Weinberger, J. Blitzer, L. Saul: Distance Metric Lea
3 0.63069159 280 hunch net-2007-12-20-Cool and Interesting things at NIPS, take three
Introduction: Following up on Hal Daume’s post and John’s post on cool and interesting things seen at NIPS I’ll post my own little list of neat papers here as well. Of course it’s going to be biased towards what I think is interesting. Also, I have to say that I hadn’t been able to see many papers this year at nips due to myself being too busy, so please feel free to contribute the papers that you liked 1. P. Mudigonda, V. Kolmogorov, P. Torr. An Analysis of Convex Relaxations for MAP Estimation. A surprising paper which shows that many of the more sophisticated convex relaxations that had been proposed recently turns out to be subsumed by the simplest LP relaxation. Be careful next time you try a cool new convex relaxation! 2. D. Sontag, T. Jaakkola. New Outer Bounds on the Marginal Polytope. The title says it all. The marginal polytope is the set of local marginal distributions over subsets of variables that are globally consistent in the sense that there is at least one distributio
4 0.59920931 140 hunch net-2005-12-14-More NIPS Papers II
Introduction: I thought this was a very good NIPS with many excellent papers. The following are a few NIPS papers which I liked and I hope to study more carefully when I get the chance. The list is not exhaustive and in no particular order… Preconditioner Approximations for Probabilistic Graphical Models. Pradeeep Ravikumar and John Lafferty. I thought the use of preconditioner methods from solving linear systems in the context of approximate inference was novel and interesting. The results look good and I’d like to understand the limitations. Rodeo: Sparse nonparametric regression in high dimensions. John Lafferty and Larry Wasserman. A very interesting approach to feature selection in nonparametric regression from a frequentist framework. The use of lengthscale variables in each dimension reminds me a lot of ‘Automatic Relevance Determination’ in Gaussian process regression — it would be interesting to compare Rodeo to ARD in GPs. Interpolating between types and tokens by estimating
5 0.57957155 189 hunch net-2006-07-05-more icml papers
Introduction: Here are a few other papers I enjoyed from ICML06. Topic Models: Dynamic Topic Models David Blei, John Lafferty A nice model for how topics in LDA type models can evolve over time, using a linear dynamical system on the natural parameters and a very clever structured variational approximation (in which the mean field parameters are pseudo-observations of a virtual LDS). Like all Blei papers, he makes it look easy, but it is extremely impressive. Pachinko Allocation Wei Li, Andrew McCallum A very elegant (but computationally challenging) model which induces correlation amongst topics using a multi-level DAG whose interior nodes are “super-topics” and “sub-topics” and whose leaves are the vocabulary words. Makes the slumbering monster of structure learning stir. Sequence Analysis (I missed these talks since I was chairing another session) Online Decoding of Markov Models with Latency Constraints Mukund Narasimhan, Paul Viola, Michael Shilman An “a
6 0.57272416 77 hunch net-2005-05-29-Maximum Margin Mismatch?
7 0.51902723 438 hunch net-2011-07-11-Interesting Neural Network Papers at ICML 2011
8 0.4887566 444 hunch net-2011-09-07-KDD and MUCMD 2011
9 0.48304757 185 hunch net-2006-06-16-Regularization = Robustness
10 0.46541658 192 hunch net-2006-07-08-Some recent papers
11 0.46172702 188 hunch net-2006-06-30-ICML papers
12 0.45734638 310 hunch net-2008-07-15-Interesting papers at COLT (and a bit of UAI & workshops)
13 0.45715833 216 hunch net-2006-11-02-2006 NIPS workshops
14 0.45261851 71 hunch net-2005-05-14-NIPS
15 0.44195661 113 hunch net-2005-09-19-NIPS Workshops
16 0.43967676 403 hunch net-2010-07-18-ICML & COLT 2010
17 0.42583042 340 hunch net-2009-01-28-Nielsen’s talk
18 0.41879028 177 hunch net-2006-05-05-An ICML reject
19 0.41827282 251 hunch net-2007-06-24-Interesting Papers at ICML 2007
20 0.41489181 277 hunch net-2007-12-12-Workshop Summary—Principles of Learning Problem Design
topicId topicWeight
[(9, 0.011), (10, 0.038), (13, 0.022), (27, 0.115), (34, 0.039), (37, 0.057), (38, 0.029), (49, 0.036), (53, 0.049), (55, 0.093), (64, 0.018), (90, 0.332), (94, 0.043), (95, 0.017)]
simIndex simValue blogId blogTitle
1 0.94325215 340 hunch net-2009-01-28-Nielsen’s talk
Introduction: I wanted to point to Michael Nielsenâ€™s talk about blogging science, which I found interesting.
2 0.92166358 323 hunch net-2008-11-04-Rise of the Machines
Introduction: On the enduring topic of how people deal with intelligent machines , we have this important election bulletin .
3 0.9039759 32 hunch net-2005-02-27-Antilearning: When proximity goes bad
Introduction: Joel Predd mentioned “ Antilearning ” by Adam Kowalczyk , which is interesting from a foundational intuitions viewpoint. There is a pervasive intuition that “nearby things tend to have the same label”. This intuition is instantiated in SVMs, nearest neighbor classifiers, decision trees, and neural networks. It turns out there are natural problems where this intuition is opposite of the truth. One natural situation where this occurs is in competition. For example, when Intel fails to meet its earnings estimate, is this evidence that AMD is doing badly also? Or evidence that AMD is doing well? This violation of the proximity intuition means that when the number of examples is few, negating a classifier which attempts to exploit proximity can provide predictive power (thus, the term “antilearning”).
same-blog 4 0.83793032 144 hunch net-2005-12-28-Yet more nips thoughts
Introduction: I only managed to make it out to the NIPS workshops this year so I’ll give my comments on what I saw there. The Learing and Robotics workshops lives again. I hope it continues and gets more high quality papers in the future. The most interesting talk for me was Larry Jackel’s on the LAGR program (see John’s previous post on said program). I got some ideas as to what progress has been made. Larry really explained the types of benchmarks and the tradeoffs that had to be made to make the goals achievable but challenging. Hal Daume gave a very interesting talk about structured prediction using RL techniques, something near and dear to my own heart. He achieved rather impressive results using only a very greedy search. The non-parametric Bayes workshop was great. I enjoyed the entire morning session I spent there, and particularly (the usually desultory) discussion periods. One interesting topic was the Gibbs/Variational inference divide. I won’t try to summarize espe
5 0.78705984 239 hunch net-2007-04-18-$50K Spock Challenge
Introduction: Apparently, the company Spock is setting up a $50k entity resolution challenge . $50k is much less than the Netflix challenge, but it’s effectively the same as Netflix until someone reaches 10% . It’s also nice that the Spock challenge has a short duration. The (visible) test set is of size 25k and the training set has size 75k.
6 0.76672137 139 hunch net-2005-12-11-More NIPS Papers
7 0.7296387 284 hunch net-2008-01-18-Datasets
8 0.66128874 333 hunch net-2008-12-27-Adversarial Academia
9 0.44155431 454 hunch net-2012-01-30-ICML Posters and Scope
10 0.43767878 437 hunch net-2011-07-10-ICML 2011 and the future
11 0.43600464 134 hunch net-2005-12-01-The Webscience Future
12 0.43164313 1 hunch net-2005-01-19-Why I decided to run a weblog.
13 0.43149886 95 hunch net-2005-07-14-What Learning Theory might do
14 0.4304049 194 hunch net-2006-07-11-New Models
15 0.42696124 452 hunch net-2012-01-04-Why ICML? and the summer conferences
16 0.42597795 40 hunch net-2005-03-13-Avoiding Bad Reviewing
17 0.42575511 343 hunch net-2009-02-18-Decision by Vetocracy
18 0.42571372 153 hunch net-2006-02-02-Introspectionism as a Disease
19 0.42440104 51 hunch net-2005-04-01-The Producer-Consumer Model of Research
20 0.42213696 116 hunch net-2005-09-30-Research in conferences


We will ask two people who are about to go to lunch/dinner to evaluate Delp. We have received feedback through several channels that certain features of the app seem somewhat hidden, so our tasks will be designed so that the key features of the app (map, search, favorites) are particularly useful for one task each. The ease of accessing these features (and the navigation paths taken by the user) will help us figure out what functionality needs to be emphasized in our redesign.
Task 1 asks users to locate the three closest dining halls, then find some more information about a particular hall. Rather than manually searching the list of halls, we expect users to find the "Nearby" page in the menu and use our map's functionality to complete this task. The second part of the task will require navigation to a dining hall's page. The idea is that users about to go to a meal will want to explore the most practical (closest and open) options first.
Task 2 will first test the interactive features of the homepage and the food pages. Users will need to understand that the icons on the food page are clickable buttons. More critically, it will ask users to discover some way of accessing concise information for several items. This task is intended to unearth either the favorites page (easy and prompted) or multi-item searches (perhaps less intuitive).
Task 3 asks users to understand the search bar and tags. It will require the user to understand in some sense that the search bar is flexible in its input - it can match partial food items and tags, and combine multiple pieces in a single search. A possible way to solve this task is to individually search for specific food items; if this happens, we need to make search even more prominent and give better examples in the prompt text.
Thank you for agreeing to test Delp. To expedite the test, we have created a new user account that you can access with your SUNet ID. We will now ask you to complete several tasks using Delp. After giving you each task, we will not intervene except to answer any questions you may have. As a reminder, we will be taking photographs during this user test.
1. Identify the three closest dining halls to your current location, and find the hours and menu of the closest hall.
2. Browse Delp to find your favorite three food items, like and favorite them, and find where these items are served.
3. Please find all dining halls serving either [choose tags/partial names related to user's favorites, like "vegetarian or biscuits"].


| Created: | 6/27/2020 7:02:39 AM |
| Modified: | 6/27/2020 7:02:39 AM |
| Project: | |
| Advanced: |
| Attribute |
|
Public serial id |
|
Details:
|
|
Public integer budget_calendar_id |
|
Details:
|
|
Public integer adjustment_type_id |
|
Details:
|
|
Public bigint amount_cents |
|
Details:
|
|
Public varchar(255) created_by |
|
Details:
|
|
Public timestamp with time zone(0) created_at |
|
Details:
|
|
Public timestamp with time zone(0) updated_at |
|
Details:
|
|
Public varchar(255) updated_by |
|
Details:
|
| Operation | ||
|
Public budget_adjustments_pkey( id: serial, |
||
|
Details:
<<PK>>
|
| Element | Source Role | Target Role |
|
«table» budget_adjustment_versions Table «FK» |
Name: budget_adjustment_versions_budget_adjustment... |
Name: budget_adjustments_pkey |
|
Details:
|
| Tag | Value |
| Owner | public |
|
Details:
|
| Property | Value |
| isFinalSpecialization: | 0 |


IFRS 1 indicates that an entity (apart from certain exceptions which form the main part of the Standard), in its opening IFRS statement of financial position, shall:


Contact Sam and Scott
S&S'
Indonesia
Uganda
Nepal&India
Required information is marked with an asterisk (*).
Name:*
E-mail:*
Address:
Comments:*


Was a Lebanese-American writer, poet and visual artist, also considered a philosopher
although he himself rejected this title in his lifetime. He is best known as the author of The Prophet
, which was first published in the United States in 1923 and is one
of the best-selling books of all time, having been translated into dozens of languages.
Born in a village of the Ottoman-ruled Mount Lebanon Mutasarrifate to a Maronite Christian family, the young
Gibran immigrated with his mother and siblings to the United States in 1895.
As his mother worked as a seamstress, he was enrolled at a school in Boston, where his creative abilities were
quickly noticed by a teacher who presented him to Fred Holland Day. Gibran was sent back to his native land by
his family at the age of fifteen to enroll at al-Hikma School in Beirut.
Returning to Boston upon his youngest sister's death in 1902, he lost his older half-brother and his mother the
following year, seemingly relying afterwards on his remaining sister's income from her work at a dressmaker's
shop for some time.
| Book Name | Year | Rating |
|---|---|---|
| The Prophet | 1923 | 4.23 |
| A Tear and a Smile | 1950 | 4.03 |
| The Broken Wings | 1912 | 3.92 |
I would not exchange the sorrows of my hear
For the joys of the multitude.
And I would not have the tears
that sadness makes
To flow from my every part turn into laughter.
I would that my life remain a tear and a smile.
A tear to purify my heart and give me understanding
Of life's secrets and hidden things.

A tear to unite me with those of broken heart;
A smile to be a sign of my joy in existence.
I would rather that I died in yearning and longing
than that I live Weary and despairing.
I want the hunger for love and beauty to be in the
Depths of my spirit,for I have seen those who are
Satisfied the most wretched of people.
I have heard the sigh of those in yearning and Longing, and it is
sweeter
than the sweetest melody.
With evening's coming the flower folds her petals
And sleeps, embracingher longing.
At morning's approach
she opens her lips to meet
The sun's kiss.
I am dotted silver threads dropped from heaven
the gods.
Nature then takes me, to adorn
fields and valleys.
I am beautiful pearls, plucked from the
Crown of Ishtar by the daughter of Dawn
To embellish the gardens.
I cry the hills laugh;
When I humble myself the flowers rejoice;
When I bow, all things are elated.


|
MoveToCode
|
Interface for managing scenes in Unity. More...
Public Member Functions | |
| Task | LoadContent (IEnumerable< string > scenesToLoad, LoadSceneMode mode=LoadSceneMode.Additive, SceneActivationToken activationToken=null) |
| Async method to load the scenes by name. More... | |
| Task | UnloadContent (IEnumerable< string > scenesToUnload) |
| Async method to unload scenes by name. More... | |
| Task | LoadContent (string sceneToLoad, LoadSceneMode mode=LoadSceneMode.Additive, SceneActivationToken activationToken=null) |
| Async method to load a single scene by name. More... | |
| Task | UnloadContent (string sceneToUnload) |
| Async method to unload a single scene by name. More... | |
| Task | LoadContentByTag (string tag, LoadSceneMode mode=LoadSceneMode.Additive, SceneActivationToken activationToken=null) |
| Async method to load content scenes by tag. More... | |
| Task | UnloadContentByTag (string tag) |
| Async method to unload scenes by name. More... | |
| Task | LoadNextContent (bool wrap=false, LoadSceneMode mode=LoadSceneMode.Single, SceneActivationToken activationToken=null) |
| Loads the next content scene according to build index. More... | |
| Task | LoadPrevContent (bool wrap=false, LoadSceneMode mode=LoadSceneMode.Single, SceneActivationToken activationToken=null) |
| Loads the previous content scene according to build index. More... | |
| bool | IsContentLoaded (string sceneName) |
| Returns true if a content scene is fully loaded. More... | |
| void | SetLightingScene (string newLightingSceneName, LightingSceneTransitionType transitionType=LightingSceneTransitionType.None, float transitionDuration=1f) |
| Sets the current lighting scene. More... | |
| IEnumerable< Scene > | GetScenes (IEnumerable< string > sceneNames) |
| Returns a set of scenes by name. More... | |
| Scene | GetScene (string sceneName) |
| Returns a scene by name. More... | |
| Public Member Functions inherited from Microsoft.MixedReality.Toolkit.IMixedRealityEventSystem | |
| void | HandleEvent< T > (BaseEventData eventData, ExecuteEvents.EventFunction< T > eventHandler) |
| The main function for handling and forwarding all events to their intended recipients. More... | |
| void | Register (GameObject listener) |
| Registers a GameObjectto listen for events from this Event System. More... | |
| void | Unregister (GameObject listener) |
| Unregisters a GameObjectfrom listening for events from this Event System. More... | |
| void | RegisterHandler< T > (IEventSystemHandler handler) |
| Registers the given handler as a global listener for all events handled via the T interface. More... | |
| void | UnregisterHandler< T > (IEventSystemHandler handler) |
| Unregisters the given handler as a global listener for all events handled via the T interface. More... | |
| Public Member Functions inherited from Microsoft.MixedReality.Toolkit.IMixedRealityService | |
| void | Initialize () |
| The initialize function is used to setup the service once created. More... | |
| void | Reset () |
| Optional Reset function to perform that will Reset the service, for example, whenever there is a profile change. More... | |
| void | Enable () |
| Optional Enable function to enable / re-enable the service. More... | |
| void | Update () |
| Optional Update function to perform per-frame updates of the service. More... | |
| void | LateUpdate () |
| Optional LateUpdate function to that is called after Update has been called on all services. More... | |
| void | Disable () |
| Optional Disable function to pause the service. More... | |
| void | Destroy () |
| Optional Destroy function to perform cleanup of the service before the Mixed Reality Toolkit is destroyed. More... | |
Properties | |
| Action< IEnumerable< string > > | OnWillLoadContent [get, set] |
| Called just before a set of content scenes is loaded. More... | |
| Action< IEnumerable< string > > | OnContentLoaded [get, set] |
| Called when a set of content scenes have been loaded, activated and are valid. More... | |
| Action< IEnumerable< string > > | OnWillUnloadContent [get, set] |
| Called just before a set of content scenes will be unloaded. More... | |
| Action< IEnumerable< string > > | OnContentUnloaded [get, set] |
| Called after a set of content scenes have been completely unloaded. More... | |
| Action< string > | OnWillLoadLighting [get, set] |
| Called just before a lighting scene is loaded. More... | |
| Action< string > | OnLightingLoaded [get, set] |
| Called when a lighting scene has been loaded, activated and is valid. More... | |
| Action< string > | OnWillUnloadLighting [get, set] |
| Called just before a lighting scene unload operation begins. More... | |
| Action< string > | OnLightingUnloaded [get, set] |
| Called after a lighting scene has been completely unloaded. More... | |
| Action< string > | OnWillLoadScene [get, set] |
| Called just before a scene is loaded. More... | |
| Action< string > | OnSceneLoaded [get, set] |
| Called when scene has been loaded, activated and is valid. More... | |
| Action< string > | OnWillUnloadScene [get, set] |
| Called just before a scene will be unloaded Called for all scene types (content, lighting and manager) Includes scene name More... | |
| Action< string > | OnSceneUnloaded [get, set] |
| Called when scene has been unloaded Called for all scene types (content, lighting and manager) Includes scene name More... | |
| bool | SceneOperationInProgress [get] |
| True if the scene system is loading or unloading content scenes. More... | |
| float | SceneOperationProgress [get] |
| Progress of the current scene operation, from 0-1. More... | |
| bool | LightingOperationInProgress [get] |
| True if the scene system is transitioning from one lighting scene to another. More... | |
| float | LightingOperationProgress [get] |
| Progress of current lighting operation, from 0-1 More... | |
| bool | WaitingToProceed [get] |
| True when content has been loaded with an activation token and AllowSceneActivation has not been set to true. More... | |
| string | ActiveLightingScene [get] |
| Name of the currently loaded lighting scene. More... | |
| bool | PrevContentExists [get] |
| Returns true if a content scene appears in build settings PRIOR to the latest loaded build index. More... | |
| bool | NextContentExists [get] |
| Returns true if a content scene appears in build settings AFTER the latest loaded build index. More... | |
| string[] | ContentSceneNames [get] |
| An array of content scenes available to load / unload. More... | |
| Properties inherited from Microsoft.MixedReality.Toolkit.IMixedRealityEventSystem | |
| List< GameObject > | EventListeners [get] |
| List of event listeners that are registered to this Event System. More... | |
| Properties inherited from Microsoft.MixedReality.Toolkit.IMixedRealityService | |
| string | Name [get] |
| Optional Priority attribute if multiple services of the same type are required, enables targeting a service for action. More... | |
| uint | Priority [get] |
| Optional Priority to reorder registered managers based on their respective priority, reduces the risk of race conditions by prioritizing the order in which managers are evaluated. More... | |
| BaseMixedRealityProfile | ConfigurationProfile [get] |
| The configuration profile for the service. More... | |
| Properties inherited from Microsoft.MixedReality.Toolkit.IMixedRealityEventSource | |
| uint | SourceId [get] |
| The unique source id of this event source. More... | |
| string | SourceName [get] |
| The name of this event source. More... | |
Interface for managing scenes in Unity.
Scenes are divided into three categories: Manager, Lighting and Content.
The Manager scene is loaded first and remains loaded for the duration of the app. Only one Manager scene is ever loaded, and no scene operation will ever unload it.
The Lighting scene is a largely empty scene which controls lighting settings. Ambient lighting, skybox, sun direction, etc. A default lighting scene is loaded on initialization. After that the active lighting scene may be changed at any time via SetLightingScene. Only one lighting scene can ever be loaded at a time.
Content scenes are everything else. These can be loaded and unloaded at will in any combination.
The scene actions provided improve on unity's SceneManagement events by ensuring that scenes are considered valid before the action is invoked.
| Scene Microsoft.MixedReality.Toolkit.SceneSystem.IMixedRealitySceneSystem.GetScene | ( | string | sceneName | ) |
Returns a scene by name.
Useful for processing events.
Implemented in Microsoft.MixedReality.Toolkit.SceneSystem.MixedRealitySceneSystem.
| IEnumerable<Scene> Microsoft.MixedReality.Toolkit.SceneSystem.IMixedRealitySceneSystem.GetScenes | ( | IEnumerable< string > | sceneNames | ) |
Returns a set of scenes by name.
Useful for processing events.
Implemented in Microsoft.MixedReality.Toolkit.SceneSystem.MixedRealitySceneSystem.
| bool Microsoft.MixedReality.Toolkit.SceneSystem.IMixedRealitySceneSystem.IsContentLoaded | ( | string | sceneName | ) |
Returns true if a content scene is fully loaded.
Implemented in Microsoft.MixedReality.Toolkit.SceneSystem.MixedRealitySceneSystem.
| Task Microsoft.MixedReality.Toolkit.SceneSystem.IMixedRealitySceneSystem.LoadContent | ( | IEnumerable< string > | scenesToLoad, |
| LoadSceneMode | mode = LoadSceneMode.Additive , |
||
| SceneActivationToken | activationToken = null |
||
| ) |
Async method to load the scenes by name.
If a scene operation is in progress, no action will be taken.
| scenesToLoad | Names of content scenes to load. Invalid scenes will be ignored. |
| mode | Additive mode will load the content additively. Single mode will first unload all loaded content scenes first. |
| activationToken | Optional token for manual scene activation. Useful for loading screens and multiplayer. If not null, operation will wait until activationToken's AllowSceneActivation value is true before activating scene objects. |
Implemented in Microsoft.MixedReality.Toolkit.SceneSystem.MixedRealitySceneSystem.
| Task Microsoft.MixedReality.Toolkit.SceneSystem.IMixedRealitySceneSystem.LoadContent | ( | string | sceneToLoad, |
| LoadSceneMode | mode = LoadSceneMode.Additive , |
||
| SceneActivationToken | activationToken = null |
||
| ) |
Async method to load a single scene by name.
If a scene operation is in progress, no action will be taken.
| sceneToLoad | Name of content scene to load. Invalid scenes will be ignored. |
| mode | Additive mode will load the content additively. Single mode will first unload all loaded content scenes first. |
| activationToken | Optional token for manual scene activation. Useful for loading screens and multiplayer. If not null, operation will wait until activationToken's AllowSceneActivation value is true before activating scene objects. |
Implemented in Microsoft.MixedReality.Toolkit.SceneSystem.MixedRealitySceneSystem.
| Task Microsoft.MixedReality.Toolkit.SceneSystem.IMixedRealitySceneSystem.LoadContentByTag | ( | string | tag, |
| LoadSceneMode | mode = LoadSceneMode.Additive , |
||
| SceneActivationToken | activationToken = null |
||
| ) |
Async method to load content scenes by tag.
All scenes with the supplied tag will be loaded. If no scenes with this tag are found, no action will be taken. If a scene operation is in progress, no action will be taken.
| tag | Scene tag. |
| mode | Additive mode will load the content additively. Single mode will first unload all loaded content scenes first. |
| activationToken | Optional token for manual scene activation. Useful for loading screens and multiplayer. If not null, operation will wait until activationToken's AllowSceneActivation value is true before activating scene objects. |
Implemented in Microsoft.MixedReality.Toolkit.SceneSystem.MixedRealitySceneSystem.
| Task Microsoft.MixedReality.Toolkit.SceneSystem.IMixedRealitySceneSystem.LoadNextContent | ( | bool | wrap = false , |
| LoadSceneMode | mode = LoadSceneMode.Single , |
||
| SceneActivationToken | activationToken = null |
||
| ) |
Loads the next content scene according to build index.
Uses the last-loaded content scene as previous build index. If no next content exists, and wrap is false, no action is taken. Use NextContentExists to verify that this operation is possible (if not using wrap).
| wrap | If true, if the current scene is the LAST content scene, the FIRST content scene will be loaded. |
| mode | Additive mode will load the content additively. Single mode will first unload all loaded content scenes first. |
| activationToken | Optional token for manual scene activation. Useful for loading screens and multiplayer. If not null, operation will wait until activationToken's AllowSceneActivation value is true before activating scene objects. |
Implemented in Microsoft.MixedReality.Toolkit.SceneSystem.MixedRealitySceneSystem.
| Task Microsoft.MixedReality.Toolkit.SceneSystem.IMixedRealitySceneSystem.LoadPrevContent | ( | bool | wrap = false , |
| LoadSceneMode | mode = LoadSceneMode.Single , |
||
| SceneActivationToken | activationToken = null |
||
| ) |
Loads the previous content scene according to build index.
Uses the loaded content scene with the smallest build index as previous build index. If no previous content exists, and wrap is false, no action is taken. Use PrevContentExists to verify that this operation is possible (if not using wrap).
| wrap | If true, if the current scene is the FIRST content scene, the LAST content scene will be loaded. |
| mode | Additive mode will load the content additively. Single mode will first unload all loaded content scenes first. |
| activationToken | Optional token for manual scene activation. Useful for loading screens and multiplayer. If not null, operation will wait until activationToken's AllowSceneActivation value is true before activating scene objects. |
Implemented in Microsoft.MixedReality.Toolkit.SceneSystem.MixedRealitySceneSystem.
| void Microsoft.MixedReality.Toolkit.SceneSystem.IMixedRealitySceneSystem.SetLightingScene | ( | string | newLightingSceneName, |
| LightingSceneTransitionType | transitionType = LightingSceneTransitionType.None , |
||
| float | transitionDuration = 1f |
||
| ) |
Sets the current lighting scene.
The lighting scene determines ambient light and skybox settings. It can optionally contain light objects. If the lighting scene is already loaded, no action will be taken. If a lighting scene transition is in progress, request will be queued and executed when the transition is complete.
| lightingSceneName | The name of the lighting scene. |
| transitionType | The transition type to use. See LightingSceneTransitionType for information about each transition type. |
| transitionDuration | The duration of the transition (if not None). |
Implemented in Microsoft.MixedReality.Toolkit.SceneSystem.MixedRealitySceneSystem.
| Task Microsoft.MixedReality.Toolkit.SceneSystem.IMixedRealitySceneSystem.UnloadContent | ( | IEnumerable< string > | scenesToUnload | ) |
Async method to unload scenes by name.
If a scene is not loaded, it will be ignored. If a scene operation is in progress, no action will be taken.
Implemented in Microsoft.MixedReality.Toolkit.SceneSystem.MixedRealitySceneSystem.
| Task Microsoft.MixedReality.Toolkit.SceneSystem.IMixedRealitySceneSystem.UnloadContent | ( | string | sceneToUnload | ) |
Async method to unload a single scene by name.
If the scene is not loaded, no action will be taken. If a scene operation is in progress, no action will be taken.
Implemented in Microsoft.MixedReality.Toolkit.SceneSystem.MixedRealitySceneSystem.
| Task Microsoft.MixedReality.Toolkit.SceneSystem.IMixedRealitySceneSystem.UnloadContentByTag | ( | string | tag | ) |
Async method to unload scenes by name.
If a scene is not loaded, it will be ignored. If a scene operation is in progress, no action will be taken.
| tag | Scene tag |
Implemented in Microsoft.MixedReality.Toolkit.SceneSystem.MixedRealitySceneSystem.
|
get |
Name of the currently loaded lighting scene.
If a transition is in progress, this reports the target lighting scene we're transitioning to.
|
get |
An array of content scenes available to load / unload.
Order in array matches build order. Useful if you want to present an ordered list of options, or if you want to track which scenes are loaded via IsContentLoaded.
|
get |
True if the scene system is transitioning from one lighting scene to another.
Lighting operations will not impede other operations.
|
get |
Progress of current lighting operation, from 0-1
|
get |
Returns true if a content scene appears in build settings AFTER the latest loaded build index.
Use to verify that LoadNextContent can be performed without wrapping.
|
getset |
Called when a set of content scenes have been loaded, activated and are valid.
Includes names of all scenes loaded.
|
getset |
Called after a set of content scenes have been completely unloaded.
Includes names of all scenes about to be unloaded.
|
getset |
Called when a lighting scene has been loaded, activated and is valid.
Includes scene name.
|
getset |
Called after a lighting scene has been completely unloaded.
Includes scene name.
|
getset |
Called when scene has been loaded, activated and is valid.
Called for all scene types (content, lighting and manager) Includes scene name
|
getset |
Called when scene has been unloaded Called for all scene types (content, lighting and manager) Includes scene name
|
getset |
Called just before a set of content scenes is loaded.
Includes names of all scenes about to be loaded.
|
getset |
Called just before a lighting scene is loaded.
Includes name of scene.
|
getset |
Called just before a scene is loaded.
Called for all scene types (content, lighting and manager) Includes scene name
|
getset |
Called just before a set of content scenes will be unloaded.
Includes names of all scenes about to be unloaded.
|
getset |
Called just before a lighting scene unload operation begins.
Includes scene name.
|
getset |
Called just before a scene will be unloaded Called for all scene types (content, lighting and manager) Includes scene name
|
get |
Returns true if a content scene appears in build settings PRIOR to the latest loaded build index.
Use to verify that LoadPrevContent can be performed without wrapping.
|
get |
True if the scene system is loading or unloading content scenes.
Manager and lighting scenes are ignored.
|
get |
Progress of the current scene operation, from 0-1.
A scene operation may include multiple concurrently loaded scenes.
|
get |
True when content has been loaded with an activation token and AllowSceneActivation has not been set to true.
Useful for existing entities that shouldn't act until a newly loaded scene is actually activated.


My first page
Useless line
This is a button
Hey, Listen
Did you listen?
This is really my first page
This is the second element.


ThreeJS Experiments
Basic
- A simple spinning cube
Flock
- Flocking objects
Br3akout
- Breakout clone (wip)
These examples use ECMAScript 2016 features. Please make sure you are using a modern browser like Firefox or Chromium.


{{ "" | safeHTML }} {{ with .Site.Params.callforpapers.title }}{{ . | markdownify }}{{ end }} Book of abstracts is ready ! Click here to download
Book of abstracts is ready ! Click here to download


The polygon contains an outer ring and zero or more inner rings.
More...
template<typename Point, bool ClockWise = true, bool Closed = true, template< typename, typename > class PointList = std::vector, template< typename, typename > class RingList = std::vector, template< typename > class PointAlloc = std::allocator, template< typename > class RingAlloc = std::allocator>
class boost::geometry::model::polygon< Point, ClockWise, Closed, PointList, RingList, PointAlloc, RingAlloc >
The polygon contains an outer ring and zero or more inner rings.
- Template Parameters
-
| Point | point type |
| ClockWise | true for clockwise direction, false for CounterClockWise direction |
| Closed | true for closed polygons (last point == first point), false open points |
| PointList | container type for points, for example std::vector, std::list, std::deque |
| RingList | container type for inner rings, for example std::vector, std::list, std::deque |
| PointAlloc | container-allocator-type, for the points |
| RingAlloc | container-allocator-type, for the rings |
- Note
- The container collecting the points in the rings can be different from the container collecting the inner rings. They all default to vector.
- Examples:
- 02_linestring_example.cpp, 03_polygon_example.cpp, 06_a_transformation_example.cpp, and 06_b_transformation_example.cpp.
template<typename Point, bool ClockWise = true, bool Closed = true, template< typename, typename > class PointList = std::vector, template< typename, typename > class RingList = std::vector, template< typename > class PointAlloc = std::allocator, template< typename > class RingAlloc = std::allocator>
template<typename Point, bool ClockWise = true, bool Closed = true, template< typename, typename > class PointList = std::vector, template< typename, typename > class RingList = std::vector, template< typename > class PointAlloc = std::allocator, template< typename > class RingAlloc = std::allocator>
| typedef ring<Point, ClockWise, Closed, PointList, PointAlloc> boost::geometry::model::polygon< Point, ClockWise, Closed, PointList, RingList, PointAlloc, RingAlloc >::ring_type |
template<typename Point, bool ClockWise = true, bool Closed = true, template< typename, typename > class PointList = std::vector, template< typename, typename > class RingList = std::vector, template< typename > class PointAlloc = std::allocator, template< typename > class RingAlloc = std::allocator>
template<typename Point, bool ClockWise = true, bool Closed = true, template< typename, typename > class PointList = std::vector, template< typename, typename > class RingList = std::vector, template< typename > class PointAlloc = std::allocator, template< typename > class RingAlloc = std::allocator>
Default constructor, creating an empty polygon.
template<typename Point, bool ClockWise = true, bool Closed = true, template< typename, typename > class PointList = std::vector, template< typename, typename > class RingList = std::vector, template< typename > class PointAlloc = std::allocator, template< typename > class RingAlloc = std::allocator>
Constructor taking std::initializer_list, filling the polygon.
template<typename Point, bool ClockWise = true, bool Closed = true, template< typename, typename > class PointList = std::vector, template< typename, typename > class RingList = std::vector, template< typename > class PointAlloc = std::allocator, template< typename > class RingAlloc = std::allocator>
template<typename Point, bool ClockWise = true, bool Closed = true, template< typename, typename > class PointList = std::vector, template< typename, typename > class RingList = std::vector, template< typename > class PointAlloc = std::allocator, template< typename > class RingAlloc = std::allocator>
template<typename Point, bool ClockWise = true, bool Closed = true, template< typename, typename > class PointList = std::vector, template< typename, typename > class RingList = std::vector, template< typename > class PointAlloc = std::allocator, template< typename > class RingAlloc = std::allocator>
template<typename Point, bool ClockWise = true, bool Closed = true, template< typename, typename > class PointList = std::vector, template< typename, typename > class RingList = std::vector, template< typename > class PointAlloc = std::allocator, template< typename > class RingAlloc = std::allocator>
template<typename Point, bool ClockWise = true, bool Closed = true, template< typename, typename > class PointList = std::vector, template< typename, typename > class RingList = std::vector, template< typename > class PointAlloc = std::allocator, template< typename > class RingAlloc = std::allocator>
Utility method, clears outer and inner rings.


|
This widget lets you display images in a rich interactive
visualization similar to that of Apple iTunes known as Cover Flow.
It is a Flash-based implementation.
Links
CreditsOriginal author: David Huynh. The images used for this demo are from Freebase. |
The Flash widget can fire events to update the web page's Javascript. For example, when you select a new image in the widget above, this text in HTML should be updated: . The web page's Javascript can change the Flash widget on the fly. Try changing the various settings below: Theme:
|


Vector Magnatude
Accelerate Toward Mouse
Vector Multiplication
Vector Normalize
Vector Sample
Vector Subtraction
Walker
Box
Gaussian Distribution
Circles
Tethered Circles


--- layout: archive title: Zulip Chat Archive permalink: /stream/113488-general/topic/compute.20value.20of.20function.html ---
Hi. Lean-newbie here. I've got a function f : \N \to \Z with a pretty involved definition. I would like to see what Lean thinks that the value of f is on 0,1,2,3 for example.
My current approach has been:
example : f 0 = n := refl
and then just trying different values of n, until I am lucky. But there should be a better way...
(Ok, I just saw there is a "new members" stream. If someone can move this topic overthere, please feel free to do so.)

It uses the virtual machine so if f
is computation intensive, this will ensure swift execution
If you want slow execution, you can try #reduce f x
;).
(Also your refl
trick made me giggle so you're awarded a pointless internet point.)
(I think we can use octopuses to award those internet points)
What an excellent idea.
Thanks for the point!
thanks)
the rfl
thing is considered good style if you go by "Software Foundations"
it's basically inline unit testing
I have no recollection of that in SF o_O?
Aaah right.
You mean his auto-tests.
yeah, for ex
Definition hd (default:nat) (l:natlist) : nat := match l with | nil ⇒ default | h :: t ⇒ h end. Definition tl (l:natlist) : natlist := match l with | nil ⇒ nil | h :: t ⇒ t end. Example test_hd1: hd 0 [1;2;3] = 1. Proof. reflexivity. Qed. Example test_hd2: hd 0 [] = 0. Proof. reflexivity. Qed. Example test_tl: tl [1;2;3] = [2;3]. Proof. reflexivity. Qed.
Yeah absolutely.
Oh boy that book is such an excellent introduction to these things.
Compare that to CPDT... :-\.
(Sorry Adam...)
yeah, if you do 2 semesters of software foundations
first
maybe you can understand cpdt, except you still won't
Anyway, the function in question is the Ramanujan tau function (https://en.wikipedia.org/wiki/Ramanujan%27s_tau_function)
Already #reduce \tau 2
is extremely slow for my implementation.
But #eval \tau 4
is pretty fast. And the first 5 values are correct (^;
Last updated: Apr 24 2020 at 19:02 UTC


What would you like to search?
Donald Trump
Maybe they fixed it. I haven't been on the beta site since


Design
Web Page Plan
Purpose
Provide users with access to my EDA exercises in a logical consistent way.
Goal
Provide a well designed web page that meets all the Solo Challenge requirements, meets all the stated Learning Competencies and exhibits good design.
Target Audience
Kereru Community and EDA team
Content
Navigation Bar
Links to Pages:
EDA Exercise 1 - Introduction to me
EDA Exercise 2 - Baking a Carob Cake
Technical Blog
Cultural Blog
Wireframe Examples
My Wireframe Exercise
Design features to consider:
Fonts, Colours, Images, Icons, Navigation Method
Footer Info
Site Map
Wireframe


(Authentic South Asian grocery)
(For all best Caribbean foods and beverages)
(For all your Indian/Sri-Lankan/Pakistani culinary expeditions)
Discounted delivery for students.
10% discount on purchase of $100 or more
10% discount on purchase of $50 or more
Find 1,000's of products from the stores you already shop at.
Last updated 3 mins ago
We make deliveries in cities like Toronto, Kitchener, Ottawa. London, Brampton. Mississauga, London and many more.
Last updated 3 mins ago
Find exclusive deals on popular products -- delivered to your front door!
Last updated 3 mins ago


a
| Building | Floor | Expiring Time |
|---|---|---|
| {{reservation.buildingName}} | {{reservation.floorNumber}} | {{reservation.time}} |
| Name | Building | Floor |
|---|---|---|
| {{reservation.rooms[0].name}} | {{reservation.rooms[0].buildingName}} | {{reservation.rooms[0].floor}} |
| ID | Building | Floor |
|---|---|---|
| {{seat.id}} | {{seat.buildingName}} | {{seat.floor}} |


Installation:¶
Where to get it¶
The source code is currently hosted on GitHub at: https://github.com/calypso-science/Totoview
Module requirements:¶
Toto module needs to be installed: The source code is currently hosted on GitHub at: https://github.com/calypso-science/Toto
For windows user, if using the compiled version (.exe file)A environmental variable must be setup To set it up temporarily:
set TotoPath=C:\user\software\toto
or add TotoPath as environmental variable
Install from sources¶
- Toto toolbox needs to be installed :
see https://github.com/calypso-science/Toto for instructions
Install requirements. Navigate to the base root of totoview and execute:
pip install -r requirements.txt
Then install totoview:
python setup.py install
Windows installation:¶
Once installed, WINDOWS user must set up an Environmental variable with the folder name from where TOTO has been installed. The variable MUST be called TotoPath.
Using the compiled version¶
There are two versions of TOTOVIEW that are already compiled for Windows user. They can be found on the GitHub page:
totoview_withtoto.exe.
This version will install TOTO and TOTOVIEW. No need to install TOTO, it is included in it. However, you will need to wait for a new release to update your code
totoview_nototo.exe.
This version will install TOTOVIEW and TOTO’s requirement. You still need to install TOTO but you can skip the requirement installation. This is easier to update TOTO’s code, just need to pull the updated code from GitHub and re-install TOTO.


Review the counselling guidelines outlined before submitting. This will open a new window.
Office:
Toll free - 1<PHONE_NUMBER>
Office:
Lower Mainland -<PHONE_NUMBER>
Mailing:
PO Box 5550 Station Terminal,
Vancouver, BC V6B 1H1
Email:
{{cvapEmail}}
It looks like you are using an unsupported browser.
For best results, we recommend you use Chrome, Firefox, Edge, or Safari.
Welcome to the Crime Victim Assistance Program's (CVAP) invoice submission form for counselling services.
First time users please click the link to review instructions. Link
The legal name to whom the cheque/payment is made to.
The payment method on file with the Crime Victim Assistance Program will be used for payment of this invoice. Please contact the Crime Victim Assistance Program if you need to set up or make any changes to your method of payment.
Refer to the CVAP Contact Information on the left
For example Registered psychologist are exempted from GST.
The total amount will be calculated based on the rate that the counsellor on file is registered for. For reference, the calculation will be as follows:
| Rate | Session Hours | Total |
|---|---|---|
| $40 | n hours | $40 x n hrs = total |
| $60 | n hours | $60 x n hrs = total |
| $80 | n hours | $80 x n hrs = total |
| $95 | n hours | $95 x n hrs = total |
| $105 | n hours | $105 x n hrs = total |
| $15 | n hours | $15 x n hrs = total |
If additional information is required, we will be in contact with you. Once invoices are processed, payment will be issued within a few days
Please check the accuracy of the information entered in your invoice before submitting.
| Vendor Number | {{ valueOrEmpty('invoiceDetails.vendorNumber') }} |
|---|---|
| Postal Code | {{ valueOrEmpty('invoiceDetails.vendorPostalCode') }} |
| Counsellor Registration Number | {{ valueOrEmpty('invoiceDetails.counsellorRegistrationNumber') }} |
|---|---|
| Counsellor Last Name | {{ valueOrEmpty('invoiceDetails.counsellorLastName') }} |
| Claimant's Name | {{ valueOrEmpty('invoiceDetails.claimantsFirstName') }} {{ valueOrEmpty('invoiceDetails.claimantsLastName') }} |
|---|---|
| Claim Number | {{ valueOrEmpty('invoiceDetails.claimNumber') }} |
| Invoice Number | {{ valueOrEmpty('invoiceDetails.invoiceNumber') }} |
|---|---|
| Invoice Date | {{ datesOrEmpty(['invoiceDetails.invoiceDate']) }} |
| SESSION DATES | COUNSELLING TYPE | HOURS | MISSED SESSION |
|---|---|---|---|
| {{ datesOrEmpty([item.get('sessionDate')]) }} | {{ enumHelper.InvoiceCounsellingType[valueForEnum(item.get('counsellingType'))] }} | {{ item.get('sessionHours').value }} |
| GST Applicable | {{ valueOrEmpty('invoiceDetails.gstApplicable') }} |
|---|
| Submitter's Full Name | {{ valueOrEmpty('invoiceDetails.submitterFullName') }} |
|---|---|
| Submitter's Email | {{ valueOrEmpty('invoiceDetails.submitterEmailAddress') }} |
In the event that there is an issue with the information submitted, a staff member from the Crime Victim Assistance Program will contact you.
Click here to return to Crime Victim Assistance Program Invoicing Home Page
You have successfully cancelled the invoice.
Please contact the Crime Victim Assistance Program (CVAP) if you need information to assist you in completing the invoice submission process. Refer to the CVAP Contact Information on the left."
Click here to return to Crime Victim Assistance Program Invoicing Home Page


{% extends "master.html" %} {% block title %} - Overview{% endblock %} {% block head_main %} {% endblock %} {% block content %}
In the future, this page will show details and activity updates regarding your network and scenarios. In the mean time, you can do something with your network: