Abstract: The relative effect that each of a wide variety of factors has on the extent to which a traveler will chain trips was investigated. The objectives were to empirically determine which factors influence a traveler's tendency to chain two or more trips within one tour, as well as the relative significance of these considerations; to more specifically determine the level of influence that urban centers have on trip chaining; and to evaluate the potential effects on trip-chaining behavior of specific transportation demand management (TDM) strategies through examination of variables that describe effects associated with TDM. A negative binomial regression model was developed in which the number of trips in a chain is related to household characteristics, traveler characteristics, trip characteristics, and urban form. After the model was estimated, the significance of individual variables was analyzed. Characteristics from each of these categories were found to be statistically significant. A number of the significant variables help to describe effects of specific TDM strategies, and the relative effects of these variables on trip-chaining behavior were addressed. Some of the variables representing TDM strategies increased the level of trip chaining, whereas other variables decreased the level of chaining. Potential policy conflicts between trip chaining and specific TDM programs are discussed.

Abstract: We apply chaining techniques to automated theorem proving in many-valued logics. In particular, we show that superposition specializes to a refined version of the many-valued resolution rules introduced by Baaz and Fermuller, and that ordered chaining can be specialized to a refutationally complete inference system for regular clauses.

Abstract: The modular exponentiation function used in public key encryption and decryption systems is implemented in a standalone engine having at its core modular multiplication circuits which operate in two phases which share overlapping hardware structures. The partitioning of large arrays in the hardware structure, for multiplication and addition, into smaller structures results in a multiplier design which includes a series of nearly identical processing elements linked together in a chained fashion. As a result of the two-phase operation and the chaining together of partitioned processing elements, the overall structure is operable in a pipelined fashion to improve throughput and speed. The chained processing elements are constructed so as to provide a partitionable chain with separate parts for processing factors of the modulus. In this mode, the system is particularly useful for exploiting characteristics of the Chinese Remainder Theorem to perform rapid exponentiation operations. A checksum mechanism is also provided to insure accurate operation without impacting speed and without significantly increasing complexity. While the present disclosure is directed to a complex system which includes a number of features, the present application is particularly directed to the incorporation and integration of circuits used for calculating a modular multiplicative inverse used as an input parameter to the process.

Abstract: The modular exponentiation function used in public key encryption and decryption systems is implemented in a standalone engine having at its core modular multiplication circuits which operate in two phases which share overlapping hardware structures. The partitioning of large arrays in the hardware structure, for multiplication and addition, into smaller structures results in a multiplier design comprising a series of nearly identical processing elements linked together in a chained fashion. As a result of the two-phase operation and the chaining together of partitioned processing elements, the overall structure is operable in a pipelined fashion to improve throughput and speed. The chained processing elements are constructed so as to provide a partitionable chain with separate parts for processing factors of the modulus. In this mode, the system is particularly useful for exploiting characteristics of the Chinese Remainder Theorem to perform rapid exponentiation operations. A checksum mechanism is also provided to insure accurate operation without impacting speed and without significantly increasing complexity. While the present disclosure is directed to a complex system which includes a number of features, the present application is particularly directed to the overall two-phase system with overlapping hardware components.

Abstract: A method and system for producing, eg, tamper-resistant software such that the software is fault intolerant, thereby complicating hacking attacks, includes undertaking several iterations of forward plain text chaining and backward plain text chaining through the blocks Essentially, during forward chaining a block is scrambles using a single round of an appropriate algorithm such as DES, and then it is XORed with the plain text of the next block The result of the XOR is then scrambled, and then XORed with the plain text of the next block, and so on At the end of the stream, the process is repeated in reverse, from last block to first The cycles are repeated for the desired number of rounds, eg, 16

Abstract: We study the problem of how a computer program can learn, by interacting with an environment, to return an algorithm for solving a class of problems. The two example domains studied in this paper are Blocks World stacking problems and Rubik's Cube. Our approach is to simulate the evolution of an artificial economy of computer programs called "agents". Simple rules imposed on the economy result in credit assignment, factoring the problem of evolving an overall program for the class of problems into simpler problems of evolving agents that specialize on aspects of the problem and collaborate to solve the overall class. In this paper our agents are Post Production Systems. Our system, called Hayek4, has learned from random examples a program that solves arbitrary block stacking problems. The program essentially consists of about 5 learned rules and some learned control information. Solution of an instance with n blocks in its goal stack requires the automatic chaining of the rules in correct sequence about 2n deep. Hayek4 has also learned to correct Rubik's cubes scrambled with up to about 7 random rotations. These results can also be seen in the automatic theorem proving context as a way to learn domain knowledge allowing one to automatically generate compact proofs.

Abstract: This paper discusses a system for online new event detection in the domain of news articles on the web. This area is related to the Topic Detection and Tracking initiative. We evaluate two benchmark systems: The first like most current web retrieval systems, relies on term repetition to calculate document relatedness. The second attempts to perform conceptual indexing through the use of the WordNet thesaurus software. We propose a novel approach for the identification of breaking news stories, which uses a technique called lexical chaining. We believe that this technique will improve the overall performance of our web retrieval system by allowing us to encapsulate the context surrounding a word and disambiguate its senses.

Abstract: A method for providing security to a chaining of useful operations of the same type, performed by an electronic circuit executing an algorithm, randomly introduces one or more dummy operations in the chaining of operations. This prevents any fraudulent access to protected data through a statistical analysis of electrical currents.

