text:
The eighth phase of polling that took place in the states of Uttar Pradesh, West Bengal and Andhra Pradesh on May 7 didn't go without allegations of poll rigging with several of them made by top candidates.
As five constituencies in Uttar Pradesh went to polls, key candidates alleged instances of poll rigging and violence.
1. Bharatiya janata Party's (BJP) Amethi candidate Smriti Irani made headlines when she confronted Priyanka Gandhi's PA Preeti Sahay saying why she was present around the poll booth in Amethi. She was quick enough to post a picture of Sahay from her Twitter account.
2. Irani claimed that voters were being influenced by the Congress when she tweeted that voters had to pass the Congress mahasachiv's home which is 30 meters away from polling booths 210 and 211 in the Amethi constituency
3. The TV actress turned politician even claimed that voters in Kaima were beaten by Congress workers and went on to tweet a picture of man's back that had injury marks.
4. AAP's Kumar Vishwas made allegations of booth capturing in several booths. He had tweeted that "Booth capturing is going on at booth number 42 of Mehmoodpur...," but all of Vishwas' found to be untrue after verification by the Election Commission(EC).
5. AAP took objection to Rahul Gandhi's mode of transport claiming that he traveled in a cavalcade but the Congress responded that he was travelling in just one car with rest of the cars being used by security personnel to commute. It was however the first time Rahul Gandhi had visited Amethi on a polling day.
6. Rahul Gandhi too objected to a drawing of a lotus on a blackboard in a polling booth in Amethi and said he would take it up with the EC.
In West Bengal six constituency went to polls and registered voters' turnout higher than national standards. The Left Front claimed taht voters were being intimidated with violence and there were instances of booth capturing.
In Andhra Pradesh 25 constituencies went of polls. Violent clashes broke out and 20 people were reported to be injured and 3 police vehicles were damaged.The clashes were reported to be between the YSR Congress Party and Telugu Desam Party workers


text: animals Comments 3 Science Fact or Science Fiction: WEIRD Animal Edition By Vadim Newquist Jan 2, 2014 Back 22 of 22 Next More More Slideshows Cookin' with Samwise! Comic Con Is Almost Here... Get Ready With This To-DYE-For Raven Cosplay Makeup! Star Wars Characters Pose With Shelter Pets For Adorable Photo Series Back Next more > Back Next more > FACT! Tags: animals, science, quizzes, slideshows Doge Does Our Fave YA Book Covers Doge Does Our Fave YA Book Covers HAPPY NEW YEAR FROM THE MINDHUT!!! HAPPY NEW YEAR FROM THE MINDHUT!!! Related Posts science Science Fact or Science Fiction: WEIRD Animal Edition videos This Eagle Took A Selfie! slideshows Revenge of the Science Fact or Science Fiction Quiz! science SCIENCE EXPLAINS: Dinosaur Awesomeness! Write your own comment! Hold up there partner! Before you comment on a post there's one more step. You'll have to choose a nickname to be displayed on your comment. Give 'er a shot below! Write your own comment! OR Remember me OR Please log in first Email Password Remember me Log in Create an account | Lost password ...or log in using

subset: commoncrawl


