text:
The patent application taught an object based information storage, search and mining system and method, which can store, retrieve, and mine massively amount of object data efficiently. A first embodiment includes an object based search engine which can organize and identify the objects efficiently from the search space based on certain operational measure quantifying the search objectives. A second embodiment includes an operational measure estimator which can adaptively adjust or reconfigure itself to improve the accuracy of the estimation. A third embodiment includes a method for mapping objects onto a topological maps to enable identifying objects rapidly from the search space according to certain measures for search objectives. A forth embodiment includes a method for conducting object based search through mapping query objects and search objects onto topological maps and searching effectively through the maps based on certain operational measures.
1. A method for conducting an object-based search comprising the steps of
determining from the query, a set of characteristics corresponding to the search objective for the query,
exploring objects in a search space, and
identifying objects optimally conforming to the search objective, wherein
conforming identified objects have a predetermined correspondence with the desired set of characteristics.
2. The method of
extracting from the object a plurality of parameters,
determining from the parameters, the set of characteristics corresponding to the search objective, and
deriving a measure of conformability to the search objective based on the set of characteristics.
3. The method of
4. The method of
5. The method of
6. The method of
7. The method of
8. The method of
9. The method of
10. The method of
11. The method of
locating at least a neighborhood on the topological map, each neighborhood comprising a group of correlated objects, wherein the neighborhood includes objects meeting a threshold correspondence with the set of characteristics, and
searching the neighborhood for objects optimizing the search objective.
12. The method of
13. The method of
14. The method of
15. The method of
16. The method of
locating the first neighborhood of the query object on the first topological object map (the Query Object Map), the neighborhood comprising a group of correlated past history query objects, wherein the neighborhood includes query objects meeting a threshold correspondence with the set of characteristics, and
for each past history query object in the first neighborhood, locating the node corresponding to its query result object on the second topological object map (the Search Object Map), and
searching the neighborhood for the nodes corresponding to past query result objects on the second topological object map (the Search Object Map) optimizing the search objective.
17. A multimedia object miner, comprising
a query object mapper for receiving and organizing query objects from service requesting agent, and
a search object mapper for retrieving and organizing search objects from one or more search spaces, and
an operational measure estimator for receiving a priori parameters and generating estimation for operation measure of an expected search objective, and
an object mining processor for controlling searches of the one or more search spaces and adaptively modifying parameters controlling operation of the query object mapper and the search object mapper.
18. The multimedia object miner of
a multimedia object buffer for maintaining query objects, and
an query object feature vector extractor for generating feature vectors from query objects, and
one or more topological maps for mapping a plurality of query objects based on the feature vectors.
19. The multimedia object miner of
a multimedia object buffer for maintaining search objects, and
an search object feature vector extractor for generating feature vectors from search objects, and
one or more topological maps for mapping a plurality of search objects based on the feature vectors.
20. The multimedia object miner of
a first buffer for storing the a priori data, and
a first parameter extractor for extracting the a priori search parameters from the a priori data,
a second buffer for storing the a posteri data,
a second parameter extractor for extracting the a posteri parameters from the a posteri data, and
an adaptive function estimator for providing an estimation of the operational measure of the search objective based on the a priori parameters,
the a posteri parameters are obtained from results of one or more preceding searches, and
the operation of the function estimator is reconfigurable based on the characteristics of the a posteri parameters and estimation error.
21. A method for mapping a multidimensional object on a topological map, comprising the steps of
locating a closest other object mapped on the topological map, the closest other object having a predetermined correspondence with the first object, and
mapping the object on the topological map in relative proximity to the other object, wherein
correspondence between objects is related to a difference measure associated with the objects.
22. The method of
comparing a plurality of target objects with the object to obtain operational difference measures representing differences between the object and each of the plurality of target objects, and
selecting as the closest other object, a remaining target object with a lowest difference measure.
23. The method of
24. The method of
repeating the step of locating a selected number of times to identify one or more next closest objects, and
mapping the object on the topological map in relation to proximities of the object to the closest and the next closest objects.
25. The method of
extracting multidimensional feature vectors from objects, and
mapping the objects onto a lower-dimensional lattice according to difference measures of the multidimensional feature vectors.
26. The method of
27. The method of
28. The method of
29. The method of
locating a subset on the hierarchical map, the subset including objects having a predetermined correspondence with the input object, and
mapping the object within the subset,
wherein the hierarchical map includes a plurality of nodes.
30. The method of
31. The method of
comparing a plurality of target objects to obtain relationships between the input object and each of the plurality of target objects, and
assigning to the subset, objects with the predetermined correspondence.
32. The method of
33. The method of
This application claims priority to U.S. provisional patent application Ser. No. 60/638,929, filed on Dec. 22, 2004, entitled "O
This application claims the benefit of:
U.S. utility patent application Ser. No. 10/867,447, filed on Jun. 14, 2004, entitled "M
U.S. utility patent application Ser. No. 10/867,027, filed on Jun. 14, 2004, entitled "M
Wherein Ser. No. 10/867,447 and Ser. No. 10/867,027 each claim priority to U.S. provisional patent application Ser. No. 60/480,985, filed on Jun. 23, 2003, entitled "M
1. Field of the Invention
Generally, the present invention relates to multimedia data searching. More specifically, the present invention relates to data mining, internet search engines, multimedia storage, multimedia data bases, data warehousing, multimedia data compression, multimedia communications, data security and intelligence agents.
2. Description of Related Art
There are massive amount of multimedia objects on the Internet. Current Internet search engines are "text" or "hypertext" based. It is difficult to search for non-text media objects, like video, image, and audio, which are more targeted for human consumption. Most of the current methods for organizing multimedia data are based on "metadata", which is also text based information. There is no current effective method to arrange or sort media objects available in the disorder of the World Wide Web, or to construct an ordered media storage and media storage network structure based on the multimedia data content itself. Most, if not all, of the current search engines available today utilize fixed search criteria and cannot tailor or adjust to the requester's individual tastes or measures. The techniques and systems used in prior art systems are therefore optimized for, if not dedicated to, text-based searching, which limits their effectiveness for searching objects which are not text-based. However, the reduction of media objects to a set of metadata, as used by conventional systems, necessarily eliminates large amounts of the most useful data and therefore can often yield an unsatisfactory search result.
There has therefore been a need for systems, processors, techniques and methods for characterizing, searching for and sorting media objects available on the internet without the need to attach metadata to those media objects.
The present invention provides a method to effectively represent, search, and manipulate multimedia objects through a group of interconnected multimedia search agents functioning logically on an interconnected multimedia storage network.
A first aspect of the invention is directed to a multimedia object mining agent (MOM), which can search for multimedia objects in a distributed multimedia data reservoir effectively to produce the results to satisfy certain content based multimedia queries.
A second aspect of the invention is directed to the search method and system of the multimedia object mining agent based on topological map structure to efficiently searching for the desired multimedia data from a large search space to satisfy users' multimedia information requirements. The search system also includes a dynamically adjustable cost function, which estimates certain operational measures; dynamically adjustable topological maps, which sort out the objects in the search space and query space; fast search method which exploits the neighborhood information in the topological maps, followed by detail and global search processes.
A third aspect of the invention is directed to a multimedia object store (MOS) and a multimedia object store network (MOSNET), which are interconnected multimedia storage devices with processing and communication capability. MOS and MOSNET are used to support the implementation and operation of multimedia object agents.
A fourth aspect of the invention is directed to a multimedia object mining network (MOMNET), which is a distributed agent network that can dynamically structure and organize itself to satisfy the users' multimedia information requests.
A fifth aspect of this invention is directed to applications, which include an n-dimensional image database, a data security and encryption system and a media contents push-pull agent.
A sixth aspect of this invention is directed to practical implementations for the structures and methods taught in this invention. The object oriented processing unit (OOPU) and object oriented memory unit (OOMU) are described to provide guidelines for implementing the data processing and storage structure for the multimedia object miner.
These and other aspects of an embodiment of the present invention are better understood by reading the following detailed description of the preferred embodiment, taken in conjunction with the accompanying drawings, in which:
The present invention will now be described in detail with reference to the drawings, which are provided as illustrative examples of the invention so as to enable those skilled in the art to practice the invention. Notably, the figures and examples below are not meant to limit the scope of the present invention. Where certain elements of the present invention can be partially or fully implemented using known components, only those portions of such known components that are necessary for an understanding of the present invention will be described, and detailed descriptions of other portions of such known components will be omitted so as not to obscure the invention. Further, the present invention encompasses present and future known equivalents to the known components referred to herein by way of illustration.
Referring to
The MAA 12 typically delivers multimedia services to the user 102, in response to a multimedia service request. The MDR 13 is a depository of multimedia information that may be maintained on storage systems located locally or dispersed across one or more networks. The MOM 11 supports processes that search, process and provide multimedia objects in response to queries relayed by the MAA 12. The communication network 14 provides a plurality of communication channels for the exchange of information between the various components of the MSS 101 and between the MSS 101 and the user 102.
Multimedia Object Miner (MOM)
Referring to
The MOM 11 may also include a search object mapper ("SOM") 23 for sorting and organizing one or more search spaces of the MDR 13. The SOM 23 typically creates and updates one or more topological maps related to search objects, wherein the topological maps are used to optimize the search process. In at least some embodiments, an operational measure estimator ("OME") 21 provides an estimation of a search objective measure that may be used to assess expected outcomes of searches based on factors including merit of search points as discussed below. The OME 21 can provide estimations of certain search results based on information available during the search, the estimations relating to measures that can characterize the quality of the certain search results. The OME 21 may provide a search cost function value to estimate certain post search operational measures. This cost function value can be used to guide the search point evaluation for the OMP 22 and guide the adaptation of topological maps 23 and 24 (as described below). Typically, the MOM 11 also includes a MOM embedded communicator ("MEC") 28 for maintaining the communication channels that link MOM to other components and entities coupled to the communication network 14.
Referring also to
The estimation 309 is typically obtained by first obtaining the a priori data and stored in an a priori data buffer (PRB) 301. The a priori data buffer (PRB) stores relevant "pre-operation" data (i.e., the data available before the target actions or operations are taken to the search results) that may be available during the search process. Then, the a priori input parameters 308 are extracted using an a priori parameter extractor (PRE) 302. Last, an adaptive function estimator (AFE) 303 receives the a priori parameters 308 and provides estimation 309 of the operational measure.
Parameters associated with the search results (hereinafter "a posteriori input parameters") 312 are typically processed in a similar manner to the a priori input parameters 308. The search results comprise data, hereinafter called a posteriori data that is derived by processing an object retrieved by the search. An a posteriori data buffer (POB) 306 is provided to store information derived from processing the retrieved object. An a posteriori parameter extractor (POE) 305 extracts the a posteriori input parameters 312. An operational measure calculator (OMC) 304 calculates the operational measure value 310 from the a posteriori input parameters 312. It will be appreciated that this a posteriori operation measure 310 can be fed back into the AFE 303 to adjust the internal structure or parameters of the AFE 303 such that the AFE 303 may provide better estimation. Thus the operation of the AFE 303 may be characterized as adaptive in nature since performance of the AFE 303 can be improved and optimized after each search. This "adaptation" can be performed through a "supervised learning" process to dynamically and iteratively improve estimation accuracy.
It will be appreciated that quality of results delivered by the MOM 11 is dependent, at least in part, on selection of appropriate operational measures. Appropriate operational measures include information measure and entropy measure, as defined in the well-known Shannon's information theory. Many embodiments of the present invention employ entropy as an operational measure for the result of the search.
The operational entropy of an object ("O") related to encoding method ("m") is represented as I_m(O), and may be calculated as a number of bits required in encoding the object. A relative operational entropy may be defined, at least for the purpose of this application, as the number of bits required to encode a first object ("O1"), given information related to the encoding of a second object ("O2"), using encoding method m; the relative operation entropy may be represented as Ir_m(O1, O2). It will be appreciated that I_m( ) and Ir_m( ) define upper bounds of Shannon's theoretic measure. It can also be appreciated that such entropy-based measurement differs from what can be referred to as "energy-based measurement" used in most prior art search processes.
The present invention provides an entropy based operational measure that can generate search results with a perceptual quality that is better suited to human searchers because it will be appreciated that the human perception system has evolved to process "information" and entropy-based measurements are information-oriented. In many embodiments of the invention, the AFE 303 is instrumental in providing accurate guidance in driving the search process. In at least some embodiments, the AFE 303 implements a parameterized function with adaptable parameters to provide a result RAFE 309 such that:
Referring to
It will be appreciated that the accuracy of estimation attributable to the AFE 303 is typically significantly affected by selection of input parameters and structure of the estimation function. In some embodiments the selection of input variables for the AFE 303 (hereinafter referred to as "cost function") is based on criteria including simplicity criteria ("C1"), relevancy criteria ("C2"), "divide and conquer" refinement criteria ("C3"), input variable factoring criteria ("C4"), and simple substitute criteria ("C5"). Simplicity criteria factor the ease of extraction of the input variables from various search states during the ME search process. Relevancy criteria account for the degree of relevancy of input variables to the target objective cost. The divide and conquer refinement criteria decompose a cost function F into separable contributing component functions F1, F2, etc. to simplify the function form for easy evaluation and tracking. Input variables factoring criteria decompose an input parameter X1 into separable contributing components Xi1, Xi2, etc., thereby creating more input variables and promoting better accuracy, control and tracking. Simple substitute criteria substitutes one or more parameters to replace difficult to obtain parameters.
In an exemplary embodiment, a MOM 11 is used for searching based on N-dimensional image matching. Since the type of object sought is highly correlated and normally encoded through some kind of coefficient de-correlating transform such as Discrete Cosine Transform ("DCT"), Discrete Wavelet Transform ("DWT"), Discrete Hardmard Transform ("DHT") and Karhunen-Loeve Transform (KLT). Following transformation, derived signal energies are typically concentrated on a few low frequency bands. Based on this observation, a priori input parameters for AFE 303 may be selected from the energies in a plurality of low frequency sub-bands {E_0, E_1, . . . , E_i} and remaining high frequency residue energy E hi. Embodiments adopting the simplest form of this "sub-band" decomposition may divide the energy into direct current ("DC") and alternating current ("AC") terms of a transform. Here the AFE result RAFE 303 can be approximated by
In other embodiments, criteria C3 may be applied by decomposing the AFE function into portions representing estimated values and accurate values. Since some of the estimation problem may include one or more exactly predicable portions that contribute to the operational measure, the predicable portion may be realized using a table look-up or simple function calculator, where the functional form is known.
Because the relevancy of a priori data significantly affects the accuracy of estimation, some embodiments place great weight on providing accurate estimation of a posteriori operational measures based on a priori data. For example, where queries involve object matching types, it is preferable to have complete object information available to compute a cost function. However, it is relatively commonplace that complete object information is not available because of bandwidth availability and cost, and for other reasons. For example, complete object information may not be available when query and search objects Oq and Os are physically residing in different locations of a network.
The following is describes an embodiment of an operational measure estimator. BEGIN: Exemplar Operational Measure Estimator Declaration
1. A method for estimating operational measures associated with objects, comprising the steps of
Referring again to
Examples of topological maps are depicted in
An illustrative example is shown in
In addition to its use for deriving missing objects that reside on non-integer points of the lattice, the interpolation method may also be used for correcting error and omissions attributable to transmission and storage faults, and other problems associated with distributed network updates.
An example is shown in
Referring now to
The MOB 901 is typically coupled to a MOM embedded communicator ("MEC") 28 and may assess the multimedia data exchanged by the MDR 13 (see
The OFE 904 may extract feature vectors from an object to be sent to a feature vector bus 906. The feature vector is typically a set of values that characterizes an object and the feature vector can be used for object matching during searches and to enable content-based access of objects. In the latter use, the feature vector may be used to retrieve an object pointer from the OTM 902 using an object pointer bus 910.
The object bus 905 may be provided to permit fast object data transfer for various purposes including
The object map index bus 907 is provided to transmit access requests by the OMP 22 to the object map. The object pointer bus 910 typically transmits the object pointer information to and from the MOB 901 to access object data in the MDR 13 through a bus 202 and the MEC 28 (as shown in
Referring now to
Some embodiments of the invention implement an associative addressing method. An input feature vector X 1206 is provided to each neuron in the lattice for measuring a difference from the feature vector W(i) stored in each node N(i). The difference is typically a value measured using metrics that quantify relative distance of nodes. The "difference value", together with a weighted summation of the output from the neurons in the neighboring set S(i) is added together to generate the "pre-sigmoidal" activation level h(i) for neuron N(i). An output y(i) for neuron N(i) is typically generated by mapping h(i) through a non-linear signmod function f( ). The system converges through several iterations and the neuron (i.e., the node in the SPAN map) with the highest output value is selected as the closest match. The neighborhood set S(i) of a node N(i) on a lattice map of the exemplary embodiment is the set of nodes within a certain neighborhood region of node N(i).
Referring next to
Considering now the diagram of
An addressed node N(i) typically provides attributes such as W(i) and P(i) for various purposes. W(i) may be used for object matching and searching and P(i) may be used for accessing objects from the ODR 13 (as shown in
For each SPAN map a node N(i) with a feature vector W(i) matching the input vector X in the nearest neighbor sense can be selected through a distance measurement. The distance between two vectors may be represented using the notation D(W(i),X). Preferably, D( ) should be defined to be consistent with the operational measurement described previously (see
Embodiments of the invention provide topology-preserving mapping. Topology-preserving mapping is provided when neighboring nodes on the topological map are also neighboring nodes on an original feature vector space. Additionally, in topology-preserving mapping, two nodes on the feature vector space are neighbors if they share a boundary surface or a point on Voronoi regions determined by the feature vectors {W(i)} of nodes {N(i)}, with all the points in a Voronoi region V(i) for node N(i) closer to W(i) than the feature vectors of other nodes.
In the exemplary embodiment of
In this exemplary embodiment, the map may be constructed according to the following procedure:
Map Training:
Object indexing:
The procedure shown above demonstrates an exemplary embodiment of indexing the objects onto a lattice structure, through a parameter level feature vector training process. The lattice structure of the map may also be adjusted through certain node generation and annihilation processes. The generation and annihilation process can be based on activities and information representation contents associated with the node. This structure level adaptation of the map can also be governed by an operational measure, which measures certain resource utilization, performance/quality trade-offs of the system. It will be appreciated that the QOM 24 in the exemplary embodiment shown in
MOM Search Process
In many embodiments, the performance of the MOM 11 is optimized by the establishment and maintenance of topological maps including maps used by the SOM 23 and the QOM 24. These two maps provide for the capturing of topological structure of search and query spaces respectively. The topological structure of the input query map and object search map provide the ability to execute efficient search processes that leverage the topological structure of the maps.
A starting point on the SOM 18002 is preferably may be selected by evaluating all points in neighborhood sets on the SOM, where the neighborhood sets are referred to by the neighboring points of the current query point 18003 on QOM 18001. Then the point yielding a best operation measure value is selected as the starting point.
Once the starting point is selected, the search process will be followed by conducting a detailed search around the neighborhood region of the starting point. This process may establish the best operational measure result as a threshold. In many instances, this detailed search generates optimal results.
Next, the MOM 11 executes a selected global search process, typically designed to explore large territories with an objective of reaching neighborhoods of better points. Additionally, the global search minimizes the risk of being trapped in a local minimum during the search process.
As with any general search problem, existing search strategies and algorithms may be implemented to execute a detailed or global search process. However, aspects of the present invention permit the execution of other search techniques to obtain good search results using the described topological maps and operational measure cost functions.
For example, an "A* search," as known in the art, may be used to skip search points if a lower bound of the cost value for an object can be provided during the search process. Specifically, if the lower bound is already larger than the best cost value obtained so far, then there is no point to evaluate this candidate point. Additionally, termination criteria for "success" or "failure" can be based on certain threshold parameters, which can also be adaptively adjusted based on the context of the search through certain learning processes. With a "successful match" or "acceptable match" termination condition set, in some embodiments, a spiral search pattern can be executed around an optimal starting point to minimize the time required to obtain an acceptable outcome. Also, if the search is sequenced according to a monotonically increasing order of certain contributing factor Xc of the cost function search points, then the search process can be terminated if, at a certain point, the Xc value is larger than the best cost value obtained so far.
Referring to
Referring now to
Next, at steps 26017-26021, the MOM 11 executes a detailed search loop to closely evaluate a small region around the StartPt. The spiral search process of
The search process provided in these embodiments is very efficient because of search behaviors including:
In real world multimedia search problems, the resource requirements on signal processing and matching calculation for MOM 11 to search a large space can be very demanding and the resource requirements for different queries can be quite different and unequal. For practical implementation of the OMP 22 processor shown in
Intrinsically, data processing independency exists in the search and query objects. In many embodiments, systems with high performance throughput may be developed with the following considerations:
The drawing of
The OMCU 62 is typically used for controlling and guiding the operation of OMP 22 in performing search and computation processes, using certain control parameters. Control parameters of the OMP control processes may include:
As an illustrative example of the OOPU, in a 2-D topology map structure, given the search starting point 20001, a 3×3 array processor may be included in the object data path 6002 (of
The following is the declarative description of an embodiment of an OMP 22 based on the OOPU structure described above.
BEGIN: Exemplar OMP Declaration
1. An object mining processor, comprising
The throughput for data access from the topological maps is very important for the overall performance of the MOM 11. To optimize the throughput, design of the storage structure, i.e., the OOMU is adapted to support intrinsic spatial and temporal data independency. Notice that OOPU and OOMU are closely related with the data access method of OOPU reflected in the OOMU structure.
The drawing of
The following is the declarative description of an embodiment of an MOB 901 based on the OOMU structure described above.
1. A multimedia object buffer, comprising
Referring now to
A MOSNET with interconnected MOS 72 may provide the environment to enable the emergence of a distributed multimedia agent network using the proposed MOM 11 as fundamental logic building blocks.
The first MOM 25001 also has upstream second and third MOMs 25002, 25003 which are dependent on the first MOM 25001 to fill in certain portion of their associated SOMs. Thus, the logically connected MOMs form a multimedia object miner network (MOMNET) 25017, which can dynamically grown, adjust, shrink, and terminate. Multiple MOMNETs may co-exist and evolve on the MOSNET to provide services to other multimedia application agents. The evolution of the MOMNETs can also be governed by certain operational measures which determine the overall objectives of the network. With properly set operational measures for the network, the MOMs and MOMNETs can compete for resources in the underlying MOSNET (e.g., the internet, or the corporate storage area networks) and follow a "survival of the fittest" rule as the evolution process in nature to optimize the objectives for the network to satisfy human's needs.
Many potential applications of the structures and methods are provided by the present invention. The following examples are illustrated in detail to demonstrate some of the aspects of the present invention and are not intended to limit the scope of the current invention.
An image write query is typically presented through query bus 22017 to the query object mapper 22003. A database query buffer 22009 converts the image query into object form and a feature vector of the image query is extracted through query feature extractor 22010. The query objects are typically organized on the database query map 22008 according to the feature vector extracted. The input object may be sent through input object bus 22023 to the image database processor 22004 and an object searcher/estimator 22014 typically searches the database object map 22011 to find the closest (measured by relative operational entropy between objects defined earlier) object 22026 derived from the image database 22016, and this object is used to estimate the input query object.
While the object searcher/estimator 22014 performs the search, relative entropy (in terms of the number of bits) may be estimated through an operational measure estimator 22002, that typically receives certain extracted parameters 22028, which may become available during the search, and provides the relative entropy estimation 22029. 22002 can adjust its accuracy through feedback from the actual bit number results 22030 from the delta object encoder 22015. A difference 22025 between an input object 22023 and estimated object 22026, together with a reference index 22027 of the estimated object on a database object map 22011, are encoded through delta object encoder 22015. The encoded data 22032 may then be transmitted through the database object mapper 22005 to the image database 22016.
For an image search query, a query image is typically presented to the system through a communication link 22017 and the image is converted into object form. An object searcher/estimator 22014 may then search through the database object map 22011 to retrieve the encoded image data 22019 (in the encoded format) from the image database 22016. The encoded image is decoded and recovered into the object form through database object buffer 22012. The image object may then be sent through an image object bus 22031 to the object searcher/estimator 22014 to evaluate the query target based on certain search target measures estimated by the OME 22002. The image object with the best operational measure value may be then transmitted to the query object mapper 22003 through 22024, and then presented to the users through a database query bus 22017
A good search performance may be achieved when certain hierarchical structures are included in topological maps 22011 and 22008. An exemplary embodiment is presented in
Fast Search Process:
The following describes an embodiment of a method for object storing and retrieving from a data base using some of the concepts described above. In one approach, the method for storing and retrieving objects in a database can comprise the steps of, first, extracting from an input object a first plurality of parameters, which can, for example, be a desired set of characteristics or a search objective, then, exploring at least some of the objects already stored in the database, and deriving from each database object a second plurality of parameters, and calculating from those database object parameters a set of characteristics corresponding to the search objective, followed by identifying those objects in the database which have the greatest correlation or other correspondence with the desired set of characteristics, where the correlation can be based on a variety of operational measures. For example, for an input object, the operational differential entropy measures the number of bits to encode the input object based on the objects identified from the data base, where the encoding is performed through certain actual encoding operation process. The operational differential entropy measure quantifies the information difference between two objects through certain encoding methods (i.e., the operation). Another example is in searching the design objects from a data base of existing design objects to create new designs requested by certain design request query. Here the operational measure can measure the actual amount of effort to complete the design for the design request query based on the existing design objects identified from the design data base. In this case, the actual amount of design work has to be estimated during the search process. However, after the design objects are identified and the requested design work done, the actual amount of work can be measured (through the operational measure), then feedback to the operational measure estimator to improve the estimation accuracy.
The plurality of parameters in the foregoing example can include, for example, feature vectors of the input objects or data base objects, which may be characterized in one or more dimensions. In addition, the operational measures can include quantifying the differences in information content between objects, such as differential entropy.
In at least some embodiments, the proximate relationship between objects can be measured in one or more dimensions, of which one dimension can be time-related, such as a location in a time-sequence of images or similar time-based media objects.
In some arrangements of the invention, including at least some of those using feature vectors, the database may be mapped to a lattice structure having a plurality of nodes, wherein the step of storing an object includes deriving or otherwise obtaining a set or sets of parameters for each of the one or more other objects, and then extracting neighborhood relationships between the input object and one or more other objects. The neighborhood relationship in such embodiments typically is related to the correspondence between the input object and one or more other objects. In such an arrangement, the step of mapping the input object can also include modifying the lattice structure, which can include node generation and/or node annihilation or deletion. The modifications may be based on factors including utilization and performance, and may also include the operational quality of the system adapted to maintain the lattice structure.
In some arrangements, mapping of the input object can include training of the feature vectors, including training at the parameter level. The step of mapping can alternatively include using interpolation to identify a position for the input object with in the lattice structure, and then mapping the input object to that position. The step of extracting neighborhood relationships can also include processing a plurality of feature vectors using an adaptable or dynamic function which may be parameter-based, or parameterized.
In some embodiments, it may be desirable for one or more of the feature vectors to reside in a higher dimensioned space than the lattice structure. In such an arrangement, the neighborhood relationships can exist between pairs of nodes on the lattice structure, and the pairs of nodes can share boundary surfaces or points on Voronoi regions. The shared boundary surfaces or points can, in at least some embodiments, be determined based on the feature vectors. In addition, it can be desirable in some embodiments to map the higher-dimensioned space of the feature vectors to the lattice structure. In at least some embodiment, the higher-dimensioned space can include characteristics for preserving neighborhood relationships between objects.
It will be apparent to those skilled in the art that one dimension on the lattice can represent a time axis, at least in some embodiments.
The process of storing objects can, in some embodiments, predicting a storage location for an input object based on the other objects already stored in the database. The predicted storage location can be associated with a predicted object, wherein the predicted object provides a minimum differential entropy measure related to the input object. One or more difference objects can then be generated, representing differences between the input object and the other objects, followed by storing the one difference objects with one or more difference paths. Each of the one or more difference paths can locate the input object relative to at least one of the other objects.
The process of retrieving can include, in at least some arrangements, selecting a map location of an object to be retrieved, and then fetching information associated with that object to be retrieved. The information can include, for example, difference objects and difference paths related to other objects. The, the other objects can be retrieved, followed by constructing the object to be retrieved from the other objects and the fetched information.
In some arrangements, successive input objects can be mapped onto a query object map, where the query object map preserves the neighborhood mapping of a query object space. In some such arrangements, the query object map is a one dimensional sequence for ordering input objects.
The parameters noted above in the example may also include components extracted using a coefficient de-correlating transform. Such components may include a plurality of signals, each signal having an energy. The plurality of signal energies can include a first signal energy having no alternating component. Each of the other signal energies can be associated with a different band of non-zero frequencies. In some arrangements, the non-zero frequencies are typically lower than a selected first frequency.
Referring now to
On the transmission side, transmission data 24010 is provided to enable retrieval of closest matching reference data 24016 obtained from a common data storage 24007. A calculated difference (delta difference) 24017 between the transmission data 24010 and the matching reference data 24016, together with a map reference index 24014, are encoded by a transmission encoder 24006 and transmitted through an unsecured channel 24009 to the receiving side.
On the receiving side, a transmission decoder 24020 decodes received data into a decoded delta difference 24018 and a decoded map reference index 24015. The map reference index 24015 may then be used to retrieve a receiver-side matching reference data 24019 from a receiver side common data storage 24008. Retrieval is facilitated by commonalities between topological maps on receiver and transmitter sides. The receiver-side matching reference data 24019 is added to the decoded delta difference 24018 to provide a received data 24011. The received data 24011 may then be sent to the receiving process 24004.
An exemplary embodiment is presented in
In push applications, a first MOM 25001 pushes queries and results to multimedia content consumers. This mode of operation may be characterized as an up-stream linking process from the QOM 24 (see
In the exemplary embodiment, of
To deliver media content to a consumer, MOM 25001 pulls multimedia objects from its down stream agents linked through its SOM 23 (see
As mentioned above, the structures and methods taught in this document can be applied to a wide range of multimedia applications through varying the object types and operational measures. Some additional examples embodiments are briefly summarized in the followings:
A. Object Oriented Internet Mapping Crawlers:
For a target object application with specific operation measures, a group of mapping crawlers can be dispatched into the Internet to navigate through the Internet hyperspace to generate the topological map for the target object search space. It will be appreciated that the crawlers may be distributed and hierarchical in form to cover the internet through "divide and conquer" and "parallel distributed processing". The basic structure of a crawler is the same as the MOM structure as shown in
B. Target Personal Multimedia Search Agent on Demand:
Providing target multimedia search agent for specific applications on demand, such that:
C. Multimedia Data Warehouse Mining:
To map, search, analyze a large multimedia data warehouse for knowledge discovery and decision making.
D. Multimedia Data Base Indexer:
E. Delta Data Compression:
F. Data Encryption, Security, and Error-Resilient/Fault-Tolerant Communications:
G. Human Interface Mining:
H. Personal Interactive Multimedia Object On-Demand Activities:
Although the present invention has been particularly described with reference to embodiments thereof, it should be readily apparent to those of ordinary skill in the art that changes and modifications in the form and details thereof may be made without departing from the spirit and scope of the invention. For example, those skilled in the art will understand that variations can be made in the number and arrangement of components illustrated in the above block diagrams. It is intended that the appended claims include such changes and modifications.
Citations de brevets
Référencé par
Image d'origine
Faire pivoter


text:
Category: Museums
Address: 1200 Getty Center Drive
Email: firstname.lastname@example.com
Website: Visit the website
Telephone: (310) 440-7360
Reviews J.Paul Getty Center
J.Paul Getty Center
J. Paul Getty Center is a research centre as well as a museum which is managed and run by the J. Paul Getty trust.
There are more than three hundred collections of pieces of art including manuscripts, sculptures, photographs, drawings, paintings and more.
It also exhibits the Etruscan, Roman and Greek sculptures which were once placed in the Getty Center which has paintings of artists such as Vincent Van Gogh.
One can spend a lot of time in this centre at the gardens, in the museum, at the buildings which provide scenic views of the city, the gift shop, the galleries, eateries and more.
The J. Paul Getty Center has interactive activities for children and they can run about in the open spaces outdoors.
There are five two-storey pavilions situated in an open patio with each gallery displaying work of art of popular artists.
Maybe you might also be interested in:
|Getty Museum - 1.8 mi
Located in Brentwood, Los Angeles, the Getty Museum was opened in December, 1997. The hundred and ten acre complex features a great collection European paintings, sculpture, photographs,...
Reviewed by: Editorial Staff
|Museum of Tolerance - 4.8 mi
the Museum taken care to accommodate manifestations that regard the tolerance between the people.
Reviewed by: Editorial Staff
|Museum of Jurassic Technology - 6.1 mi
Museum of Jurassic Technology claims of having a 'specialized repository' of artifacts and relics from Lower Jurassic, that too, with an emphasis on the ones demonstrating curious or unusual technological qualities. The catalog...
Reviewed by: Editorial Staff

subset: commoncrawl


text:
This weekend, Dallan and I are hosting our annual friend Halloween Party. I know I've been rather hush, hush about my party this year. Why? Because I'm a hosting procrastinator. Secret's out – drat!
For example, I am still pulling together last minute Halloween decor (i.e. Halloween Tree, Entryway/porch decor, et cetera). I didn't pull my menu together until Monday. My costume still needs to be made (at least I purchased all of the materials for said costume). And, I'm trying to come up with party game ideas. Suggesstions?
Amongst all of this procrastination, I managed to whip out a couple of Nutter Butter Ghost cookies. They go a little something like this. Hit it!
- Nutter Butters
- White Candy Melts (I used Wilton's)
- Dark Candy Melts (I used Wilton's)
- Line a cookie sheet with parchment paper
- Melt white chocolate according to package directions
- Dip nutter butter in melted white chocolate and clean up nutter butter edges with a butter knife.
- Lay white chocolate covered nutter butters on parchment paper.
- After you have finished covering nutter butters, place cookie sheet in freezer for 10-15 minutes (or until chocolate has hardened).
- Remove cookies from freezer and melt milk/dark chocolate.
- You may either dot the eyes and mouth on with a Toothpick or place melted chocolate in a candy decorating bag or candy decorating squeeze bottle and dot from there. (I used a candy decorating squeeze bottle – so easy.)
- Let chocolate eyes and mouth hard.
- Serve!
Are any of you making fun holiday treats? We'd love to see pictures!


text:
|Jaxsen Keith Graves
|Wednesday, 20 February 2013 11:03
Jaxsen Keith Graves infant son of Brad and Gina Jones Graves of Park City, died Monday, February 18, 2013 in Glasgow.
In addition to his parents he is survived by four brothers, Corey Graves of Park City, Trenten Spears of Glasgow, Westen Harper of Glasgow and Ty Graves of Park City; two sisters, Kaitlyn Graves of Glasgow and Taylor Graves of Park City; maternal grandparents, Junior and Brenda Anderson of Glasgow, paternal grandparents, Betty and Dennis Vibbert of Park City; paternal great-grandparents, J. B. and Wanda Doyle of Park City and several aunts, uncles and cousins.
He was preceded in death by his grandfather David Graves and great-grandparents, Albert and Louise Morgan and Jack and Marie Graves.
Graveside services for Jaxsen Keith Graves will be held at 11am Thursday at the Rocky Hill Cemetery.


text:
Posted at: 11/13/2012 6:34 AM
A new study from Canada suggests there is no need for patients to go hungry before getting their cholesterol checked.
Patients usually have to fast before their cholesterol appointments but now some doctors are rethinking that strategy.
An analysis of more than 200,000 people in Canada found cholesterol testing results differed little between those who fasted and those who did not.


text:
Saybrook University
Fear doesn't build character in kids08/25/2011
To say that trying to get kids to do the right thing by scaring them is "common place" is like saying Christmas is a holiday. In fact, it's EVERYWHERE.
We try to scare kids about the dangers of drugs, about the dangers of gangs, about what will happen if htey don't get an education, about what could happen if they talk to strangers, about drinking, about driving, about drinking and driving ... you'd almost think we enjoy scaring kids, we do it so much.
But it's effective, right?
At The New Existentialists, Saybrook psychology student Makenna Berry has gone over some of the evidence -- and it turns out that "scared straight" style interventions do little to no short-term good and negative long term impacts.
Uh oh.
Fortunately, there are better approaches we can take to help children navigate a world full of pitfalls.
Why do we medicate first and ask questions later?08/09/2011
It's a common assumption among medical professionals that biochemical conditions must involve biochemical treatments -- you need to pop a pill for your depression and take medication for your blood pressure.
But that doesn't necesarilly follow. High blood pressure is often best treated by diet and exercise, and depression -- even assuming it is a biochemical condition -- is frequently better addressed by talking with a therapist and changing your life.
Writing at The New Existentialists, Sarah Kass notes that a recent study has shown that practicing yoga "helps to calm the schizophrenic mind."
And why wouldn't it? While the benefits of yoga have only been acknowledged by western medicine relatively recently, it has thousands of years of history behind it as an aid to meditation and a way to help unify mind and body. The notion that this is inferior to a pill because ... because ... wait, why exactly? Oh right, because it isn't "medicine." Well, that's a notion that doesn't make any sense.
Healthy approached that take the whole person into account should be medicine of first resort, not last - especially since practicing them is still a good idea when you're already healthy. Unlike medication, the "side effects" of yoga are all positive if you do it right. It can even serve as preventative medicine - the best kind.
Who's in charge here?08/03/2011
Political leaders say they way a "systemic" fix to America's problems – but Aimee Juarez doesn't believe them.
Writing at Rethinking Complexity, she suggests that American politicians are very good at causing system problems but not at fixing them. The only kind of solution congress ever looks for are piecemeal solutions, with little regard to the big picture or long-term consequences.
As a result even good ideas can push us deeper into the hole we're digging … because systemic problems require system-wide solutions.
Is Carl Jung having an American Renaissance?08/02/2011
That's the question asked by Saybrook Psychology Professor Eugene Taylor, who has recently been asked to review two books about Jung's work for the APA's website.
A recent upswing in positive reviews of Jung's work, new analysis about Jung's insights, and popular acclaim, Taylor suggests, are signs that even academic psychology - long dominated by "experimentalists" who didn't believe anything they couldn't measure under laboratory conditions - is accepting the value of depth psychology's approach to the human mind.
Our youth obsessed culture is about to get a shock07/27/2011
The first wave of Baby Boomers are retiring, and by some estimates one-in-five Americans will be over 65 by 2030.
How does a culture obsessed with youth cope?
So far, most of our fixes have been technological - and amazing new gadgets to help the elderly function are in the works.
But even the researchers behind these new inventions admit it: our society can't handle this "silver tsumani" without fundamentally changing they way it handles the elderly.
An essay at The New Existentialists suggests that psychology should be playing a key role in this transition. That instead of just trying to "fix" symptoms, psychologists have a vital role to play in providing healthy perspective to people about the a life that includes old age.
Why is the NFL better at compromising than congress?07/26/2011
This week the NFL announced it had reached an agreement with its players.
Republicans and Democrats? Not so much.
In his recent book, On Compromise and Rotten Compromises, Avishai Margolit, professor emeritus of philosophy at the Hebrew University of Jerusalem, refers to compromise as "an ambivalent concept." On the one hand, we laud those who can preserve friendship or peace through cooperation. On the other hand, we revile those who too readily accede to intransigence. Compromise can be pragmatic and strategic, consider the resolution of the Cuban missile crisis; compromise can be cowardly and weak, consider much of the historic judgment against policies of appeasement during the rise of Nazi Germany. In an environment where words are chosen carefully to frame a perception in order to influence another's thinking, how we conceptualize compromise matters.
Read more about compromise and America at Rethinking Complexity
Why are we all less happy?07/25/2011
In 2009 a major study showed that women were increasingly unhappy in the modern world – and a host of pundits, psychologists, and sociologists asked "What's happened to the fairer sex?"
Was it feminism that was making women less happy? Economic inequality? Higher expectations? Loneliness? Feminism? (That one came up a lot. Apparently people like to blame things on feminism).
Two years later, another data set has been analyzed, and it turns out that the reason more women are unhappy has nothing to do with women. According to the data, we're ALL less satisfied with life than we were 25 years ago.
Why? What does it mean? At the New Existentialists, they have a pretty good idea: it means we've been trying to become happy by proxy, substituting medication and commercialization for an inner life. Turns out that doesn't work.
Catch Saybrook at this year's APA in Washington D.C.07/22/2011
Saybrook University is always well represented at the American Psychological Association, with faculty, alumni, and students making presentations, leading panels, and holding debates.
This year they'll be presenting on everything from using expressive arts in the workplace to the medical uses of hypnosis and the culture of cyberspace.
Saybrook's annual APA convention dinner, sponsored by Dr. Stanley Krippner and the Saybrook Alumni Association, will be held on Friday, August 5, from 6 - 9 p.m., at Clyde's of Gallery Place (707 7th Street, NW, Washington, D.C.).
To RSVP, or for more information, email Saybrook Alumni Director George Aiken, or call: 415-394-5968
A list of Saybrook faculty, student, and alumni presentations at this year's APA (Aug 4-7) is below:
Are poets crazy?07/20/2011
A lot of people seem to think so: the link between "genius" and "madness" is a well established cultural cliche.
Information is not like bread07/19/2011
It seems like we live in an age when politicians and "digerati" believe that universities can be replaced by Twitter – no harm done.
That, suggest Stewart Brand, is because we think that new information is always better. So what Aristotle thought 2000 years ago is always less relevant than what Ashton Kutcher tweeted five minutes ago.
But there are other ways of thinking about information. Here (with a hat tip to Atlantic Blogger Alexis Madrigal) is a passage from one of Brand's books:
Most of this book is Used Information. It is reprinted from various issues of The CoEvolution Quarterly, a California-based peculiar magazine. You can look at that news two ways. If you operate by the Bread Model of Information, it's terrible news. You've been gypped - stale information. On the other hand if you view information as something fundamentally different from bread, there's the possibility of good news. Having lived longer, the information here may be wiser, more co-evolved with the world. It may be more refined, having cycled complexly through the minds and responses of 40,000 CQ readers. And it's been through two editorial distillations; the less-than-wonderful and out-of-date may have been extracted.
The notion that there's value in information that isn't cutting edge is out of fashion in our world, but it may be crucial to understand in the digital age.


text:
Jaleel Awini has confirmed what The Gazette reported Monday - that he intends to play football at the University of Colorado.
In a story on BuffStampede.com, Awini is quoted as saying: "I am going to go to CU. I told their coaches that and they were excited. They think I will bring a little athleticism to the team at quarterback or wide receiver, anywhere."


text:
Circular Needles and some Lime colored yarn that is. This is my first attempt at using two circular needles to make a hat. I am having such a great time as I am making the Hat in this cool Lime Green from Lion Brand. It is cotton and should be nice for the San Francisco Summer.
Since this picture I have frogged and recasted it and back up where this picture was taken yesterday. I was afraid the Borg Queen will dismember me for not complying, but I walk with the Prophets. (stardate 07/27/07)
At the begining I had no idea of what to do, but thanks to a visual tutorial from the internet rfom this website http://www.knittinghelp.com/knitting/advanced_techniques/ I was able to visually see what it was I was suppose to be doing and then adapted the technique to my own. It gave me a great idea to when I decide to follow knitting socks. Thanks for stopping by
I wonder is that yarn blacklight reactive :)
Visit my site: www.sleepyroot.com
Love the lime yarn! What kind is it?
I use the 2 circulars for socks. For sleeves, I will use either the 2 circ's or the 1 long circ. That's some lime green - I imagine you'll glow in the dark!
My life is a Craft, not a blog.
I am hoping to glow in the dark, is very nice color, is not as bright, who am I kidding ha ha ha ha!
2 circs is a great method.
MMario - Can anybody tell me what year it is?


text:
The Accounting and Corporate Regulatory Authority (ACRA) is the Singapore government organisation that provides a company search service in Singapore.
Conduct a Singapore Company Search
The form is very easy to use. The default drop down box is set to Search by Entity Name. This is the correct setting. It's then as easy as entering in the name of the entity that you wish to search in the "Search Details: *" input box.
If you use the option "Starting with" then just enter the first word or characters of the name you are searching for and then press "Search".
After a short delay you will be taken to a page which shows the Search Results. The search results page contains the following information:
- Registration No.(You can click the hyperlink to buy entity information)
- Entity Name
- Partial Address
- Status; and
- Compliance Rating for Annual Filing.
Further information or assistance?
If you need additional help with your company search or the assistance of a forensic accountant, then please don't hesitate to use the simple form below to make contact with a Singaporean forensic accountant who has expertise at conducting corporate background and property searches.


text:
Created: 07/29/2014 3:07 PM WHEC.com
By: Associated Press
A book signing by Hillary Rodham Clinton had hundreds of people lining up for hours in downtown Saratoga Springs.
The potential 2016 presidential candidate was signing copies of her memoir, "Hard Choices," Tuesday at Northshire Bookstore.
There were 1,000 people who bought Clinton's book from the store in advance for a chance to line up and get the former New York senator's signature.
Clinton is making selected stops to promote her book about her four years heading the State Department under President Barack Obama.
News10NBC/WHEC-TV welcomes your opinion and interaction on our website, but please remember to keep it clean. If you're advertising for another business, being profane, vulgar or slanderous your post will be deleted. By commenting on this website, you agree that anything you post may be used, along with your name and profile picture, in accordance with our Privacy Policy and the license you have granted pursuant to our Terms of Use. Comments are not pre-screened before they posted.


text:
Texas on the Potomac
Washington news with a Texas accent
Posts filtered on Category
Analysis: Ted Cruz turning into Rick Perry's worst nightmare in Iowa
"Cruz is a phenomenon that I haven't seen the like of in a long time, probably ever," Bob Vander Plaats told TheIowaRepublican.com. [Read More]
Recording of private phone call 'truly sick', says McConnell campaign manager and Ron Paul confidant
Emails and phone conversations are resurfacing after allegations that the Ron Paul campaign paid thousands of dollars to an Iowa state Sen. to leave Michele Bachmann's presidential campaign in 2011. Paul's former national campaign chairman, Jesse Benton, was recorded in a private phone conversation about the issue. Benton also makes a negative comment in the recording about his boss, Sen. Mitch McConnell. [Read More]
Emails suggest Ron Paul's presidential campaign offered money to Bachmann's Iowa chairman
Michele Bachmann accused the Ron Paul campaign of offering money to her former Iowa Chairman in 2011 to get him to switch teams. Emails and a phone conversation were recently released that may just prove Bachmann's theory that Iowa state Sen. Kent Sorenson was offered a financial incentive to leave her campaign. [Read More]
Rick Perry makes a campaign stop in that great Florida city of … New Orleans
We all know that geography wasn't Rick Perry's best subject at Texas A&M. Neither were "Principles of Economics" or "Organic Chemistry," if you remember that leaked transcript. The Texas governor recently made national news by getting Libya and Lebanon confused. He did it again this week when he transported New Orleans to … well, just read the post by our Austin bureau colleague Peggy Fikac. [Read More]
Hillary Clinton trounces Rick Perry in presidential match-up; Perry, Ted Cruz lag behind in GOP primary
Perry, who says he is thinking and praying about a possible 2016 presidential candidacy, trails the former Secretary of State by 16 percentage points — 52 percent to 36 percent — in a hypothetical general election match-up. The strongest Republicans included in the McClatchy-Marist poll were New Jersey Gov. Chris Christie (6 percentage points behind Clinton) and former Florida Gov. Jeb Bush (down by 8 points). [Read More]
Taxpayer tab for Rick Perry's out-of-state travels now tops $2.6 million since 2010
Trips covered by the latest report include the security detail accompanying Perry to California, where he sought to attract business to Texas; Palm Beach, where he appeared with Florida Gov. Rick Scott at a forum; and Washington, D.C. He spoke at CPAC, the Conservative Political Action Conference, near Washington in March. [Read More]
Ted Cruz places sixth in new Iowa presidential poll; Perry doesn't make the cut
Cruz takes 10 percent in the new poll, trailing frontrunner Rand Paul, the Kentucky senator and fellow Tea Party Republican, New Jersey Gov. Chris Christie, House Budget Committee Chairman Paul Ryan and Florida Sen. Marco Rubio. [Read More]
Video: Rick Perry's supporters talk like he's running for president in 2016
"Our voters like to know and see the candidates a few times before they make them the nominee," said longtime Perry adviser Ray Sullivan. "So there's ample opportunity to prove his abilities and be successful on the trail." [Read More]
Rick Perry will face much tougher field in 2016 GOP presidential race … if he runs
If Rick Perry decides to run for president again in 2016, the man from Paint Creek would face daunting obstacles on the road to the White House. Here are some of Perry's potential rivals and what the Texas governor would need to do to trump them for the nomination. [Read More]
Show More


text:
|Site sponsored by IGEL
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[directfb-users] Re: Unable to disallocate VT
Hi All, Actually i was able to overcome the problem of disallocation of VT. Some how i was able to figure out the problem, looking into the vt.c in the DirectFB/src/core/fbdev directory. It was actually trying to control(using ioctl) the tty0. So this message apears as part of not able to disallocate display memory related to cursor of general purpose mous(GPM). But if i am able to stop GPM & do it, the VT problem no more apears. But with this, there comes another doubt. Why do we need to stop GPM, so that i can use mouse in my DirectFB applications. If i dont stop GPM, then i cant use my mouse in DirectFB applications. Is there any other mechanism to overcome this problem, or stoping GPM is the only way to do it? Thanks again, regards, Bheemesh. > Hello list, > > I am trying to run a simple gtk+ appln on a DirectFB, but getting a message > as unable to disallocte VT. > >prompt i see the following error as: > > ( ! ) DirectFB/core/vt:Unable to disallocate VT! > -->Device or resource busy. > Now here what could be the problem. I expect an early reply from your side. > Thanks in advance. > -- Info: To unsubscribe send a mail to firstname.lastname@example.com with "unsubscribe directfb-users" as subject.
|Old Archives


text:
As everyone has gotten busier, with schedules ever more packed, the save-the-date card has become standard for all weddings. Many couples choose to match their save-the-date card to the theme and feel of their wedding invitations. Others choose a more whimsical approach, perhaps showing off their unique personalities. A photo save-the-date card is a great way to introduce each other to extended family and friends before the first meeting at the wedding.
There are currently no products in this category.
Page: Show All Items


text:
Korab, Balthazar
From Library of Congress Name Authority File
Korab, Balthazar
Instance Of
Scheme Membership(s)
Collection Membership(s)
Exact Matching Concepts from Other Schemes
- found: Author's Gamberaia, 1971.
- found: Encyclopedia of American architecture, c1995: t.p. (Balthazar Korab) p. xi (b. in Hungary in 1926)
- found: New York times WWW site, Jan. 29, 2013 (in obituary published Jan. 26: Balthazar Korab; b. Feb. 16, 1926, Budapest; d. Jan. 15, Royal Oak, Mich., aged 86; lived in Troy, Mich.; one of the leading architectural photographers in the period after World War II when Modernist design remade the American landscape)
Change Notes
- 1980-04-23: new
- 2013-01-29: revised
Alternate Formats


text:
Reebok Men's Tampa Bay Lightning Steven Stamkos #91 Away White Premier Jersey
Product Information:
Go top shelf just like the pros in the Reebok® Men's Tampa Bay Lightning Steven Stamkos #91 Away White Jersey. A lace-up placket at the neck provides comfort while adding authenticity to your fandom. This premier hockey jersey is engineered to duplicate that of your favorite player. It features a twill applique team crest and Stamkos' name and number so you can fit in with the power play unit any day of the week.
- Reebok® premier hockey jersey
- Official team crest embroidered on the front
- Screen-printed twill applique player name and number on the back
- Team logo on the shoulders
- NHL® shield patch on front neck insert
- Lace-up placket at the front neck
- Official NHL® locker tag at left hem
- Officially licensed by the NHL®
- Fabric: 100% polyester pique 2-way stretch body
- Reebok
Country of Origin: ImportedWeb ID: 19228286


text:
Operacion Puerto trial: Fuentes says he may co-operate with anti-doping authorities
Spanish doctor ready to name names as trial heads towards its conclusion
Previous News
Next News
Eufemiano Fuentes, the Spanish doctor at the centre of the Operacion Puerto doping scandal, has stated that he may be prepared to assist anti-doping authorities, including providing the names of the athletes to whom the blood in bags taken by the police as part of the investigation belongs.
According to a report on Yahoo! Eurosport, Fuentes, who is currently on trial in Madrid on public health charges, told reports outside the court: "If they believe that I am useful and they ask me I would consider it and I would be ready.
"What I don't know is if what I could contribute would be worth anything to them or not," he went on, saying that he had a "mutual collaboration" in mind. "If they want my involvement to include the list they would have it."
While cycling has been the sport most under scrutiny in connection with the scandal ever since it broke in 2006, and a number of riders have provided testimony at the trial, Fuentes has always insisted that cyclists accounted for only three in ten of his clients.
The World Anti-Doping Agency (WADA) has asked to be given access to the evidence, including blood bags, seized under the investigation, so far without success.
However, a lawyer for the Spanish government involved in the case said last week that blood samples, but not the bags themselves, would be released to WADA once the trial is over.
Fuentes and his co-defendants face penalties of up to two years' imprisonment if found guilty, with closing statements due to begin on 2 April.
I read a report yesterday that all Puerto blood bags are now accounted for so will be interesting to see which names come up and whether there's any surprises. Also, if Fuentes does start cooperating, there's going to be a lot of squeaky bottoms in the sporting world and not just in cycling.
posted by Sadly Biggins [269 posts]
21st March 2013 - 11:22
Sounds like he is going to plea bargain to me; but yes SB I think there will be some squeaky bottoms. After seeing 'my' sport dragged through the mud it would be nice to see other cheating b's getting some publicity. But is still a sad day for sport in general that we have this sort of 'professional' cheating at all
posted by SideBurn [908 posts]
21st March 2013 - 12:25
Look forward to it. Of course every arm chair sportsman that's been sneering at cycling in the past when presented cheating in tennis, Footie, et al will no doubt say 'We knew of course and anyway - who cares?'
Silly me. You're probably right....
posted by MercuryOne [1161 posts]
21st March 2013 - 14:15
I think it would be healthy if the proverbial hit the fan within other sports. Football, tennis, etc. need exposing. If a snooker player can gain an advantage from PED's (betablockers) then you can bet your bottom dollar that sports where success is so highly rewarded are at it as well.
The Arsenal team were given 'courage pills' as early as 1925, and cortisone enabled injured players to compete throughout the post-war era. Diuretics (Kolo Toure, Shane Warne) are the tip of the iceberg.
posted by Duncan Stone [7 posts]
21st March 2013 - 15:07
I'll believe it when I see it, quite frankly. Think the Spanish authorities would rather the scandal just went quietly away.
In theory, there is no difference between theory and practice, but in practice...
posted by notfastenough [3689 posts]
21st March 2013 - 15:58
An interesting read:
posted by kcr [101 posts]
21st March 2013 - 16:00
Footballers may be involved with the blood bags, but I doubt that tennis will be dragged down as deeply. The evidence at the moment appears to be related to HGH and steroids.
However, if EPO is being used in Tennis is would appear to an interesting development. I figure something EPO has an effect on the top end of sporting activity. After all if you can produce your highest output and effort for a longer period before lactate sets in and inhibits power and energy production it allows you to sustain a level of effort at a higher level for longer. This sort of thing would explain why sprinters have changed their running style and able to break the new world records....but untraceable during competition, and especially without a blood test.
In fact I do not understand why blood testing is not more in depth and widespread. Having read 'The Death of Marco Pantani', it seems to me that evidence can easily be obtained to show abnormal blood values as a result of EPO abuse (though I would expect that mild and infrequent EPO abuse does not indicate the same level of variations and would be harder to detect - micro dosing being 'du jour' amongst the pro-peloton).
I think it is time that international sporting agencies and governments become aware of the major issues within sport and tackle the usage and developments that come about.
posted by Colin Peyresourde [1531 posts]
22nd March 2013 - 14:29


text:
Questions and Answers
Honda Accord Ignition Timing
Q. I have a 1988 Honda Accord LXi in which I just replaced the engine. The difficulty that I am having is understanding what the correct timing is to be set to. The VECI label say "+15° +/- 2° BTDC. The problem is that the markings are hard to read. I see a "T" and also a green dot on the timing section.
Where should I time the car at? The green dot or the T? The Chiltons and Haynes manuals are no HELP! Please assist me.
Thank you,
C. Butler
A. Here's a picture of the timing marks. If you remove the rubber cap from the inspection window of the cylinder block you'll see them. Also, disconnect the vacuum hoses from the vacuum advance diaphragm and pinch off the end of the hoses.
Additional Information provided courtesy of ALLDATA
Additional Information provided courtesy of ALLDATA


text:
Hyjal Summit image requests
Category page
102,844pages on
this wiki
this wiki
Articles in this category have the {{Screenshot}} tag, and the subjects come from the Hyjal Summit instance, also known as the Battle for Mount Hyjal. You can help by uploading images or screenshots that meet the image guidelines.
" Ancient Wisp Level: 70 Hyjal Summit, Caverns of Time Ancient Wisp are floating around Hyjal...Ancient Wisp
" Towering Infernal Level: 72 Caverns of Time, Tanaris Towering Infernals are summoned during the...Towering Infernal
" Skeleton Mage Level: 69 - 70 Hyjal Summit Skeleton Mage can be found in Hyjal Summit. External...Skeleton Mage
Pages in category "Hyjal Summit image requests"
The following 4 pages are in this category, out of 4 total.


text:
Last Activity: 26-Jul-2015 04:09 AM
- User Lists
Visitor Messages
This form is to write a personal message to another user. DO NOT ASK FOR TECH SUPPORT HERE. To ask your tech support question, please go to the forums or read our welcome guide for new members. Thanks for your cooperation!
This form is to write a personal message to another user. DO NOT ASK FOR TECH SUPPORT HERE. To ask your tech support question, please go to the forums or read our welcome guide for new members. Thanks for your cooperation!
Showing Visitor Messages 1 to 10 of 13
- 21-Feb-2013 02:08 AMdpotmshrHello Rollin,
Thank you so much for your help on solving my last macro problem.I am stuck with another problem and could help but dropping you note to help me on this. I have macro to send the mail with attachments via lotus notes and its working fine.But the issue is to encrypt the mails.Can you please advise on how can we encrpt the mails via macro using lotus notes.
- 16-Nov-2011 08:39 AMdenismottuBelated Birthday Wishes...
- 29-Sep-2009 11:27 AMseamansilkHope you can help out an old sailor.
I have a large HTML file I need to split into smaller html files whenever the the character string <html> is entountered in the large file. Might you know of any software that can accomplish this task. All software I found splits the file based on lines and not a specific character string.
Many thanks for your help
- 26-Jun-2009 09:28 AMmchoi
- 04-May-2009 08:48 AMkejothis man is amazing!
- 04-May-2009 04:34 AMraja_hotHi rollin,
Lot of thanks for a random selection of rows solution. Works really good. But in some sheets it is not producing consistent results. Say when we select 5 records it only pick 1 or 2 records.
Can u please help me out in this issue. If needed i will attach those sheets for ur kind reference.
Thanks in advance
- 02-May-2009 05:28 PMkejoRollin_Again thank you for helping here:
can you please look at my reply?
the problem is still needing a solution
- 20-Apr-2009 11:03 PMJaguar3407hey rollin i tried dns flush and everything...my lines are good but every1 i have talked to can't figure it out i took it to a computer tech but they've just put it off and just say, "it's weird" anyways if you could help me out i really need it cause my laptop vidcard crashed and now this and i dont really want to flush 750gigs of data if you could get in touch with me and help me fix this i'd be very happy give me a call if you're cool with that 903-821-8046 thanks again ill try to log on when i can if you dont call thanks for any help you may be able to offer
- 02-Apr-2009 11:08 PMpravinsurvehi Rillin
i am using xp with sp3 and it with 945 intetl original board 1 gb ram 160 gb hdd
i once again installed os now my trading software is working fine i dont now its platform but all rates of stock are change perfect as wel as i can place my buy sell order also but only thing is that browser is not working ff opera as per ur advice i disable all addons but still problem is there pl help me
- 24-Nov-2008 03:24 PMRollin_AgainPlease forward your workbook to rollin_again at hotmail.com
Please include detailed explanation of what you want and the specific cells that are affected. If the workbook isn't sensitive you should just start a new thread with your problem since you will generate much more response. I will be happy to help any way I can. Sending the email automatically should be easy once I have the details.
About Me
- About Rollin_Again
- Location
- Atlanta, GA - Planet Earth
- Occupation
- Systems Engineer
- Experience
- Advanced
Showing Friends 1 to 3 of 3
- computerman29642
- Member
- slurpee55
- Member
- Zack Barresse
- Member


text:
|11.5 in.
|8.8 lbs.
|Base Type:
|Fixed / Plunge
|Collet Capacity:
|1/4 in. / 1/2 in.
|Cord Length:
|8 ft.
|Depth Adjustment Increments (Fixed Base):
|1/64 in.
|Depth Adjustment Range (Fixed Base):
|1-21/32 in.
|Depth Adjustment System:
|Micro-Fine Depth Adjustment
|Handle Style:
|Dual Knob
|Horsepower (Peak):
|No-Load Speeds (RPM):
|10,000 - 24,000
|Plunge Depth:
|2-7/8 in.
|Speed Controls:
|Speed Settings:
|Switch Type:
Reviewed by 2 customers
Sort by
Best Uses
Comments about 2-1/4 Max HP EVS Multi-Base Router Kit:
Easy to handle fixed base with body grip. Plunge base is smooth. Both have easy to set depth for accurate profiles, trimming, or mortising. The case is bulky but has storage spaces for all the accesories that come with this kit; dust collector attachment, fence, 1/2 & 1/4 collets, wrenches, etc. Great package for beginners and professionals. Fixed base can be mounted to a router plate or table and provdes above table height adjustment (it is its own router lift). Variable speed and enough power to handle large bits.
Best Uses
Comments about 2-1/4 Max HP EVS Multi-Base Router Kit:
I have installed the fix base in a router tale and the above the table height adjustment is great. Working with the plunge base is really smooth, in particular the release/locking handle. Although the storage box is good, some of the pieces don't have a lock place (the dust accesory).
Do you have questions about this product?
Get answers from real customers and in-house experts with AnswerBox.
Q:Does this have soft start?
3 answers
A:The 5616-24 does not have the soft start function.
A:The 5616-24 does not have the soft start function.
A:No, this model does not have a soft start.
Q:Is this router a variable speeds unit and if so what speeds will it run at?
1 answer
A:Yes, the router is variable speed. There is a variable speed dial, the rpm's are 10,000 to 24,000.