Patent application number | Description | Published |
20080320502 | Providing Information about Software Components - Aspects of the subject matter described herein relate to providing information about software components. In aspects, an interface is provided via which processes may request component information. The interface is publicly exposed and is callable by both local and remote procedures. In response to a request received at the interface, static information regarding one or more components is retrieved and combined with discovered dynamic information regarding the one or more components. This information is then transformed into a form suitable for sending via the interface. | 12-25-2008 |
20100094991 | Automated Role Based Usage Determination for Software System - A usage data collection and evaluation mechanism may collect usage information from various sources and summarize the usage information to determine a role for a system. The role and usage information may be transmitted to a centralized server for aggregation and analysis. The collection and transmission of usage data may be governed by and conform to a privacy agreement and may be collected when an end user agrees to such collection. Role determination may be performed using data collected from a single device, multiple devices, or from a network monitoring system. The usage data collection and evaluation mechanism may determine an installed role base and any changes in the installed role base since a previous report. | 04-15-2010 |
20100235471 | ASSOCIATING TELEMETRY DATA FROM A GROUP OF ENTITIES - Embodiments of the invention provide an ability to associate telemetry data received from different entities, such as guest and/or host machines residing on one or more particular physical computers (e.g., server computers) executing virtualization software. In some embodiments, telemetry data supplied by each entity includes information that identifies, and preserves the anonymity of, the entity (e.g., the computer(s) on which the guest and/or host machine(s) reside(s)). For example, if the entities comprise guest and/or host machines residing on a single computer, the information may comprise a one-way hash of the fully qualified domain name (FQDN) of the computer. If the entities are guest and/or host machines residing on a group of computers, the information may comprise a one-way hash of a portion of an FQDN for each computer which is common to all computers in the group. If the group of computers belong to a network domain having a globally unique identifier (GUID) (e.g., as employed by Microsoft Active Directory), the information may comprise a one-way hash of a portion of the GUID. | 09-16-2010 |
Patent application number | Description | Published |
20110173015 | DETERMINING ROAD TRAFFIC CONDITIONS USING DATA FROM MULTIPLE DATA SOURCES - Techniques are described for assessing road traffic conditions in various ways based on obtained traffic-related data, such as data samples from vehicles and other mobile data sources traveling on the roads and/or from one or more other sources (such as physical sensors near to or embedded in the roads). The road traffic conditions assessment based on obtained data samples may include various filtering and/or conditioning of the data samples, and various inferences and probabilistic determinations of traffic-related characteristics of interest from the data samples. In some situations, the inferences include repeatedly determining current traffic flow characteristics and/or predicted future traffic flow characteristics for road segments of interest during time periods of interest, such as to determine average traffic speed, traffic volume and/or occupancy, and include weighting various data samples in various ways (e.g., based on a latency of the data samples and/or a source of the data samples). | 07-14-2011 |
20120150425 | DETERMINING ROAD TRAFFIC CONDITIONS USING MULTIPLE DATA SAMPLES - Techniques are described for assessing road traffic conditions in various ways based on obtained traffic-related data, such as data samples from vehicles and other mobile data sources traveling on the roads and/or from one or more other sources (such as physical sensors near to or embedded in the roads). The road traffic conditions assessment based on obtained data samples may include various filtering and/or conditioning of the data samples, and various inferences and probabilistic determinations of traffic-related characteristics of interest from the data samples. In some situations, the inferences include repeatedly determining current traffic flow characteristics and/or predicted future traffic flow characteristics for road segments of interest during time periods of interest, such as to determine average traffic speed, traffic volume and/or occupancy, and include weighting various data samples in various ways (e.g., based on a latency of the data samples and/or a source of the data samples). | 06-14-2012 |
20130046456 | ASSESSING INTER-MODAL PASSENGER TRAVEL OPTIONS - Techniques are described for using information regarding road traffic and other types of transportation-related information to determine and/or assess alternative inter-modal passenger travel options in a geographic area that supports multiple modes of transportation. For example, a particular user may have multiple alternatives for travel from a starting location to a destination location in the geographic area, including to use alternative modes of transportation (e.g., private vehicle, bus, train, walking, etc.) for some or all of the travel, and these alternatives may have different travel-related characteristics in different situations (e.g., depending on current road traffic; mass transit schedules and current actual deviations; travel-related fees for gas, parking, mass transit, etc; parking availability; etc.). Multiple alternative travel options are thus assessed for a given situation based on multiple types of information, enabling one or more preferred travel options for the given situation to be identified and used. | 02-21-2013 |
20130226443 | FUEL CONSUMPTION CALCULATIONS AND WARNINGS - One or more techniques and/or systems are provided for determining whether a vehicle comprises a sufficient amount of fuel to reach a destination. Making such a determination may comprise, among other things, estimating an amount of fuel required to reach the destination and/or estimating a rate of consumption along a travel route. Such estimates may be based upon factors external to the vehicle, including, among other things, topology of the travel route, current and/or predicted traffic patterns along the travel route, and/or driving habits of a user or others whom have navigated a similar route (or at least a portion of the route). When it is determined that the vehicle comprises an insufficient amount of fuel, a refueling notice indicative of the determination may be provided. In one embodiment, such a refueling may also suggest possible refueling stations along the travel route. | 08-29-2013 |
20130226915 | ORGANIZATION OF SEARCH RESULTS BASED UPON AVAILABILITY OF RESPECTIVE PROVIDERS COMPRISED THEREIN - One or more techniques and/or systems are provided for providing search results for presentation as a function of the availability of respective providers comprised in the search results. For example, a user may perform a search for local groceries stores and stores within a 5 miles geographic radius of the user may be identified and filtered/distinguished as a function of the availability of respective stores. Such availability may be a function of whether respective stores are open or closed at the time of the search, whether respective stores are expected to be open or closed at an estimated time of arrival (e.g., based upon travel time from the user's location at the time of the search to respective stores), and/or parking considerations (e.g., parking availability, type of parking, and/or parking cost) at respective stores. | 08-29-2013 |
20130265174 | PARKING RESOURCE MANAGEMENT - Among other things, one or more techniques and/or systems for parking based route navigation and/or parking resource management are disclosed to facilitate navigation to parking spots associated with a destination and/or management of respective parking spots. Navigation may be provided to a parking spot based upon parking criteria (e.g., such as distance to a destination and/or costs associated with the parking spot). Additionally, navigation (e.g., instructions, alternate transport, such as public transit) from the parking spot to the destination may be provided. Parking spots may be reserved by a parking management system based upon reservations received through a parking based route navigation system. Travelers may be re-routed based upon parking factors (e.g., traffic around a parking location, parking density, etc.). Accordingly, travelers may be routed to a destination in a more efficient manner and/or a management system may price and/or allocate parking spots in a desired manner. | 10-10-2013 |
20130268187 | PARKING BASED ROUTE NAVIGATION - Among other things, one or more techniques and/or systems for parking based route navigation and/or parking resource management are disclosed to facilitate navigation to parking spots associated with a destination and/or management of respective parking spots. Navigation may be provided to a parking spot based upon parking criteria (e.g., such as distance to a destination and/or costs associated with the parking spot). Additionally, navigation (e.g., instructions, alternate transport, such as public transit) from the parking spot to the destination may be provided. Parking spots may be reserved by a parking management system based upon reservations received through a parking based route navigation system. Travelers may be re-routed based upon parking factors (e.g., traffic around a parking location, parking density, etc.). Accordingly, travelers may be routed to a destination in a more efficient manner and/or a management system may price and/or allocate parking spots in a desired manner. | 10-10-2013 |
20130289862 | DETECTING ANOMALOUS ROAD TRAFFIC CONDITIONS - Techniques are described for assessing road traffic conditions in various ways based on obtained traffic-related data, such as data samples from vehicles and other mobile data sources traveling on the roads and/or from one or more other sources (such as physical sensors near to or embedded in the roads). The road traffic conditions assessment based on obtained data samples may include various filtering and/or conditioning of the data samples, and various inferences and probabilistic determinations of traffic-related characteristics of interest from the data samples. In some situations, the inferences include repeatedly determining current traffic flow characteristics and/or predicted future traffic flow characteristics for road segments of interest during time periods of interest, such as to determine average traffic speed, traffic volume and/or occupancy, and include weighting various data samples in various ways (e.g., based on a latency of the data samples and/or a source of the data samples). | 10-31-2013 |
20140149028 | ASSESSING ROAD TRAFFIC SPEED USING DATA FROM MULTIPLE DATA SOURCES - Techniques are described for assessing road traffic conditions in various ways based on obtained traffic-related data, such as data samples from vehicles and other mobile data sources traveling on the roads and/or from one or more other sources (such as physical sensors near to or embedded in the roads). The road traffic conditions assessment based on obtained data samples may include various filtering and/or conditioning of the data samples, and various inferences and probabilistic determinations of traffic-related characteristics of interest from the data samples. In some situations, the inferences include repeatedly determining current traffic flow characteristics and/or predicted future traffic flow characteristics for road segments of interest during time periods of interest, such as to determine average traffic speed, traffic volume and/or occupancy, and include weighting various data samples in various ways (e.g., based on a latency of the data samples and/or a source of the data samples). | 05-29-2014 |
20140149030 | Detecting Unrepresentative Road Traffic Condition Data - Techniques are described for assessing road traffic conditions in various ways based on obtained traffic-related data, such as data samples from vehicles and other mobile data sources traveling on the roads and/or from one or more other sources (such as physical sensors near to or embedded in the roads). The road traffic conditions assessment based on obtained data samples may include various filtering and/or conditioning of the data samples, and various inferences and probabilistic determinations of traffic-related characteristics of interest from the data samples. In some situations, the inferences include repeatedly determining current traffic flow characteristics and/or predicted future traffic flow characteristics for road segments of interest during time periods of interest, such as to determine average traffic speed, traffic volume and/or occupancy, and include weighting various data samples in various ways (e.g., based on a latency of the data samples and/or a source of the data samples). | 05-29-2014 |
20150094941 | FILTERING ROAD TRAFFIC DATA FROM MULTIPLE DATA SOURCES - Techniques are described for assessing road traffic conditions in various ways based on obtained traffic-related data, such as data samples from vehicles and other mobile data sources traveling on the roads and/or from one or more other sources (such as physical sensors near to or embedded in the roads). The road traffic conditions assessment based on obtained data samples may include various filtering and/or conditioning of the data samples, and various inferences and probabilistic determinations of traffic-related characteristics of interest from the data samples. In some situations, the inferences include repeatedly determining current traffic flow characteristics and/or predicted future traffic flow characteristics for road segments of interest during time periods of interest, such as to determine average traffic speed, traffic volume and/or occupancy, and include weighting various data samples in various ways (e.g., based on a latency of the data samples and/or a source of the data samples). | 04-02-2015 |
Patent application number | Description | Published |
20080270482 | MANAGING OBJECT LIFETIME FOR NATIVE/MANAGED PEERS - A system that manages lifetime of an object is provided. The system analyzes references on multiple objects to determine reachability of a native peer and dynamically transitions between native and managed object lifetime management systems based on the analysis. When a native peer is not reachable by a native application reference, the system weakens references to a managed peer avoiding memory leaks and clones the native references to the managed side to avoid premature collection. The system performs an optimized cleanup during object system shutdown wherein the references between managed and native peers are released and SafeHandles are suppressed from finalization. The system employs a pending remove list that stores a reference to a weak reference of a managed peer to eliminate race conditions that occur during finalization. | 10-30-2008 |
20080270893 | Systems and Methods for Pagination and Co-Pagination - Methods and systems are provided for controlling pagination in computer software applications. Abstract classes and methods are provided with programming interfaces to improve the ease with which developers can create applications that allow for co-pagination with arbitrary object types, and can create arbitrary object types that can co-paginate with arbitrary applications. | 10-30-2008 |
20090132578 | LAYOUT MANAGER - Various technologies and techniques are disclosed for managing layout updates to user interface elements. A dirty state of user interface elements is tracked in a tree with multiple nodes of user interface elements. The dirty state allows dirty subtrees of the nodes to be identified. A root node is identified for each of the dirty subtrees. Affected portions of the tree are updated, starting with the root node that was identified for each of the dirty subtrees. As part of the update process, changes to ancestor nodes are detected and used to make a layout process more efficient. For example, any layout processes that are currently being performed on any descendant nodes of a changed ancestor are abandoned, and the layout process is resumed at the changed ancestor. After updating affected portions of the tree, the updated user interface elements are then rendered on an output device. | 05-21-2009 |
20090172637 | MARKUP-BASED LANGUAGE FOR MANIFESTS - Applications are deployed with manifests authored in a markup-based language to leverage the benefits afforded thereby. Application manifests are simple and easily expressible without requiring a complex implementation. Markup elements or tags can be mapped directly to objects or an object hierarchy visible to programmers to enable fine grain control. Programmers can subsequently interact with these objects in a predictable and consistent manner. | 07-02-2009 |
20120167224 | PROTECTED AND VIRTUAL INTERFACES FOR COM AGGREGATION - An outer COM object can be provided with privileged access to protected functionality in an inner COM object. An inner COM object can offer a custom protected interface to an outer COM object by creating a new inner internals COM object that is not available to a calling application or by creating a new extension IUnknown interface that can be used to access the protected content. An outer COM object can override behavior in an inner COM object. An inner COM object can offer access to custom behavior to an outer COM object by creating a new inner internals COM object that is not available to a calling application. The new inner internals COM object can implement a new interface that provides access to the customized (override) content or can create a new extension IUnknown interface that can be used to provide access to the customized (override) content. | 06-28-2012 |
Patent application number | Description | Published |
20120130925 | DECOMPOSABLE RANKING FOR EFFICIENT PRECOMPUTING - Methods and computer storage media are provided for generating an algorithm used to provide preliminary rankings to candidate documents. A final ranking function that provides final rankings for documents is analyzed to identify potential preliminary ranking features, such as static ranking features that are query independent and dynamic atom-isolated components that are related to a single atom. Preliminary ranking features are selected from the potential preliminary ranking features based on many factors. Using these selected features, an algorithm is generated to provide a preliminary ranking to the candidate documents before the most relevant documents are passed to the final ranking stage. | 05-24-2012 |
20120130995 | EFFICIENT FORWARD RANKING IN A SEARCH ENGINE - Methods and computer storage media are provided for generating entries for documents in a forward index. A document and its document identification are received, in addition to static features that are query-independent. The document is parsed into tokens to form a token stream corresponding to the document. Relevant data used to calculate rankings of document is identified and a position of the data is determined. The entry is then generated from the document identification, the token stream of the document, the static features, and the positional information of the relevant data. The entry is stored in the forward index. | 05-24-2012 |
20120130997 | HYBRID-DISTRIBUTION MODEL FOR SEARCH ENGINE INDEXES - Methods and systems are provided for using a hybrid-distribution system to identify relevant documents based on a search query. A group of documents is assigned to a particular segment. The group of documents is indexed both by atom and by document to form a reverse index and a forward index. Both indexes are divided amongst each node in that segment so that each node is responsible for storing and accessing a different portion of both the reverse and forward indexes. The reverse index portion is accessed on each of a first set of nodes to identify a first set of documents that is relevant to a particular search query. Document identifications associated with the first set of documents are used to identify a second set of nodes that access their forward index portions to limit the number of relevant documents to a second set of documents. | 05-24-2012 |
20130297621 | DECOMPOSABLE RANKING FOR EFFICIENT PRECOMPUTING - Methods and computer storage media are provided for generating an algorithm used to provide preliminary rankings to candidate documents. A final ranking function that provides final rankings for documents is analyzed to identify potential preliminary ranking features, such as static ranking features that are query independent and dynamic atom-isolated components that are related to a single atom. Preliminary ranking features are selected from the potential preliminary ranking features based on many factors. Using these selected features, an algorithm is generated to provide a preliminary ranking to the candidate documents before the most relevant documents are passed to the final ranking stage. | 11-07-2013 |
20140324819 | EFFICIENT FORWARD RANKING IN A SEARCH ENGINE - Methods and computer storage media are provided for generating entries for documents in a forward index. A document and its document identification are received, in addition to static features that are query-independent. The document is parsed into tokens to form a token stream corresponding to the document. Relevant data used to calculate rankings of document is identified and a position of the data is determined. The entry is then generated from the document identification, the token stream of the document, the static features, and the positional information of the relevant data. The entry is stored in the forward index. | 10-30-2014 |
Patent application number | Description | Published |
20100185541 | NETWORK SERVICE FOR MODULARLY CONSTRUCTING A SOFTWARE DEFINED RADIO - Systems and methods are provided that disclose a network service for modularly constructing a software defined radio (“SDR”). A server system provides an SDR kernel (i.e., a potentially platform-neutral definition of digital signal processing functionality and control operations necessary to implement the core portion of a software defined radio implementing a particular radio standard) to a client system. The client system may select a desired SDR kernel through a variety of means disclosed herein. While some SDR kernels may be provided for free and unrestricted use, others may be purchased or subscribed to and additionally restricted by digital rights management (“DRM”) policies. Based upon the agreed upon payment terms and any other restrictions, a customized set of DRM policies may be applied by the server system to the SDR kernel before sending it to a client system. Additionally, the server system may provide a description of governmental regulations applicable to a given locality. | 07-22-2010 |
20110151770 | SYSTEM CAPABILITY DISCOVERY FOR SOFTWARE DEFINED RADIO - Capability checking to examine a computing device's capabilities to determine if the device supports a software defined radio to communicate according to a specific wireless protocol. Applicants have appreciated that as the reliance on software defined radio increases, numerous potential options may be available to a user for performing wireless communication. Applicants have appreciated the desirability of providing the ability to discover the capabilities of a user's computer to determine whether it is capable of supporting one or more wireless protocols. | 06-23-2011 |
20130139011 | PREDICTING DEGRADATION OF A COMMUNICATION CHANNEL BELOW A THRESHOLD BASED ON DATA TRANSMISSION ERRORS - Applicants have discovered that error detection techniques, such as Forward Error Correction techniques, may be used to predict the degradation below a certain threshold of an ability to accurately convey information on a communication channel, for example, to predict a failure of the communication channel. In response, transmission and/or reception of information on the channel may be adapted, for example, to prevent the degradation below the threshold, e.g., prevent channel failure. Predicting the degradation may be based, at least in part, on data transmission error information corresponding to one or more blocks of information received on the channel and may include determining an error rate pattern over time. Based on these determinations, the degradation below the threshold may be predicted and the transmission and/or reception adapted. Adapting may include initiating use of a different error encoding scheme and/or using an additional communication channel to convey information. | 05-30-2013 |
20130170380 | ADAPTING A COMMUNICATION NETWORK TO VARYING CONDITIONS - Systems and methods are disclosed for adapting a communication system to varying conditions. Using some form of discovery protocol, the communication standards supported by at least two communicants are determined. Each communicant may then periodically monitor the quality of the channel established by the communication standard and dynamically select a set of one or more communication standards to use for communicating. Further, when communicants share common non-standard parameterized implementations of communication standards, changes to the protocols which the communication standards comprise can be used to add options for a more dynamic response to changing conditions than is possible when adhering only to an established communication standard. | 07-04-2013 |
20140304796 | PROVIDING GUEST USERS NETWORK ACCESS BASED ON INFORMATION READ FROM A CREDIT CARD OR OTHER OBJECT - Guest user are enabled to access network resources through an enterprise network using a guest user account. A guest user account may be created for a guest for a limited time. Guest account credentials of the guest account may be provided to the guest to use the guest account using any of a variety of techniques described herein, for example, by scanning a guest access card, credit card or mobile telephone of guest user, and providing the guest account credentials to the user based on the information obtained. A guest access management server may be configured to generate and maintain guest accounts, authenticate guest users, and track and log guest activity. A VLAN technology may be used to separate guest traffic from host enterprise traffic on the host enterprise network. After a guest user is authenticated, communications to and from the guest user may be routed to a guest VLAN. | 10-09-2014 |