Limada

limada::concept (0 comments)

limada::concept (0 comments)

limada::concept version 0.081 is an application to draw, edit and store concept maps. * NEW: Create and edit rich text notes * NEW: HTML-Viewer is now backed on Gecko 1.9 (Firefox-Engine) * NEW: HTML-Viewer uses a build in proxy-webserver, so you ... [More] can browse in the database DOWNLOAD: http://sourceforge.net/projects/limada/files/Limada/limada_concept%200.08/Limada-0.081.zip/download INFO: http://limada.sourceforge.net A concept map is a diagram showing the relationships among concepts. They are graphical tools for organizing and representing knowledge. They include concepts, usually enclosed in circles or boxes of some type, and relationships between concepts indicated by a connecting line linking two concepts. Concepts can be connected with labeled arrows. The relationship between concepts can be articulated in linking phrases, e.g., "gives rise to", "results in", "is required by," or "contributes to". Concept maps are similar to mindmaps, but give more freedom, as mindmaps are often restricted to radial hierarchies and tree structures. Features: * Drag and drop images, rich text, html * Organize different views on your concept maps in sheets * Add concepts by typing or drag and drop * Link your concepts, and label them * You can link a concept with as many other concepts you need. You can link concepts with other links * Move your concepts around as you like and as you need it. No restriction for placing or ordering! * Your concept-map is stored in a database. You can make very big maps with many of concepts and links. * Assign different shapes to a concept * Work with a splitted screen: several views or sub-views of the same concept-map. * Export your map as an image * NEW! Create and edit rich text notes * NEW! HTML-Viewer is now backed on Gecko 1.9 (Firefox-Enging) * NEW! HTML-Viewer uses a build in proxy-webserver, so you can browse in the database Restrictions: The main purpose of this program is to demonstrate the possibilities of limada::framework. As the framework is in alpha, there is no garantee that you can read your data with later versions. limada::framework 0.081 Limada (Linked Marked Data) is the framework behind. It is a framework for managing relationships of data in non-hierarchical structures. It is suitable for data sets where the individual elements are interconnected in complex ways. The philosophy behind is that information is not in the data, but in the relationship between the data. The basic data structures are things, links and graphs. A thing holds a piece of information, such as text or numerical data. A link is a triple of things: it connects a root with a leaf, and a marker provides information about the character of the connection, the "why are root and leaf connected". A link is a thing by itself, so links can be connected with other links ("link on link") and used as markers as well. A graph is a container of things and links. It provides access to the relations of things. Limada has persistance layers for storing things and links in databases, and user interface components for visualizing the relationships between the data. New features since Version 0.08 * More dependencies removed. * Refactoring and bug removing Limada provides the following structures: A generic Thing<T> class as the base elements (vertice or node) of a ThingGraph. A Thing has a unique id and a generic data property. A Thing<Stream> class to handle streams. Streams can be compressed. A Link class as a triple of Things, connecting a Root- and a Leaf-Thing, and describing the quality of the connection with a Marker-Thing. A Link is a Thing, and implements an Limaki.IEdge<Thing>-Interface. A ThingGraph class implementing an Limaki.Graph<Thing>-Interface. A database backed ThingGraph. A Limaki.Widget - Thing - GraphPair. This GraphPair transforms Limada.Things into Limaki.Widgets and vice versa. It is the "visualizer" class for Limada.Things Some Scheme classes providing general usefull marker things. A Schema-Filter-Graph using the Schemes for filtering limaki::framework 0.081 NEW features since Version 0.08: * No winform/gdi-dependencies on keyboard-actions * Negative coordinates are allowed * Improved layout * Refactoring and bug removing Architecture The design of Limaki follows the principle of separation of concerns. Data and visual model are separated, similar to the model-view-controller design pattern. In a further step, the view part of the pattern is itself modeled after mvc-pattern to separate visual models from concrete displays. Modular view controllers are used to handle user input in a flexible and reusable fashion. Restrictions This release is a proof of concept; the main purpose was to find out an architecture which provides a user-friendly graphical interface to manipulate graph structures. This is a pre-alpha-release. The software is tested on Net 3.5, Mono 2.4 under Windows XP and Mono 2.4 under Ubuntu 8 Known limitations of this release: Editing works only on string-based widgets. DragDrop works with tif, png, dip, rtf, html and text. The graphical representation is limited to simple rectangles and lines. There is no design-time support; you have to code everything “by hand”. Mono: Although I tried my best to provide the full feature set on mono, you have to consider the following limitations when using it under mono: Speed: around 1/3 of speed under mono-windows, less on mono-linux Cursor-Handling: the cursors don’t show up as in .NET if you manipulate nodes (resizing, moving) No DragDrop-support on Windows Only small Graphs can be shown under Linux [Less]