text:
The speed and accuracy of a computer implemented handwriting recognition system is enhanced by several innovations, including integrated segmentation and context processing. The recognition processing occurs while the user is providing ink data. The system quickly reaches the recognition result once all of the input is received. More than one result may be returned by the system.
1. A method of processing data that represents strokes of handwritten information, thereby to identify characters represented by the data, the method comprising the steps of:
receiving the data provided by a user, the data having a beginning part and an end part that define therebetween a complete amount of handwritten information to be processed;
assembling portions of the data into a sequence of packages; and
determining for the sequence of packages a probable result set of characters represented by the sequence, the determining step occurring before the end part of the data is received and comprising the steps of simultaneously considering information pertaining to the character shapes represented by the packages and information pertaining to the literal context of the characters represented by the packages;
wherein the determining step includes searching for the result set of characters from among a plurality of character candidates using a first search technique; and
wherein the first of two search techniques comprises the steps of:
developing for each package at least one path representing a string of character candidates, each path having a respective beginning and a respective end; and
generating for each path a first cost value that reflects the probability that the path includes the result set of characters, the first cost value being based upon information pertaining to the character shapes represented by the packages and information pertaining to the literal context of the characters represented by the packages and
wherein the second of the two search techniques assigns a second cost value to a considered path based upon the literal context of the considered path, and wherein the second search technique conducts a reverse search towards the respective beginning of at least some of the paths developed by the first search technique to identify the result set as a path having the lowest of the combine first and second cost values.
2. The method of claim 1 wherein the second of the search techniques assigns the second cost value to a considered path based upon whether the character string represented by the path appears in a dictionary.
3. The method of claim 1 wherein considering the information pertaining to the character shapes represented by the packages and the information pertaining to the literal context of the characters represented by the packages includes considering the likelihood of the occurrence of three adjacent character candidates.
4. The method of claim 1 wherein considering the information pertaining to the character shapes represented by the packages and the information pertaining to the literal context of the characters represented by the packages includes comparing the relative sizes of adjacent character candidates to establish whether one of the character candidates is an uppercase character.
5. A method of processing data that represents strokes of handwritten information, thereby to identify characters represented by the data, the method comprising the steps of:
receiving the data provided by a user, the data defining an amount of handwritten information to be processed;
assembling portions of the data into a sequence of packages;
determining for the sequence of packages a probable result set of characters represented by the sequence, the determining step comprising the step of simultaneously considering information pertaining to the character shapes represented by the packages and information pertaining to the literal context of the characters represented by the packages
wherein the determining step includes searching for the result set of characters from among a plurality of character candidates using a first search technique and combining the first search technique with a second search technique that is performed subsequent to the first technique;
wherein considering the information pertaining to the character shapes represented by the packages and the information pertaining to the literal context of the characters represented by the packages includes considering whether the size of a space between two adjacent character candidates exceeds a predetermined amount representative of a space between adjacent character candidates.
6. A method of processing a received stream of data that is representative of stylus tip movement on a tablet or the like, comprising the steps of:
dividing the stream into a plurality of sequential frames;
combining the frames of input data into one or more packages;
assigning one or more character hypotheses to at least some of the packages;
constructing in a sequence conforming to the sequence with which the data is received paths of multiple character hypotheses;
assigning to portions of the paths values based upon the shape and literal context of the character hypotheses contained in the path; and
reverse-searching the constructed paths in a direction opposite to the direction the data was received.
7. The method of claim 6 wherein the reverse-searching step includes using the values assigned in the assigning step to direct the reverse-search.
8. The method of claim 6 including the step of beginning the constructing step before the end of the stream of data is received.
9. The method of claim 6 including the step of receiving the data stream provided by a user, the data stream having a beginning part and an end part that define therebetween an amount of handwritten information to be processed and wherein the constructing step is executed as soon as the beginning part is provided by a user.
10. A handwriting recognition system for providing a result of a recognition task comprising:
input means for collecting ink data that represents strokes of handwritten information, the data having a beginning part and an end part that define therebetween an amount of handwritten information to be processed;
classifier means for providing character hypotheses based the ink data; and
search means for selecting the result by substantially simultaneously considering the shape and literal content of the character hypotheses as soon as the beginning part is provided by a user.
11. The system of claim 10 wherein the search means includes first search means for modeling the collected ink data as dynamic programming paths each having a beginning and an end; and
second search means for reverse searching the paths modeled by the first search means towards their respective beginnings.
The present invention relates to a computer implemented handwriting recognition system.
Handwritten information may be used as computer input once it is converted to digital form. Handwritten information may be collected by any of a number of mechanisms. Typically, the tip of a pen or stylus that is held by the user is placed in contact with a tablet device that includes sensing mechanisms for detecting the position of the pen tip. Movement of the pen tip along the tablet, such as occurs when the user prints or writes, generates a stream of pen tip position data. The data may be an array of "x" and "y" position coordinates, and may be referred to as "ink" or "ink data." Handwriting recognition systems process such ink data for the purpose of transforming the user's handwritten information into digital information that can be used with any conventional computer application, such as word processing.
The primary design considerations for handwriting recognition systems are speed and accuracy. One of the factors affecting the speed with which handwriting recognition can progress relates to how computer processing time is allocated to the recognition task. For example, earlier recognition systems postponed the processing of ink data until all of the ink data was provided by the user. Such an approach failed to efficiently use processing time that was available as the computer was collecting ink data.
The speed and accuracy with which a handwriting recognition system transforms written information to corresponding digital information may suffer as a result of the order by which the ink data is processed. In some prior systems, for example, ink data was first processed to determine which alphanumeric characters were most likely formed from a series of pen movements made on the tablet. Such character identification is often referred to as segmentation processing. The likely characters were thereafter processed to determine whether or not a character was meaningful in the literal context of the other likely characters. This latter processing is referred to as context processing.
The problem with such sequential segmentation processing and context processing is that the selection of likely characters takes place without access to the context information. Put another way, segmentation processing takes place with limited information, without reference to context information that could be advantageously used to assist with the determination of the most likely characters. The accuracy of the context processing is correspondingly hindered because the context processing commences with characters that are determined by a segmentation process that is based on such limited information.
The present invention is directed to a system for increasing handwriting recognition speed and accuracy by the application of a number of innovations. For example, the present system (which will hereafter be occasionally referred to as "the recognizer") begins processing ink data as soon as the user begins to write on the tablet. Accordingly, the final recognition result is available very soon after all of the ink is collected.
As another aspect of the present invention, segmentation and context processing are integrated in order to significantly increase the accuracy of the overall recognition process. This integration is achieved by modeling a recognition task as a dynamic programming problem and constructing paths of multiple character hypotheses from the stream of ink data. The recognizer searches the multiple paths to find the optimal path, which is the string of characters most likely to match what the user wrote on the tablet. Each node of a path represents a discrete portion of the ink data. Each node has associated with it a probability or cost value that is the aggregate of the cost values assigned to the node by several modeling components. Some of the components provide cost values that relate to the probable character represented by the node. Other components provide cost values pertaining to the context of the node information. As a result, the highest probability or estimate of the correct word or sentence construction is made using, concurrently, context and segmentation processing. This segmentation/context integration greatly enhances the accuracy of the recognition system.
The dynamic programming path search (hereafter referred to as the DPP search) begins essentially as soon as the user begins to write. This search serves as a forward pass in the recognition process and is coupled with a second, reverse-pass search of the paths. The second search occurs once all of the ink data is collected. The DPP search generates the costs of the paths based upon the cost value provided by the modeling components mentioned above. These path costs are used as estimates for the second search, which is a stack-based bounded path search (hereafter referred to as the SBP search). The SBP search uses the estimates generated by the DPP search and refers to a system dictionary to add to the DPP search path estimates the probability that the word or words found in the path appear in the dictionary. The SBP search arrives at the overall optimal (most likely) recognition result. The SBP search can produce and rank a number of probable results. The results are made available to the application that calls upon the recognizer.
Other inventive aspects of this invention will become clear upon review of the following description.
FIG. 1(a) is a diagram of mechanisms for collecting data representative of handwritten information.
FIG. 1(b) is a representation of data points associated with a handwritten character.
FIG. 1(c) is a diagram of a series of ink strokes that combine to form a character.
FIG. 2 is a diagram depicting the primary components of the recognizer and its interaction with a computer application that can call upon the services of the recognizer.
FIG. 3 is a flow chart representing the overall processing undertaken by the recognizer.
FIG. 4 is a flow chart representing the processing undertaken by a portion of the recognizer, an object designated SINFO, that establishes and stores for later processing certain information relating to ink data that is provided by the application.
FIG. 5 is a flow chart representing the processing undertaken by a portion of the recognizer, an object designated GESTURE, for detecting whether the ink data represents a specified gesture.
FIG. 6 is a flow chart of a portion of the recognizer, an object designated ENGINE, that controls the overall search procedure for generating the best handwriting recognition result(s).
FIG. 7 is a flow chart representing the processing undertaken by one of the two search techniques, designated DPP, used by the recognizer.
FIG. 8 is a flow chart representing the processing undertaken by the second of the two search techniques, designated SBP, used by the recognizer.
The diagram of FIG. 1(a) represents a system with which the methods of the present invention may be implemented. An electronic digitizing tablet 20 is connected to a computer 22 by a cable 24. The user provides handwritten information to the computer by moving the tip of a stylus or pen 26 across the screen 28 of the tablet 20 in a manner substantially identical to printing on paper. Typically, the tablet 20 will include mechanisms for displaying on the tablet what the user writes on the screen 28.
The tablet may include a conventional grid of conductive strips underlying the screen 28. The pen 26 serves as a probe having a conductive tip. The position of the tip is detected by the grid when the user brings the tip into contact with the screen. The tablet makes available to the computer the data that is representative of the pen tip position. The data may be in the form of a stream of "x" and "y" location coordinates.
It will be appreciated that any of a variety of mechanisms may be employed for providing data indicative of a pen position. Moreover, the tablet and computer components used for implementing the present invention may be incorporated into a single hand-held device.
When an application that is run on the computer seeks as input handwritten information on the tablet, the computer samples the x-y coordinate data at a rate, for example, of 200 times per second and calls upon the recognizer of the present invention to process the ink data by correlating that data to known characters. The recognizer provides its results to the application. For the purposes of this description, the term "character" refers to an alphanumeric character or symbol. A "recognition task" will refer to the handwriting recognition performed by the recognizer on a specified, uninterrupted amount of handwritten information.
FIG. 2 depicts the overall scheme of the present recognizer and its relationship with an application that calls upon the recognizer to perform a recognition task. The recognizer is a component of the computer operating system. It may be called upon via a predefined set of application program interfaces (APIs). In a preferred embodiment, the computer program aspect of the recognizer is coded in C programming language and interacts with the application via three main objects. In this implementation, the objects are designated HRC, HMACRO and HRCRESULT. These objects are respectively designated with reference numerals 30, 32 and 34 in FIG. 2.
HRC is the root object that is used by the application to interact with the recognizer. The life span of this object is one recognition task. This object is responsible for setting, via member functions, recognition parameters and other necessary information (input flags, language codes, guide structures, etc.) for the recognizer.
HMACRO is an object that is created by the application for providing context information, such as application-specified word lists, to the recognizer.
HRCRESULT is the object to which the recognizer provides the results of the recognition task. The application queries this object to obtain the results.
Also depicted in FIG. 2 is a schematic representation of several modules employed by the recognizer for carrying out the recognition task. More particularly, the recognizer includes an engine module 40 and associated modules for processing the ink data that is provided by the application via the HRC object 30.
A preprocess module 42 filters and smoothes the sampled ink data received from the tablet. The preprocess module 42 extracts from the sampled ink data the information that is necessary and sufficient for a classifier module 44 to provide hypotheses as to which characters may be represented by the ink data.
It is noteworthy here that the term "stroke" will be used to refer to the data generated as the pen tip is moved across the tablet screen 28 FIG. 1(a) from the location where the tip first contacts the screen to the location where the tip is removed from the screen. For example, the writing appearing on the screen 28 of FIG. 1(a) depicts four strokes, one being the vertical member of the "T", the other being the horizontal member of the "T", the third stroke being the letter "h", and the fourth stroke comprising the letter "e".
The engine module 40 delivers to the classifier module 44 the preprocessed data from module 42. The data is delivered in groups of discrete sequences or "frames" of ink data. For each frame group, the classifier module 44 returns to the engine module 40 a set of character hypotheses, which may be referred to as candidates. For each candidate, there is assigned an associated probability that the candidate corresponds to that written on the tablet by the user.
Groups of character candidates are provided by the engine module 40 to a gesture module 56, a whitespace module 46, a trigram module 48, and a baseline/height module 50.
The gesture module 56 reviews each character candidate to determine whether it represents a gesture, which is a specific system-defined command. For example, when the user writes an encircled "c", the gesture module will note whether what is written is a predefined gesture. The encircled "c", for example, may be a predefined gesture indicating that a portion of text is to be copied. If a gesture is found, the recognizer immediately returns control to the application with the identified gesture placed in the HRCRESULT object.
The whitespace module 46 calculates the probability that any two character candidates are separated by a whitespace. This information is returned to the engine module and used in the search for the best result(s). By "best result" is meant the character string returned by the recognizer at the completion of the recognition task.
The trigram module 48 reads three adjacent character candidates given to it by the engine module and provides a probability of the occurrence of those three characters in the language. For example, for the adjacent characters "t" "h" and "e", the trigram module will return a very high probability, while the adjacent characters "t" "l" and "e" would return a relatively lower probability. This information is used by the engine module in searching for the best result. It is noteworthy here that although a trigram (that is, three successive letters) is used in a preferred implementation of this system, any number of successively occurring letters, such as bigrams, may be used with this module.
The baseline/height module 50 compares the relative sizes of adjacent characters and, for example, returns to the engine module a probability that the first of the characters is an uppercase letter.
The hmacro module 52 is a mechanism for providing to the engine module 40 specific contextual information, such as word lists, that is provided by the application via the HMACRO object 32. For example, the application may provide the recognizer with the last name of the computer user. That name would be considered during the searching undertaken by the engine module.
With the information received from the classifier, whitespace, trigram, baseline/height and hmacro modules, the engine module searches as described hereinafter for the best result of the handwriting recognition task. The one or more best results determined by the search process are provided to a result module 60 and obtained by the application upon a query of the HRCRESULT object 34.
Turning now to the particulars of the recognizer and with reference to FIG. 2, the application, for each handwriting recognition task, creates the HRC object via the CreateHRC API call. The application passes to the recognizer the input ink data via the AddPenInputHRC API call. The application also provides for the recognizer an amount of processing time via the ProcessHRC API call.
As processing time is available (see step 80, FIG. 3), the recognizer first invokes the ENGINE object 90. For the present it is assumed, however, that no information has been prepared for the ENGINE object to process and, therefore, control immediately returns to the main recognizer program (see step 92, FIG. 6). The recognizer next invokes at step 100 an object (FIG. 3), designated SINFO (for search information), which is one of the primary objects of the engine module. As shown at 101, FIG. 4, the SINFO object immediately returns control if there is no ink to process. Considered next is the situation where ink data is available.
Indicated at 102 (FIG. 4), the "Ink data preprocess" step is carried out, whenever ink data is present, by the above-mentioned preprocess module 42. The preprocessing is best considered in conjunction with the drawing of FIG. 1(b). FIG. 1(b) is a drawing that is illustrative of how the x-y coordinate data is collected by the tablet 20 (FIG. 1(a)). There, the letter "m" was drawn by a user. Since the x-y data from the tablet is sampled up to 200 times per second, there is generated in drawing an "m" a multitude of data points.
The ink data preprocessing step 102 first removes from the received data any points that can be characterized as noise, such as shown at point 104 in FIG. 1(b). Next, a limited amount of essential x-y data is extracted from the multitude of sampled data coordinates so that the classifier 44 and other modules may efficiently process the information. One method of extracting this essential data is to note along the entire ink stroke "extrema" points, such as shown by the solid circles 106 in FIG. 1(b). The extrema 106 represent the uppermost peaks and lowermost valleys of the stroke. In this instance, the stroke is the entire letter "m".
With the extrema 106 recorded, several intermediate data points (illustrated as hollow circles in FIG. 1(b)) between the extrema 106 may then be extracted from the data. The extracted data points represent the essential features of the ink and are stored for further processing. In this regard, the preprocessed ink data corresponding to one stroke of ink is stored as a "frame", all of the preprocessed ink strokes are stored as an array of frames. (Hereafter, a preprocessed stroke will usually be referred to as a frame.)
As shown at step 108 in FIG. 4, the processing undertaken by the SINFO object 100 next packages a number of adjacent frames of input data for analysis by the classifier module 44. In this regard, a "glyph" is considered as one frame, or a combination of a few frames. Glyphs are passed to the classifier to determine which characters they may represent.
In a preferred implementation, the glyphs are grouped in separate combinations of one, two, three and four frames. A group of four glyphs, therefore, is associated with each frame. For example, with reference to FIG. 1(c), when one prints the uppercase letter "E", four successive strokes are employed, 112, 114, 116, 118. Once the x-y data representing these four strokes is preprocessed as mentioned above, the recognizer will, for each frame (referring here, for example, to the frame associated with the last-made stroke 118) package (i.e., arrange in computer memory) a group of associated glyphs. For the frame corresponding to stroke 118, the associated glyph group will include a glyph comprising only the frame 118 data; a glyph comprising frame 118 and the immediately prior frame 116; a glyph comprising frames 118, 116, and the prior frame 114; and a glyph comprising the data of frames 118, 116, 114, and 112. In the preferred embodiment, the maximum number of frames assembled into a glyph is four, inasmuch that users do not combine more than four strokes into an English-language character.
It is noteworthy here that as an alternative to the "free" handwriting input discussed above, the pen and tablet system may define on the screen 28 (FIG. 1a) "boxes" within each of which a user is to enter a single alphanumeric character. In such an instance, the glyph packaging carried out by the SINFO object (step 108, FIG. 4) would entail grouping all of the frames contained within a particular input box as a single glyph for analysis by the classifier. Except as noted below, the application, via an attribute of the HRC object, provides to the SINFO object data representative of the boxes or guide structure employed by such a tablet system. The hereafter described searches are carried out in the same manner irrespective of whether boxed or free input is used.
Once the group of four glyphs associated with each frame of free-input ink data is packaged, the SINFO processing at step 120 (FIG. 4) invokes the classifier. The classifier reviews the glyph group of each frame to determine whether the shape of any glyph corresponds to an alphanumeric character. In instances where character shapes are found, the classifier returns for each such glyph the one or more likely character candidates, the candidates may be referred to as character hypotheses. For each candidate, the classifier also provides a probability value relating to how closely that candidate matches the glyph as written by the user. The classifier, which may be referred to as a shape recognizer, is a statistically based type using y extrema based features.
For example, for the glyph comprising the four frames 112, 114, 116, 118 depicted in FIG. 1(c), the classifier would return a character hypothesis, the letter "E", with a very high probability of its occurrence (assuming that the "E" is precisely drawn as shown in the Figure). Depending upon how carefully the "E" glyph is formed, other shapes, such as an "F" with a lower probability value may also be returned as a candidate.
The glyph and corresponding character hypotheses with associated probabilities are then stored by the SINFO object, step 122 (FIG. 4), for later use during the search.
After all the glyph groups for all of the currently available glyphs are analyzed by the classifier, the SINFO object, step 124 in FIG. 4, invokes the whitespace module. The whitespace module 46 compares the x-y data of a given character candidate with that of the immediately prior candidate. If the size of the space between two adjacent candidates exceeds a threshold amount representative of typical spacing between adjacent characters, the whitespace module will return for that candidate a value representing a high probability of a space between characters. As indicated in step 126 in FIG. 4, the whitespace probabilities associated with each character are stored for use by the engine module. As noted earlier, the probability of whitespace characters is considered in the search for the best recognition result. In instances where "boxed" input is employed as described above, the whitespace module is not invoked since word boundaries are made explicit by that input format.
When the SINFO object completes processing of currently available ink data, it returns control to the main recognizer, and a GESTURE object 101 (see FIG. 3) is then invoked.
The GESTURE object (FIG. 5) determines whether any of the recently received strokes (stored as frames) comprises a gesture. As depicted in FIG. 5, GESTURE compares the preprocessed x-y data corresponding to a successive set of strokes (for example, three successive strokes) with tabulated data corresponding to system-defined gesture possibilities (steps 130, 132, FIG. 5), such as the encircled "c" described earlier. GESTURE then returns to the main program with an indication of which, if any, gestures have been entered by the user. Any detected gesture information is immediately placed in the HRCRESULT object and made available to the application. It will be appreciated that the processing carried out by GESTURE module is not required for the recognition task processing. In this regard, the GESTURE module is demonstrative of how a discrete system requirement (gesture identification) may be readily incorporated into the present recognition system to complement the recognizer.
If no gesture is found, the recognizer at 103 (FIG. 3) determines whether there has been stored by the SINFO object any (or more) information for the ENGINE object to process. If such information is present, and processing time remains (step 80), the recognizer again calls ENGINE (see FIG. 6), which is another primary object of the engine module, for carrying out the above-mentioned searches to arrive at the best result of the recognition task.
The ENGINE object retrieves all of the information about the ink given to the recognizer and combines the information in a meaningful way to generate the optimal solution or best guess via the dynamic programming (DPP) search and stack-based, bounded path (SBP) searches mentioned above.
When data (designated "search information" to represent what has been processed by SINFO) is available for processing by the ENGINE object (step 92 at FIG. 6), the DPP object 200 (FIG. 6) is invoked by the ENGINE object. The DPP object is called upon to process one granularity, in this instance a frame of preprocessed ink, for extending dynamic programming paths.
With reference to FIG. 7, the DPP search at step 202 first retrieves for the frame (for DPP search purposes, the frames are considered layers of the search paths) all of the glyphs that were packaged for this frame as explained above in connection with the SINFO object 100 (FIG. 4).
Next, at step 204, DPP retrieves from the SINFO search information each of any character hypotheses (referred to in the search as a "symbol,") that were returned by the classifier when the glyph group of this frame was considered by the classifier. Thus, step 204 retrieves for a given layer, all of the character candidates ("symbols") that were returned by the classifier.
Step 206 indicates that the DPP object establishes a node of a search path for each such symbol associated with the frame or layer "i" under consideration.
As will be explained, the DPP search object later calculates the best path cost up to each node at the present layer from all of the previous nodes at the previous layer. The search, therefore, makes a forward pass, in the direction of first-received data (nodes) to last received. Before proceeding, however, it is noteworthy to point out that in a preferred implementation, the DPP search and the hereafter described SBP search determine as "best" costs the lowest path costs. Accordingly, the probabilities returned by the above-described modules (classifier, trigram, etc.) are transformed in the ENGINE object to least-cost values by converting the probabilities to their associated negative-log values. As a result, the aggregate of least-cost values returned by the several modules is determined by adding these negative-log values, thereby avoiding computational inefficiencies that would arise if probabilities were multiplied to arrive at the aggregate values.
Before calculating the dynamic programming search path cost as mentioned above, the DPP object first, step 208, calls the hmacro module 52 to determine whether the path up to all of the nodes of the layer under consideration is permitted by any template supplied by the main application via the HMACRO object mentioned above. If such transition validity is acceptable, the DPP object, step 209, retrieves, one-at-a-time, the path information (character string) and aggregate least-cost value for every path, as calculated up to each node that is located in the layer immediately prior to the layer of the node under consideration.
Over the series of steps explained next, the DPP search calculates the path up to the node under consideration (CostNew) by adding to the path cost up to the previous node the cost values associated with the node under consideration.
Specifically, at step 210, DPP retrieves for the node under consideration the character least-cost value α that was returned by the classifier for the symbol that now comprises the node under consideration.
Steps 212 and 214 indicate that the cost value, β, representing the trigram least-cost value from the trigram module 48 is also retrieved for the path node under consideration.
The baseline/height cost value γ (steps 216, 218), and the above-described whitespace cost value δ, step 220 are also retrieved for the node under consideration.
At step 224, the path costs (CostNew) to the node under consideration from each of the previous-layer nodes are separately determined, and the lowest path cost up to the node under consideration is stored, step 226, as a (partial) path cost estimate to be used by the SBP search, as described more fully below.
Once least-cost paths are established for all nodes at a particular layer (steps 208 through 226), the DPP search returns from its iteration. The ENGINE object then checks, step 230 (FIG. 6), to determine whether a flag provided by the application via the HRC object has signaled the end of ink input. If not, the ENGINE object returns control to the main recognizer program (FIG. 3), which, time permitting, again steps through the ENGINE, SINFO and GESTURE objects for (1) generating more search information in the event that more ink data has become available as the user continues to write on the tablet, (2) reviewing for gestures made by the newly added ink, and (3) extending the DPP object's dynamic search paths by one more layer. It will be appreciated with respect to the just-noted item (1), processing or construction of the dynamic search paths for ultimately finding the best result occurs even though the user has not necessarily finished writing onto the tablet. This aspect of the invention substantially speeds the final calculation of the best result.
Returning to consider step 230 of the processing carried out by the ENGINE object (FIG. 6), in the event that the end of ink input has been flagged by the application, the ENGINE then invokes at step 230 the SBP search for performing the above-mentioned stack-based bounded path search to arrive at one or more best results.
Specifically, with reference to FIG. 8, the SBP search first retrieves the nodes that occur at each end of the DPP paths (that is, the dynamic programming search paths established by the DPP object as mentioned above). At step 302 the SBP object expands, in reverse, from each node end toward the beginning of the DPP paths. The SBP object, at each node-to-previous-node expansion, consults the system dictionary and any application-supplied wordlist for determining whether the transition from one node to another yields a character string from the end node that is valid in view of the system dictionary or wordlist.
At step 304, the SBP object adds a dictionary cost Δ, to the DPP partial-path cost (that is, the path cost calculated by the DPP object from the beginning of the path to the node in question) for the node associated with an invalid transition. In this regard, the assigned dictionary cost is relatively high so that the path that includes a dictionary cost will be unlikely to yield the best result. Similarly, a path that includes more than one assigned dictionary cost (as a result of step 304) will have even lower likelihood of becoming the best overall result.
It is noteworthy here that the extent to which the SBP search relies upon the dictionary may be established by the application that calls the recognizer. In this regard, one of the attributes of the HRC object may include a coercion variable set by the application for influencing the extent to which the SBP search should rely on the system dictionary. For example, a very high-valued coercion variable provided to the engine module via the HRC object would indicate that the recognizer is to reject any words not found in the dictionary. As a result, the SBP search would assign a very high dictionary cost Δ, thereby to eliminate such paths.
Once the dictionary costs are assigned to all DPP paths, the SBP object, beginning its reverse search at each end node, step 306, calculates for each end node an "actual" cost (step 308) that comprises the sum of the character cost α, trigram cost β, baseline/height cost γ, whitespace cost δ, and (if assigned) the dictionary cost Δ. These costs are immediately available because they are stored in connection with each node as earlier processed in the DPP search, which nodes provide the foundation for the reverse search carried out by the SBP search. In this regard, the phrase "SBP node" will sometimes be used to refer to the nodes considered by the reverse-direction SBP search.
After calculating the actual cost for an SBP node under consideration (for now, still referring to each of the end nodes of the DPP search paths), the SBP search at 310 then calculates the costs of all the path extensions between the SBP node under consideration and each immediately adjacent (i.e., toward the beginning) node. This reverse-path extension or SBP cost for an adjacent node comprises (1) the "actual" cost of the node considered (step 308) and (2) the DPP partial path cost up to the adjacent nodes.
The SBP object, step 312, saves to a stack the SBP costs associated with every reverse-path extension of the node under consideration.
At 314, the SBP object checks to determine whether the reverse-path extension has reached the beginning of the DPP path (that is, the beginning of the input). If not, the reverse paths held in the stack are sorted and the next node selected for consideration is that on the path having the "best" or lowest SBP cost (step 316). For that best-path node the search steps described at 308, 310, 312, and 314, FIG. 8, are performed. As apparent in step 314, the SBP search performs the steps 308, 310, and 312 for the paths corresponding to all of end nodes. When all of the searching is thereby completed, the SBP search returns with the best result represented by the content of the sorted stack assembled at step 312. This best result is provided via the result module to the HRCRESULT object and is accessible by the calling application.
It is noteworthy here that the SBP search is readily adaptable for providing more than one "best" answer. In this regard, the search, in iterating through steps 308, 310, 312, and 314 saves the nodes associated with several lowest-cost paths. Such results will be ranked according to cost and made available to the application.
Having now described the principles of the invention with reference to exemplary methods and systems, it should be apparent that these examples can be modified in arrangement and detail without departing from such principles. For example, although printed input was referred to in the detailed description, the present recognizer can readily handle cursive input by, for example, defining in the preprocess module a suitable division of the input into strokes. Such a preprocess module may be incorporated or "plugged" into the recognizer without the need to alter other modules of the recognizer.
The present invention can be implemented using a variety of different computer systems. One of which may be a personal computer using an Intel 66 MHz 80486 microprocessor, running the Microsoft Windows 3.1 operating system. The following represents exemplary data structures and functions that may be employed in programming in C language a digital computer to perform the functions described above:
Data Structures
Stores the character probability generated by set of frames in terms of GLYPHSYM objects. Also stores the whitespace cost of different glyph combinations. This is one of the main objects contained in the HRC object.
Stores the character hypothesis information associated with a glyph.
Stores the probabilities returned by the shape recognizer.
Contains objects DPP and SBP. Responsible for scheduling search engine processes between the two search objects. This is one of the main objects contained in the HRC object.
Contains information about the DPP search process. Stores all the nodes and path estimations to be used by the SBP search.
Contains information about the SBP search process. Stores the priority queue for the current search containing paths. Stores alternate results.
GLYPHSYM functions:
int CSymGLYPHSYM(GLYPHSYM*glyphsym)
Returns the number of symbol hypothesis associated with this glyph. Invoked by DPP and SBP modules.
SYM SymAtGLYPHSYM(GLYPHSYM*gtyphsym, int iSym)
Returns the ith symbol hypothesis for this glyph. Invoked by DPP and SBP modules.
PROB ProbAtGLYPHSYM(GLYPHSYM*glyphysm, int iSym)
Returns the cost of ith symbol hypothesis for this glyph. Invoked by DPP and SBP modules.
GLYPH GlyphGLYPHSYM(GLYPHSYM*glyphsym)
Returns the glyph itself. Invoked by DPP and SBP modules.
SINFO functions:
int ProcessSINFO(SINFO*sinfo, BOOL fEndOfInk)
Processes SINFO object one granularity. During the processing, SINFO object constructs a valid GLYPHSYM object based on given ink, invokes the shape recognizer for symbol hypothesis. It also performs segmentation for boxed recognition. This is invoked during the ProcessHRC API call.
BOOL SetGuideSINFO(SINFO*sinfo, LPGUIDE lpguide, int nFirst)
Sets the guide info. Invoked directly by the HRC object. This function is invoked during the SetGuideHRC API call.
BOOL SetAlphabetSINFO(SINFO*sinfo, ALC alc, LPBYTE rgbyte)
Sets the alphabet info. This function is invoked during the SetAlphabetHRC API call.
BOOL GetBoxResultsSINFO(SINFO*sinfo, int cAlt, int iSyv,
LPBOXRESULTS lpboxresults) Retrieves the box results currently stored in the recognizer. Retrieves character alternatives for the iSyv th symbol in the boxed input. This function is invoked during the GetBoxResultsHRC API call.
GLYPHSYM GlyphysmAtSINFO(SINFO*sinfo, int iFrame, int cFrame)
Retrieves the glyphsym object that contain the glyph with the following specification: the index of the last frame of the glyph is iFrame; the number of frames in the glyph is cFrame. This function is invoked by the search engine during the search.
ENGINE functions:
int ProcessENGINE(ENGINE*engine, BOOL fEndOfInk)
Performs DPP and SBP searches. At first, check to see if any new information has been added to SINFO object. If so, invokes ProcessDPP to give DPP object time to do some processing. Otherwise, invokes ProcessSBP to give SBP object time to do some SBP search. ProcessENGINE is invoked during the ProcessHRC API call.
BOOL SetCoercionENGINE(ENGINE*engine, UINT uCoercion)
Sets the coercion level in the search engine. This function is invoked during the SetCoercionHRC API call.
BOOL SetMarcoENGINE(ENGINE*engine, HMACRO hmacro)
Sets the macro object with which the search process is done. A macro can be either a template, word list or a dictionary. This is propagated down to the DPP and SBP objects for use during the search process. This function is invoked during SetMacroHRC API call.
int CResultENGINE(ENGINE*engine)
Returns the number of results generated from the search. This number is less than or equal to the maximum number of results desired by the application. This is invoked during GetResultsHRC API call.
RESULT ResultAtENGINE(ENGINE*engine, int index)
Returns the ith result generated by the search engine. RESULT object is created and destroyed by the ENGINE object and the information is accessed through the member functions of RESULT class.
DPP functions:
int ProcessDPP(DPP*dpp)
Performs a single granularity of DPP search. This includes extending the existing path by one node and storing the best partial results. This function is invoked during ProcessENGINE call.
int CLayerDPP(DPP*dpp)
Returns the number of layers generated as the result of the DPP search. This is equal to the number of frames processed in the case of free input. In boxed input, this is equal to the number of boxes generated. This function is invoked in the SBP module.
int CFrameDPP(DPP*dpp)
Returns the number of frames processed. This function is invoked in the SBP module.
COST GetEstimateDPP(DPP*dpp, int iLayer, SYM sym)
Returns the best path cost estimation as the result of DPP search. iLayer is the index of the layer of DPP search. Sym is the ending symbol at the particular layer, for example, GetEstimateDPP(dpp, 3, (SYM)`a`) returns the best DPP estimate of the path that ends in the letter `a` after 4 frames (for free input). This function is invoked by the SBP module during the search.
SBP functions:
int ProcessSBP(SBP*sbp)
Processes one granularity of SBP search. This function is invoked during ProcessHRC API call.
int CResultSBP(SBP*sbp)
Returns the number of results generated by the SBP search currently invoked by the ENGINE module.
BOOL SetResultMaxSBP(SBP*sbp, int cMax)
Sets the maximum results desired by the SBP search. Invoked during ProcessHRC call when the application sets the desired number of results from the search.
Patent Citations
Non-Patent Citations
Referenced by
Legal Events
Original Image


