text:
About Schools in Pine Beach, NJ
Contact a Coldwell Banker® real estate agent to learn more about the schools and school districts in Pine Beach, NJ.FIND AN AGENT
Pine Beach, New Jersey is located in Ocean County. Nearby cities and towns include Island Heights, Beachwood, Ocean Gate, South Toms River, Holiday City South, Silver Ridge, Toms River, Holiday Heights, Seaside Heights, Seaside Park, Dover Beaches South, Lavallette, Holiday City-Berkeley, Dover Beaches North, Pine Lake Park, Leisure Village East, Leisure Village, Forked River, Leisure Village West, Pine Ridge at Crestwood, Leisure Knoll, Cedar Glen West, Lakehurst, Crestwood Village, Mantoloking, Waretown, Point Pleasant, Lakewood, Bay Head, Cedar Glen Lakes, Ramtown, Point Pleasant Beach, Barnegat, Barnegat Light, Brielle, Manasquan, Allenwood, Ocean Acres, Sea Girt, Harvey Cedars, Spring Lake Heights, Spring Lake, Manahawkin, Vista Center, West Belmar, Lake Como, Farmingdale, Belmar, Beach Haven West, Shark River Hills, Surf City, Avon-by-the-Sea, Neptune City, Country Lake Estates, Ship Bottom, Bradley Beach, Ocean Grove, New Egypt, Presidential Lakes Estates, Browns Mills, Asbury Park, West Freehold, Wanamassa, Interlaken, Loch Arbour, Allenhurst, Freehold, McGuire AFB, North Beach Haven, Deal, East Freehold, Tinton Falls, Oakhurst, Fort Dix, and Tuckerton. Pine Beach is a rural community with a population of 2,156. The median household income is $76,487. In Pine Beach, 60% of residents are married, and families with children reside in 39% of the households. Half the population of Pine Beach commutes 23 minutes or less to work, with 62% of residents holding white collar jobs and 38% residents holding blue collar jobs. The median age of homes in Pine Beach, NJ is 40 years, with 77% of those homes owned, 12% rented, and 11% not occupied. In the previous year, 21 Pine Beach properties were sold. The median sale price of a home in Pine Beach in the previous year was $266,190.
Contact a Coldwell Banker® real estate agent to learn more about the schools and school districts in Pine Beach, NJ.FIND AN AGENT
See if your personality and goals are right for real estate.SEE ALL REAL ESTATE CAREERS
Community information and market data Powered by Onboard Informatics. Copyright ©2015 Onboard Informatics. Information is deemed reliable but not guaranteed.
This information is provided for general informational purposes only and should not be relied on in making any home-buying decisions. School information does not guarantee enrollment. Contact a local real estate professional or the school district(s) for current information on schools. This information is not intended for use in determining a person's eligibility to attend a school or to use or benefit from other city, town or local services.


text:
Additional file 7.
microRNAs (miRNAs) used in the nearest shrunken centroid classifier for normal versus adenocarcinoma versus squamous cell carcinoma, as well as the standardized centroids for each of those miRNAs in each class.
Format: XLS Size: 56KB Download file
This file can be viewed with: Microsoft Excel Viewer
Witten et al. BMC Biology 2010 8:58 doi:10.1186/1741-7007-8-58

subset: commoncrawl


text:
Please use this identifier to cite or link to this item: http://hdl.handle.net/10355/5648
|Advanced guidance algorithms for the Ares V cargo launch vehicle
|Su, Shelly
|University of Missouri--Columbia
|Launch ascent guidance is an area that routinely involves applications of optimization tools and optimal control theory. The vacuum ascent trajectory problem has been formulated as a two-point boundary-value problem with an interior-point state constraint and is solved with a method of direct parameter optimization. The direct method simplifies the more complicated full costate problem and an off-line trajectory optimization routine for the Ares V Cargo Launch Vehicle (CaLV) shows optimal performance as compared to trajectory simulations performed in the industry standard software, Optimal Trajectories by Implicit Simulation (OTIS). The guidance solution may also be determined through an analytic method, developed by assuming polynomial approximations for the steering profiles and flight-path angle profiles. The analytic solutions prove to be useful when applied to the Shuttle-based Powered Explicit Guidance (PEG) routine, where the results have been shown to converge to near a near optimal trajectory.
|Other Identifiers:
Items in MOspace are protected by copyright, with all rights reserved, unless otherwise indicated.