*********************** limada::concept 0.08 *********************** is an application to draw, edit and store concept maps. * NEW: Drag and drop images, rich text, html * NEW: Organize different views on your concept maps in sheets DOWNLOAD: ... [More] http://sourceforge.net/project/showfiles.php?group_id=196119&package_id=231743&release_id=690641 INFO: http://limada.sourceforge.net/ A concept map is a diagram showing the relationships among concepts. They are graphical tools for organizing and representing knowledge. They include concepts, usually enclosed in circles or boxes of some type, and relationships between concepts indicated by a connecting line linking two concepts. Concepts can be connected with labeled arrows. The relationship between concepts can be articulated in linking phrases, e.g., "gives rise to", "results in", "is required by," or "contributes to". Concept maps are similar to mindmaps, but give more freedom, as mindmaps are often restricted to radial hierarchies and tree structures. Features: * NEW: Drag and drop images, rich text, html * NEW: Organize different views on your concept maps in sheets * Add concepts by typing or drag and drop * Link your concepts, and label them * You can link a concept with as many other concepts you need. You can link concepts with other links * Move your concepts around as you like and as you need it. No restriction for placing or ordering! * Your concept-map is stored in a database. You can make very big maps with many of concepts and links. * Assign different shapes to a concept * Work with a splitted screen: several views or sub-views of the same concept-map. * Export your map as an image Restrictions: The main purpose of this program is to demonstrate the possibilities of limada::framework. As the framework is in pre-alpha, there is no garantee that you can read your data with later versions. ************************** limada::framework 0.08 ************************** Limada (Linked Marked Data) is the framework behind. It is a framework for managing relationships of data in non-hierarchical structures. It is suitable for data sets where the individual elements are interconnected in complex ways. The philosophy behind is that information is not in the data, but in the relationship between the data. The basic data structures are things, links and graphs. A thing holds a piece of information, such as text or numerical data. A link is a triple of things: it connects a root with a leaf, and a marker provides information about the character of the connection, the "why are root and leaf connected". A link is a thing by itself, so links can be connected with other links ("link on link") and used as markers as well. A graph is a container of things and links. It provides access to the relations of things. Limada has persistance layers for storing things and links in databases, and user interface components for visualizing the relationships between the data. NEW features; * Streams can be stored by drag and drop * A stream can be marked with a description thing Limada provides the following structures: A generic Thing class as the base elements (vertice or node) of a ThingGraph. A Thing has a unique id and a generic data property. A Thing class to handle streams. Streams can be compressed. A Link class as a triple of Things, connecting a Root- and a Leaf-Thing, and describing the quality of the connection with a Marker-Thing. A Link is a Thing, and implements an Limaki.IEdge-Interface. A ThingGraph class implementing an Limaki.Graph-Interface. A database backed ThingGraph. A Limaki.Widget - Thing - GraphPair. This GraphPair transforms Limada.Things into Limaki.Widgets and vice versa. It is the "visualizer" class for Limada.Things Some Scheme classes providing general usefull marker things. A Schema-Filter-Graph using the Schemes for filtering ************************* limaki::framework 0.08 ************************* NEW features since Version 0.072: * No dependency on System.Graphics and System.Windows in limaki.core and limaki.view. * Stream-Handling backed by the proxy-pattern. Architecture The design of Limaki follows the principle of separation of concerns. Data and visual model are separated, similar to the model-view-controller design pattern. In a further step, the view part of the pattern is itself modeled after mvc-pattern to separate visual models from concrete displays. Modular view controllers are used to handle user input in a flexible and reusable fashion. ************* Restrictions ************* This release is a proof of concept; the main purpose was to find out an architecture which provides a user-friendly graphical interface to manipulate graph structures. This is a pre-alpha-release. The software is tested on Net 2.0, Mono 2.4 under Windows XP and Mono 2.4 under Ubuntu 8 Known limitations of this release: Editing works only on string-based widgets. DragDrop works with tif, png, dip, rtf, html and text. The graphical representation is limited to simple rectangles and lines. There is no design-time support; you have to code everything “by hand”. Mono: Although I tried my best to provide the full feature set on mono, you have to consider the following limitations when using it under mono: Speed: around 1/3 of speed under mono-windows, less on mono-linux Cursor-Handling: the cursors don’t show up as in .NET if you manipulate nodes (resizing, moving) No DragDrop-support on Windows Only small Graphs can be shown under Linux [Less]

