Token Object Research Articles

Differential analysis of token metric and object oriented metrics for fault prediction

Due to the scarcity of resources, testing of each module is not possible for large projects. Thus, calculation of fault prone modules can be used for better resource utilization. A proposed token metric and the available object oriented metrics for forecasting the fault prone modules of an open source project has been proposed. The results from both set of metrics are compared to assess the effectiveness of the planned approach. The results concluded that (1) the proposed metric can be utilized for the calculation of fault prone modules with equivalent accuracy as in the case of object oriented metrics; (2) the token metric and object oriented metrics show opposite trends of results in precision and recall; (3) the proposed metric is much better for projects involving high risks.

On making meanings: Curators, social assembly, and mashups

The central argument of this article is that institutional theory is fundamentally concerned with the creation, distribution, and application of meaning. The field today only recognizes two of these three collective practices: what we term meaning-evangelizing, concern for how actors and institutions distribute and contest meanings; and meaning-applying, how and to what end actors apply existing, established categorical systems and logics to token objects, actors, organizations, and so on. This essay focuses on the third, less studied leg: meaning-making, the construction of the meanings that guide social actors. This essay offers a theoretical path for exploring meaning-making by discussing its actors, actions, and outcomes: the institutional actors who create meanings (such as curators), how they do it ( social assembly), and what is made ( social mashups, i.e., candidate meanings).

Gaze control and memory for objects while walking in a real world environment

Assessments of gaze behaviour and object memory are typically done in the context of experimental paradigms briefly presenting transient static images of synthetic or real scenes. Less is known about observers’ gaze behaviour and memory for objects in a real world environment. While wearing a mobile eyetracker, 20 subjects performed a task in which they walked around a building eight times and were either told to walk normally, or to also expect to be asked about what they saw following their walk. During the course of their walk, nine objects along their path were exchanged for similar token objects of the same category (e.g., whisk broom for push broom). Observers told to prepare for a memory test were much more likely to notice object changes than observers simply told to walk normally (32% vs. 5%). Detected object changes were also fixated for longer duration prior to the change, suggesting a role of task demand in gaze control and the selective storage of visual information.

On the Expressiveness of Communication Channels for Object Nets

In this work we present object net systems, i.e. Petri nets with nets as token objects, which are equipped with channels that allow to transfer net-tokens in the vertical dimension of the nested marking. These channels are a modelling element powerful enough to describe a direct simulation of counter programs which shows that typical net problems like boundedness, coverability, and reachability are undecidable.

Some puzzling findings in multiple object tracking (MOT): II. Inhibition of moving nontargets

We present three studies examining whether multiple object tracking (MOT) benefits from the active inhibition of nontargets, as proposed in Pylyshyn (2004, Visual Cognition). Using a probe-dot technique, the first study showed poorer probe detection on nontargets than on either the targets being tracked or in the empty space between objects. The second study used a matching nontracking task to control for possible masking of probes, independent of target tracking. The third study examined how localized the inhibition is to individual nontargets. The result of these three studies led to the conclusion that nontargets are subject to a highly localized object-based inhibition. Implications of this finding for the FINST visual index theory are discussed. We suggest that we need to distinguish between the differentiation (or individuation) of enduring token objects and the process of making the objects accessible through indexes, with only the latter being limited to 4 or 5 objects.

Does Visual Reference Depend on Sortal Classification? Reply to Clark

Clark's main thesis is, roughly, that the visual system proper is not smart enough to sustain demonstrative reference in the way I describe. Rather, visual information processing has to be helped out by the subject's intelligent use of sortal concepts. I think there are two ways in which his line of thought underestimates the resources available to vision without appeal to the intelligent use of sortal concepts. First, the internal management of information in vision is significantly more sophisticated than Clark allows: in effect he maintains, to make his point, that amodal completion, which does seem demanded by our ordinary use of visual demonstratives, requires the intelligent use of sortal concepts, and we will see that it does not. Secondly, some of the appearance of smartness on the part of the visual system may be owed, not to its internal organization, nor to the subject's intelligent use of sortal concepts, but to the way in which the visual system is embedded in the world of concrete objects. Suppose we think of visual attention to an object as a relation in which the subject stands to a particular concrete thing. The organizing work of the visual systems in the brain may be regulated over time by the particular token object seen, so that visual attention can keep locked on to that particular thing. What does the work is the

