-
1.发明专利
公开(公告)号：JP2007172602A
公开(公告)日：2007-07-05
申请号：JP2006327595
申请日：2006-12-04
Applicant: Internatl Business Mach Corp
, インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation Inventor： FEIGENBAUM BARRY ALAN
IPC: G06F9/44
CPC classification number: G06F11/3414 , G06F11/3466 , G06F2201/86 , G06F2201/865
Abstract: PROBLEM TO BE SOLVED: To provide a method, computer program, and data processing system for recording GUI events and for persistently identifying the events' target GUI components for subsequent playback of the recorded events.
SOLUTION: According to a preferred embodiment of the invention, each GUI component is assigned a numerical identifier by traversing the component hierarchy in a well-defined order. When the GUI components are accessed during the traversal, the components are numbered sequentially according the order in which the components are accessed. When events are received, they are recorded along with the number corresponding to the target component of the event. Upon subsequent execution of the GUI program, the component hierarchy is traversed again in the same order, which results in the same assignment of identifying numbers to components. Therefore, the recorded events can be played back by applying each event to its corresponding target component, as identified by number.
COPYRIGHT: (C)2007,JPO&INPITAbstract translation: 要解决的问题：提供用于记录GUI事件的方法，计算机程序和数据处理系统，以及用于持续识别事件的目标GUI组件以用于随后重放所记录的事件。
解决方案：根据本发明的优选实施例，通过以良好定义的顺序遍历组件层次来为每个GUI组件分配数字标识符。 当在遍历期间访问GUI组件时，组件按照访问组件的顺序顺序编号。 当事件被接收时，它们被记录在与事件的目标分量相对应的数字上。 在随后执行GUI程序时，以相同的顺序再次遍历组件分层，这导致对组件的标识号的相同分配。 因此，记录的事件可以通过将每个事件应用到其对应的目标分量来播放，如由数字所标识的。 版权所有（C）2007，JPO＆INPIT
-
公开(公告)号：DE3780807T2
公开(公告)日：1993-03-11
申请号：DE3780807
申请日：1987-12-15
Applicant: IBM
Abstract: A data processing system has files stored on disks in a tree structure of directories and files. The system is operated to rapidly open files which have been recently opened or for which partial path information is available, by accessing a drive cache (30) in main memory (16). The cache has entries chained in a tree structure which is then searched to provide the same information during the opening process as that information which would otherwise have to be obtained from a disk (22). When the cache is full, a new entry replaces the least recently used entry.
-
公开(公告)号：PL290801A1
公开(公告)日：1992-03-23
申请号：PL29080191
申请日：1991-06-25
Applicant: IBM
Inventor： FEIGENBAUM BARRY ALAN , SPRINGHETTI RODNEY PETE
Abstract: A data processing system, such as a personal computer, contains bootable disk operating system (DOS) programs that are stored in a read only memory (ROM) as an alternate file system in which the files are stored in packed format. When the system is powered on, the programs are rapidly booted up or loaded from read only memory (ROM) into random access memory (RAM) and executed to "instantly" (as it appears to the user) place the system in operation.
-
公开(公告)号：DE3579860D1
公开(公告)日：1990-10-31
申请号：DE3579860
申请日：1985-07-12
Applicant: IBM
Inventor： FEIGENBAUM BARRY ALAN , SACHSENMAIER ROBERT , SKOWBO JAMES WILLIAM
Abstract: The present disclosure concerns a method for allowing for adoption of names either on a unique basis (association of the name with one and only one entity) or a non-unique basis (association of one name to plural entities), in a data communication system that allows communicating processors to act without reliance on a common directory to adopt logical names for respective locally attached entities (programs, data files, human operators, etc.), and to initiate sessions relative to remote entities by means of communications directed to respective entity names (rather than addresses associated with the physical locations of respective entities). Names adopted on a non-unique basis are flagged as such in the adopting system, and name checking communications directed to such names are ignored by processors serving the respective entity (thereby allowing the checking processors to adopt the respective non-unique name, using the existing procedure for adopting unique names, and thereby enabling processors serving a group of entities to adopt a common name for directing network communications to the entire group concurrently). The disclosure describes specific communication applications made possible by this non-unique naming capability. (Fig. 6)
-
公开(公告)号：BR8503043A
公开(公告)日：1986-03-11
申请号：BR8503043
申请日：1985-06-25
Applicant: IBM
Inventor： FEIGENBAUM BARRY ALAN , SACHSENMAIER ROBERT , SKOWBO JAMES WILLIAM
Abstract: The present disclosure concerns a method for allowing for adoption of names either on a unique basis (association of the name with one and only one entity) or a non-unique basis (association of one name to plural entities), in a data communication system that allows communicating processors to act without reliance on a common directory to adopt logical names for respective locally attached entities (programs, data files, human operators, etc.), and to initiate sessions relative to remote entities by means of communications directed to respective entity names (rather than addresses associated with the physical locations of respective entities). Names adopted on a non-unique basis are flagged as such in the adopting system, and name checking communications directed to such names are ignored by processors serving the respective entity (thereby allowing the checking processors to adopt the respective non-unique name, using the existing procedure for adopting unique names, and thereby enabling processors serving a group of entities to adopt a common name for directing network communications to the entire group concurrently). The disclosure describes specific communication applications made possible by this non-unique naming capability. (Fig. 6)
-
Patent Agency Ranking
公开(公告)号：AT78943T
公开(公告)日：1992-08-15
申请号：AT87118540
申请日：1987-12-15
Applicant: IBM
Abstract: A data processing system has files stored on disks in a tree structure of directories and files. The system is operated to rapidly open files which have been recently opened or for which partial path information is available, by accessing a drive cache (30) in main memory (16). The cache has entries chained in a tree structure which is then searched to provide the same information during the opening process as that information which would otherwise have to be obtained from a disk (22). When the cache is full, a new entry replaces the least recently used entry.
-
公开(公告)号：DE3581310D1
公开(公告)日：1991-02-21
申请号：DE3581310
申请日：1985-04-23
Applicant: IBM
Inventor： FEIGENBAUM BARRY ALAN , GIBBS DENNIS DARRELL , SACHSENMAIER ROBERT
Abstract: Computer systems linked to nodes in a communication network communicate directly with each other to establish name associations for entities (e.g. programs, storage files, etc.) susceptible of being shared across the network, and thereafter communicate further by names (rather than addresses) to establish sessions (i.e. logical connections over the network) between entities. Each system maintains a table of names assigned to locally accessible entities. The name and session establishment processes are architected to avoid dependence on any "central" or "master" system, and to allow for extension of communications relating to these processes across devices linking portions of the network associated with different communication media or channels.
-
公开(公告)号：BR8801438A
公开(公告)日：1988-11-01
申请号：BR8801438
申请日：1988-03-29
Applicant: IBM
Abstract: A data processing system has files stored on disks in a tree structure of directories and files. The system is operated to rapidly open files which have been recently opened or for which partial path information is available, by accessing a drive cache (30) in main memory (16). The cache has entries chained in a tree structure which is then searched to provide the same information during the opening process as that information which would otherwise have to be obtained from a disk (22). When the cache is full, a new entry replaces the least recently used entry.
-
公开(公告)号：DE3743890A1
公开(公告)日：1988-10-27
申请号：DE3743890
申请日：1987-12-23
Applicant: IBM
Abstract: A data processing system has files stored on disks in a tree structure of directories and files. The system is operated to rapidly open files which have been recently opened or for which partial path information is available, by accessing a drive cache (30) in main memory (16). The cache has entries chained in a tree structure which is then searched to provide the same information during the opening process as that information which would otherwise have to be obtained from a disk (22). When the cache is full, a new entry replaces the least recently used entry.
-
公开(公告)号：AU568933B2
公开(公告)日：1988-01-14
申请号：AU4186885
申请日：1985-05-01
Applicant: IBM
Inventor： FEIGENBAUM BARRY ALAN , GIBBS DENNIS DARRELL , SACHSENMAIER ROBERT
Abstract: Computer systems linked to nodes in a communication network communicate directly with each other to establish name associations for entities (e.g. programs, storage files, etc.) susceptible of being shared across the network, and thereafter communicate further by names (rather than addresses) to establish sessions (i.e. logical connections over the network) between entities. Each system maintains a table of names assigned to locally accessible entities. The name and session establishment processes are architected to avoid dependence on any "central" or "master" system, and to allow for extension of communications relating to these processes across devices linking portions of the network associated with different communication media or channels.
-
-
-
-
-
-
-
-
-
Search Results
25
records
(took 0.033 seconds)