*********************** limada::concept 0.08 *********************** is an application to draw, edit and store concept maps. * NEW: Drag and drop images, rich text, html * NEW: Organize different views on your concept maps in sheets DOWNLOAD: ... [More] http://sourceforge.net/project/showfiles.php?group_id=196119&package_id=231743&release_id=690641 INFO: http://limada.sourceforge.net/ A concept map is a diagram showing the relationships among concepts. They are graphical tools for organizing and representing knowledge. They include concepts, usually enclosed in circles or boxes of some type, and relationships between concepts indicated by a connecting line linking two concepts. Concepts can be connected with labeled arrows. The relationship between concepts can be articulated in linking phrases, e.g., "gives rise to", "results in", "is required by," or "contributes to". Concept maps are similar to mindmaps, but give more freedom, as mindmaps are often restricted to radial hierarchies and tree structures. Features: * NEW: Drag and drop images, rich text, html * NEW: Organize different views on your concept maps in sheets * Add concepts by typing or drag and drop * Link your concepts, and label them * You can link a concept with as many other concepts you need. You can link concepts with other links * Move your concepts around as you like and as you need it. No restriction for placing or ordering! * Your concept-map is stored in a database. You can make very big maps with many of concepts and links. * Assign different shapes to a concept * Work with a splitted screen: several views or sub-views of the same concept-map. * Export your map as an image Restrictions: The main purpose of this program is to demonstrate the possibilities of limada::framework. As the framework is in pre-alpha, there is no garantee that you can read your data with later versions. ************************** limada::framework 0.08 ************************** Limada (Linked Marked Data) is the framework behind. It is a framework for managing relationships of data in non-hierarchical structures. It is suitable for data sets where the individual elements are interconnected in complex ways. The philosophy behind is that information is not in the data, but in the relationship between the data. The basic data structures are things, links and graphs. A thing holds a piece of information, such as text or numerical data. A link is a triple of things: it connects a root with a leaf, and a marker provides information about the character of the connection, the "why are root and leaf connected". A link is a thing by itself, so links can be connected with other links ("link on link") and used as markers as well. A graph is a container of things and links. It provides access to the relations of things. Limada has persistance layers for storing things and links in databases, and user interface components for visualizing the relationships between the data. NEW features; * Streams can be stored by drag and drop * A stream can be marked with a description thing Limada provides the following structures: A generic Thing<T> class as the base elements (vertice or node) of a ThingGraph. A Thing has a unique id and a generic data property. A Thing<Stream> class to handle streams. Streams can be compressed. A Link class as a triple of Things, connecting a Root- and a Leaf-Thing, and describing the quality of the connection with a Marker-Thing. A Link is a Thing, and implements an Limaki.IEdge<Thing>-Interface. A ThingGraph class implementing an Limaki.Graph<Thing>-Interface. A database backed ThingGraph. A Limaki.Widget - Thing - GraphPair. This GraphPair transforms Limada.Things into Limaki.Widgets and vice versa. It is the "visualizer" class for Limada.Things Some Scheme classes providing general usefull marker things. A Schema-Filter-Graph using the Schemes for filtering ************************* limaki::framework 0.08 ************************* NEW features since Version 0.072: * No dependency on System.Graphics and System.Windows in limaki.core and limaki.view. * Stream-Handling backed by the proxy-pattern. Architecture The design of Limaki follows the principle of separation of concerns. Data and visual model are separated, similar to the model-view-controller design pattern. In a further step, the view part of the pattern is itself modeled after mvc-pattern to separate visual models from concrete displays. Modular view controllers are used to handle user input in a flexible and reusable fashion. ************* Restrictions ************* This release is a proof of concept; the main purpose was to find out an architecture which provides a user-friendly graphical interface to manipulate graph structures. This is a pre-alpha-release. The software is tested on Net 2.0, Mono 2.4 under Windows XP and Mono 2.4 under Ubuntu 8 Known limitations of this release: Editing works only on string-based widgets. DragDrop works with tif, png, dip, rtf, html and text. The graphical representation is limited to simple rectangles and lines. There is no design-time support; you have to code everything “by hand”. Mono: Although I tried my best to provide the full feature set on mono, you have to consider the following limitations when using it under mono: Speed: around 1/3 of speed under mono-windows, less on mono-linux Cursor-Handling: the cursors don’t show up as in .NET if you manipulate nodes (resizing, moving) No DragDrop-support on Windows Only small Graphs can be shown under Linux [Less]