Ambient Petri Nets

Both the Ambient Calculus by L. Cardelli and the Elementary Object Systems by R. Valk model the behaviour of mobile systems. The Ambient Calculus is based on the concept of ambient, which is an environment with a given name that is delimited by a boundary, where some internal processes are executed. The main property of these ambients is that they can be moved to a new location thus modeling mobility. Elementary Object Systems are two-level net systems composed of a system net and one or more object nets, which can be seen as high-level token objects of the system net modeling the execution of mobile processes. This paper intends to contribute to the relationship between both frameworks by defining a multilevel extension of Elementary Object Systems, which will be used to provide a denotational semantics of a new process algebra called APBC (Ambient Petri Box Calculus). Such process algebra is an extension of the Petri Box Calculus that includes both ambients and their mobility capabilities, which conversely can be also interpreted as an extension of the Ambient Calculus with the main operations from the PBC.

Intrinsically Worthless Objects as Media of Exchange: Experimental Evidence*

This article reports results from an experiment that examines whether an intrinsically worthless, ‘‘token'’ object serves as a medium of exchange in a laboratory implementation of Kiyotaki and Wright's search model of money. The theory admits Nash equilibria in which the token object is or is not used as a medium of exchange. We find that subjects nearly always offer to trade for the token object when such a trade lowers their storage costs. However, subjects frequently refuse to offer to trade the token object for more costly‐to‐store goods when the theory predicts they should make such trades.

Improvising Machines: Spectral Dance and Token Objects

The author examines the evolution of a system he developed for the creation of two compositions, Spectral Dance and Token Objects, against a backdrop of other composers who have built their own electronic systems. This provides a window on the gradual transformation that has taken place in the way music has been created over the last three decades.

ViewFinder: an object browser

ViewFinder is a graphical tool for browsing in databases that provides a flexible, yet intuitive environment for exploratory searches. The design approach has been to provide maximum functionality and generality without sacrificing simplicity. The constructs of ViewFinder’s external model are essentially object-oriented: class and token objects, membership relationships between tokens and classes, generalization relationships between classes, inheritance, and so on. This external model is based on an internal model which resembles a semantic network. Such a network may be extracted from a variety of data models, including object-oriented, entity-relationship and extended relational models. This architecture gives ViewFinder a large degree of model independence. The main construct of the external model are displays of objects (either classes or tokens), called views. Commands are available for efficient traversal of the database, displaying views of any class or token. To speed up repetitive searches, views may be synchronized: the user sets up several views, linked in a tree-like structure, so that when the information displayed in the root view is modified (e.g. scrolled by the user), the contents of the other views change automatically. Additional commands are available to search, order, aggregate and select the information displayed in a view, thus providing a simple query facility.

An implementation model for reasoning with complex objects

In this paper, we first propose a natural syntactical extension of DATALOG called NESTED_DATALOG for dealing with complex objects represented as nested predicates. Then, we introduce the token object model which is a simple extension of the relational model with tokens to represent complex objects and support referential information sharing. An implementation model of a NESTED_DATALOG program is defined by mapping it to the token object model which remains a straightforward extension of classical logical databases. Through this work, we can accommodate two basic requirements. The availability of a rule language for reasoning with complex objects, and the mechanism for mapping a complex object rule program to a relational DBMS offering a pure DATALOG rule language. In summary, the main contributions of the paper are the definition of a rule language for complex objects and the development of a technique to compile this complex object rule language to classical DATALOG.