text:
Hotel Atrium - Rimini
Viale Cormons 50 - Rimini1-877-662-6988
Close the beach and all of Rimini's nightlife, the Hotel Atrium offers inexpensive accommodation in Rimini a few minutes' walk away from the bustling Viale Amerigo Vespucci promenade, packed with clubs and bars. This 3-star Rimini hotel is situated near Rimini Railway Station, Romeo Neri Stadium, and is also within walking distance of the Rimini's historic center. If you are traveling by car, you can easily reach the A14 motorway, the Republic of San Marino, and Federico Fellini Airport. For a fee, the hotel also offers a roundtrip airport shuttle.
Open all year round, the Hotel Atrium is the ideal place for a laid-back, sun-drenched Rimini vacation where you can spend all day lounging by the poolside, alternating soaks in the outdoor spa tub with a drinks from the hotel bar. In the summer, the hotel also organises an open-air party in the countryside near Rimini and everybody is invited!
This Rimini holiday hotel has a restaurant serving an extensive range of Italian and international dishes as well as a starter and dessert buffet. If you are coming to Rimini on business, then you will find the free wireless and wired Internet access a great plus point along with the fully-equipped meeting facilities.
Chip and cleane. From Atrium i moved to Brown, because there were no rooms. Brown ...Venere Guest, Russia
These reviews have been left by customers who actually stayed at this hotel
Check Availability at Hotel Atrium
Hotel Facilities at Atrium
- Business Center
- Meeting Room
- Dogs allowed
- Laundry service
- Lift/elevator
- Room service - limited hour
- Garden
- Pets accepted
- Bar
- Pool bar
- Restaurant/Dining
- Baby sitter
- Luggage room
- Multilingual staff
- Front desk - safety deposit box
- City tour
- Front desk - 24 hour
- Outdoor swimming pool
- Children swimming pool
- Internet/Email services
- Hydromassage Jacuzzi
- Shuttle service
- Shuttle service from and/or to the airport
Know before you go
- Cash transactions at this property cannot exceed EUR 999.99, due to national regulations. For further details, please contact the property using information in the booking confirmation.
Check-in: after noon.
Check-out: before 10 AM.
PolicyExtra-person charges may apply and vary depending on hotel policy.
Government-issued photo identification and a credit card or cash deposit are required at check-in for incidental charges.
Special requests are subject to availability upon check-in and may incur additional charges. Special requests cannot be guaranteed.
City tax and/or any other fees charged by the hotel
The following fees and deposits are charged by the property at time of service, check-in, or check-out.
- Crib (infant bed) fee: EUR 15 per night
- Rollaway bed fee: EUR 25 per night
The above list may not be comprehensive. Fees and deposits may not include tax and are subject to change.
You'll be asked to pay the following charges at the hotel:
- A tax is imposed by the city: EUR 1.50 per person, per night. This tax does not apply to children under 14 years of age.
We have included all charges provided to us by the property. However, charges can vary, for example, based on length of stay or the room you book.
Atrium Hotel reviews
- September 2013
- Venere Guest
- Single traveller
- Russia
Chip and cleane. From Atrium i moved to Brown, because there were no rooms. Brown was good enough for my goals (language course), early breakfast, quaet,friendly, near a park. Thank u a lot!
- July 2012
- Venere Guest
- Not Specified
- Sweden
Horrible hotel, stay away! This was the first time I left a hotel right after I had checked in and seen the room. The room was very dirty, so much that I even felt like I got dirty myself simply by standing in it. I didn't want to open my suitcase for fear of something jumping into it. There was an old telephone covered with brown dirt. The floor had dirt stains. The desk and chairs were dirty, the nightstand was old and dirty and underneath it you could see dirt as if it was pouring out from under it. If you don't believe me I took pictures and will try to add them with this review. The bed looked like someone had slept in it. The sheets were wrinkled and there were hairs and dirt on them. The walls were lined with dirt. There was a horrible noise in the room: zmmmmmm zmmmmmmm zmmmmmmm. The elevator was shaky, small and generally scary. The receptionist was not particularly welcoming but okay, but when I went back down and said I wanted to cancel my reservation straight away she seemed baffled and slightly rude, asking me to show her the dirt, which I did, and she didn't even comment it, just said that she could see if there was another room available but she didn't know if there was. I asked "Won't it be the same standard?" to which she didn't reply. I don't think it's right that I had to pay for the first night, get a taxi and go searching for a new hotel and pay more than 3x the amount for the first night, but I would have paid more simply to get away from hotel hell. I'm still worried that some kind of pest worked its way into my bags. Luckily I found a much better hotel, otherwise I don't think I would have slept at all the first night in Rimini. It's better to sleep on the beach or a park bench than in "Hotel" Atrium. The place is simply a dump. The only good thing is the location, close to the beach, but so are many, many other hotels and they are not much more expensive either. I knew I was taking a chance with thi
- June 2012
- Venere Guest
- Couple
- Italy
Grat swimmingpool
- September 2009
- Venere Guest
- Single traveller
- Italy
I stay there for one week and the cleaning lady went to my room just once in the whole period. I stayed in the residence next to the hotel so the room, even if a bit neglected, was really big and complete.
- January 2014
- Venere Guest
- Group
- Italy
- August 2010
- Venere Guest
- Single traveller
- Latvia
- May 2009
- Venere Guest
- Family with young children
- Italy
Loading reviews in other languages...
- April 2014
- Venere Guest
- Not Specified
- Italy
- August 2009
- Venere Guest
- Group
- Germany
- July 2014
- Venere Guest
- Couple
- Italy
- April 2014
- Venere Guest
- Single traveller
- Italy
Atrium Hotel reviews by TripAdvisor
Room Details
Book your business-friendly accommodation at Atrium, offering 30 guest rooms with climate control. Rooms open onto balconies. Televisions in each room offer entertainment at the end of a long day. Business travelers visiting the Rimini area will have access to desks and safes. Bathrooms are outfitted with hair dryers. Additional comforts include air conditioning.
Accommodation Services
- Air conditioning
- Extra beds
- Hairdryer in each room
- Safe
- Desk
- Individually controlled air conditioning
- Terrace/Balcony
Distances from Hotel AtriumAnfiteatro Romano - 0.5 km / 0.3 mi
Piazza Marvelli - 0.7 km / 0.4 mi
Tempio Malatestiano - 0.9 km / 0.6 mi
The Surgeon's House - 0.9 km / 0.6 mi
Rimini City Museum - 0.9 km / 0.6 mi
Piazza Tre Martiri - 1 km / 0.6 mi
Antica Pescheria - 1 km / 0.6 mi
Bronze Statue of Paul V - 1.1 km / 0.7 mi
Federico Fellini Foundation - 1.1 km / 0.7 mi
Arch of Augustus - 1.1 km / 0.7 mi
Piazza Cavour - 1.1 km / 0.7 mi
Fontana della Pigna - 1.1 km / 0.7 mi
Rimini City Hall - 1.1 km / 0.7 mi
Rimini Marina - 1.1 km / 0.7 mi
Palazzo dell'Arengo e del Podesta - 1.2 km / 0.7 mi
The preferred airport for Atrium is Rimini (RMI-Federico Fellini Intl.) - 5.8 km / 3.6 mi.
Distances are calculated in a straight line from the property's location to the point of interest or airport and may not reflect actual travel distance.
Distances are displayed to the nearest 0.1 km and mile.
Transportation services Hotel Atrium
- Shuttle service
- Shuttle service from and/or to the airport
We have the accommodation you need, all over the world
- • La Quinta Inn & Suites Lakeland East - Lakeland, USA
- • Hotel San - Tivat, Montenegro
- • B&B La Locanda di Villa Toscana - Bibbona, Italy
- • Hotel Le Priori - Québec, Canada
- • B&B Orient Express - Sofia, Bulgaria
- • Il Tivano B&B - Zelbio, Italy
- • Alpinpark Hotel - Innsbruck, Austria
- • The Old Mill Hotel - Bath, United Kingdom
- • Woraburi Phuket Resort - Phuket, Thailand
- • Hotel Altpradl - Innsbruck, Austria
- • Art Hotel Binders - Innsbruck, Austria
- • Vacation Rental Lily Ann Beach - Sithonia, Greece
- • Résidence Maeva Inter-Résidences - Tignes, France
- • Central Hotel Forum - Sofia, Bulgaria
- • Hilton Garden Inn Konya Turkey - Konya, Turkey
- • Panormos Hotels, Greece
- • Domburg Hotels, Netherlands
- • Papingo Hotels, Greece
- • Paradissi Hotels, Greece
- • Rosny-sous-Bois Hotels, France
- • Patitiri Hotels, Greece
- • Helsinge Hotels, Denmark
- • Patras Hotels, Greece
- • Parikia Hotels, Greece
- • Rueil-Malmaison Hotels, France
- • Sale Marasino Hotels, Italy
- • La Spezia Hotels, Italy
- • Kathmandu Hotels, Nepal
- • Pefkari Hotels, Greece
- • Paxi Hotels, Greece


