|
Intertwingularity
Intertwingularity is a term coined by Ted Nelson to express the complexity of interrelations in human knowledge. Nelson wrote in ''Computer Lib/Dream Machines'' : "EVERYTHING IS DEEPLY INTERTWINGLED. In an important sense there are no " subjects" at all; there is only all knowledge, since the cross-connections among the myriad topics of this world simply cannot be divided up neatly." He added the following comment in the revised edition : "Hierarchical and sequential structures, especially popular since Gutenberg, are usually forced and artificial. Intertwingularity is not generally acknowledged—people keep pretending they can make things hierarchical, categorizable and sequential when they can't." Intertwingularity is related to Nelson's coined term hypertext, partially inspired by "As We May Think" (1945) by Vannevar Bush. Influence Peter Morville, an influential figure in information architecture, discusses intertwingularity in some of his books. In ''Ambient Findability: W ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Computer Lib/Dream Machines
''Computer Lib/Dream Machines'' is a 1974 book by Ted Nelson, printed as a two-front-cover paperback to indicate its " intertwingled" nature. Originally self-published by Nelson, it was republished with a foreword by Stewart Brand in 1987 by Microsoft Press. In Steven Levy's book ''Hackers'', ''Computer Lib'' is described as "the epic of the computer revolution, the bible of the hacker dream. elsonwas stubborn enough to publish it when no one else seemed to think it was a good idea." Published just before the release of the Altair 8800 kit, ''Computer Lib'' is often considered the first book about the personal computer. Background Prior to the initial release of ''Computer Lib/Dream Machines'', Nelson was working on the first hypertext project, Project Xanadu, founded in 1960. An integral part to the Xanadu vision was computing technology and the freedom he believed came with it. These ideas were later compiled and elaborated upon in the 1974 text, around the time when lo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Ted Nelson
Theodor Holm Nelson (born June 17, 1937) is an American pioneer of information technology, philosopher, and sociologist. He coined the terms ''hypertext'' and ''hypermedia'' in 1963 and published them in 1965. According to his 1997 ''Forbes'' profile, Nelson "sees himself as a literary romantic, like a Cyrano de Bergerac, or 'the Orson Welles of software'." Early life and education Nelson is the son of Emmy Awards, Emmy Award–winning director Ralph Nelson and Academy Awards, AcademyAwardwinning actress Celeste Holm. His parents' marriage was brief and he was mostly raised by his grandparents, first in Chicago and later in Greenwich Village. Nelson earned a Bachelor of Arts, B.A. in philosophy from Swarthmore College in 1959. Following a year of graduate study in sociology at the University of Chicago, Nelson began graduate work in Social Relations, then a department at Harvard University, specializing in sociology, and ultimately earned a M.A in sociology from the Departmen ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Sam Ruby
Sam Ruby is a prominent software developer who has made significant contributions to web standards and open source software projects. In particular he has contributed to the standardization of syndicated web feeds via his involvement with the Atom standard and the Feed Validator web service. He currently holds the position of Rails Specialist aFly.io He resides in Raleigh, North Carolina. Background Sam Ruby received a B.A. in mathematics from Christopher Newport University, Newport News, Virginia. Ruby was hired immediately out of college by IBM and has worked there since. Apache Project Ruby is a former board member of the Apache Software Foundation. He formerly served as president; Assistant Secretary; Director, Vice President of Legal Affairs; and was the former Chair of the Apache Jakarta Project. He also actively contributes to numerous Apache projects. Notably, he was one of the early Ant contributors, as well as being the creator of Gump. Feed Validator Ruby is the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Connectedness
In mathematics, connectedness is used to refer to various properties meaning, in some sense, "all one piece". When a mathematical object has such a property, we say it is connected; otherwise it is disconnected. When a disconnected object can be split naturally into connected pieces, each piece is usually called a ''component'' (or ''connected component''). Connectedness in topology A topological space is said to be ''connected space, connected'' if it is not the union of two disjoint sets, disjoint nonempty open sets. A Set (mathematics), set is open if it contains no point lying on its boundary (topology), boundary; thus, in an informal, intuitive sense, the fact that a space can be partitioned into disjoint open sets suggests that the boundary between the two sets is not part of the space, and thus splits it into two separate pieces. Other notions of connectedness Fields of mathematics are typically concerned with special kinds of objects. Often such an object is said to be ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Jamie Zawinski
Jamie Werner Zawinski (born November 3, 1968), commonly known as jwz, is an American computer programmer, blogger, and impresario. He is best known for his role in the creation of Netscape Navigator, Netscape Mail, Lucid Emacs, Mozilla.org, and XScreenSaver. He is also the proprietor of DNA Lounge, a nightclub and Music venue, live music venue in San Francisco. Biography Zawinski's programming career began at age 16 with Scott Fahlman's Spice Lisp project at Carnegie Mellon University. He then worked at AI startup Expert Technologies, Inc. followed by Robert Wilensky and Peter Norvig's AI research group at University of California, Berkeley, UC Berkeley, working on natural language processing. In 1990 he began working at Lucid Inc., first working on Lucid Common Lisp, and then on Lucid's Energize C++ Integrated development environment, IDE. Lucid decided to use GNU Emacs as the text editor for their IDE due to its free license, popularity, and extensibility, and Zawinski led ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
 |
