Abstract: This disclosure relates to methods for modulating activity of a cell capable of being activated by light and treating diseases with such methods. The disclosure also provides systems suitable for use in such methods, particularly systems having silicon nanostructures.

Abstract: The disclosed technology enables assistance to software developers by identifying the software application code that needs to be changed or behaves differently, as a consequence of a database schema change. The disclosed technology also enables a provision of automatic transformations, or at least hints for the transformation of the code, to accommodate the database schema change.

Abstract: A technique is disclosed for identifying impact of database changes on an application. Given a proposed database change, affected source code is identified that is affected by the proposed database change. References to the affected source code are created and organized into a hierarchy. A user can ascertain the extent of the impact by viewing the hierarchy and by using the hierarchy to access and view the affected source code in a visually distinct manner.

Abstract: A technique is disclosed for identifying impact of database changes on an application. Given a proposed database change, affected source code is identified that is affected by the proposed database change. References to the affected source code are created and organized into a hierarchy. A user can ascertain the extent of the impact by viewing the hierarchy and by using the hierarchy to access and view the affected source code in a visually distinct manner.

Abstract: A technique is disclosed for identifying impact of database changes on an application. Given a proposed database change, affected source code is identified that is affected by the proposed database change. References to the affected source code are created and organized into a hierarchy. A user can ascertain the extent of the impact by viewing the hierarchy and by using the hierarchy to access and view the affected source code in a visually distinct manner.

Abstract: A computer-readable medium is disclosed that tangibly embodies a program of machine-readable instructions executable by a digital processing apparatus to perform operations including determining whether data to be released from a database is associated with one or more confidential mappings between sets of data in the database. The operations also include, in response to the data being associated with the one or more confidential mappings, determining whether release of the data meets one or more predetermined anonymity requirements of an anonymity policy. Methods and apparatus are also disclosed.

Abstract: The disclosed technology enables assistance to software developers by identifying the software application code that needs to be changed or behaves differently, as a consequence of a database schema change. The disclosed technology also enables a provision of automatic transformations, or at least hints for the transformation of the code, to accommodate the database schema change.

Abstract: A technique is disclosed for identifying impact of database changes on an application. Given a proposed database change, affected source code is identified that is affected by the proposed database change. References to the affected source code are created and organized into a hierarchy. A user can ascertain the extent of the impact by viewing the hierarchy and by using the hierarchy to access and view the affected source code in a visually distinct manner.

Abstract: A method is provided for analyzing an object oriented program that supports dynamic class loading. A set A of classes in the program is identified, wherein each class within set A is capable of, during execution of the program, causing the loading of a class outside of set A. A first set of method calls belonging to the classes in set A are identified that, during execution of the program, are capable of calling only methods belonging to a class within set A. A second set of method calls belonging to the classes in set A are identified that, during execution of the program, are capable of calling methods belonging to a class outside set A. Data that identifies the first and the second set of method calls is stored for subsequent use.

Abstract: The invention provides a method for improving the precision of interprocedural alias analysis by efficiently qualifying (naming) dynamically allocated storage locations with call path information and identifying as identical qualified name pairs, one of which is a prefix substring of another. The invention also provides a compact method for representing alias information which improves the efficiency and in some cases, the precision, of alias analysis, by eliminating alias relations that involve more than one level of dereferencing and by eliminating all alias relations that do not contain at least one dereferenced object.

Abstract: By novel use of the Program Call Graph representation of computer programs, this method and apparatus provides a general analysis method for interprocedural bidirection data flow problems in computer software programs. The invention has many uses, including the determination of interprocedural alias analysis of computer software programs which contain pointers.The method starts by constructing a Program Call Graph representation of a computer program with each node of the graph representing a routine of the program. An internal representation of each node is then constructed and initial interprocedural values are associated with appropriate nodes. An interprocedural traversal of the Program Call Graph is performed in which each node is visited; an intraprocedural propagation is performed to develop a new set of interim solution values; and the new interim solution values are interprocedurally propagated. The new interim solution is propagated in a forward and backward direction in one pass of the traversal.

Abstract: The present invention provides a system and method for optimizing or parallelizing computer code typically represented by a source program. The source program is represented by a control flow graph. The present invention includes an optimizer for constructing a compact data flow representation from the control flow graph and a mechanism for evaluating the compact data flow representation in relation to a data flow framework in order to determine a solution to a particular data flow problem. The present invention represents data flow chains compactly, obtaining some of the advantages of Static Single Assignment (SSA) form without modification of program text (i.e., renaming). In addition, the present invention represents compactly certain data flow chains which SSA form fails to represent (i.e. def-def, use-def, and use-use chains).

Abstract: A small capacity digital PBX-key system which uses a single processor to control the system. Since only a single processor is employed, the system is interrupt controlled. In the system, there is a codec per line, the codecs each having sufficient programmability to eliminate the need for time slot interchangers. To provide as many as 64 (or more) channels usable for speech, tones and conferencing, two (or more) parallel, 32 channel busses are used as the group bus. The stations and trunks (ports) of the system have access to both busses through the codecs. Information is routed to one or another bus through the transmission of bus control bits from the processor.

Abstract: A conference circuit capable of controlling a plurality of conferences in PCM format. In this system, a person calling a party busy in a two party conversation and wishing to notify the called party of the call initiates camp-on service. The call is transferred to conference channels. The conference circuit performs a comparison between the loudness of the speech sample from each party in a conference to transmit the loudest sample for a second comparison. The second comparison is made against signals generated for providing camp-on tone to existing calls. The loudest sample output indicated by the second comparison is transmitted to the stations of the conference other than the one having generated the loudest signal.