text:
West Virginia School of Osteopathic Medicine
|West Virginia School of Osteopathic Medicine
|Lorenzo Pence, D.O.
Academic staff
|Lewisburg, West Virginia,
United States
37°48′21″N 80°26′14″W / 37.8058°N 80.4373°WCoordinates: 37°48′21″N 80°26′14″W / 37.8058°N 80.4373°W
|West Virginia School of Osteopathic Medicine
The West Virginia School of Osteopathic Medicine, located in Lewisburg, West Virginia, United States, is a public free-standing and independent medical school. The mission of the school is to educate students from diverse backgrounds as lifelong learners and to prepare them for careers in osteopathic medicine with a focus on primary care and rural medicine although a significant percentage of graduates go on to practice in many of the medical specialties. It is one of three medical schools in West Virginia and the sole institution that grants the Doctor of Osteopathic Medicine (D.O.) degree. WVSOM has 778 students at present.[2]
According to U.S. News & World Report, medical students at the West Virginia School of Osteopathic Medicine graduate with more debt than any other medical school in the United States.[3] Of the top ten schools that graduate physicians with the most debt, WVSOM is the only public school.[3] In 2014, the U.S. News & World Report ranked WVSOM program third for graduates entering into primary care specialties and as the eleventh best rural medicine program.[4][5]
Purchasing a facility once used as Greenbrier Military School (1812–1972), the Greenbrier College of Osteopathic Medicine began as a private school with a class of 36 students in 1974. Two years later, in 1976, the West Virginia Higher Education Policy Commission brought the school under its umbrella, establishing it as a state-funded public institution now named the West Virginia School of Osteopathic Medicine. In 1978, WVSOM graduated its first class of 33 students.[2] Extensive renovations started in 1992 and continue into the present time, with construction just completed on a new 19,000-square-foot (1,800 m2) building that includes exam rooms and laboratory space. WVSOM has spent more than $38 million on construction and renovation projects while increasing from one building in 1974 to 12 campus facilities across its more than 50-acre (200,000 m2) campus, all of this was accomplished while maintaining a debt free financial status.[6][7]
WVSOM was founded on the principles of osteopathic medicine, a branch of medicine founded by frontiersman Andrew Taylor Still in the mid-to-late 19th century. The basic premise of osteopathic medicine is that a physician's primary role is to facilitate the body's inherent ability to heal itself. While originally designed as an improvement on the traditional medicine of 19th century America, osteopathic medicine became a reformation within the U.S. healthcare system while remaining distinct from other forms of medicine.[8] In addition to a medical education, students at WVSOM also learn holistic techniques and are trained in Osteopathic Manipulative Medicine (OMM), manual-based therapies used to relieve pain, restore range of motion and foster the body's own ability to heal itself.[8] Medical school at WVSOM is a four-year program, with two years of training located at the Lewisburg-based campus and the final two years taking place off-campus during clinical rotations.[2] WVSOM uses human subject robots as part of its training. The lifelike robots breathe, cry, defecate, bleed, and are anatomically correct, allowing students to practice nearly every aspect of patient care, including checking vital signs, inserting a chest tube and performing CPR.
WVSOM's current enrollment stands at 778 students, with out-of-state students composing the majority (557 out of state :221 in state). The median age is 27, and there are students from 46 states currently attending WVSOM. The male female ratio is roughly equal with 369 females and 409 males. WVSOM maintains a diverse ethnic community on campus, with 161 minority students. AACOMAS reports that 3,283 students applied for admission into WVSOM's most recent class (Class of 2013).[2]
- ^ "West Virginia School of Osteopathic Medicine". U.S.News & World Report. Retrieved 11 August 2012.
- ^ a b c d WVSOM at a Glance
- ^ a b Kelsey Sheehy (May 12, 2012). "10 Medical Schools That Lead to the Most Debt". US News & World Report. Retrieved May 24, 2012.
- ^ "Which schools turn out the most primary care residents?". US News & World Report. Retrieved 13 March 2014.
- ^ "Best Rural Medicine Programs". U.S. News & World Report. 2013. Retrieved 13 March 2014.
- ^ Christian Giggenbach (2008-01-03). "New WVSOM building on tap for '09". The Register-Herald. Retrieved 2008-04-20.
- ^ The Associated Press (2008-01-04). "Osteopathic school to build $9.3 million facility". Charleston Daily Mail. Retrieved 2008-04-20.
- ^ a b About Osteopathic Medicine
External links[edit]
- West Virginia School of Osteopathic Medicine
- American Osteopathic Association
- West Virginia Higher Education Policy Commission