Rhizome (philosophy)
A rhizome is a concept in post-structuralism describing an Assemblage (philosophy), assemblage that allows connections between any of its constituent elements, regardless of any predefined ordering, structure, or entry point. It is a central concept in the work of French Theorists Deleuze and Guattari, Gilles Deleuze and Felix Guattari, who use the term frequently in their development of schizoanalysis. Deleuze and Guattari use the terms "rhizome" and "rhizomatic" (from Ancient Greek , , "mass of roots") to describe a network that "connects any point to any other point". The term is first introduced in Deleuze and Guattari's 1975 book ''Kafka: Toward a Minor Literature'' to suggest that Kafka's work is not bound by linear narrative structure, and can be entered into at any point to map out connections with other points. The term is heavily expanded upon in Deleuze and Guattari's 1980 work ''A Thousand Plateaus'', where it is used to refer to networks that establish "connections b ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
Polysemy
Polysemy ( or ; ) is the capacity for a Sign (semiotics), sign (e.g. a symbol, morpheme, word, or phrase) to have multiple related meanings. For example, a word can have several word senses. Polysemy is distinct from ''monosemy'', where a word has a single meaning. Polysemy is distinct from homonymy—or homophone, homophony—which is an Accident (philosophy), accidental similarity between two or more words (such as ''bear'' the animal, and the verb wikt:bear#Etymology 2, ''bear''); whereas homonymy is a mere linguistic coincidence, polysemy is not. In discerning whether a given set of meanings represent polysemy or homonymy, it is often necessary to look at the history of the word to see whether the two meanings are historically related. Lexicography, Dictionary writers often list polysemes (words or phrases with different, but related, senses) in the same entry (that is, under the same headword) and enter homonyms as separate headwords (usually with a numbering convention such ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
 |
Multiple Inheritance
Multiple inheritance is a feature of some object-oriented computer programming languages in which an object or class can inherit features from more than one parent object or parent class. It is distinct from single inheritance, where an object or class may only inherit from one particular object or class. Multiple inheritance has been a controversial issue for many years, with opponents pointing to its increased complexity and ambiguity in situations such as the "diamond problem", where it may be ambiguous as to which parent class a particular feature is inherited from if more than one parent class implements said feature. This can be addressed in various ways, including using virtual inheritance. Alternate methods of object composition not based on inheritance such as mixins and traits have also been proposed to address the ambiguity. Details In object-oriented programming (OOP), ''inheritance'' describes a relationship between two classes in which one class (the ''child'' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
 |
Multigraph
In mathematics, and more specifically in graph theory, a multigraph is a graph which is permitted to have multiple edges (also called ''parallel edges''), that is, edges that have the same end nodes. Thus two vertices may be connected by more than one edge. There are 2 distinct notions of multiple edges: * ''Edges without own identity'': The identity of an edge is defined solely by the two nodes it connects. In this case, the term "multiple edges" means that the same edge can occur several times between these two nodes. * ''Edges with own identity'': Edges are primitive entities just like nodes. When multiple edges connect two nodes, these are different edges. A multigraph is different from a hypergraph, which is a graph in which an edge can connect any number of nodes, not just two. For some authors, the terms ''pseudograph'' and ''multigraph'' are synonymous. For others, a pseudograph is a multigraph that is permitted to have loops. Undirected multigraph (edges without ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
Multi-label Classification
In machine learning, multi-label classification or multi-output classification is a variant of the statistical classification, classification problem where multiple nonexclusive labels may be assigned to each instance. Multi-label classification is a generalization of multiclass classification, which is the single-label problem of categorizing instances into precisely one of several (greater than or equal to two) classes. In the multi-label problem the labels are nonexclusive and there is no constraint on how many of the classes the instance can be assigned to. The formulation of multi-label learning was first introduced by Shen et al. in the context of Semantic Scene Classification,Xipeng Shen, Matthew Boutell, Jiebo Luo, and Christopher Brown,Multi-label Machine Learning and Its Application to Semantic Scene Classification, In Proceedings of IS&T/SPIE's Sixteenth Anaual Symposium on Electronic Imaging: Science and Technology (EI 2004), San Jose, California, USA, January 2004, pag ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Multicriteria Classification
In multiple criteria decision aiding (MCDA), multicriteria classification (or sorting) involves problems where a finite set of alternative actions should be assigned into a predefined set of preferentially ordered categories (classes). For example, credit analysts classify loan applications into risk categories (e.g., acceptable/unacceptable applicants), customers rate products and classify them into attractiveness groups, candidates for a job position are evaluated and their applications are approved or rejected, technical systems are prioritized for inspection on the basis of their failure risk, clinicians classify patients according to the extent to which they have a complex disease or not, etc. Problem statement In a multicriteria classification problem (MCP) a set : X=\ of ''m'' alternative actions is available. Each alternative is evaluated over a set of ''n'' criteria. The scope of the analysis is to assign each alternative into a given set of categories (classes) ''C'' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |