최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
DataON 바로가기다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
Edison 바로가기다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
Kafe 바로가기국가/구분 | United States(US) Patent 등록 |
---|---|
국제특허분류(IPC7판) |
|
출원번호 | US-0349482 (1999-07-09) |
발명자 / 주소 |
|
출원인 / 주소 |
|
대리인 / 주소 |
|
인용정보 | 피인용 횟수 : 495 인용 특허 : 145 |
An application aware, quality of service (QoS) sensitive, media access control (MAC) layer includes an application-aware resource allocator, where the resource allocator allocates bandwidth resource to an application based on an application type. The application type can be based on input from at le
An application aware, quality of service (QoS) sensitive, media access control (MAC) layer includes an application-aware resource allocator, where the resource allocator allocates bandwidth resource to an application based on an application type. The application type can be based on input from at least one of: a packet header; and an application communication to the MAC layer. The application communication includes: a communication between the application, running on at least one of a subscriber workstation and a host workstation, and the MAC layer, running on at least one of a subscriber CPE station and a wireless base station. The bandwidth resource is wireless bandwidth. The resource allocator schedules bandwidth resource to an IP flow. The IP flow includes at least one of: a transmission control protocol/internet protocol (TCP/IP) IP flow; and a user datagram protocol/internet protocol (UDP/IP) IP flow. The resource allocator in scheduling takes into account resource requirements of at least one of a source application and a destination application of an IP flow. The resource allocator takes into account IP flow identification information extracted from at least one packet header field. The bandwidth resource is wireless bandwidth. The resource allocator allocates switching resource to an application based on an application type. The application type is based on input from at least one of: packet header; and an application communication to the MAC layer. The application communication includes a communication between an application, running on at least one of a subscriber workstation and a host workstation, and the MAC layer, running on at least one of a subscriber CPE station and a wireless base station. The application communication includes a priority class of the IP flow.
An application aware, quality of service (QoS) sensitive, media access control (MAC) layer includes an application-aware resource allocator, where the resource allocator allocates bandwidth resource to an application based on an application type. The application type can be based on input from at le
An application aware, quality of service (QoS) sensitive, media access control (MAC) layer includes an application-aware resource allocator, where the resource allocator allocates bandwidth resource to an application based on an application type. The application type can be based on input from at least one of: a packet header; and an application communication to the MAC layer. The application communication includes: a communication between the application, running on at least one of a subscriber workstation and a host workstation, and the MAC layer, running on at least one of a subscriber CPE station and a wireless base station. The bandwidth resource is wireless bandwidth. The resource allocator schedules bandwidth resource to an IP flow. The IP flow includes at least one of: a transmission control protocol/internet protocol (TCP/IP) IP flow; and a user datagram protocol/internet protocol (UDP/IP) IP flow. The resource allocator in scheduling takes into account resource requirements of at least one of a source application and a destination application of an IP flow. The resource allocator takes into account IP flow identification information extracted from at least one packet header field. The bandwidth resource is wireless bandwidth. The resource allocator allocates switching resource to an application based on an application type. The application type is based on input from at least one of: packet header; and an application communication to the MAC layer. The application communication includes a communication between an application, running on at least one of a subscriber workstation and a host workstation, and the MAC layer, running on at least one of a subscriber CPE station and a wireless base station. The application communication includes a priority class of the IP flow. ology development environment (IODE) for generating database schemas, definitions, tables and corresponding rules sets and integrity constraints from an ontology for a selected common domain and for generating application program interface (API) specifications for at least one target domain within the common domain, comprising: an ontology management system (OMS) containing a formal representation of at least one ontology for a target subject domain and corresponding parent or ancestral domains, the parent domains being shared by one or more target subject domains, wherein the ontology is defined with a number of explicit integrity constraints; a database generator (DBG), the DBG enabling generation of output, the output customized to a type of database, wherein the database is defined-by the target subject domain ontology; and a strongly typed API generator (STAG) generating an Qbject-oriented API for use in programming an application using the target subject domain ontology and corresponding parent or ancestral ontologies to access and use data in a database generated by the DBG, wherein the API maintains integrity of the generated database using the explicit and implicit integrity constraints defined by the hierarchy of ontologies, wherein the automatic generation of a database by the DBG performs rule optimization, and the DBG has an alternate temporal transformation that allows for both stratified and non-stratified rules. 2. A computer implemented (IODE), as recited in claim 1, wherein the DBG generates a database of the type of one of a deductive database, a relational database and an object-oriented database. 3. A computer implemented integrated ontology development environment (IODE) as recited in claim 1, wherein the at least one ontology (i) uses well founded semantics, (ii) takes advantage of unary type-checking predicates for better predicate dependency analysis, and (iii) differentiates between predicates that are time dependent and those predicates that are not time dependent. 4. A computer implemented integrated ontology development environment (IODE) as recited in claim 3, wherein the at least one ontology further uses a specialized type hierarchy to restrict a notion of a type in order to better correlate specification and generation of databases. 5. A computer implemented integrated ontology development environment (IODE) as recited in claim 3, wherein a temporal model is correct with respect to the well founded semantics. 6. A computer implemented integrated ontology development environment (IODE) as recited in claim 3, wherein the OMS creates transform rules to have a well founded semantics temporal model. 7. A computer implemented integrated ontology development environment (IODE) as recited in claim 3, wherein the DBG creates transform rules to have a well founded semantics temporal model. 8. A computer implemented integrated ontology development environment (IODE) as recited in claim 1, wherein the OMS conducts equality reasoning on the at least one ontology and the database generated by the DBG has characteristics allowing equality reasoning to be performed on the database. 9. A computer implemented integrated ontology development environment (IODE) as recited in claim 1, wherein the OMS recognizes predicates for definitional rules, integrity constraints, fixed extents, and transitive closure in the at least one ontology. 10. A method for generating a database and corresponding API from an ontology for a selected common domain for at least one target domain within the common domain, said method comprising the steps of: loading conjunctive normal form (CNF) data into a database generator; handling existential quantification on the CNF data; converting the CNF data to rules; reformulating the rules for performing equality reasoning; breaking negative cycles for deductive databases, and breaking all cycles for relational and object-oriented databases; generating a database specification fo
Copyright KISTI. All Rights Reserved.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.