text:
Package: libsinatra-ruby (1.0.a-1) [universe]
Links for libsinatra-ruby
Ubuntu Resources:
Download Source Package libsinatra-ruby:
Please consider filing a bug or asking a question via Launchpad before contacting the maintainer directly.
Original Maintainers (usually from Debian):
- Laurent Vallar
- Debian Ruby Extras Maintainers (Mail Archive)
It should generally not be necessary for users to contact the original maintainer.
External Resources:
- Homepage [www.sinatrarb.com]
Similar packages:
Ruby web-development dressed in a DSL (Ruby 1.8 package)
Sinatra is an open source web framework for Ruby programming language. It provides simple Domain Specific Language (DSL) for defining RESTful HTTP actions, and then defining how the application is going to respond to them.
This framework is lighweight and uses Rack which is a web server interface developed to run many Ruby frameworks using the same stack.
This is a dummy package depending on the library for the current default version of Ruby.
Other Packages Related to libsinatra-ruby
- dep: libsinatra-ruby1.8
- Ruby web-development dressed in a DSL
Download libsinatra-ruby
|Package Size
|Installed Size
|55.7 kB
|96.0 kB
|[list of files]


text: Tilletiopsis washingtonensis Nyland, anamorph (ATCC® 96156™) Product Format: frozen General Information Characteristics Culture Method History Documentation Print Email Share Share this product Facebook Twitter Google+ Permits and Restrictions View Permits Application biological control of powdery mildew, Sphaerotheca fuliginea Biosafety Level 1 Product Format frozen Type Strain no Preceptrol® no Medium ATCC® Medium 336: Potato dextrose agar (PDA) Growth Conditions Temperature: 15.0°C Name of Depositor EJ Urquhart Isolation mildewed cucumber leaves, Cucumis sativus, Langley, British Columbia, Canada References Punja ZK, et al. Growth and biological control activity of Tilletiopsis species against powdery mildew (Sphaerotheca fulginea) on greenhouse cucumber. Phytopathology 84: 341-351, 1994. Permits These permits may be required for shipping this product: Customers located in the state of Hawaii will need to contact the Hawaii Department of Agriculture to determine if an Import Permit is required. A copy of the permit or documentation that a permit is not required must be sent to ATCC in advance of shipment. Basic Documentation Product Sheet Certificate of Analysis SDS