text:
A computer implemented method of storing, manipulating, assessing, and displaying data and its relationships, and a computer system (with memory) programmed to implement such method. The data is stored into nodes, and visualized as a sea of linked nodes.
1. A method for creating a highly connected network of nodes indicative of computer-readable data, including the steps of:
capturing data contained in at least one legacy database;
structuring the captured data as a set of linked nodes, wherein each of the nodes includes at least one link to another one of the nodes, and the set of linked nodes is structured such that when one of the nodes is designated as a point of view, and values are calculated for a set of paths from the point of view to other ones of the nodes based on parameters in said other ones of the nodes and links between nodes along each of the paths, representations of the nodes determined using said values can be displayed as a sea of node representations viewed from said point of view, where the calculated values are represented by qualities such as position and size, and the parameters include those such as link distance, connection strength, type, and magnitude;
designating one of the nodes as the point of view; and
displaying said representations of the nodes as said sea of node representations, viewed from said point of view, wherein said sea of node representations includes virtual reality renderings.
2. A method of establishing a set of linked nodes from data organized in rows and columns with column headings, wherein each of the nodes includes at least one link to another one of the nodes, the nodes are indicative of computer-readable data, and the set of linked nodes is structured such that when any of the nodes is designated as a point of view, and values are calculated for a set of paths from the point of view to other ones of the nodes based on parameters in said other ones of the nodes and links between nodes along each of the paths, representations of the nodes determined using said values can be displayed as a sea of node representations, viewed from said point of view, where the calculated values are represented by qualities such as position and size, and the parameters include those such as link distance, connection strength, type, and magnitude, said method including the steps of:
representing each of the column headings by an abstract node;
representing each cell of the data by a data node;
establishing links between each said abstract node and each said data node that corresponds to a cell in a column whose column heading is represented by said abstract node; and
establishing links between each said data node that corresponds to a cell in one of the rows.
3. A method for creating a highly connected network of nodes indicative of computer-readable data, including the steps of:
capturing data contained in at least one legacy database;
structuring the captured data as a set of linked nodes, wherein each of the nodes includes at least one link to another one of the nodes, at least some of the nodes are linked with links that determine at least one cyclic loop, and the set of linked nodes is structured such that when one of the nodes is designated as a point of view, and values are calculated for a set of paths from the point of view to other ones of the nodes based on parameters in said other ones of the nodes and links between nodes along each of the paths, representations of the nodes determined using said values can be displayed as a sea of node representations viewed from said point of view, where the calculated values are represented by qualities such as position and size, and the parameters include those such as link distance, connection strength, type, and magnitude;
designating one of the nodes as the point of view; and
displaying said representations of the nodes as said sea of node representations, viewed from said point of view.
4. A method of creating a connected network of nodes indicative of computer-readable data, including the step of:
structuring the data as a connected set of linked nodes, wherein each of the nodes includes at least one link to another one of the nodes, the set of linked nodes is structured such that at least one link of at least one of the nodes includes content indicative of a relationship between said at least one of the nodes and at least one other one of the nodes, and such that when said other one of the nodes is designated as a point of view and values for a set of paths from the point of view to other ones of the nodes are calculated based on parameters in said other ones of the nodes and links between nodes along each of the paths, representations of the nodes determined using said values can be displayed as a sea of node representations, viewed from said point of view, including by rendering said at least one of the nodes with at least one feature indicative of said relationship, where the calculated values are represented by qualities such as position and size, and the parameters include those such as link distance, connection strength, type, and magnitude.
5. The method of
designating said other one of the nodes as the point of view; and
displaying said representations of the nodes as said sea of node representations, viewed from said point of view.
The present application is a continuation of U.S. patent application Ser. No. 09/578,127, filed on May 24, 2000 now U.S. Pat. No. 6,714,936, and claims the benefit of U.S. Provisional Application No. 60/135,740, filed May 25, 1999. This application claims the benefit of U.S. Provisional Application No. 60/135,740, filed on May 25, 1999.
The invention is a computer implemented method of storing, manipulating, accessing, and displaying data and its relationships, and a computer system (with memory containing data) programmed to implement such method.
Today's GUI (graphical user interface) software requires a great deal of training for proficiency. They rarely show their context and rarely show internal data and control points. The actions of applications should be fast and easy to use, not confusing and restrictive.
Shortcomings of current technologies include the following:
Awkward Navigation: Navigating a current GUI is to learn how the programmers have organized the data and the control points. Today's UI (user interface) relies on windows and pull-down menus which hide prior ones as the user makes selections, and an often-complex series of mouse selections to navigate to the desired control point. In performing an action after traversing a path of pull-down menus and button selections on different sub-windows, the user may be returned to the beginning, forced to retrace their steps if they wish to apply an action repeatedly. The UI does not shift from one state to another in a smooth way.
Relationships are Invisible: Current GUI's with pop-up menus and layers of text-based windows. Today's GUI's suffer from a list mentality: rows of icons with little or no meaning in their position, no relationships readily visible between themselves or to concepts which the user may be interested in or have knowledge of.
The standard GUI concept of a canvas with buttons and pull-downs require reading and thinking about the meaning of text to, hopefully, grasp the model of control flow. Virtually no information is given outside of static text to help the user understand relationships and control points.
Access to Crucial Data is Confusing: Gaining access to fields or parameters in current applications can also be a challenge. For example, the Microsoft POP mail retrieval service uses a configuration profile defined by the user to access the mail server, and displays the name of that configuration when logging. Although one sees evidence of the existence of this configuration, how does one change it? The answer may not be obvious. An object-oriented system that implemented all actions on an object could also provide the mechanism of self-deletion, but this helps only if the object itself is visible and accessible via the GUI. This is what DataSea does. Windows technology is moving in this direction, by having many words in menus modifiable, but DataSea achieves this automatically by virtue of its design.
GUI Design is bug-prone: A complex GUI, such as a presentation and control system for database administration, today consists of many canvases and widgets which hopefully present, through multiple mouse clicks, all information that is available. Any data can be changed by any part of the program, and this leads to bugs if the programmer can not easily see these interactions. A DataSea presentation of data and control shows all the objects and their relationships, and thus shows immediately what nodes can affect changes to the data, reducing bugs. To turn a DataSea view into an "application" means to set internal parameters, create and link together application nodes, and add programmatic instructions to these nodes. DataSea will implement a means to invoke these instructions.
Interoperability Conflicts: DataSea can serve as the single source of data for any application. Any RDBMS (relational database management system) can do this, but DataSea is completely flexible in its data storage and linkage, guaranteeing forward compatibility by eliminating the risk of changes to database structure and entity-relationships of RDBs (Relational Databases).
Two separate DataSea databases can be joined, and automatic linkage routines will merge them without programmer effort. This is generally impossible in RDBs. This joining can occur by simply adding nodes and links from the two data sets, and adding together the contents of the master index, NameListObj. Or, the two data sets can be blended, merging their contents: taking two nodes with the same name from the two separate data sets, creating one node which has all the links from the two separate nodes.
In most storage systems, especially RDBMS's, the user must know how information is stored in the computer and which parameter or parameters that the computer is using to store the data, as well as the proper range of values. This is often non-intuitive and may seem somewhat arbitrary for a non-technical user. Ideally, the computer would better mimic human associative memory, allowing the user to look for new information associated with that which is better known, such as a particular context, or a range of values without regard to parameterization, to specify the target of interest.
OLAP (online analytical processing) and data mining require both analytical models and custom code to apply these models to particular database structures. These customizations may be hard-coded, non-portable and irrelevant to the model. The DataSea API (application programming interface) provides access to all data while eliminating the need to worry about database structure such as tables, columns and foreign keys.
Shortcomings of more recent data presentation technologies include the following:
Non-linear Viewing: Up-coming non-linear presentation tools such as fish-eye or hyperbolic views do not address the difficult problem of how to lay out the data and their relationships before the viewing method is applied. These may be useful, but do not address the difficult issue of how the graph is laid out initially. Nor are they appropriate for highly linked data sets, because the plethora of links resembles a cobweb from a psychotic spider.
Virtual Reality: VR takes advantage of visual clues and spatial awareness, but only for data sets that may be appropriately mapped to a 3-dimensional space. Generally data is N-dimensional and thus, in general, virtual-reality which models information as physical objects in 3D space is inappropriate for viewing arbitrary data.
Voice Interface: even more than a GUI, voice control needs a smooth transition from state to state in response to commands so that the user can follow what is happening. GUIs hide previous states with new windows, while the present invention moves objects gradually and continuously in response to programmatic or user events.
The inventive method (referred to as "DataSea") is a method for storing, accessing, and visualizing information. Data is stored into nodes and visualized as a 'sea' of linked nodes. Nodes can contain anything such as documents, movies, telephone numbers, applications or words containing concepts. Interactions with the user organize the data from a defined, and then refined, point of view, with relevant data brought to their attention by smooth changes in the data's appearance.
Essentially, a handful of nodes (which are typically selected by value) are linked to the point of view turning the web of data into a hierarchical network. Further order is imposed by the use of two types of commands: one which relies on the data values, the other on the links and types of the data nodes.
The user typically enters words into a computer programmed in accordance with DataSea and watches DataSea's response. Individual nodes are rendered according to the sequence of nodes between themselves and the point of view, allowing different presentations of data. Applications may be stored into nodes and can be located and executed by DataSea. These applications can operate on and present information from DataSea in the conventional manner, with windows and menus, or by using the DataSea mechanisms of visualization, including the so-called virtual reality mode ("VR-mode") which supports deterministic data placement as needed in such things as forms and spread sheets.
Examples of use include:
The user enters the name of "Jim Smith" followed by an appropriate command such as "back" or "and" along with the phrase "Phone number" which refers to a pre-existing AN. Jim's telephone number becomes obvious as it approaches the point of view, which in this case is "Jim Smith".
Each of
This is a disclosure of computer implemented methods for storing, manipulating, accessing and displaying data and its relationships, and of computer systems programmed to implement such methods.
These methods are flexible, applicable to any kind of data and are useful to diverse groups of users. A prototype is implemented in the Java programming language.
Data is stored into nodes which are linked together. All nodes contain variables, including descriptions, types, magnitudes and timestamps. Links also contain information about themselves, including connection strength of the link and descriptive information.
Data is accessed and modified based on the values of data, their relationships, the values of DataSea parameters and links between nodes, rather than pre-determined locations in memory, as is done in most programming models.
Any existing application can be emulated in DataSea by creating and linking appropriate nodes. Positions of nodes as displayed on the screen are a result of processing force parameters rather than pre-determined positions.
Commands to DataSea are not chosen from hierarchical lists or menus, but rather they are
1. Simple navigation commands;
2. Words (data values) generated by the user; and
3. References to nodes brought to user's attention.
This approach to the command interface, and the smooth changes of state in visual feedback, lends DataSea to voice input and thus wireless 'PDA' (personal digital assistant) type devices.
Key aspects of the invention are:
1. nodes which can contain any type of data, links between the nodes;
2. manipulation of internal parameters of nodes and links;
3. visualization of nodes and their internal parameters;
4. smooth transitions during changes in state of the network;
5. integration of virtual reality representations;
6. simple commands and low learning curve;
7. increased robustness to imprecise commands as the data set grows and matures;
8. obviation of the need to predetermine data structures when entering new data; and
9. integration of legacy data with the structure inherent in it.
'multiple paths' refers to more than one route, through links, between two nodes.
Proximal is the opposite, referring to lower distance.
"Presented data set" is what the user sees at the moment, being a collection of nodes with
(mag>some threshold).
"Target data set" is an ideal collection of nodes representing the information the user is searching for.
"Traveling distally" means going from node A to node B only if B.dist is >A.dist.
"Traveling proximally" means going from node A to node B only if B.dist is <A.dist.
"Traveling downstream" means going from node A to node B only if A.getPol(B) is '−'. The polarization of the link between A and B can be set on entering the link between A and B, the order of A and B determining the polarization:
A.getPol(B) is '−'. Typically, nodes A and B are linked such that node B is downstream from node A when node A is more general than node B (so that by traveling downstream from node A to Node B, a user encounters more specific, rather than less specific, information). In characterizing a node, a user usually wants to see progressively more general (broader) information about it.
"Traveling upstream" means going from node A to node B only if A.getPol(B) is '+'.
A "Recently visited" node denotes a node being used in an operation which traverses the network. The node's TimeStamp is updated on a visit.
As shown in
Example of Using the Invention
A candy factory supervisor performs the following tasks (there are many different commands and choices of values which will give similar results):
DataSea is a comprehensive program that stores, manipulates and visualizes all forms of data. Visually animated objects, or nodes, represent data or abstract concepts. Interactive commands (which something like verbs) operate on nodes and the links between them (which act something like nouns). These commands change internal parameters of the nodes and links. These parameters are visualized by qualities such as position and size. Certain nodes are emphasized, presenting information. The user finds the data or resource needed without knowledge of the data structure.
Unusual features of DataSea include relatively natural commands, robustness to imprecise queries, ability to generalize, absence of restrictive structure, use of semantic information and smooth transitions between visual states of the user interface. The simple commands and feedback from smooth visual transitions is key in integration DataSea with a voice interface.
The front-end of DataSea is a query interpreter and visualization system, and on the back-end is a database and API (application programming interface).
DataSea nodes act something like nouns of a natural language, and DataSea commands something like verbs.
In a preferred embodiment, DataSea is a pure-Java application that can serve in a range of roles. It can view and control existing and legacy data such as email, documents, file directories and system utilities. It can ultimately serve as the principal UI to a system managing all data and system resources of a personal computer or workstation.
The natural ability of people to recognize visual patterns can be leveraged to convey information rapidly to the user. For instance, certain algorithms which depend on particular node and link configurations can render and position those nodes for rapid recognition. For example, if a target DN is surrounded by intermediate DNs which are themselves linked each to a distal AN, then those intermediate DNs are probably describing the target DN. The number of intermediates is then a measure of how much information is known about the target DN.
Its ability to gracefully reduce the complexity of the visual output means that a wireless hand-held client can be used to quickly browse and retrieve information from a remote server.
The simplicity of commands and accessibility of DataSea to the novice user lends itself to voice commands that can be used to navigate and control the display of DataSea.
The simplicity of DataSea's data structure allows easy acquisition and integration of legacy data into DataSea. Because new data is integrated with old, the acquisition of new data not only allows its retrieval by the user, but also enhances the user's retrieval of older data. Thus, as DataSea matures in its data content, queries are more robust to imprecise terms from the user. Since DataSea captures the information in the data and its structure from legacy databases, applications in DataSea can emulate legacy applications, while of course making this information available to broader use within DataSea.
While DataSea can emulate a RDBMS, without the complications of tables and foreign keys, the rich connections of DataSea and its ability to insert abstract nodes opens the way for neural-type processing. Learning-by-example is one example of that new capability. Learning-by-example refers to adjusting mag and CS values by 'voting' (via 'more' or 'less', for example) on DNs, without relying on ANs. This selects DNs which the user especially likes or dislikes. Applying commands to DNs (such as files or URLs) changes not only the mag of each DN, but changes the CS and mag in its neighborhood, typically spreading through related ANs, thereby changing the mag of other DNs in the neighborhood, i.e., having similar qualities as the DNs that the user liked. A different point of view applied to DataSea, by virtue of different connections and connection strengths, changes the presentation of data as fundamentally as changing the database design in a relational database, but much more easily.
DataSea can be used to perform simple web-history viewing, data mining, and can be used as the principal Desktop UI for a computer showing all of the computer resources.
LEGACY DATA AND NETWORK TOOLS: Viewing domains such as file systems, web history or HTML documents and computer networks are obvious uses of DataSea and are early targets of DataSea. Applied to a web browser, the text of links to the current URL can be retrieved and parsed into DataSea, in effect pre-digesting it for the user.
VOICE INTERFACE TO WIRELESS HANDHELD DEVICES: The GUI (Graphical User Interface) of DataSea is important, but the underlying structure of DataSea queries and input methods are curiously appropriate for voice and natural language interfacing. Since queries, input and control of DataSea rely on simple words DataSea, current voice recognition software can be used instead of text input, and would significantly improve the uniqueness and general usability of DataSea. No other UI uses voice or is as appropriate for voice control. Since the results of many queries may be a short answer, voice generation is an appropriate output method, in addition to or instead of graphic output. For instance, the query 'show John Smith and address' is precise enough to generate one value significantly stronger than others, and therefore amenable to a programmatic decision for selecting which results to submit to voice output. In this way, voice can be a complete communications method, opening the door to remote access via telephone or wireless device.
PORTAL: Another opportunity involves selling server time for web searches, giving away client software initially. A typical interaction might involve throwing a number of search terms, asking for a display of abstraction categories or examples of URL's followed by the user judging prominent nodes, repeating as the search narrows.
DATA WAREHOUSING: DataSea's data structure and tools lend themselves naturally to data warehousing and mining, each with an estimated worldwide budget in 1999 of nearly $2 billion. DataSea intrinsically provides data mining and warehouse support. DataSea supports any type of data without specifying in advance the fields or tables to use. This is good for arbitrary user input, such as free-form notes, or machine-generated input, such as received data from automated test-equipment. DataSea therefore is a completely flexible data warehouse.
DATA MINING: Data mining is supported by DataSea's ability to reorganize any data based on user-defined point of views, the ability to link any and all data, and the ability to store the processing of data and applications into DataSea itself.
PRINCIPAL UI: DataSea can serve as the Desktop screen, the principal interface to all system services, independent of operating system. It can do this on demand, without locking the user into a particular operating system.
Architecture of DataSea
Java Objects
The most used variables of object Node are Name, dist, mag and links[ ].
Most methods have three versions of arguments: ( ) (String s), and (Node n1, Node n2 . . . ). If null, then lastNode is used, if String, then matching nodes are looked for: both pass one or more nodes to the third version which takes explicit Nodes.
We next describe some of the above-mentioned commands in another way, and we describe other commands:
Data Manipulation Commands
The special syntax
creates AN(word1) linked to DN(word2).
Any application can store new data into DataSea, e.g. the applications Notes and Email.
Custom programs can translate legacy formats into DataSea linked nodes, e.g. to load information about a file system, the names of files and directories are stored into a tree representation first, then suffix and name can be used to create ANs, then content can be analyzed, e.g. by putting it through the Notes processor.
A RDB (Relational Database) would be loaded by storing the names of databases, tables and columns into ANs, and then values into DNs and keys into links. All these would be linked appropriately: e.g. table name linked to column names linked to all DNs having the values in those columns.
Web indices and browser histories can be stored.
System resources can be represented in DataSea.
A dictionary or synonym list can be loaded. The Type and Desc of links between synonyms or nodes with similar meaning are set. E.g. Type="synonym", Desc="from Webster's 10th Ed."
The user need not know about the data structure, such as database tables and their entity relationships in a relational database, or the directory structure of a file system. Nor does the user need to parameterize and decide how to store data, but may rather simply stuff it into DataSea. DataSea will parse the textual data and create links to representing abstract nodes. Abstract nodes are typically single words representing simple or complex concepts, and are linked to data nodes related to them. These nodes typically are massively linked.
DataSea is accessible from external programs via its API. More interestingly though, Java code may be stored into a node, fully integrating data and methods. The Java code can then act from within DataSea, for instance modifying the rendering of objects or analyzing data and creating new nodes and links.
The sequence of positioning and rendering flows through the network of nodes from the POV distally. Typically an application will start from one node, specified by name, pointing device or other means, and will search the neighborhood of that node for certain relationships or values and types. For example, invoking "Phone Jim" can find the nearest DN(Jim), then present the nearest DN which is linked to AN("phone number"). Thus commands like "Phone emergency" can work since 'emergency' can be linked to '911' which can have a large default CS which allows it to dominate, and "Phone 123 Main St" can work since the address "123 Main St" can be linked to a phone number through a DN of a person's name.
In addition to the DataSea commands such as show, abs and sim, new applications can be written to extend the base command set of DataSea.
All nodes have the capacity to store a VRObject which contains position and rendering information. It includes a triplet of numbers describing the relative position of a child to its parent, if the rendering mode of DataSea is set to 'VR-mode'.
Applications in DataSea: how they Differ from Typical Applications Outside of DataSea
Typically computer applications use or set values at specific locations of memory and may or may not check their values by some means or rules or comparisons.
DataSea looks for information by nearness (a fuzzy metric) and/or characteristics of its links and/or characteristics of nodes directly or indirectly linked and/or their values.
Besides looking for DNs which are linked to specific ANs, an application in DataSea can query the distance or conceptual distance from a node to one or more values (of values such as data values, TimeStamps or other parameters). Decisions can be based on complex functions of environment checking.
Visual Presentation
The visual tools of DataSea are based on a visual language which is completely different from today's standard GUI's and gives the user easier access to relevant data, and inhibits irrelevant data. DataSea can visually present large amounts of data and the relationships amongst them, emphasizing that which is relevant while keeping the larger context. The user sees exactly the data that is needed as well as related data, a form of look-ahead, albeit at lower resolution.
The data presentation changes as the user interacts with DataSea. Data moves smoothly from the background to the foreground, bringing it to the users' attention in response to the user. The gradual shift in visual states helps the user to understand what is happening as the query progresses.
The scene begins with a sea of objects representing nodes. Ordering of this sea begins as a result of commands to set a POV or by changing the mode to VRmode on some or all nodes. Typically one sees the sea of data in the background with the POV in the foreground and a TimeLine along an edge such as the bottom. Nodes move and change their appearance with interactions. These interactions can be with the user or with programs inside DataSea or externally.
The positions of nodes are changed by iterative calculations of forces on them, thus they move visibly between positions, rather than jumping suddenly. In this way changes in state, and thus appearance, can be followed by the user better than by sudden changes of appearance.
Visualization (in Accordance with the Invention)
Nodes are positioned dependent a set of pressures from sources, each pressure from a source (e.g. POV, parent, neighbors) being a function of that source's preferred position or distance between the child and the source, the child's mag, dist, etc. The optimum distance to point of view is proportional to dist/f(mag).
A node is stationary once these forces are balanced.
Rendering is also dependent on mag, dist, and mode.
Point of view is either a new temporary node set at a specific position on screen, or is an existing node.
Visual Presentation
The visual tools of DataSea are based on a visual language which is completely different from today's standard GUI's and gives the user easier access to relevant data, and inhibits irrelevant data. DataSea can visually present large amounts of data and the relationships amongst them, emphasizing that which is relevant while keeping the larger context. The user sees exactly the data that is needed as well as related data, a form of look-ahead, albeit at lower resolution.
The data presentation changes as the user interacts with DataSea. Data moves smoothly from the background to the foreground, bringing it to the users' attention in response to the user. The gradual shift in visual states helps the user to understand what is happening as the query progresses. For example, compare the ease of understanding either of these two scenarios: First, watching five animated objects, which represent five words in alphabetical order, reverse their order, representing reverse-alphabetical ordering: Second, watching five words on a line change from ascending alphabetical order to descending. In the first case, reversal is apparent.
In the second, the simple operation of reversal is far less apparent: seeing the reversal requires re-analyzing the words and then trying out one or more possible explanations. In DataSea, nodes cluster and move individually and in groups in response to queries. Internal parameters inherent in each node and link change in response to queries. These internal parameters are mapped to visual behavior and appearances, such as size, position, color and shape.
These visual cues are used to enhance certain nodes or groups of nodes and their links. The internal parameters are changed by (typically recursive) commands that start at one node and spread through links to others. Commands adjust connection strength and magnitude of nodes based on their programmed algorithms and local node and link information, such as node type and the distance from the point of view.
The point of view distance parameters are associated with each node and are functions of the shortest path from that node to the point of view. Recursive commands are self-terminating: typically but not always acting distal to the point of view (where the value of the next nodes distance is greater than or equal to the current distance) and often but not always producing less effect further away from the point of view.
The initial appearance of the GUI is a pseudo-3D view of:
A new query is begun by entering words, similar to a web-search, or manipulating regions of the background with the mouse. One or more data nodes are directly 'hit', increasing their magnitude, and secondary nodes (those distal to a primary) and their links are affected: exactly how depends on the spread mode of the operation. Nearness to the point of view is usually a function of link-distance and magnitude, but other methods are possible, e.g. link-distance alone which display data in a simple hierarchical set of 'levels'. Details of nodes are normally suppressed, but with the 'magnifier mode' turned on, any node under the cursor presents more information. Another mode is 'warp mode', which acts like a large magnifying lens on a region of the screen. This is similar to hyperbolic viewing of networks of nodes.
Which nodes are enhanced depends on the command and the spread mode, which is the way in which it traverses the linked nodes. The simplest spread mode is 'radial': this modifies the node at distance n+1 based on the strongest node directly connected to it of distance n, in effect being influenced by the node which is on the strongest path back to the point of view. Another spread-mode is 'sum', which adds up all the contributions of nodes of distance n to directly connected nodes of distance n+1. In 'sum' mode, a single data node distal to a large number of nodes will sum all their contributions. This is especially useful in the Similarity and Abstractions operations.
If a specific node is specified in the query, it is enhanced by, for instance, growing in size and moving towards the point of view from the background blur of nodes. If an operation of an abstraction type is used, the abstract nodes are enhanced. The relative positioning of higher or lower levels of abstraction depends on the specific command. If an operation of a similarity type is used, data nodes predominate by approaching the point of view and by being enhanced.
Rather than connecting the hits immediately and directly to the point of view, abstract-nodes in common are first drawn near the point of view. These more abstract nodes are then followed by more detailed ones receding back to the backdrop, positioned to give the sense of their being pulled out of the DataSea. Qualities like time since an event, or distance to one or more chosen abstract nodes can act as a secondary force, or wind, acting to influence the position of nodes along one of the 3 dimensions of the visualization.
Data in DataSea is heavily linked without restrictions on what can be linked. DataSea solves the 'cobweb' visual problem by establishing a point of view for the users' queries. The problem of following links that are loops is solved by calculating, on the fly, the shortest number of links from the point of view to the nodes. This turns a series of self-referencing loops into a temporary hierarchy, based on the current point of view.
The user can browse raw data in DataSea, but meaningful structure comes from the interaction between the point of view and raw data. This is analogous to the quantum-physics effect of forcing a wave function into a specific physical state by applying an observation to the wave function: interaction with the user that forces data into its useful, visible state.
A point of view is one form of an abstract node. Once the user finishes a query, the point of view that has been created can be absorbed into DataSea and used later, a form of 'checkpoint' used in calculations.
Links can occur rather mindlessly, for instance simply by association to part or all of an inputted document, in a way which captures relationships, for instance field definitions from legacy databases, or semantic meaning from, for example, some level of natural language processing.
Postprocessing inside DataSea creates abstract nodes.
Each event which links data within DataSea stores a link ID along with it. Thus any two nodes can be linked together more than once, each link having a different ID to differentiate the context of their being linked. A single link ID can be used between many nodes, as long as that particular subset of nodes has a meaningful context. This context is stored in an abstract node which, linked of course to the subset with that link ID, and contains the reason for the links.
Data is user-defined and customizable: whatever the user puts into DataSea, it merely needs to be in a computer representation. Data is held inside so-called 'nodes', which may be linked together. A data-node can be a specific value, text such as a web page or free-form entry, or an object representing something as complex as a virtual-reality view of a manufacturing facility. Text in any language is broken up into words and stored. All of the different forms of data share identical mechanisms of storage, linkage, search, presentation and access. The database contains highly linked data but differs in significant ways from RDBMS's (relational database management systems), including the ability to create links between any data and the elimination of structured tables. Rather than using pre-defined fields to capture relationships, DataSea uses nodes with appropriate links. As new data is introduced and linked to the existing nodes, alternate paths are created between points. This allows data to be found which contains no keywords contained in the query, relying on associations contained in the new data. A simple example would be loading a dictionary into DataSea: there are few related concepts that are not linked through only even two or three definitions of either. Thus, a user may enter a query containing no keywords of a document and be presented with that document, albeit emphasized less than documents that contain more direct links to the query terms. AI or manual 'digestion' of information and linkage to abstract concepts is of course possible, as is done by those who compile databases for search engines today.
The user need not know about the data structure, such as database tables and their entity relationships in a relational database, or the directory structure of a file system. Nor does the user need to parameterize and decide how to store data, but may rather simply stuff it into DataSea. DataSea will parse the textual data and create links to representing abstract nodes. Abstract nodes are typically single words representing simple or complex concepts, and are linked to data nodes related to them. These nodes typically are massively linked.
DataSea is accessible from external programs via its API. More interestingly though, Java code may be stored into a node, fully integrating data and methods. The Java code can then act from within DataSea, for instance modifying the rendering of objects or analyzing data and creating new nodes and links.
A fully integrated application in DataSea uses the DataSea linkage and VR mechanisms to provide the functionality of typical window/menu systems. The program of the application is stored in a DataSea application node.
All nodes have the capacity to store a 3-D vector called a 'VR-position'. This is a triplet of numbers describing the relative position of a child to its parent, if the rendering mode of DataSea is set to 'VR-mode'. Any child having non-zero a VR-position variable will position itself relative to the calling parent based on the VR-position values.
Essential Internal Elements of DataSea
In a preferred implementation, DataSea is a pure-Java application. Once loaded, user-defined data-nodes and links are used to visualize information from a range of sources in an interactive or programmatic way. Data-node sources can be email, web sites, databases or whatever is required.
The DataSea database is a highly linked structure of nodes. A link contains information describing itself and how it relates the linked data-nodes. It therefore contains semantic information, adding a new dimension to interactive or programmed processing of data. That is, DataSea supports not just parametric searches (which find the values at certain storage locations specified by parameters) or content-based analysis (which find particular values and their relations anywhere in the database), but the meaning of a collection of nodes. An example of this could be a link with the description "located near" relating a computer with a person's name.
Processing of data occurs not only on values of certain parameters, but on any value, independent of what it is describing. For instance, one may search for all information related to an individual's name without specifying which table and column of the database to search, and in which tables and columns to look for foreign keys.
Applications can run inside DataSea, in fact these applications are themselves held inside a node. Current applications such as automatic report generators and data formatters, know which pre-defined data fields to place, just where, and how to order the values. This functionality is served by DataSea's mechanism of node and link descriptors, which can act as the column names of RDBMS's. The DataSea link description however also provides semantic information about those relationships.
Objects are positioned and rendered strongly dependent on their content and their links. That is, features of the rendering of nodes and the relative positions of nodes depend on content and links. Thus, DataSea is unique because the presentation is strongly dependent on the data itself.
Usage Scenario
Below is a scenario of events with comparisons between two different application approaches: The user routinely stores information and calls it up later when faced with a decision as to repair a new printer or buy an old one. This example shows the simplicity and time saved with DataSea. It compares:
User says 'show Mail' mail nodes swell, abstract nodes visible.
User says 'show Files' 'Tax 97' brings directories forward and shows files.
User says 'show John Smith' which crates a point of view, linked to abstract node named "John Smith"
User says 'BMW' which shows Smith's "BMW 528 1985" by virtue of abstract node "car" linked to "BMW", "Ford".
User says 'show address' bringing "123 Main St." forward.
User says 'reset', then 'show address' and sees names and addresses of all entries.
User marks timeline over the past week, and says 'show printer and email and Hewlett Packard' which shows an abstract node "Printer" linked to email message about printers and a web page of HP printers
User says 'input "John Smith telephone 848-1234" which creates a node holding the entire message, and parses it into smaller data nodes.
User says 'show John Smith'; one sees his telephone number.
To demonstrate abstract nodes and learning: have processed 50 URLs from 'cat' web search. See all 50 around the abstract nodes surrounding the point of view named 'show cat'. User deselects URLs not related to technical descriptions, the abstract nodes change, bringing forward URLs with more technical information.
Aspects of the invention include the following:
These methods:
Variation 1: Voice integration. Front end routines take either keyboard input or voice input, submitting word strings from either to handler functions. Voice word 'go' acts as keyboard 'Enter'.
Variation 2: Client server, a wireless or wired client, display mode set to abbreviate early.
Self Diagnostics and Use as a Debugger:
DataSea can be used to visualize the DataSea program itself. Besides visualizing nodes which represent data for the user, as described elsewhere in this document, in so-called 'dataset nodes' the nodes that are visualized in DataSea can represent internal programming objects, methods or elements of DataSea itself (providing a sort of built-in debugger).
Code can be inserted into the program which will visualize each method's invocation and its modifications of user data.
DataSea separates the two tasks of modifying the values of node variables and rendering of those nodes. Thus DataSea can redraw the entire scene not only after traversing the linked nodes and re-calculating their internal parameters, but the entire scene can be re-drawn at any time during these calculations, even once every time a dataset-node variable such as 'mag' is changed.
Thus, a self-node can indicate to the user its own activity, by redrawing the entire scene normally and then highlighting itself, or drawing lines to a dataset-node or its elements that it is operating on.
For instance, if a user commands DataSea to increase the variable 'mag' of a node, the method which does that (e.g., 'spread( )') can draw a line from the self-node representing 'spread( )' to the dataset node it is modifying. A simple implementation could be as follows:
If the method spread( ) recursively calls the method spread_recursive( ) insert a conditional call to touch( ) after spread_recursive:
The method touch(Node caller, Node target) could be implemented as follows:
Aspects of the invention include:
a method and apparatus for creating nodes containing data, linking the nodes into a network, setting parameters of the nodes (node variables, and maintaining information specific to each node, e.g. mag, CS, direction of the link (polarization). Each node preferably has a name associated with which it can be searched from a master list;
a method and apparatus using "context nodes" to modulate link connection strength (CS) and establish context for groups of nodes. For example, a method for associating a set of links and establishing a context node which can modulate the CS of those links thereby sensitizing or desensitizing them to further operations. The context node can also magnify the nodes linked by each link it modulates;
a method and apparatus for loading data from free-form notes. For example, a method of taking text input (text from user or application, or text resulting from voice translation) and establishing a set of linked nodes therefrom by:
creating a new node for the full text called the full-text-node;
discarding selected words (e.g. articles)
linking the full-text-node to individual nodes representing each remaining word in the full text, creating new nodes as needed.
For another example, a method of converting tabular data, i.e., text organized into rows and columns, with column headings (or RDMBS data, with additional links for the keys of the RDBMS), into a set of linked nodes, in which:
each column heading is represented by an AN, the column-heading-AN
each cell of data is represented by a DN
links are established between each column-heading-AN (representing a particular column) and those nodes corresponding to the cells in that column
links are established between those nodes corresponding to each cell in a row from the table.
For another example, a method of converting files from a computer file system or a set of files linked by HTML references into a set of linked nodes, in which:
DNs are established representing each directory or file;
links from each node are established to terms found in the file content, e.g., as is done in the parsing of notes. The procedure can filter the content looking for only certain tag values such as meta-tags or heading values (e.g. <H1> Title Here </H1> has "Title Here" as heading-level-1 in HTML)
Another set of links can be made to ANs representing the suffix of files, or such ANs can be used as ContextNodes for all links to those files.
For HTML files, links are to be established between nodes representing HTML files and other nodes representing HTML files that are referenced by the first HTML file.
For another example, a method of converting files from a computer file system, in which links are established between DNs representing file directory with DNs representing files or sub-directories in that directory;
a method and apparatus for defining a POV (either a particular node or a new node linked to a particular node);
a method and apparatus for defining distance (as a function of the number of links between nodes and the node type) and hierarchy from the POV and determining distal and proximal directions, in which: once a POV is set and distances calculated from it, a hierarchical 'tree' is defined from what was an arbitrarily complex cross-linked network of nodes.
Thus, if any node 'x' has had its distance set by this routine, one is guaranteed to find a path from that node 'x' back to the POV by traveling on a path between nodes of ever-decreasing distance values;
a method and apparatus for retrieving data which is linked into a network of nodes interacting with the user to better present the desired data;
a method for emphasizing nodes and paths by tracing backwards from a target node to a POV by following all links to nodes whereby the next node has magnitude less than that of the prior node. Emphasizing those nodes on the path(s) shows nodes 'between' the target and POV. By traveling backwards from the target node to the POV, there may be more than one node having a distance less than the target. This is fine, and if all paths backwards (with the requirement that they are consistently proximal) are emphasized it is fine. For example, with Bob being the POV, and traveling backwards from the node representing January 1999, all nodes such as notes and events related to Bob will be emphasized;
a method for assigning position to each node which is dependent on the node's parameter values, including distance, CS and magnitude. Rather than setting the node at the calculated position immediately, it moves there gradually thereby showing the transition between states. One way to do this is to calculate forces on a node which are related to the difference between the node's current position' and an ideal calculated position.
The ideal position depends on the positioning mode in effect:
a Relations Mode: Most suitable for narrow queries where we wish to see all the links between nodes in the target data set. Nodes fan out from their parent; the angle dependent on the number of children their parent has, their distance dependent either on (mag) or (1/mag); or
a Levels Mode: Most suitable for broad queries where there are too many links between nodes in the target data set. Starting in the center of the screen, fanning out to the left dependent on their distance from the POV, ANs are rendered. Starting in the center and belonging to the right half of the screen are the DNs whose position moves further to the right the lower their mag;
a method and apparatus for visualizing data, by appearance on a screen. For example, a method of assigning visual emphasis (color, size) to each node dependent on the nodes distance, CS and magnitude.
Examples of operations performed on nodes of the inventive set of linked nodes (or on a sea of displayed representations of such nodes) include:
'ABS'(for characterizing and understanding the environment of nodes and their ANs): from a target node, traveling distally and upstream, find the first AN and emphasize it. This 'abstracts' the target node in terms of linked ANs. To abstract it at a higher level, go from those ANs to directly linked ANs which are both distal and upstream. This can continue to arbitrary level until we run out of nodes (realistically not very far, a handful of levels);
'XABS' (for emphasizing ANs from a group of nodes, those ANs not having been recently visited by query operations: emphasizing distally from these ANs will result in a relatively large number of DNs being modified. The user may find ANs which are obviously related or not related to their interest, and thereby significantly change the presented data set. Since these ANs haven't been used recently, we in effect triangulate the target data set from more vantage points. Determining categories which, when evaluated by the user as good or bad, have a large effect on narrowing the presented data set, that is helping the user find the target data set;
'SIM': a method of emphasizing (magnifying) nodes based on their similarity to a chosen node without specifying values of any node (using the 'sim' command which emphasizes DNs linked to any or all of the ANs which are linked to the chosen node(s));
"POTMAG": a method of modifying the variable Potentiation of a node, and using that value to influence the degree of change to the variable 'mag' from a subsequent operation. Thus, one operation on the first set of nodes may call Node1.setPotentiationValue( ) and a subsequent operation on the second set of nodes may set the value of Node1.mag based on Node1.getPotentiationValue( ) This 'primes' a set of nodes, and can operate approximately as a soft, or non-binary AND operation.
Another aspect of the invention is structuring of a set of linked nodes (a "network") including "application nodes" (sometimes referred to as applications). Applications are nodes containing code which get the information they operate on from traversing the network. E.g. an email node-application is linked to, or given a reference to, the node "Bob Smith", and upon being invoked (by the action function inherent in each node or otherwise) searches the neighborhood of the "Bob Smith" node for a DN linked to an AN representing email address. If more than one is found, the user is presented with the selection to choose from. Thus any node-application can be 'applied' to any node.
One aspect of the invention is a method of accessing data, wherein the data is structured as a set of linked nodes, and each of the nodes includes at least one link to another one of the nodes. The method includes the steps of:
preliminary to displaying representations of the nodes on a screen in a screen space having N dimensions, where N is an integer, dividing a display space having dimension N+1 into an array of cells, wherein the dimension of the display space includes a size dimension;
linking each of the nodes to at least one of the cells; and
implementing a user interface which displays representations of at least some of the nodes on the screen having sizes determined by the cells to which said at least some of the nodes are linked, wherein the user interface rapidly accesses individual ones or groups of the nodes in response to selection of at least one of said representations.
The computer program listing appendix filed herewith is incorporated herein by reference. This appendix is a source code listing (in the Java programming language) of a computer program for programming a computer to implement an embodiment of the invention.
In the listing (which consists of parts labeled "TL.java," "Timer.java," "ColorObj.java," "Link.java," "Mode.java," "Node.java," "Force.java," "GetURLInfo.java," "Input.java," "Populate.java," "GUI.java," "DataSea.java," "LinkObj.java," "VRObj.java," and "nsr.java"), the object "gui" of class "GUI" is the top-level object, and instantiates the object "datasea" of class "DataSea" (and other objects).
Patent Citations
Non-Patent Citations
Referenced by
Legal Events
Original Image


text:
Signs of Silence opens deaf teen center
Staff Writer
SAN MARCOS -- Signs of Silence has opened a new center for deaf teens that is the first of its kind in the county, said director Roy Hensley.
"We have a lot of older teens who want a safe place to come to ," said Hensley, who spoke during an interview in the non-profit's 500-square foot building at 1056 Commerce St. in a light industrial area of San Marcos.
"We hosted about 30 people here when we opened Friday night and will focus on the kids having a general place for their activities," Hensley said. "Rent is $400 a month and we plan fund-raisers, car washes and garage sales along with asking for $20, or $25, donations to keep it up."
Hensley and some deaf teens from Signs of Silence went to San Marcos City Hall a few weeks ago to talk about their plans with city officials. Mayor Corky Smith on Monday said he liked what he heard.
"Anything like that for kids is fantastic as far as I am concerned," Smith said. "Bill Schramm, the director of community services, will help them."
The new teen center is next to the all-volunteer group's main office and had been vacant for months.
Roberto Nunez, 21, of Escondido, a deaf volunteer at Signs of Silence, finished up a game of chess at the new teen center and, with a broad grin, said: "This is very cool. We can have fun here."
"We're bored a lot around here," Nunez continued. "There really aren't any safe places to go and you can get bored or get in trouble. I like to talk to friends. It's fun to chat. I love playing games on the Playstation."
Hensley signed for Nunez and added: "Deaf culture is very social. More people will come here, plus it's fun. This will add some options."
Signs of Silence blazed a trail in North County in 1997 as Hensley volunteered his time and used his energy to start connecting the deaf and hard-of-hearing with social agencies and create a sense of community. He is a free-lance interpreter for the deaf and fluent in sign language. The group also has a Signs of Silence.com Web site.
"When I started meeting the deaf I started finding a lot of issues such as abuse, lack of social activities and family situations that were very frustrating," Hensley said. "There was only one deaf organization in San Diego County and none in North County. We're finding a lot of deaf people live here. We have placed 75 people in jobs and are on a 5-year plan trying to raise more money."
Drawing on state statistics, Signs of Silence estimates between 350,000 and 450,000 people are deaf or hard-of-hearing in San Diego County. That would represent around 125,000 such people in North County. Of this population, almost 55 percent are unemployed or underemployed and depend on some form of federal aid, Hensley said.
Some other statistics Hensley cites about the deaf: More than 90 percent of hearing parents of deaf children do not learn sign language; one out of three deaf males and one out of five deaf females are sexually abused by age 18; more than 90 percent of deaf children in foster care agencies can't be placed due to speech barriers; and, on average, a deaf youth graduates high school at a third grade level.


text: Video: Craig Alexander's Thoughts on the KPR System Posted by: Susan Legacki , September 9, 2013 Share! Tweet Susan Legacki About the author Susan Legacki is the founding editor of LAVA Magazine. She is currently the Features Editor of the print edition of LAVA Magazine and the Online Editor of lavamagazine.com. She has been competing in triathlons from Sprint to Ironman distance for more than a decade. When she's not working, training or traveling to races, you can find her on her surfboard. Related Posts IRONMAN Unveils 2015 Lottery and Legacy Winners photo by Jay Prasuhn IRONMAN today announced the 100 age-group athletes who have earned the opp ... VIDEO: Sebastian Kienle's Road to Kona An interview with Sebastian Kienle on his preparations towards winning the IRONMAN World Champi ... Comments comments


text:
17 April 2013 09:55 [Source: ICIS news]
LONDON (ICIS)--EU passenger car registrations in March 2013 declined for the 18th consecutive month, falling by 10.2% year on year, an industry body said on Wednesday.
According to data from the European Automobile Manufacturers' Association (ACEA), 1,307,107 new passenger cars were registered in the region in March, down from 1,454,907 units registered in the same month in 2012.
The fall in March continues a downward year-on-year trend which began in October 2011.
"In March, the UK remained a resilient market, posting a 5.9% growth, while Italy (-4.9%), Spain (-13.9%), France (-16.2%) and Germany (-17.1%) saw their demand decrease. Overall, the EU recorded a total of 1,307,107 new cars, or 10.2% less than in March 2012," the ACEA said.
During the first quarter of the year, demand for new cars declined by 9.8%, amounting to 2,989,486 units.
"From January to March, except for the UK (+7.4%), all major markets faced a double-digit downturn ranging from -11.5% in Spain to -12.9% in Germany, -13.0% in Italy and -14.6% in France," it added.
A wide variety of chemical markets depend on demand from the automotive industry, which has suffered badly from the effects of the global economic crisis.
For the latest chemical news, data and analysis that directly impacts your business sign up for a free trial to ICIS news - the breaking online news service for the global chemical industry.
Get the facts and analysis behind the headlines from our market leading weekly magazine: sign up to a free trial to ICIS Chemical Business.
|ICIS news FREE TRIAL
|Get access to breaking chemical news as it happens.
|ICIS Global Petrochemical Index (IPEX)
|ICIS Global Petrochemical Index (IPEX). Download the free tabular data and a chart of the historical index
Asian Chemical Connections


text:
To embed, copy and paste the code into your website or blog:
Thomas Jefferson said, "The beauty of the Second Amendment is that it will not be needed until they try to take it." Is this the framework the court used to find that the 2nd Amendment forbids the State of California from authorizing local authorities to impose a "good cause" requirement to issue a permit to carry a concealed handgun in the Peruta v. County of San Diego case? Did the court fully take into consideration that this "pro-gun" ruling will affect every county in the state?
The aftermath of the Peruta ruling last month has been riddled with Petition's for Rehearing. First, the California Police Chiefs' Association and the California Peace Officers Association filed a petition requesting rehearing asserting the issues in this matter are of "exceptional importance" warranting review.
Next, the Attorney General (A.G.) filed a "Petition for Rehearing or Rehearing En Banc" making a robust plea to the court to reconsider the Peruta ruling claiming it is "neither procedurally proper nor substantively sound, it fails to follow precedent as to how 2nd Amendment claims are analyzed, and it is in direct conflict with the holdings of three other federal courts of appeal." Likewise claiming the legal issues present a case of "exceptional importance," the A.G. is seeking "en banc review," where the case is heard before all the judges of a court rather than by a panel.
Following the filing of the A.G.'s petition, the Los Angeles Times now reports that the Orange County Sheriff's Department has been deluged with more than 1,000 concealed weapons applications since rolling back restrictions in the wake of an appellate court ruling. An onslaught my colleague, Paul Cappitelli, predicted in his recent BBKnowledge blog post.
Notably, neither the San Diego Sheriff, where the case originated, nor the California Sheriff's Association have appealed the ruling or joined any of the other appeals. So what's next? The 9th Circuit must decide. Do they uphold the ruling providing citizens with greater access to carrying concealed handguns? Do they overturn the ruling placing the "good cause" requirement back into play. Time will tell. The gun debate marches on.
DISCLAIMER: Because of the generality of this update, the information provided herein may not be applicable in all situations and should not be acted upon without specific legal advice based on particular situations.
© Best Best & Krieger LLP
Read fresh new writing on compliance, cybersecurity, Dodd-Frank, whistleblowers, social media, hiring & firing, patent reform, the NLRB, Obamacare, the SEC…
…or whatever matters the most to you. Follow authors, firms, and topics on JD Supra.
Create your news brief now - it's free and easy »
A full-service law firm with nearly 200 attorneys in nine offices throughout California and...
View Profile »
See more »
Sign up for your custom alerts now, using LinkedIn ›
Back to Top
Copyright ©


text:
Yet MORE good proof. Now let's stop.
This is a discussion on Man never walked on the moon. within the A Brief History of Cprogramming.com forums, part of the Community Boards category; Yet MORE good proof. Now let's stop....
Yet MORE good proof. Now let's stop.
The conspiracy movie about this was pretty convincing i gotta say that, so yes i think that man neva walked on the moon. however, my knowledge of this is limited so i cant really say much about it. But yea I'm a believer
You should read the book Bad Astronomy, or the online version: http://www.badastronomy.com/bad/tv/foxapollo.html
It disproves the moon landing conspiracy theory very thoroughly.
Seek and ye shall find. quaere et invenies.
"Simplicity does not precede complexity, but follows it." -- Alan Perlis
"Testing can only prove the presence of bugs, not their absence." -- Edsger Dijkstra
"The only real mistake is the one from which we learn nothing." -- John Powell
Other boards: DaniWeb, TPS
Unofficial Wiki FAQ: cpwiki.sf.net
My website: http://dwks.theprogrammingsite.com/
Projects: codeform, xuni, atlantis, nort, etc.
Oh god, not again. §áßøæ, read the rest of the thread and realize that if you continue you'll get picked apart and eaten.
manutd, people are entitled to their opinions. And that is true regardless how ridiculous, untrue or contrary to your own as they may be. It's a wonderful thing the fact they are.
If this debate disgusts you so much that you even expressed it over 2 other threads besides this one, my suggestion is... don't read the posts on this thread.
Originally Posted by brewbuck:
Reimplementing a large system in another language to get a 25% performance boost is nonsense. It would be cheaper to just get a computer which is 25% faster.
Lock please.
Memorial University of NewfoundlandComputer Science
Mac and OpenGL evangelist.
Mario F.: No, I just don't want to continue what is essentially a big flame and a pointless argument. This thread deserved a lock two days ago.
Which is fine and I agree. But ask for a lock instead of reopening the debate with that post.
Originally Posted by brewbuck:
Reimplementing a large system in another language to get a 25% performance boost is nonsense. It would be cheaper to just get a computer which is 25% faster.
Agreed. My fault.


text:
Family members of champion boxers Jack Johnson and Jim Jeffries, legendary fight promoter Tex Rickard, and then acting Nevada Governor Denver Dickerson to attend anniversary celebration scheduled for July 2-4, 2010.
Reno, NV: On July 4, 1910, Jack Johnson and Jim Jeffries stepped into a custom-built boxing ring in Reno, Nevada, with over 20,000 fight fans from across the country and around the world on-hand to witness what had been hyped as the Battle of the Century..
Johnson, an intimidating boxer and the first African American to hold the World Heavyweight Championship, was a pariah amongst white America because of his refusal to live his life according to the bigoted social norms prevalent during his day.
Jeffries the former champion who had retired undefeated three years earlier, never having agreed to face Johnson had come out of retirement as the Great White Hope to take back the heavyweight championship for the white race.
A fight anticipated like no other, before or since, the Johnson-Jeffries match is still cited as one of the most important sporting events of all time. And now, exactly 100 years later, the city of Reno will honor the legacy of this most famous of fights with a three-day celebration, July 2-4, 2010, featuring boxing celebrities, family members of those involved in the original fight, and live professional boxing at the Grand Sierra Resort which will be aired by Fox Sports Net.
Were very excited that family members representing all four of the principle parties involved in making the original fight happen Jack Johnson, Jim Jeffries, promoter Tex Rickard and acting Governor Denver Dickerson will be able to attend the 100-year anniversary celebration, said Terry Lane of Lets Get It On Promotions, which is helping organize the celebration.
Just like in 1910, when over 20,000 people streamed in to Reno (population approximately 15,000 at the time) to witness the original fight, visitors to the 100-year anniversary celebration will have the opportunity to tour the original fight site as well as the locations of both Johnsons and Jeffries pre-fight training camps.
Other attractions, hosted by Renos Eldorado Hotel and Casino, include a Gala dinner remembering the Fight of the Century, with multimedia presentations and honored guests and family members in attendance; and the Al Bernstein Live Boxing Party, which will allow audience members to hear from and match wits with legendary boxing commentator Al Bernstein (aka the Voice of Boxing).
Dates, times and more details about these and other events planned for the Johnson-Jeffries 100-year anniversary celebration can be found online at www.JohnsonJeffries2010.com, along with more history of the original fight and information about lodging packages available for the weekend.
previous article: John Murray looking for early stoppage
next article: When the Boxing Dragon Started Spitting fire why didn't Shane Mosley step on his tail??
If you detect any issues with the legality of this site, problems are always unintentional and will be corrected with notification.
The views and opinions of all writers expressed on Boxing247.com do not necessarily state or reflect those of the Management.
Copyright © 2001- 2015 Boxing247.com - Privacy Policy l Contact


text:
Interview with Eli Kaimeh of Per Se, Nominated for Outstanding Restaurant
Although Per Se debuted a decade after a certain acclaimed sibling restaurant in California, this fine-dining temple, perched high in New York City's Time Warner building, has enjoyed its own abundant successes. The three-Michelin-starred property is an oasis on every level, beckoning epicureans from all corners of the globe with its unparalleled luxuries and cuisine. Below, we caught up with chef de cuisine Eli Kaimeh to get the inside scoop on the Outstanding Restaurant nominee's tasting menus, the team's pioneering work with vegetables, and their take on gluten-free substitutions.
JBF: While some of Per Se's signature dishes (such as oysters and pearls) remain, we know that the world-renowned menu is constantly evolving. Can you tell us about a dish or two that's currently on the menu that really captures the restaurant's point of v... Read more >
Entertaining Tips from Carla Hall
To help you prep for a stellar Beard Awards viewing party, we tapped the chef, television personality, and host of our 2015 Book, Broadcast & Journalism Awards, Carla Hall, for some sage advice. Below, the former caterer shares her top tips.
Turn Down the Volume
I want background music at a cocktail party, not something that will take over the conversations. The playlist depends on the crowd you're entertaining, but jazz is always a good place to start.
Make It Ahead
I like to prep and cook as much as I possibly can in advance. I want to enjoy my guests! Plus, as a recovering caterer, I can't help but think that way. Even the hot dishe... Read more >
What We're Reading: April 29, 2015
Why your brain wants those Oreos: a new study reveals that sugar is a neurological stress reliever. [MUNCHIES]
You, too, can compost with this starter guide. [Food52]
Has the word "natural" become totally meaningless? [NYT]
Tyson Foods has vowed to stop feeding its chickens antibiotics that are used in human medicine. [... Read more >
Overheard at the 2015 JBF Book, Broadcast & Journalism Awards
The winners of last weekend's 2015 Book, Broadcast & Journalism Awards were as eloquent in their acceptance speeches as they were in their winning bodies of work. We couldn't help but note some of the most inspiring, hilarious, and quotable lines of the night to share, below.
"Is that Rick Bayless right there? That's the coolest thing ever."
— Keith Schroeder, Focus on Health Book Award winner for Cooking Light Mad Delicious: The Science of Making Healthy Food Taste Amazing
"Anyone can butcher—which also sounds like the sequel to Ratatouille."
— Adam Danforth, Reference and Scholarship Book Award winner for Butchering Poultry, Rabbit, Lamb, Goat, and Pork: The Comprehensive Photographic Guide to Humane Slaughtering and Butchering
"I hope this book can inspire people to tread more lightly and compost."
— Amy Chaplin, Vegetable Focused and Vegetarian Book Award winner... Read more >
Interview with Stuart Brioza of the Progress, Nominated for Best New Restaurant
San Francisco power duo Stuart Brioza and Nicole Krasinski are no stranger to the James Beard Awards: in 2013, the pair took home our Best New Restaurant medallion for State Bird Provisions, and now, just two years later, they're nominated in the same category for their newest concept, the Progress, located just next door. Read on for Stuart Brioza's insights on the restaurant's unique shared-plates format, its organic environs, and where he plans to chow down in Chicago.
JBF: We've been asking all of the chefs behind our Best New Restaurant nominees to tell us the stories behind the restaurants' names. Can you share yours?
Stuart Brioza: The Progress was actually the name of the theater that our restaurant's building was originally built as in 1911.
... Read more >
Recipes for Your LIVE Beard Awards Viewing Party
The culinary industry's biggest night goes down this weekend, so start planning a gathering with your food-loving friends for a screening of the James Beard Awards! On Monday, May 4, the 2015 ceremony will be streamed live from Lyric Opera of Chicago, where your favorite food world stars and hometown heroes will take the stage to claim their silver medallions. No viewing party would be complete without a selection of decadent and crowd-pleasing canapés, so whip up these elegant bites from past Beard Award winners, and you'll be voted Outstanding Chef in your own circle.
Easiest Chicken Liver Mousse
Every party spread needs a luxe, spreadable treat. This one comes from Jamie Bissonnette, our 2014 Best Chef: Northeast and co-owner... Read more >
What We're Reading: April 28, 2015
Sorry, Harlem: chicken and waffles is actually a German invention. [FWF]
Toss out the tortillas and give the tortas a try. [Serious Eats]
Chipotle has vowed to stop serving G.M.O. products. [NYT]
Is your Vitamix or Blendtec really worth its hefty price tag? [... Read more >
Video: How to Make Truffled Popcorn
We're excited to announce our partnership with Simmer, a new app that allows you to generate step-by-step recipe videos that you can create, watch, and share from your very own kitchen. In the coming weeks and months, we'll share instructional videos that will teach you how to create tantalizing dishes from JBF Award winners, Beard House chefs, and even Beard himself, all prepared in James Beard's historic New York City kitchen.
The culinary industry's biggest night is just around the corner, so start planning a gathering with your food-loving friends for a screening of the James Bear... Read more >
Interview with April Bloomfield of the Spotted Pig, Nominated for Outstanding Restaurant
For ten years, the Spotted Pig has assuredly upheld an egalitarian ethos while also basking in enviable cultural cachet—no easy feat in one of the world's most fickle and fastidious dining cities. Now that the restaurant has earned its first Outstanding Restaurant nomination, we discussed the Pig's enduring appeal, its under-the-radar best dishes, and more with executive chef April Bloomfield.
JBF: Congrats on your nomination! All of our Outstanding Restaurant nominees have been operating for at least ten years. We'd love to hear your thoughts on why the Pig has been successful for an entire decade, and why New Yorkers continue to love to dine there.
AB: Thank you so much! We are thrilled to be nominated. It is such an honor to be recognized for this restaurant that means so much to me. I think people like the Pig because it offers a welcoming, comfy space where you can get delicious, consistent f... Read more >
Eat This Word: Pea Shoots
WHAT? Trendy tendrils. Long used in Chinese cooking, pea shoots are just beginning to find popularity on menus in this country. The pretty green tendrils, actually the leaves and shoots of the young pea plant, are a spring delicacy in China. Pea shoots, called dau miu in their native land, may be grown from a variety of pea plants but are traditionally culled from immature snow peas. Pea shoots are sweet, tender, and have a strong pea taste. You cook them as you might any green—very quickly in hot oil with, perhaps, salt, garlic, and a splash of sherry or rice wine.
WHERE? Beltane in the Berkshires
WHEN? April 28, 2015
HOW? Housemade High Lawn Farm Ricotta Gnocchi with the Meat Market–Cured Blue Hill Farm Prosciutto, Indian Line Farm... Read more >
- June 2015 (9)
- May 2015 (84)
- April 2015 (110)
- March 2015 (70)
- February 2015 (61)
- January 2015 (61)
- December 2014 (62)
- November 2014 (62)
- October 2014 (73)
- September 2014 (66)
- August 2014 (69)
- July 2014 (73)
- June 2014 (46)
- May 2014 (70)
- April 2014 (48)
- March 2014 (39)
- February 2014 (42)
- January 2014 (42)
- December 2013 (42)
- November 2013 (42)
- October 2013 (70)
- September 2013 (49)
- August 2013 (46)
- July 2013 (45)
- June 2013 (41)
- May 2013 (92)
- April 2013 (54)
- March 2013 (45)
- February 2013 (35)
- January 2013 (36)
- December 2012 (30)
- November 2012 (33)
- October 2012 (53)
- September 2012 (43)
- August 2012 (46)
- July 2012 (48)
- June 2012 (48)
- May 2012 (88)
- April 2012 (56)
- March 2012 (35)
- February 2012 (46)
- January 2012 (40)
- December 2011 (40)
- November 2011 (47)
- October 2011 (44)
- September 2011 (48)
- August 2011 (59)
- July 2011 (50)
- June 2011 (49)
- May 2011 (124)
- April 2011 (54)
- March 2011 (60)
- February 2011 (53)
- January 2011 (52)
- December 2010 (39)
- November 2010 (48)
- October 2010 (59)
- September 2010 (52)
- August 2010 (56)
- July 2010 (56)
- June 2010 (65)
- May 2010 (168)
- April 2010 (68)
- March 2010 (68)
- February 2010 (63)
- January 2010 (58)
- December 2009 (61)
- November 2009 (74)
- October 2009 (83)
- September 2009 (74)
- August 2009 (81)
- July 2009 (66)
- June 2009 (47)
- May 2009 (122)
- March 2009 (2)
Recent Comments
- Atlantic Food Channel
- Chow
- Cook and Eat Better
- Daily Dish/Los Angeles Times
- Diner's Journal/New York Times
- Eater
- Foodspotting
- Grub Street
- Hungry Beast
- Immaculate Infatuation
- Insatiable Critic
- JBF Awards
- JBF Awards Press Room
- Michael Ruhlman
- Savory Cities
- Serious Eats
- The Feed
- The Stew/Chicago Tribune
- Zester Daily


text:
Laparoscopically Assisted Vaginal Hysterectomy Center - Lake Havasu City, AZ
Lake Havasu City Obstetrician-Gynecologist Doctors for Laparoscopically Assisted Vaginal Hysterectomy
Type of Physician: Obstetrician-Gynecologist
What is a Obstetrician-Gynecologist?
A certification by the Board of Obstetrics & Gynecology; practitioners provide medical and surgical care of the female reproductive system and associated disorders, to the extent that it distinguishes them from other physicians. This training enables them to serve as consultants to other physicians and as primary physicians for women.
Specialty: Obstetrics & Gynecology
Common Name: Ob/Gyn or Ob-Gyn
Obstetrician-Gynecologist Doctors in Lake Havasu City *
Donald R Nelson MD
Megan S K Wiese MD
Megan S K Wiese MD
Richard P Benedict MD
All Womens Medical Center
All Womens Medical Center
Tri-State OB/GYN
OB/GYN Womens Center
OB/GYN Womens Center
Kingman OBGYN Associates
Kingman OBGYN Associates
Kingman OBGYN Associates
Silver Ridge Perinatal Cntr Inc
Lake Havasu City, Arizona
Laparoscopically Assisted Vaginal Hysterectomy (LAVH)
What is a hysterectomy?
A hysterectomy is the removal of the uterus (womb). For certain conditions, the Fallopian tubes and ovaries are also removed.
The most common medical reasons for doing a hysterectomy include benign fibroid tu...
Read the Laparoscopically Assisted Vaginal Hysterectomy (LAVH) article »
Other Related Laparoscopically Assisted Vaginal Hysterectomy Articles
Emergency Contact for Lake Havasu City
Nearby Lake Havasu City Hospitals *
Havasu Regional Medical Center
Lapaz Regional Hospital
Colorado River Medical Center
Parker Indian Health Center
*Provider Directory Terms of Use:
The WebMD 'Provider Directory' is provided by WebMD for use by the general public as a quick reference of information about Providers. The Provider Directory is not intended as a tool for verifying the credentials, qualifications, or abilities of any Provider contained therein. Inclusion in the Provider Directory does not imply recommendation or endorsement nor does omission in the Provider Directory imply WebMD disapproval.


text:
Williamsburg —The Harlan County Lady Bears led for more than three quarters Friday but were unable to close out Whitley County in showdown of 13th Region powers. The Lady Colonels outscored Harlan County by 10 points in the final six minutes to rally for a 51-46 win.
"We led the whole game. We have not had any consistent practices or games because of the weather. I think that shows how competitive the region really is," said Harlan County coach Anthony Nolan. "I think there are five or six teams right in this thing together and it is just who makes the plays at the end. We could very easily have been sitting here at 20-0 right now, but we have to find a way to close some of these games out."
Harlan County took control early with a dominant first quarter. The Lady Bears outscored Whitley 18-8 in the opening period. A basket from junior Bella Noe gave Harlan County an 8-7 lead with 2:50 left in the quarter. Sophomore Lindsay Brandon drained a 3-pointer on the next trip to continue a run that saw Harlan County outscore Whitley 12-1 the rest of the way. Noe had eight of her team-high 19 points in the first quarter, while sophomore Brooklyn Massingill turned in seven of her 15 points.
Whitley County chipped away at the lead in the second quarter. Senior standout Brandi Smith recorded five of her game-high 17 points in the period to pull Whitley to within four points at the half.
Smith tied the game at 30 with a pair of free throws just over four minutes into the second half. The Lady Bears didn't relinquish the lead in the period. Massingill put Harlan County back on top with a free throw on Harlan County's next possession. Massingill later closed the period with a drive and score to keep the Lady Bears in front 37-33 after three.
The Lady Colonels took the lead and maintained the advantage at the free throw line in the fourth quarter. Whitley County went to the charity stripe 14 times in the final eight minutes, hitting 12 attempts. Harlan County didn't make its first trip to the line until Noe hit a pair with 25 seconds left in the contest. The Lady Bears led by two midway through the period, but Smith converted an old-fashioned three-point play to put the Lady Colonels up 43-42 with 3:07 left. Whitley never trailed again down the stretch.
"The free throw differential was the biggest thing. We weren't even in the bonus with 1:40 on the clock. The rest of it is just toughness. We missed a block out assignment, some free throws and a couple of little things. I told them whoever did the little things most consistently would determine the game," Nolan said.
Harlan County (15-5) returns to action Monday at Middlesboro in a 52nd District contest. Whitley County (18-4) will travel to Knox Central on Thursday.
— — —
Whitley County (51) — Hallie Jones 3, Brandi Smith 17, Taylor Dingess 5, Maria Johnson 6, Kandace Craig 13, Abby Estes 7, Taryn Hickey 0, Savanna Sizemore 0, Emily Vanderpool 0, Seirra Feltner 0.
Harlan County (46) — Kaitlyn Stittums 4, Brooklyn Massingill 15, Lauren Lee 0, Bella Noe 19, Shannon Shackleford 2, Lindsay Branson 4, Kaylea Gross 2, Kaitlin Evans 0, Bridgett Bennett 0.


text:
About Schools in Freeport, KS
Contact a Coldwell Banker® real estate agent to learn more about the schools and school districts in Freeport, KS.FIND AN AGENT
Freeport, Kansas is located in Harper County. Nearby cities and towns include Danville, Argonia, Bluff City, Milan, Anthony, Harper, Manchester, Conway Springs, Mayfield, Milton, Caldwell, Norwich, Attica, Renfrow, Wakita, Waldron, Viola, Spivey, and Wellington. Freeport is a rural community with a population of 5. The median household income is $0. In Freeport, 75% of residents are married, and families with children reside in 50% of the households. Half the population of Freeport commutes 0 minutes or less to work, with 0% of residents holding white collar jobs and 0% residents holding blue collar jobs. The median age of homes in Freeport, KS is 80 years, with 100% of those homes owned, 0% rented, and 0% not occupied.
Contact a Coldwell Banker® real estate agent to learn more about the schools and school districts in Freeport, KS.FIND AN AGENT
See if your personality and goals are right for real estate.SEE ALL REAL ESTATE CAREERS
Community information and market data Powered by Onboard Informatics. Copyright ©2015 Onboard Informatics. Information is deemed reliable but not guaranteed.
This information is provided for general informational purposes only and should not be relied on in making any home-buying decisions. School information does not guarantee enrollment. Contact a local real estate professional or the school district(s) for current information on schools. This information is not intended for use in determining a person's eligibility to attend a school or to use or benefit from other city, town or local services.


text:
The Association for Accounting Marketing
The Association for Accounting Marketing (AAM) is the leading trade/educational organization for individuals working in the communications field for accounting firms. Since 1989, AAM has provided members with the information resources and market intelligence needed to excel and grow in their careers.
Why join AAM? Why attend the conferences? AAM is the organization in the United States dedicated to helping public accounting firms create, grow and strengthen their marketing resources, and any firm involved in marketing can quickly and easily stay up-to-date on the latest trends and tools available.
What does AAM do for member firms?
- Education: Educational Programs, Annual Conference
- Resources: Resource Bank, Benchmarking Survey
- Networking: Local Chapters, Conferences, Volunteer Opportunities, Discussion Forums
- Ongoing Communication: Newsletter
- Firm Development: Find qualified marketers through the Job Bank
Who are AAM members? AAM members come from a variety of backgrounds from professional marketers to CPA firm partners of the marketing function. AAM believes that to maximize the benefits of membership, successful firms will have a representative from both the partner group as well as the marketing group participate in the assocation and attend the conferences. Successful implementation of the tools gathered through AAM has been significantly enhanced through the dual membership approach.
How Much?
- Executive Member ($50 initiation fee; $200 annual dues)
- Associate Member ($50 initiation fee; $200 annual dues)
- Affiliate Member ($50 initiation fee; $200 annual dues)
- Educator Member ($50 initiation fee; $125 annual dues)
- Student Member ($50 initiation fee; $25 annual dues)
Contact info:
Association for Accounting Marketing
9140 Ward Parkway, Suite 200
Kansas City, MO 64114
(816) 444-3500
e-mail: firstname.lastname@example.com
|Association for Accounting Marketing
12th Annual Marketing Conference
Who should attend:
Be sure to tell them AccountingWEB sent you!
Editor's Choice
or shared with any third parties.


text:
DALLAS -- Joshua Burns cherishes every moment; especially with his fiancee and Zachary, his 5-month-old.
But it's another moment that makes this one more precious.
'It's a day that is pretty solidified in my mind,' Burns said.
On Feb. 15, 2014, this Dallas police officer responded to a call that put him three feet from a man with a gun. Burns was shot three times.
You can see Good Samaritans and first responders working quickly and desperately in cell phone video from that day.
'I remember laying on the ground and thinking to myself, 'I finally have everything I wanted -- a great family.' I wasn't going to let it be taken from me,' Burns said.
His fiancee was at home with a then 2-month-old. She rushed to the hospital.
'I wanted to hold his hand... And it was covered in blood from his wounds,' Kayleigh Martin said. 'Yeah, it was very emotional.'
And when times were at their worst, the community stepped up. Non-profits Carry the Load and Assist the Officer helped this family in more ways than one.
'This gives them the peace of mind that they can go out and do their jobs and there's a support system when something bad happens,' said Steve Brody with Assist the Officer.
And the cards that come from these families saying thank you at the Dallas Police Association fill up a wall.
'There was a huge outreach, and it was wonderful,' Burns said.
Three months removed, Josh Burns hasn't gone back to work. He's recovering from five broken ribs and a bullet that came one inch from his spine.
'Nothing is ever going to be the same again,' his fiancee said. 'I'm going to be scared every time he walks out that door.'
Josh and Kayleigh plan to marry in June.
They're well aware now that anything can happen. And also, that groups are there to help when it happens.
E-mail firstname.lastname@example.com
Join the Conversation
To find out more about Facebook commenting please read the Conversation Guidelines and FAQs
Dallas officer shot in line of duty gets helping hands from Carry the Load, Assist the Officer
"I remember laying on the ground and thinking to myself, 'I finally have everything I wanted -- a great family.' I wasn't going to let it be taken from me," said Dallas Police Officer Joshua Burns.
DALLAS -- Joshua Burns cherishes every moment; especially with his fiancee and Zachary, his 5-month-old.


text:
To embed, copy and paste the code into your website or blog:
New bloggers love to ask, "how long should my blog post be?" 500 words? Is 1,000 words too much?
You graduated from law school a long time, so forget about numeric constraints. When blogging you are no longer bound by rules or Blue Book guidelines. I believe in a common sense approach to the length of blog posts:
1. Say something interesting right at the beginning.
2. If you don't have anything else interesting to say, end it there.
3. If you have more to say that is useful and interesting, find a way to say it as quickly as possible. A blog post is a snack, not a meal.
This post was just over 100 words. Some days you just have to be ok with that.
DISCLAIMER: Because of the generality of this update, the information provided herein may not be applicable in all situations and should not be acted upon without specific legal advice based on particular situations.
© Adrian Dayton
Read fresh new writing on compliance, cybersecurity, Dodd-Frank, whistleblowers, social media, hiring & firing, patent reform, the NLRB, Obamacare, the SEC…
…or whatever matters the most to you. Follow authors, firms, and topics on JD Supra.
Create your news brief now - it's free and easy »
Adrian Dayton is an internationally recognized speaker on social media and the Founder of the...
View Profile »
See more »
Sign up for your custom alerts now, using LinkedIn ›
Back to Top
Copyright ©


text:
See All
My Communities
My Discussions
My Email Digests
Congratulations on your BFP! Welcome to YOUR community!
Be sure to check out:
Be sure to check out:
- A week-by-week guide to what's happening in your body.
- Get the WebMD Pregnancy app for iPhone
Spotlight: Member Stories
34 year old Registered Nurse- 2nd Pregnancy- 16 years apart. How did we end up here? No, really I am truly excited and feel blessed of God to be able ...More
More Members
Popular Discussions
Helpful Tips
if i take birth control during my pregnancy will it hurt my baby?
have 2 miscarreds before so im worryed cus i just found out im 9weeks and ive been takeing birth control and would hurt the baby and the ... More
Thank you for voting!
7 of 15 found this helpful
Helpful Resources
Related News
Report Problems With Your Medications to the FDA
You are encouraged to report negative side effects of prescription drugs to the FDA. Visit the FDA MedWatch website or call 1-800-FDA-1088.


text:
Clocked me and she told me I'm a pig like I fight crime
from G-Eazy (Ft. Dominique LeJeune) – Marilyn Lyrics on Genius
His girl at home discovered his cheating, and hit him/insulted him. By calling him a pig:
She's using a derogatory term used in reference to cops. Ipso facto, she calls G a pig like he's a policeman fighting crime.
She's calling him a misogynist. G represents a "pig" in this sense, as he is always getting with girls on tour.
To help improve the quality of the lyrics, visit G-Eazy (Ft. Dominique LeJeune) – Marilyn Lyrics and leave a suggestion at the bottom of the page