***********************limada::concept 0.08*********************** (0 comments)

***********************limada::concept 0.08*********************** (1 comments)

this is the initial release of limada::concept and release 0.072 of limada::framework and limaki in one package. *************** limada::concept *************** is an application to draw, edit and store concept maps. A concept map is a diagram ... [More] showing the relationships among concepts. They are graphical tools for organizing and representing knowledge. They include concepts, usually enclosed in circles or boxes of some type, and relationships between concepts indicated by a connecting line linking two concepts. Concepts can be connected with labeled arrows. The relationship between concepts can be articulated in linking phrases, e.g., "gives rise to", "results in", "is required by," or "contributes to". Concept maps are similar to mindmaps, but give more freedom, as mindmaps are often restricted to radial hierarchies and tree structures. _________ Features: * Add concepts by typing or drag and drop * Link your concepts, and label them * You can link a concept with as many other concepts you need. You can link concepts with other links * Move your concepts around as you like and as you need it. No restriction for placing or ordering! * Your concept-map is stored in a database. You can make very big maps with many of concepts and links. * Assign different shapes to a concept * Work with a splitted screen: several views or sub-views of the same concept-map. * Export your map as an image _____________ Restrictions: The main purpose of this program is to demonstrate the possibilities of limada::framework. As the framework is in pre-alpha, there is no garantee that you can read your data with later versions. _________ Download: http://sourceforge.net/project/showfiles.php?group_id=196119&package_id=231743&release_id=665381 contains limada::concept, limada::framework and limaki *********************** limada::framework 0.072 *********************** Limada (Linked Marked Data) is the framework behind. It is a framework for managing relationships of data in non-hierarchical structures. It is suitable for data sets where the individual elements are interconnected in complex ways. The philosophy behind is that information is not in the data, but in the relationship between the data. The basic data structures are things, links and graphs. A thing holds a piece of information, such as text or numerical data. A link is a triple of things: it connects a root with a leaf, and a marker provides information about the character of the connection, the "why are root and leaf connected". A link is a thing by itself, so links can be connected with other links ("link on link") and used as markers as well. A graph is a container of things and links. It provides access to the relations of things. Limada has persistance layers for storing things and links in databases, and user interface components for visualizing the relationships between the data. New features since Version 0.07 * Improved editing of link-markers * Filtering of links, depending on the marker Limada provides the following structures: A generic Thing<T> class as the base elements (vertice or node) of a ThingGraph. A Thing has a unique id and a generic data property. A Link class as a triple of Things, connecting a Root- and a Leaf-Thing, and describing the quality of the connection with a Marker-Thing. A Link is a Thing, and implements an Limaki.IEdge<Thing>-Interface. A ThingGraph class implementing an Limaki.Graph<Thing>-Interface. A database backed ThingGraph. A Limaki.Widget - Thing - GraphPair. This GraphPair transforms Limada.Things into Limaki.Widgets and vice versa. It is the "visualizer" class for Limada.Things Some Scheme classes providing general usefull marker things. A Schema-Filter-Graph using the Schemes for filtering ************ limaki 0.072 ************ Limaki is a framework for building interactive information visualization applications. New features since Version 0.071: * DragDrop between two WidgetDisplays in the same application * Improved editing of text: insert on cursor-position, insert with copy/paste * Assign different shapes (rectangle, rounded rectangle, bezierrectangle, line) to widgets * Assign different stylesheets * Export to image * A small Inversion of Control-Library Architecture The design of Limaki follows the principle of separation of concerns. Data and visual model are separated, similar to the model-view-controller design pattern. In a further step, the view part of the pattern is itself modeled after mvc-pattern to separate visual models from concrete displays. Modular view controllers are used to handle user input in a flexible and reusable fashion. The Limaki.Graphs namespace provides generic Graph structures for data and visual models. The Limaki.Data namespace provides generic Graph structures backed by Databases. Widgets are providing access to visual attributes. A Scene wraps a WidgetGraph and has methods for hit-tests, iterations over Widgets contained in an area, and provides a Command-Queue as a central place to gather delayed operations on Widgets. Specific visual appearance is provided by a Layout. The actual appearance of Widget instances are determined by Renderers. A Renderer is responsible for drawing Widget.Data and Widget.Shape with the appropriate Style. A Layer is responsible to draw a Scene. It acts as a camera onto the contents of the Scene. An Action transforms a user interaction into a Command. With Actions moving, resizing, deleting, editing and so on are realized. Actions are bundled in an EventControler, which converts Windows.Forms.Events into Limaki specific Events. The SceneControler is the mediator between Layout, Scene.CommandQueue and invalidation of the underlying Control. The WidgetDisplay bundles all that separated classes and modules as a user control. It paints a Scene with a Layer, feeds the Camera with appropriate panning information, and calls the EventControler in case of user interaction. A visual abstraction of a data-Graph can be made by creating a GraphPair. A GraphPair is a data structure that includes the original data-Graph but also a visualization specific Graph. ************ Restrictions ************ This release is a proof of concept; the main purpose was to find out an architecture which provides a user-friendly graphical interface to manipulate graph structures. This is a pre-alpha-release. The software is tested on Net 2.0, Mono 2.2 under Windows XP and Mono 2.2 under Ubuntu 8 Known limitations of this release: Editing works only on string-based widgets. DragDrop works only on string-based widgets. The graphical representation is limited to simple rectangles and lines. There is no design-time support; you have to code everything “by hand”. Mono: Although I tried my best to provide the full feature set on mono, you have to consider the following limitations when using it under mono: Speed: around 1/3 of speed under mono-windows, less on mono-linux Cursor-Handling: the cursors don’t show up as in .NET if you manipulate nodes (resizing, moving) No DragDrop-support on Windows Only small Graphs can be shown under Linux [Less]

this is the initial release of limada::concept and release 0.072 of limada::framework and limaki in one package.*************** (0 comments)

this is the initial release of limada::concept and release 0.072 of limada::framework and limaki in one package.*************** (0 comments)