text:
Comment: Re:i have an idea (Score 1) 246
by phildo420 (#20088781) Attached to: Microsoft To Try Works As Adware
Or, do like we did to AIM, and replace it with a superior product (Trillian).
Or rather, in this case, Open Office.
Or rather, in this case, Open Office.
Works is the most pointless software package imaginable...atleast, I hope Microsoft can't improve on the pointlessness of that package anyways.


text:
XRAY Ball Mount (2)
With your purchase, receive at no cost:
This is a set of replacement pivot ball mounts for the XRAY XB8TQ Luxury Buggy. Pivoting ball mounts for I.A.C. (Integrated Adjustable Caster) works in conjunction with eccentric front bushings to create various caster settings in front suspension using the same C-hub block. Set of 2. This is also an optional upgrade part for the XRAY XB8R buggy.
This product was added to our catalog on October 5, 2006.
Super Saver Shipping!
In Stock!
This item is eligible for Super Saver Shipping Learn More
This item earns up to 4 VIP Reward Points Learn More


text:
Recent Cayman Brac Reviews
A trip to remember
What can I say, sea fan meadows was amazing. Everything that the VRBO stated was correct. The moment we arrived at the airport, Derwin was there to greet us. We stayed at Sea Fan Meadows for 14 days, the house was so nice and comfortable. We sat out by the ocean every morning and evening. The fully equipped kitchen was amazing, we cooked most of our meals at the house, but did go out several times to try the local restaurants. Make sure you get a few meals from Barrys Golden Jerk, he is a very sweet man and what a cook, we bought a few trigger fish and Barry cooked them for us. Derwin took us on a fishing guided trip over to Little Cayman and that was amazing, he is a great guide and we made a great friend. We attended church on the Island and that was amazing meeting other believers. We snorkeled, kayaked, rode bikes all over the Island, fished right out in front of Sea Fan Meadows as well. The people on Cayman Brac are so friendly, if they waved and did not think you saw them, they would honk there horn to make sure. The groceries and gas were a bit pricey but Hey, well worth the trip. Cha Che was great with all the questions we had before we arrived on the Island. A must stay at Sea Fan Meadows. We will return for sure. Thanks Cha Che for the beautiful home.


text:
| Please
sign in
| New to BestPlaces? Sign up
About membership.
Real Estate
Compare Schools
Compare Cities
Compare Climates
Compare Crime Rates
Compare Cost Of Living
Best Places to Live
Search for any place in the USA:
State and City School Information
Bronx Health Sciences High School - Bronx, NY
Bronx Health Sciences High School - Bronx, NY
Data Source:
School Name
District Name
Bronx Health Sciences High School
750 Baychester Ave
Bronx, NY 10475
(718) 862-4406
Bronx (Bronx)
NYC Geog District #11 - Bronx
School Head Official
Miriam Rivas
Students Getting Free Lunch
I am fairly pleased with this program. My son has had to adjust to the strict environment but I think it has been good for him. There are other places where he could have landed that would not have supported his future. It is true that in the workforce our children will be required to be on time for work. They may have an early work schedule and the boss will require them to be there ON TIME. I appreciate the opportunities my son has to make choices based on his interests.
My child's GPA significantly dropped once she began attending 9th grade in this horrible school.
This school does not have any extracurricular activities for their students. It's all about work, and no play. They enforce their uniform policy, which is good. However, they still fail to create an atmosphere which is conducive to an educational environment. Gym begins way too early. Students need to get to gym for 0 period starting at 7:15.When I complained to the staff about this, I was told that they are preparing the students for adulthood/workforce. My opinion is that they are preparing the student to become high school or college dropouts, because they will experience burnout before the age of 21. Children still need a balance of work and play. This is sad, because my child isn't happy attending this school, so I will need to transfer her to another school this Fall.
really good school great atmosphere loving teachers and good social/ academic area.
I love this school. I agree with the strictness and the uniform policy. Teachers still need to be a bit more alert with the children when they go down to the gym and enforce the uniform code a bit more. Children are begining to wear whatever they want while some are trying to set new trends.
This school is very very strict. I started on september 9th and now its the 18th. There is alot of work and things to do that must be completed. The teachers have no sense of humor especially when it comes to working. Its a good school, their preparing us for college and stuff. Im a freshman and i know this will be hard 4 years. They arent joking about the uniform thing, if you dont wear it they send you home, and everyday you go home with homework and alot of notes. When you apply for this school make sure your ready to work and wear an ugly uniform. The kids are nice, theres no fighting, no disrespect, very well managed. The principal is extremely nice and so is the assisstant principal. If you want to get a good education in a public school apply for Bronx Health Sciences High School.
I've been a teacher at BHS for five years. The recent negative comment that claims that the school has no activities is false. Many of our students participate in sports as members of Truman High School's teams (we are housed inside the Truman campus). BHS also has a few clubs of its own (step, chess) and actively encourages students to form more to suit their own interests. As far as teacher encouragement, I know that many teachers (me for one) give up lunch periods and after-school time constantly to tutor students both within our own subjects and in anything else where we can be helpful. Although I am a history teacher, I have tutored students in living environment and math when I've been able to help. BHS is a rigorous college-prep school that requires students to wear uniforms. If that isn't your thing, then you would probably be happier going somewhere else. I. Stewart
School is absolutely horrible ; i guarantee any parent can find better.no sports activity's, no legit clubs , uniformed school , teachers and social worker aren't there for us , i am a former student of this school , and i tried to work hard and do my best, but the way you get pressured in this school, it's outstanding. Also you can get tagged for anything. they'll send u home and neglect you of your work over overall appearance issues. DON'T SEND YOUR KIDD HERE, this school need to be shut down
This is fatima and stephanie!!!! First graduated students from BHS! Rhat is an amazing school! I must agree , yes is a very challeging school but not hard and yes the staff stress you out but definetly only for the better! When applying for the school it specifly says its a college prepartory school! They are meant to prepare the students for college and the school does a great doing it.Helping the students find colleges was even the best part about it , because honestly I didnt think I would be here! Stephanie and I are in college now and it couldnt be easier ... All because of my school! BHS! Again thank you for everything! And for those students that are not prepare to do work and performed as a student dont waist your time and attend to the school because you are not ready to acheive!!!!!!!!!
Bronx Health Sciences high school, is in word challenging. when you send your child to this school they better be ready to do a ton of work but it pays off in the end and we always have help. yes the school is very small but its better that way beacuse kids get along better. and fore the teachers the are great and they all care about us and will do whatever they have to do to help us out. B.H.S ios a great school but its hard... but then again college isnt so easy.. so they are only preparing us for the real world... if you dont like it then dont come to this school, we have plenty of others that want to come.
as a student who goes to this high school i would say that theres nothing wrong with it. kids here learn what they need to learn and do what they have to do to move u in life.all i say is that forcing these kids to wear uniform is bad.since i go to this school i know how kids feel and they dont like the uniform.
I am presently a student of this school and I honestly think it is a great school. The teachers are very commited to making us better. Yes, we have to do research papers and community service but I don't think these should be categorized as burdens. I believe that all these are preparing us for the college challenge so we will be used to them when we get there.
i used to study here and quite honet with you i hated it!!! they pressure kids way to much. they give these insane projects that look like college term papers that are exagerated sometimes. and the worst part is that they do not wait for to finish them. they pile them all on you. also all the volunteer hours are totally insane. i just say if you have a better choice (which in this case any is better) dont come to this school it will only drive your child crazy and streesed out.
It is a horrible, poorly managed school. Parents do not send your child to this school!
well as a student i would say that bronx health science high school is a good school when it comes to being involved with students... the fact that its a small school is good cause everyone knows everyone... but although they may know each students seem to get along due to race or back ground which is sad.. bhs is a good school but over loads students with projects and students may feel pressured at times as well... but the familar environment that i feel when im in the school with my friend is great...
Most Recent Searches on Schools
School Cities
Bronx_Health_Sciences_High_School - Bronx, New_York
Liberty_Township_Fillmore_Cnty, Nebraska
Good_Luck_Township, North_Dakota
Glen_Carbon, Illinois
Mount_Pleasant, South_Carolina
Belle, Washington
Southwick, Massachusetts
Hershey, Pennsylvania
Jersey_City, New_Jersey
Eisenhower_Elementary_School - Enid, Oklahoma
Newtown_Township_(Bucks_County)_Pa,Newtown_Township_(Bucks_County), Pennsylvania
Erie_Mcnatt_Township, Missouri
Wallula, Washington
Carey, Wisconsin
Darbydale_Elementary_School - Grove_City, Ohio
Hillsboro, Iowa
Kedron_Elementary_School - Peachtree City, Georgia
Hilton_Head_Island_International_Baccalaureate_Elementary_School - Hilton_Head_Island, South_Carolina
Turner, Oregon
Global_Template_Child_0X0.Swf, Utah
About Our Data
About Sperling's
Become a Partner
Privacy Policy
Press Signup
2014 © Best Places to Live & Retire
Homes for Sale


text: Soulja Boy – Lean Like Tweet +1 IHHM Posted on September 20, 2010 Category: Audio, Free Music Downloads, Music (Legacy Category) New Soulja Boy titled "Lean", check it out. Download:Soulja Boy – Lean IHHM About: iHipHopMusic.com is brought to you by Glenton Samuels aka Chozen, CEO & Founder of Covanant LLC. Follow Me: Instagram / Twitter / Facebook / Google+ / Soulja Boy Related Content Soulja Boy – BANDS Soulja Boy – Swagg Like Me [Video] Nicki Minaj – Yasss Bish!! (feat. Soulja Boy) Soulja Boy – Make It Work (feat. Migos) Drake – We Made It (feat. Soulja Boy) Soulja Boy – Handsome Latest Chatter Kendrick went in on this freestyle. Very dope! www... brandonstylesmeeks | Read More Love this song... Bitch123 | Read More I love this song to bitchesU0001f62dU0001f62d... Bitch123 | Read More Me tooo... Bitch123 | Read More 0 comments   Get Livefyre FAQ Sign in + Follow Post comment Link Newest | Oldest


text:
Select Local Merchants
Ultimate Exposure Tanning CentersRead MoreInside Ultimate Exposure Tanning Centers' Chicagoland locations, a full lineup of UV- and spray-tanning equipment infuse skin with a healthy summer glow year-round. Individual sessions in the automated spray-tanning booths?such as VersaSpa?or UV beds gild bodysuits for nights on the town, and unlimited monthly packages fashion a continuous golden hue previously only available to sunbathing satellites. The salon stocks a variety of tan-accelerating lotions from Swedish Beauty, Australian Gold, and Designer Skin, which deepen bronze hues and moisturize skin to fashion a long-lasting radiance.1300 Winston Dr.Melrose Park, IL US
L.A. Tan & Lavie MassageRead MoreSince opening in the early 1990s with just four stores, L.A. Tan has expanded into a national brand that counts more than 180 locations in six states. Members can tan at any location they wish, selecting from services that range from at least five levels of high-end UV beds to spray-tan booths from top brands such as Mystic Tan and VersaSpa. Anyone unsure of how to navigate all the options can seek advice from one of L.A. Tan's certified tanning professionals, who know each tanning bed on a first-name basis. They also give consultations, build custom packages based on individual skin type, and offer take-home products that help tans last longer. Dependent on the location, spray tanning systems will vary; call desired location for further details.8323 W. Lawrence Ave.Norridge, IL US
PolishedRead MorePolished Nails and Tanning tidies up the digits and bronzes the bodies of men as well as women. A nail technician imbues phalanges with color and style, sterilizing the equipment with hospital-grade procedures between sessions, and a tanning professional imparts a sun-kissed hue without subjecting skin to UV rays. Staff members dedicate themselves to their continuing professional development, mastering current trends, tailoring treatments to each client, and always letting the customer win games of patty cake.1036 Lake StOak Park, IL US
OrtanicRead MoreAccording to the founders of Ortanic, it seemed there'd always been a few problems with spray tans. They smelled. They left streaks and orange tints. The results were inconsistent. To fix these common complaints, Ortanic's visionaries took matters into their own sun-dappled hands. After extensive research, they developed their own approach to spray tanning, concocting a proprietary formula to address streaks and incorporating an air-purification system to keep the extraction booths clear of particles. In January of 2009?just in time for Chicago's beach season?the first location opened. Since then, Ortanic has expanded into four locations across Chicago. Inside each, licensed skin consultants work closely with clients to select, blend, and apply custom blends to fit their skin tone. The resulting glow lasts five to seven days?just long enough for a trip to Alpha Centauri to try tanning under another sun for a change.1114 Lake St.Oak Park, IL US
Tanning Co.Read MoreThe Tanning Co.'s four types of tanning beds and array of hair services help clients add customized oomph to their appearances. Body-bronzing beginners may opt for a nap in the level I Montego Bay bed ($8/session) to achieve an admirable tan in 20 minutes, or approximately half the time it takes to dream that you forgot to study for your Biology of Puppies final exam. The Tropical Kiwi bed ($12/session) aims to turn bodies tawny in 15 minutes, while the Silver Bullet bed ($22/session) is a mammoth bed for extra comfort and creates a coppery finish in 12 minutes without metallic aftertaste. For individuals who would rather be perpendicular to the floor, the stand-up booth ($15/session) delivers new pigments in 11 minutes, eliminates lines and pressure points, and gilds hard to reach areas such as the underarms, sides, and inner eardrums. After each session, tanning beds are sanitized with an FDA-approved cleaning solution.6936 W Windsor AveBerwyn, IL US
Exotic RayzRead MoreThe crew at Exotic Rayz bronzes bodies year-round with a slew of vertical, prone, and spray tanning beds. VersaSpa spray tanning equipment produces sunless rays that kiss the skin with golden hues, and technicians can customize an airbrush spray tan to each individual. Exotic Rayz also specializes in Fit slimming body wraps, cosmetics, and tanning products and accessories such as JWoww bronzer and Body Butter tanning oil.1440 W Irving Park Rd.Bensenville, IL US


text:
Arizona Wildcats
Cat Tracks: Denker's big night leads to seventh straight non-conference win for UA
The Arizona Wildcats won their third straight non-conference game to start 2013 by a wide margin Saturday, beating up on UTSA by a final of 38-13.
The margin of victory was not all that surprising, however, who shined in the blowout was noteworthy to say the least.
Coming into Saturday night's contest, quarterback B.J. Denker was 17-of-34 for 168 yards and a touchdown on the season. Against the Roadrunners, the UA senior nearly duplicated those totals. Denker threw a 13-yard touchdown pass to freshman wideout Samajie Grant and ran for another 35-yard score in the first quarter, and from there the rout was on.
On the night, Denker was 14-of-21 for 158 yards to go along with three total touchdowns.
The Good:
Ka'Deem Carey rushed for over 100 yards and had two touchdowns in the 25-point victory. Carey now has 22 rushing touchdowns in his last 11 games.
In all, the Wildcats rushed for 264 yards.
Grant's touchdown catch in the first quarter was the first of his collegiate career.
Three of Drew Riggleman's four punts were downed inside the UTSA 20-yard line.
The Bad:
Despite Denker's big game and a dominate night on the ground, UTSA nearly outgained UA (422 yards to 379 yards).
UTSA's David Glasco II only ran the ball 10 times, but he had 70 yards rushing and a touchdown.
With the win, Arizona moved to 7-0 in non-conference play under Rich Rodriguez.
Coming Up Next:
The Wildcats (3-0) will have a week off before going up to Seattle to open up Pac-12 play against the Washington Huskies (2-0) on Sept. 28. Last season, UA took down Steve Sarkisian's squad 52-17. Game time has yet to be determined.
Most Popular
Wildcats Audio
- Bearing Down with Adam and Jarrett - May 6, 2015Adam and Jarrett talk about zero Wildcats being drafted by an NFL team.
- Bearing Down with Adam and Jarrett - April 24, 2015Adam and Jarrett talk about what Arizona basketball has lost and what it moves forward with.
- Glenn Parker, Pac-12 Networks football analystGlenn talks about the upcoming Pac-12 spring football games and shares his thought on the NFL draft.
- Rich Rodriguez, Head Coach UA FootballWhat is Coach Rodriguez doing to get his team ready for the upcoming football season?
- Doug Haller- ASU beat writer for azcentral sportsDoug Haller previews the college basketball national championship game.


text:
Re: Travel Systems...
posted at 6/18/2010 1:23 PM EDTThanks, Brighton!
Re: Travel Systems...
posted at 6/18/2010 3:45 PM EDT
Yep -- the main seat can face front or back, and reclines. But you do have to snap it out, it doesn't rotate like the Orbit, and possibly some others ... I didn't look too heavily at that feature.
It also comes with a bassinet, and you can buy adaptors to make it work as a snap & go with either the Graco, Chicco, or Peg Perego car seats (separate adaptors for each, in case you were wondering). BRU carries the adaptors, but is usually out of stock, based on my experience.
Re: Travel Systems...
posted at 6/18/2010 3:47 PM EDT
Brighton, I asked people on the street if they liked their stroller BEFORE I WAS PREGNANT. My "sister" was always pregnant and having the hardest time choosing a stroller. Honestly, she was driving me nuts!
I will say, though, haven't had a SINGLE person ever say, no, I hate it. So it's kind of pointless.


text:
J The S Song and Mixtape Downloads
Song: Sweet Sinning
J The S has made himself scarce on our pages since this April, when he wrapped up promotion on his Booth-sponsored The Last Days LP with the release of video single Higher Ground. What's the... More
Posted 2 years ago
Song: Higher Ground
J The S is on the rise, and it doesn't look like he's going to plateau anytime soon. On the latest single off his DJBooth-sponsored debut set, released along with its Joe Politics-directed... More
Posted 3 years ago
Editor's Pick
Boston rhymesayer J The S has come together with The DJBooth to bring listeners his long-awaited debut studio album, The Last Days. Executive Produced by J The S and Good Will, the project features 14 original records from... More
Posted 3 years ago
Editor's Pick
Featuring: Pill
Song: Simple Man
As anyone who plays the guitar, or even plays Guitar Hero, already knows, Lynard Skynard's Simple Man is simply one of the better rock songs ever written. While the original's roots lay in... More
Posted 3 years ago
Featuring: REKS
Song: For The Taking
For the first leak from his NewEnglandHipHop.com presented and DJ Motion hosted mixtape, The Jake The Snake Conspiracy, J The S gets loose over a bouncy DB Koopa beat on For The Taking, featuring... More
Posted 3 years ago
Song: Was It Worth It
When one's pathway to success is strewn with heartache, lies and even a couple bodies, it's only natural to look back and wonder, "Was It Worth It?." J The S'... More
Posted 3 years ago
Song: The Day The Music Died
While hip-hop is certainly alive and kicking, it's undeniable that the genre's gone through changes over the years. On unreleased cut The Day the Music Died, J the S laments the corporate,... More
Posted 3 years ago
Featuring: Mistah F.A.B
Song: Live By The Game
Those who Live by the Game may die by the game, but that's a risk J The S is willing to take—as he puts it on the latest leak off his debut studio album, "that sh*t's in my... More
Posted 3 years ago
Featuring: Emilio Rojas
The opening air horns from J The S's Last Tickets for the Bandwagon ring out like a klaxon, a warning sign for many. Jake The Snake doesn't necessarily carve out a new sound on the duo cut with... More
Posted 4 years ago
Boston representative and longtime Booth favorite J The S has hooked up with DJBooth.net, 2DopeBoyz.com and IM King Clothing to present his latest project, the long-awaited Wish You Were Here. The free street album features... More
Posted 5 years ago
Sample Text - Sample Link


text:
by Esther Yu-Hsi Lee Posted on May 15, 2015
Army veteran Jorge Salcedo's daughter now "sits by the window, waiting for her dad, asking if daddy will come home."
by Sam P.K. Collins Posted on February 13, 2015
Congress just passed a bill aimed at preventing suicides among returning service members.
by Sam P.K. Collins Posted on February 4, 2015
In states that have legalized medical marijuana, doctors may soon be able to prescribe it to military veterans suffering from PTSD.
by Kira Lerner Posted on January 8, 2015
The city met its goal of housing the 193 homeless veterans identified earlier this year.
by Alan Pyke Posted on December 30, 2014
Military families are supposed to be free from the worst abuses of the lending industry, but a new report shows that loopholes in the law are letting veterans down -- and illustrates how to fix those failures.
by Sam P.K. Collins Posted on December 16, 2014
Congress is now working on a piece of legislation that would restore their benefits.
by Kira Lerner Posted on December 12, 2014
"We were soldiers but I'm not a soldier no more," one homeless veteran said. "I barely feel like a person sometimes."
by Alan Pyke Posted on September 26, 2014
Military families are ostensibly protected from lending scams by the Military Lending Act of 2006, but loopholes have left them vulnerable for years.
by Sam P.K. Collins Posted on September 16, 2014
The world's malnourished population is declining, but too many people are still going hungry.
by Bryce Covert Posted on August 28, 2014
With a concerted government effort to end homelessness among veterans, it's down 33 percent.


text:
Fermi Peers Deep Into A Microquasar
December 1, 2009
In Cygnus X-3, an accretion disk surrounding a black hole or neutron star orbits close to a hot, massive star. Gamma rays (purple, in this illustration) likely arise when fast-moving electrons above and below the disk collide with the star's ultraviolet light. Fermi sees more of this emission when the disk is on the far side of its orbit. Credit: NASA's Goddard Space Flight Center
Topics: Semidetached binaries, Astrophysics, Star types, Fermi Gamma-ray Space Telescope, X-ray binary, Enrico Fermi, Quasar, Accretion disc, Electron, Black hole, Neutron star, Radio astronomy, Human Interest, Fermi