Patents by Inventor Brian Beckman
Brian Beckman has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20120322458Abstract: Positional information is provided while minimizing the possibility that personally identifiable information can be derived therefrom. Positional information is received in the form of trails that can be aggregated. Individual cells of a grid reflect a quantity of aggregated trails through those cells, an average intensity and direction of movement through those cells, or a more detailed distribution thereof. Alternatively, individual trails are aggregated to an aggregated trail in the form of a line. Further obfuscation of personally identifiable information occurs by resampling aggregated positional information, by introducing false positional information, or by falsely modifying existing positional information, in a manner that does not impact the overall aggregations, and by pruning, or deleting, positional information, especially around sensitive locations, such as a user's home, place of business, or other location that users typically would seek to keep private.Type: ApplicationFiled: June 17, 2011Publication date: December 20, 2012Applicant: MICROSOFT CORPORATIONInventors: Gil Shklarski, Brian Beckman, Eyal Ofek, Kenn Daniel Cartier, Shai Herzog, Gur Kimchi, Bernard Lawrence Johnston
-
Publication number: 20120323984Abstract: Language-integrated query (LINQ) operators can be extended to a set of vectors associated with a digital signal processing (DSP) environment. A language-integrated query (LINQ) operator can be created to execute a change of basis for a set of vectors. LINQ operators can be further be utilized with specifically generated parameters to perform a change of basis for the set of vectors. Additionally, the standard LINQ operators can be extended to enable querying with LINQ against the set of vectors.Type: ApplicationFiled: June 16, 2011Publication date: December 20, 2012Applicant: MICROSOFT CORPORATIONInventors: Brian Beckman, Henricus Johannes Maria Meijer, Bernard Johnston
-
Publication number: 20120315992Abstract: Architecture that motivates and utilizes users as the means for capturing geographical data of a desired location. The architecture incentivizes users (e.g., large numbers of mobile-phone and mobile-computer users) to provide the data in the form of geolocation information trails and images captured by user devices. Thus, users take multiple pictures, for example, and can validate existing coverage of specific points of interest based on variable needs of the requestor. One motivational technique is by using augmented reality (AR) games, which include shooting targets associated with the point of interest (e.g., a street). Thus, the game can be designed for the data accumulation, which includes visual data. Additionally, the architecture can determine the areas or points of interest for validation and/or additional coverage by comparing live video data to an image database to decide of the need for update.Type: ApplicationFiled: June 10, 2011Publication date: December 13, 2012Applicant: MICROSOFT CORPORATIONInventors: Elad Gerson, Eyal Ofek, Limor Lahiani, Brian Beckman, Ido Omer
-
Publication number: 20120239584Abstract: Turn-by-turn directions can guide a user to a dynamic destination, such as a person or a rendezvous location. The turn-by-turn directions enable one user to follow another or, alternatively, multiple people to rendezvous with each other. The selection can be via identifiers used in network contexts, such as social networking Individuals can select the circumstances under which their location can be revealed. Turn-by-turn directions enabling following utilize anticipated locations or predictions of likely destinations based on historical and contextual information. Turn-by-turn directions enabling rendezvous reference a rendezvous location, which is either the same for all users, or which differs among them. Also, the directions can reference intermediate, “staging”, locations from which further intermediate, or ultimate, destinations can be routed to.Type: ApplicationFiled: March 20, 2011Publication date: September 20, 2012Applicant: MICROSOFT CORPORATIONInventors: Eran Yariv, Gur Kimchi, Barney Darryl Pell, Yair E. Gheva, Brian Beckman, Elad Ben-Israel
-
Publication number: 20110173621Abstract: A library of operators is provided for performing operations on push-based streams. The library may be implemented in a computing device. The library may be stored on a tangible machine-readable medium and may include instructions to be executed by one or more processors of a computing device. The library of operators may include groups of operators for performing various types of operations regarding push-based streams. The groups of operators may include, but not be limited to, standard sequence operators, other sequence operators, time operators, push-based operators, asynchronous operators, exception operators, functional operators, context operators, and event-specific operators.Type: ApplicationFiled: January 13, 2010Publication date: July 14, 2011Applicant: MICROSOFT CORPORATIONInventors: Henricus Johannes Maria Meijer, John Wesley Dyer, Jeffrey van Gogh, Danny van Velzen, Brian Beckman, Mark Shields
-
Publication number: 20110173620Abstract: A system and method for controlling the execution of notifications in a computer system with multiple notification contexts. A RunOn operator enables context hopping between notification contexts. Push-based stream operators optionally perform error checking to determine if notifications combined into a push-based stream share a common notification context. Context boxes group together notification creators and associate their notifications with a common scheduler and notification context. Operators employ a composition architecture, in which they receive one or more push-based streams and produce a transformed push-based stream that may be further operated upon. Components may be used in combinations to implement various policies, including a strict policy in which all notifications are scheduled in a common execution context, a permissive policy that provides programming flexibility, and a hybrid policy that combines flexibility with error checking.Type: ApplicationFiled: January 8, 2010Publication date: July 14, 2011Applicant: Microsoft CorporationInventors: John Dyer, Henricus Johannes Maria Meijer, Mark Shields, Jeffrey van Gogh, Danny van Velzen, Brian Beckman, Harish Kantamneni
-
Publication number: 20090249489Abstract: Secure distributed Web applications are produced by default upon construction. Mechanisms are provided to address distributed application vulnerabilities (e.g., cross-site scripting, cross-site request forgery, replay attacks . . . automatically. These mechanisms are provided in conjunction with a tier-splitting component that breaks up an application for execution across multiple contexts or tiers. As a result, any application that is tier split is protected from security vulnerabilities by default without any intervention on the part of a developer.Type: ApplicationFiled: March 31, 2008Publication date: October 1, 2009Applicant: MICROSOFT CORPORATIONInventors: Benjamin Livshits, Henricus Johannes Maria Meijer, Brian Beckman, Jeffrey Van Gogh, Danny Van Velzen, Dragos A. Manolescu, Bryan Sullivan
-
Publication number: 20090228904Abstract: Asynchronous methods and calls are produced automatically as a function of a declarative indication of intent. A method annotated with an asynchronous attribute or method call including a special asynchronous function can be identified. Subsequently, an asynchronous version of an identified synchronous method or call is generated automatically. Assistance is also provided for specifying intent.Type: ApplicationFiled: March 4, 2008Publication date: September 10, 2009Applicant: MICROSOFT CORPORATIONInventors: Henricus Johannes Maria Meijer, John Wesley Dyer, Jeffrey Van Gogh, Danny Van Velzen, Harish Kantamneni, Dragos A. Manolescu, Brian Beckman, Benjamin Livshits
-
Patent number: 7574701Abstract: A special syntax is developed to differentiate between accesses to a primary and one or more secondary object protocols in a programming language. The syntax allows the compiler to differentiate between the primary and secondary object model based on syntax, rather than type. The syntax is created in such a way as to approximate the syntax of the secondary object model, and allows the user to dynamically generate member names.Type: GrantFiled: August 21, 2006Date of Patent: August 11, 2009Assignee: Microsoft CorporationInventors: Anders Hejlsberg, Henricus Johannes Maria Meijer, David Schach, Avner Aharoni, Brian Beckman, Andrew Kimball
-
Publication number: 20090199159Abstract: Various technologies and techniques are disclosed for enabling code to be executed on one or more execution contexts based upon declarative annotations contained in the code or other locations. An annotation associated with a region of code is located. The annotation specifies information about an execution context where the region of code should be executed. A caller proxy is generated that is responsible for calling a callee adapter to execute the region of code. The callee adapter is generated that is responsible for receiving a call from the caller proxy and for dispatching a call to the region of code at the execution context. At runtime, the caller proxy receives a request to call the region of code and sends an execution request to the callee adapter. The callee adapter receives the execution request and dispatches a call to an executable version of the region of code.Type: ApplicationFiled: January 31, 2008Publication date: August 6, 2009Applicant: Microsoft CorporationInventors: Henricus Johannes Maria Meijer, Brian Beckman, John Wesley Dyer, Jeffrey van Gogh, Benjamin Livshits, Dragos A. Manolescu, Danny van Velzen, Harish V. Kantamneni
-
Patent number: 7503033Abstract: A methodology of reducing process algebra to a language that facilitates modeling a business workflow process is provided. A process algebra is reduced to a model for business workflow processes. The model is then reduced to a scheduling programming language to allow users to create models of business process by selecting between features of the model and conventional modeling features. The scheduling programming language can be represented as a graphical user interface program that is convertible to a schedule language written in a programmable language. The present invention provides for explicitly representing parallelism within the business workflow process by separating interdependent transactions from independent transactions. The isolation of certain transactions are relaxed, such that users can define transactional boundaries in order to increase granularity of the transaction at an action level and provide visibility of transactions at intermediate steps.Type: GrantFiled: February 18, 2005Date of Patent: March 10, 2009Assignee: Microsoft CorporationInventors: Lucius G. Meredith, Amit Mital, Marc Levy, Brian Beckman, Anthony Andrews
-
Patent number: 7467371Abstract: A methodology of employing a binding for interfacing a business workflow process executable program to a real world implementation. The binding can be reduced to a programming language. A preferable programming language is XML (Extensible Markup Language). Separation of the business workflow processes and the binding allow for the same business workflow process to be implemented across a variety of different technologies. The binding maps ports and messages to corresponding units of codes and invocations of a particular technology being utilized for the modeling of the business workflow process. The binding provides a user with the ability to structure schedule messages, define the relationship of schedule ports to units of code, define the relationship of schedule actions to invocations, control the flow of data between messages, provide details of schedule conditionals and specify the interaction of the schedule with specific technology behaviors.Type: GrantFiled: April 28, 2000Date of Patent: December 16, 2008Assignee: Microsoft CorporationInventors: Lucius Gregory Meredith, Marc Levy, Brian Beckman, Anthony Andrews, Bimal Mehta, Mitra Kanchan
-
Patent number: 7409671Abstract: A methodology of reducing process algebra to a language that facilitates modeling a business workflow process is provided. A process algebra is reduced to a model for business workflow processes. The model is then reduced to a scheduling programming language to allow users to create models of business process by selecting between features of the model and conventional modeling features. The scheduling programming language can be represented as a graphical user interface program that is convertible to a schedule language written in a programmable language. The present invention provides for explicitly representing parallelism within the business workflow process by separating interdependent transactions from independent transactions. The isolation of certain transactions are relaxed, such that users can define transactional boundaries in order to increase granularity of the transaction at an action level and provide visibility of transactions at intermediate steps.Type: GrantFiled: April 28, 2000Date of Patent: August 5, 2008Assignee: Microsoft CorporationInventors: Lucius Gregory Meredith, Amit Mital, Marc Levy, Brian Beckman, Anthony Andrews
-
Publication number: 20080046456Abstract: A special syntax is developed to differentiate between accesses to a primary and one or more secondary object protocols in a programming language. The syntax allows the compiler to differentiate between the primary and secondary object model based on syntax, rather than type. The syntax is created in such a way as to approximate the syntax of the secondary object model, and allows the user to dynamically generate member names.Type: ApplicationFiled: August 21, 2006Publication date: February 21, 2008Applicant: Microsoft CorporationInventors: Anders Hejlsberg, Henricus Johannes Maria Meijer, David Schach, Avner Aharoni, Brian Beckman, Andrew Kimball
-
Publication number: 20070094647Abstract: A computer-implemented system for accessing data stored in a computer-readable format comprises a data source indicator that identifies least one datum of a data source to be typed. The system also includes a type definition component that defines a strongly typed view of the at least one datum. Methods of using the system are also provided.Type: ApplicationFiled: August 29, 2005Publication date: April 26, 2007Applicant: Microsoft CorporationInventors: Henricus Meijer, Amanda Silver, Paul Vick, Brian Beckman
-
Publication number: 20070074185Abstract: Systems and methods that enhance a programming language with late binding via employing expressions of the form “Expression” in syntactic positions—wherein previously only compile-time constants were allowed. In a related aspect, the subject innovation can parameterize over a member name, via examining the grammar of the language (and all the available helpers) and replace identifiers or constants with an expression(s).Type: ApplicationFiled: August 30, 2005Publication date: March 29, 2007Applicant: Microsoft CorporationInventors: Henricus Meijer, Peter Drayton, Brian Beckman, Paul Vick, Amanda Silver, David Schach, Avner Aharoni
-
Publication number: 20070055978Abstract: Systems and methods that enhance and balance a late binding and an early binding in a programming language, via supplying an option component to opt-in (or opt-out) late binding, and wherein a late binding is triggered based on a static type for the variable (e.g., object or a type/string.) Additionally, the variable is enabled to have different static types at different regions (e.g., a program fragment) of the programming language.Type: ApplicationFiled: September 6, 2005Publication date: March 8, 2007Applicant: Microsoft CorporationInventors: Henricus Meijer, Brian Beckman, David Schach, Amanda Silver, Paul Vick, Peter Drayton, Avner Aharoni, Ralf Lammel
-
Publication number: 20070055962Abstract: A computer-implemented system for representing data comprises a position indicator that indicates a position of a datum within a group, a name indicator that optionally names the datum, and a value of the datum. A type to be assigned to the datum is derived from at least one of a name of the datum and the position of the datum within the group. Methods of using the system are also provided.Type: ApplicationFiled: September 2, 2005Publication date: March 8, 2007Applicant: Microsoft CorporationInventors: Henricus Meijer, Brian Beckman, Paul Vick, Amanda Silver
-
Publication number: 20070050168Abstract: A system for extending data types in software comprises an extension unit that modifies an arbitrary preexisting base data type, the preexisting base data type having at least one member. The system also includes a supplemental member that is included with the extension unit and that provides additional functionality to the preexisting base type. Methods for using the system are also provided.Type: ApplicationFiled: August 29, 2005Publication date: March 1, 2007Applicant: Microsoft CorporationInventors: Henricus Meijer, Paul Vick, Brian Beckman, Amanda Silver
-
Publication number: 20070050754Abstract: Systems and methods that enhance expressibility in a programming language (e.g., Visual Basic) via relaxation of artificial restrictions and extension of delegates associated therewith, without changing the runtime infrastructure. A stub is employed that can replace an impermissible expression in the programming language, to leverage the existing permissible expressions.Type: ApplicationFiled: August 30, 2005Publication date: March 1, 2007Applicant: Microsoft CorporationInventors: Henricus Meijer, Brian Beckman, Peter Drayton, David Schach, Ralf Lammel, Avner Aharoni