Abstract: PROBLEM TO BE SOLVED: To attain high speed decoding of encrypted data in an operation mode by a CBC system or a CFB system or the like in a DES encryption mechanism or the like. SOLUTION: A DES computing unit 310 (320) is provided with a next arithmetic operation use changing value generating section 314 (324). In the DES computing unit 310, in parallel with decoding processing of encrypted text data 301 by an encryption core section 315, the next arithmetic operation use chaining value generating section 314 generates a next arithmetic operation use chaining value 330 and gives the result to the DES computing unit 320. An encryption core section 323 executes decoding processing of next encryption text data 303 by using the chaining value in overlapping with the decoding processing by the DES computing unit 310 and the next arithmetic operation use the chaining value generating section 324 generate a next arithmetic operation use chaining value 331 similarly in parallel with the execution and gives it to be DES computing unit 310.

Abstract: SODAS is a modular software in which each statistical method is manipulated as an icon and icons are linked in a chaining. A method is a module of statistical computation which is predefined in SODAS. A method is inserted (or suppressed) in a chaining using the ‘drag and drop’ procedure between two windows: the method window and the chaining window.

Abstract: Knowledge-Based Expert Systems (KBES) have long been widely used to perform tasks that normally require human knowledge and intelligence. One important issue that has not been addressed satisfactorily in the existing KBESs is that they try to make posing queries simple by letting the users specify what they want to compute rather than how to compute it. In this paper, we show that the solutions computation process can be modeled with Constraint Satisfaction Problem (CSP) techniques, employing their simple representation schemes and consistency techniques. The motivation behind this is the desire to build up a computation model for reducing the vast amount of deductions required by a KBES when executed on a logic program system. A key idea is to represent the relations among the rules as constraints and to integrate the rule chaining with constraint solving. In this integration, the constraints are regarded as special facts at each node of the solutions graph, and the constraints propagation may cause firing of rules. In this way the model allows the solutions graph to grow progressively by enumerating the solutions of the system of constraints and validating the rules associated to these constraints. The approach to accomplish this is to spend more time in each node of the solutions graph by reducing the sets of possible values for not-yet-assigned variables. The model is introduced as a general control mechanism and realizes an a priori pruning in the solutions graph. This is done by assuming that the only rules to be considered are those arising from the propagation of their constraints and by computing only the rules that acquired some domain-dependent information about the significance of various domain interactions.

Abstract: Application program on integrated circuit has list of command pointers, chaining list for commands each of which has a class each of which has a list of configurable parameters. Each class has a command builder and a search routine for next command and its parameters. An Independent claim is included for the method of managing an application program used in the described integrated circuit.

Abstract: This paper addresses the problem of synthesizing fault-secure controller/data path circuits from behavioral specifications. These circuits are guaranteed to either produce the correct output, or to flag an error. We use an iterative improvement-based behavioral synthesis framework that performs functional unit selection, clock selection, scheduling, and resource sharing with the aim of minimizing the area of the synthesized circuit, while allowing multicycling, chaining, and functional unit pipelining. We present a dynamic comparison selection algorithm that can be used during behavioral synthesis to determine which intermediate results in the computation need to be secured in order to enable maximal resource sharing. Previous work on synthesizing fault-secure data paths has focused on ensuring that aliasing (a condition when the circuit produces an incorrect output and does not flag an error) cannot occur in any part of the design. We demonstrate that such an approach can lead to unnecessarily large overheads. In order to alleviate the overheads incurred for fault security, our behavioral synthesis framework uses ALiasing Probability analysiS (ALPS) in order to identify resource sharing configurations that reduce area while introducing a very low probability of aliasing (of the order of 10/sup -10/ for a bit-width of 32) in the resultant data path. Experimental results performed for several behavioral descriptions demonstrate that our techniques synthesize more compact circuits than techniques available in the literature, e.g., double modular redundancy or zero-aliasing techniques.

Abstract: In the high-level synthesis of ASICs or in the code generation for ASIPs, the presence of conditionals in the behavioral description represents an obstacle to exploit parallelism Most existing methods use greedy choices in such a way that the search space is limited by the applied heuristics For example, they might miss opportunities to optimize across basic block boundaries when treating conditional execution We propose a constructive method which allows generalized code motions Scheduling and code motion are encoded in the form of a unified resource-constrained optimization problem In our approach many alternative solutions are constructed and explored by a search algorithm, while optimal solutions are kept in the search space Our method can cope with issues like speculative execution and code such duplication Moreover, it can tackle constraints imposed by the advance choice of a controller, such as pipelined-control delay and limited branch capabilities The underlying timing models support chaining and multicycling As tasking code motion into account may lead to a larger search space, a code-motion pruning technique is presented This pruning is proven to keep optimal solutions in the search space for cost functions in terms of schedule lengths

Abstract: Trip chaining is a growing phenomenon in travel and activity behaviour Individuals increasingly seek out opportunities to minimise the amount of travel required as part of activity fulfilment, given the competing demands on time budgets and their valuation of travel time savings This search for ways of fulfilling (more) activities with less travel input has produced a number of responses, one of which is trip chaining A particularly important policy implication of trip chaining is the potential barrier it creates in attracting car users to switch to public transport This paper seeks to improve our understanding of trip chaining as a barrier to public transport use A series of discrete choice models are estimated to identify the role that socio-economic and demographic characteristics of households have on the propensity to undertake trip chains of varying degrees of simplicity/complexity that involve use of the car or public transport with an embedded commuting or non-commuting primary purpose Multinomial logit, nested logit and random parameter logit models are developed and contrasted to establish the gains in relaxing the strict conditions of the multinomial logit model