scispace - formally typeset
Search or ask a question

Showing papers on "Class (philosophy) published in 2009"


Proceedings ArticleDOI
13 Oct 2009
TL;DR: It is shown how to detect the degree of "godliness" of classes automatically and distinguish between those classes that are so by design from those that occurred by accident (bad code).
Abstract: "God class" is a term used to describe a certain type of large classes which "know too much or do too much". Often a God class (GC) is created by accident as functionalities are incrementally added to a central class over the course of its evolution. GCs are generally thought to be examples of bad code that should be detected and removed to ensure software quality. However, in some cases, a GC is created by design as the best solution to a particular problem because, for example, the problem is not easily decomposable or strong requirements on efficiency exist. In this paper, we study in two open-source systems the "life cycle" of GCs: how they arise, how prevalent they are, and whether they remain or they are removed as the systems evolve over time, through a number of versions. We show how to detect the degree of "godliness" of classes automatically. Then, we show that by identifying the evolution of "godliness", we can distinguish between those classes that are so by design (good code) from those that occurred by accident (bad code). This methodology can guide software quality teams in their efforts to implement prevention and correction mechanisms.

84 citations


Journal ArticleDOI
TL;DR: This work proposes a new statistical framework based on relevance feedback to locate an instance of a semantic category in an unstructured image database with no semantic annotation and contains a Bayesian formulation which scales to large databases.
Abstract: Starting from a member of an image database designated the "query image," traditional image retrieval techniques, for example, search by visual similarity, allow one to locate additional instances of a target category residing in the database. However, in many cases, the query image or, more generally, the target category, resides only in the mind of the user as a set of subjective visual patterns, psychological impressions, or "mental pictures." Consequently, since image databases available today are often unstructured and lack reliable semantic annotations, it is often not obvious how to initiate a search session; this is the "page zero problem." We propose a new statistical framework based on relevance feedback to locate an instance of a semantic category in an unstructured image database with no semantic annotation. A search session is initiated from a random sample of images. At each retrieval round, the user is asked to select one image from among a set of displayed images-the one that is closest in his opinion to the target class. The matching is then "mental." Performance is measured by the number of iterations necessary to display an image which satisfies the user, at which point standard techniques can be employed to display other instances. Our core contribution is a Bayesian formulation which scales to large databases. The two key components are a response model which accounts for the user's subjective perception of similarity and a display algorithm which seeks to maximize the flow of information. Experiments with real users and two databases of 20,000 and 60,000 images demonstrate the efficiency of the search process.

56 citations


Proceedings ArticleDOI
02 Aug 2009
TL;DR: This paper presents a system named ASIA (Automatic Set Instance Acquirer), which takes in the name of a semantic class as input and automatically outputs its instances and shows excellent performance on several English-language benchmarks, thus demonstrating language-independence.
Abstract: An important and well-studied problem is the production of semantic lexicons from a large corpus. In this paper, we present a system named ASIA (Automatic Set Instance Acquirer), which takes in the name of a semantic class as input (e.g., "car makers") and automatically outputs its instances (e.g., "ford", "nissan", "toyota"). ASIA is based on recent advances in web-based set expansion - the problem of finding all instances of a set given a small number of "seed" instances. This approach effectively exploits web resources and can be easily adapted to different languages. In brief, we use language-dependent hyponym patterns to find a noisy set of initial seeds, and then use a state-of-the-art language-independent set expansion system to expand these seeds. The proposed approach matches or outperforms prior systems on several English-language benchmarks. It also shows excellent performance on three dozen additional benchmark problems from English, Chinese and Japanese, thus demonstrating language-independence.

56 citations


Proceedings ArticleDOI
24 Mar 2009
TL;DR: This work proposes an efficient algorithm to process class of "entity package finder" queries, over large corpora, and devise early pruning and termination strategies, in the presence of joins and aggregations, that do not depend on any estimates.
Abstract: Text corpora are often enhanced by additional metadata which relate real-world entities, with each document in which such entities are discussed. Such relationships are typically obtained through widely available Information Extraction tools. At the same time, interesting known associations typically hold among these entities. For instance, a corpus might contain discussions on hotels, cities and airlines; fixed associations among these entities may include: airline A operates a flight to city C, hotel H is located in city C.A plethora of applications necessitate the identification of associated entities, each best matching a given set of keywords. Consider the sample query: Find a holiday package in a "pet-friendly" hotel, located in a "historical" yet "lively" city, with travel operated by an "economical" and "safe" airline. These keywords are unlikely to occur in the textual description of entities themselves, (e.g., the actual hotel name or the city name or the airline name). Consequently to answer such queries, one needs to exploit both relationships between entities and documents (e.g., keyword "pet-friendly" occurs in a document that contains an entity specifying a hotel name H), and the known associations between entities (e.g., hotel H is located in city C).In this work, we focus on the class of "entity package finder" queries outlined above. We demonstrate that existing techniques cannot be efficiently adapted to solve this problem, as the resulting algorithm relies on estimations with excessive runtime and/or storage overheads. We propose an efficient algorithm to process such queries, over large corpora. We devise early pruning and termination strategies, in the presence of joins and aggregations (executed on entities extracted from text), that do not depend on any estimates. Our analysis and experimental evaluation on real and synthetic data demonstrates the efficiency and scalability of our approach.

38 citations


Journal ArticleDOI
TL;DR: It is found that the structure of the solutions is independent of the orders @f,@j and @ f, and can perform important functions in many analysis and design problems in linear systems.

38 citations


Proceedings ArticleDOI
11 Aug 2009
TL;DR: It is shown that there are equations not in lambda-beta (resp. Lambda-beta-eta) which hold in all (extensional) iweb-models, which are obtained by isolating among the reflexive Scott domains a class of webbed models arising from Scott's information systems, called i web-models.
Abstract: A longstanding open problem is whether there exists a model of the untyped lambda calculus in the category CPO of complete partial orderings and Scott continuous functions, whose theory is exactly the least lambda-theory lambda-beta or the least extensional lambda-theory lambda-beta-eta In this paper we analyze the class of reflexive Scott domains, the models of lambda-calculus living in the category of Scott domains (a full subcategory of CPO) The following are the main results of the paper: (i) Extensional reflexive Scott domains are not complete for the beta-eta-calculus, ie, there are equations not in lambda-beta-eta which hold in all extensional reflexive Scott domains(ii) The order theory of an extensional reflexive Scott domain is never recursively enumerable These results have been obtained by isolating among the reflexive Scott domains a class of webbed models arising from Scott's information systems, called iweb-models The class of iweb-models includes all extensional reflexive Scott domains, all preordered coherent models and all filter models living in CPO Based on a fine-grained study of an ``effective'' version of Scott's information systems, we have shown that there are equations not in lambda-beta (resp lambda-beta-eta) which hold in all (extensional) iweb-models

13 citations


01 Jan 2009
TL;DR: In this paper, the authors propose a novel approach to solve the problem of homonymity in homophily, called homophyphyphanyphanymyphys.
Abstract: ................................................................................................ vii CHAPTER

13 citations


Journal ArticleDOI
Amel Mammar1
TL;DR: This paper describes a systematic approach to identify preconditions that take a larger class of invariants into account, and the key idea is the definition of rewriting and simplification rules that are applied to the B invariants.
Abstract: Maintaining integrity constraints in information systems is a real issue. In our previous work, we have defined a formal approach that derives B formal specifications from a UML description of the system. Basically, the generated B specification is composed of a set of variables modeling data and a set of operations representing transactions. The integrity constraints are directly specified as B invariant properties. So far, the operations we generate establish only a reduced class of constraints. In this paper, we describe a systematic approach to identify preconditions that take a larger class of invariants into account. The key idea is the definition of rewriting and simplification rules that we apply to the B invariants.

10 citations


Journal Article
TL;DR: In this article, the effectiveness of a balanced amalgamated approach to teaching graduate level introductory statistics was investigated, which combines effective lecturing with active learning and team projects to improve student cognition and morale.
Abstract: This study considers the effectiveness of a “balanced amalgamated” approach to teaching graduate level introductory statistics. Although some research stresses replacing traditional lectures with more active learning methods, the approach of this study is to combine effective lecturing with active learning and team projects. The results of this study indicate that such a balanced amalgamated approach to learning not only improves student cognition of course material, but student morale as well. An instructional approach that combines mini-lectures with in-class active-learning activities appears to be a better approach than traditional lecturing alone for teaching graduate-level students.

10 citations


Journal ArticleDOI
TL;DR: In this article, an equivalent definition of packing dimension is given for a set in d-dimensional Euclidean space by using its component sets as packings, applied to determine the packing dimensions of a class of subsets with prescribed relative group frequencies.
Abstract: An equivalent definition of packing dimension is given for a set in d-dimensional Euclidean space by using its component sets as packings. It is applied to determine the packing dimensions of a class of subsets with prescribed relative group frequencies.

8 citations



14 Apr 2009
TL;DR: In this paper, the authors take as their starting point the ground-breaking claims of Sir John Lyons in his work on deixis and anaphora in the 1970s and early 1980s, developing the pioneering work of Karl Buhler.
Abstract: This paper takes as its starting point the ground-breaking claims of Sir John Lyons in his work on deixis and anaphora in the 1970s and early 1980s, developing the pioneering work of Karl Buhler: in particular, the basic insight that deixis is the source of reference. Flowing from this are the claims that anaphora is derivative upon deixis, and that there is an intimate relationship holding within the world's languages between modality and deixis. Lyons's hypothesis is that this asymetrical, "oriented" relation between deixis and anaphora is apparent in the very functioning of discourse in context: for while anaphora serves to refer back to the intensional correlates of entities already present within a given "universe of discourse", deixis is one (central) means of actually entering these discourse representations into such a universe. Taking inspiration from Lyons's conception, deixis and anaphora are conceived here as procedures for coordinating the speech participants' attention throughout the flow of text as produced within a given context to which they are party. These indexical referring procedures are by no means mutually exclusive: indeed, indexical reference is an inherently "scalar" phenomenon; for the continuous nature of the relation between strict deixis and strict anaphora, passing through "anadeixis" (a hybrid procedure type partaking of both these context-bound referring procedures) as an intermediate phase, reflects the priority of deixis over anaphora, which presupposes it both ontogenetically and phylogenetically. 'Strict' anadeictic and discourse-deictic uses both involve reference via the discourse context upstream of the occurrence of a given demonstrative expression; but while the 'strict' anadeictic function consists in simply retrieving a referent already present within a representation of the previous discourse by "pointing" toward it indexically, the discourse-deictic one requires the addressee or reader to operate upon a relevant contextual discourse representation in order to create a referent which was not present as such initially. Anadeictically-functioning demonstrative NPs may perform a discourse-structuring function, by heralding a transition between major discourse units within a given text. They realise this by shifting a hitherto individual-level reference from a macro-topical entity to a more generic class of referents that includes the one(s) in focus up to this point. It is the deictic property of demonstratives, coded morphologically via their proximal vs. distal character, along with the nature of the predicative component of the expression where it is a lexical NP (which as such may not correspond to presupposed information, but rather to a (re-)classifying or implictly-predicating function) which enable such expression types to perform the discourse-structuring roles at issue here.

Patent
IV Robert A. Butler1
06 Aug 2009
TL;DR: In this article, a method for mapping a data model to an object model comprising of an ontology is presented, where a concept classifies a Resource Description Framework (RDF) expression stored in a knowledge store.
Abstract: According to one embodiment, a method for mapping a data model to an object model comprising receiving an ontology. The ontology provides a definition of a concept. The concept classifies a Resource Description Framework (RDF) expression stored in a knowledge store. A mapping file is generated. The mapping files defines a mapping relationship between the concept and an object representation of the concept. A class is generated according to the object representation of the concept. The class provides a class definition of an object. The object is generated according to the class definition. The object is mapped to the RDF expression according to the mapping relationship.

Patent
James P. Schneider1
29 May 2009
TL;DR: In this article, an apparatus and a method for managing class properties in a computer program is described, where classes are associated with a corresponding property with at least one class inheriting one or more property corresponding to one or many other classes.
Abstract: An apparatus and a method for managing class properties in a computer program is described. Classes are declared. Each class is associated with a corresponding property with at least one class inheriting one or more property corresponding to one or more other classes. A table generator forms a table of property offsets associated with each class. The table is copied forward with each inheritance declaration. A reference to a property of a class is resolved by retrieving the table associated with a current instance's class and resolving from the table associated with the class corresponding to an object from which the property is referenced.

01 Jul 2009
TL;DR: It is claimed that personal pronouns in Japanese are neither D 0 nor N 0, but rather they sit in Spec position within (a certain extended projection of) the nominal phrase, and that these three types of nominal elements form a single, natural class i.e., Indexical class, and are merged in a designated position within nominal phrases, which is identified as SpecCaseP.
Abstract: This paper shows that personal pronouns in Japanese are neither D 0 nor N 0 , but rather they sit in Spec position within (a certain extended projection of) the nominal phrase. Evidence comes from close examination of the so-called pronoun-noun construction in this language. Despite its name, the preceding nominals in this construction can be proper names or demonstrative phrases followed by an associative marker -tachi, as well as personal pronouns. I claim that these three types of nominal elements form a single, natural class i.e., Indexical class, and that they are merged in a designated position within nominal phrases, which is identified as SpecCaseP. I further argue that these Indexical nominals are syntactically distinguished from intensional, property-denoting lexical nominals. In a nutshell, CaseP is the locus of reference-fixing, where properties or intensions denoted by a lexical nominal are related to individuals directly referred to by an Indexical, extensional nominal in SpecCaseP.

Journal Article
22 Dec 2009-Style
TL;DR: In this paper, the first mention of a particular literary character within the text world may be termed the first co-reference choice, and it is typical for some form of the proper name to perform this function.
Abstract: Introduction Co-reference chains are formed from out of that set of conceptually coherent choices by which the narrator establishes reference to a particular literary character (Halliday and Hasan; Toolan Language; Emmott Narrative; Emmott "Reference"). As Robert de Beaugrande argues, co-reference involves "the application of different surface expressions to the same [character] in a textual world" (133). Literary characters may be referenced by some form of the proper name, a definite description, a general class word or a pronoun, or an agent metonym. The stability of a particular co-reference chain derives from the writer's frequent use of some form of the proper name alternating in expected ways with the relevant pronoun. Critics have long recognized that this basic pattern may be varied for creative purposes, citing a distinction between writers who utilize stable co-reference and other writers, such as Henry James, who employ "elegant variation" (Short; Leech and Short). Far from being an issue of individual whim, however, unexpected co-reference choice is a strategic part of the narrator's management of the plot (Emmott, Narrative, 61 n34). Writers possess different voiceprints, which can be discovered by an analysis of their word frequencies. Character co-reference, which lies on the borders of grammar and lexis, would appear to differ from writer to writer, in ways that contribute meaningfully to the reader's enjoyment and comprehension of the stories they tell (Burrows; Hoover). In James Joyce's Dubliners, for example, the stories divide up into a large set that employs stable co-reference and a smaller set of narratives that make purposeful use of marked choices as part of their aesthetic design. In "Counterparts," co-reference choice serves to create distance from the central character. In "Eveline, the co-reference pattern helps establish a text world that is vague and half-irresolute, a world that is appropriate to the story's theme. in "A Little Cloud," a persistent pattern of discrepant co-reference choices serves to undermine the prospects of one character and bolster those of another. In both "The Sisters" and "The Dead," co-reference choice enacts local patterns of character defamiliarization in order to suggest secrets and make revelations. In both stories, the co-reference choices to the pivotal character are particularly marked; these patterns set apart that character whose function it is to send the main character on a journey of inward discovery. The Conceptualization and Maintenance of Literary Character For Paul Werth, the establishment of characters is one of the basic tasks in building a text world. "A world is first defined by deictic expressions of place and time, and is then furnished with [characters] by reference establishment" (Werth 158). For Werth, reference maintenance involves procedures for keeping those characters active within the narrative fiction. This procedure involves "the chaining of references to a single [character] to preserve continuity ... with clear guidelines to handle cases of reference-crossing" (Werth 158). Understood in this way, the task of the reader is an continual act of conceptualizing, monitoring and occasionally discarding one or other of the set of characters established at the story's outset (Werth; Emmott, Narrative). First Co-Reference Choice A central aspect of text-world building relates to the different surface expressions that may be used to reference each of the characters. This is because each of the major characters will form part of a character network consisting of about seven or eight "control centres" for subsequent plot elaboration. For this reason, the manner in which the narrator chooses to refer to each character is of importance (Beaugrande; Propp, Murphy, "Pivoted"). The first mention of a particular literary character within the text world may be termed the first co-reference choice. In James Joyce's Dubliners, it is typical for some form of the proper name to perform this function. …



01 Jan 2009
TL;DR: In this article, a general definition of abstract strategies is presented, which is extensional in the sense that a strategy is defined explicitly as a set of derivations of an abstract reduction system.
Abstract: This paper is a contribution to the theoretical foundations of strategies. We first present a general definition of abstract strategies which is extensional in the sense that a strategy is defined explicitly as a set of derivations of an abstract reduction system. We then move to a more intensional definition supporting the abstract view but more operational in the sense that it describes a means for determining such a set. We characterize the class of extensional stra tegies that can be defined intensionally. We also give some hints towards a logical characterization of intensional strategies and propose a few challenging perspectives.

Journal ArticleDOI
TL;DR: In this paper, it was shown that even the Tarskian correspondence is true if and only if the snow is white, which requires processes of formation and recognition which are at the basis of knowledge.
Abstract: Starting from Bateson's insight that our mind acts by identifying differences and ༀ・ltering thesethroughsuccessivelevels,asimpleformalsymbologyisproposedtorepresentthebasicelements ofknowledgeandcommunication-description,deༀ・nitionanddenomination-inordertodemonstrate how the cognitive process can be linked to a succession of acts entailing distinction, description, deༀ・nitionand recognition. After deༀ・ningthe notion of the Observational Universe as a vector of di� mensions through which the observer ༀ・ltersreality, we construct a technical description (not yet ad� opting speciༀ・clanguage) as a vector of the determinations of those dimensions for a speciༀ・cobject "O".Thankstotheinnateprocessofanalogyandanalogicalgeneralization,westartfromdescriptions repeated for a set of objects - held to be analogous, though different - in order to arrive at the tech� nical deༀ・nitionof a "general object O*", which in fact represents the concept (idea) of O* as well as the meaning (signiༀ・ed)of the signs that denote it. Gaining knowledge of the world means carrying outdescriptionsof"O",constructingdeༀ・nitionsof"O*"throughwhichtheobservergainsknowledge of "O*" as a class of all "Os" and recognizes the latter as elements (examples) of "O*". The same symbology is applied to deༀ・nethe basic elements of the process of linguistic denomination and the formation of languages through a signiༀ・cationprocess that couples a technical deༀ・nitionof "O*" - which represents the signiༀ・edof the "general sign S*" - to the technical deༀ・nitionof "S*", which represents the signiༀ・erof "O*". Communication is the basis for the arguments made in the ༀ・nalpart of the paper, where it is demonstrated that even the the Tarskian correspondence�truth«"the snow is white" is true if and only if the snow is white» requires processes of deༀ・nitionand description which are at the basis of knowledge.

Patent
29 Oct 2009
TL;DR: In this paper, the problem of generating a class structure concerning component design is addressed, where a service interface definition table, a table definition table and an inter-service interface dependency definition table are defined as bases.
Abstract: PROBLEM TO BE SOLVED: To generate a class structure concerning component design. SOLUTION: A service interface definition table, a table definition table, an inter-service interface dependency definition table, a service interface-table dependency definition table, a service input/output definition table, a table use method definition table, and an inter-class dependency template definition table, etc., which are inputted via an input part 30, are defined as bases. Based on the above tables, a processing part 10 generates a class, stores information concerning the generated class in a class definition table, generates information concerning inter-class dependency, stores the information in an inter-class dependency definition table, generates information concerning the dependency between the class and the table, and stores the information in a class-table dependency definition table, etc. A display part displays the information stored in the class definition table, the inter-class dependency definition table, and the class-table dependency definition table, thereby displaying the class structure. COPYRIGHT: (C)2010,JPO&INPIT

Journal ArticleDOI
TL;DR: There exist bounded analytic functions, which cannot be represented as the generalized convolution of two bounded analytic function, as a consequence of the finding the necessary and sufficient conditions for the inclusion P"1@?P"2@?"mP"3.
Abstract: Denote by H the class of functions analytic in the unit disc. For two functions f(z)=@?"n"="0^~a"nz^n and g(z)=@?"n"="0^~b"nz^n of the class H and for given complex m we define the generalized convolution of the form (f@?"mg)(z)=a"0b"0+m@?"n"="1^~a"nb"nz^n. By P"i we denote the classes of functions f@?H subordinated to the linear fractional transformations (@a"i+@b"iz)/(1-@c"iz), where @b"i+@a"i@c"i 0,|@c"i|@?1 and i=1,2,3. The purpose of this paper is to find the necessary and sufficient conditions for the inclusion P"1@?P"2@?"mP"3, where P"2@?"mP"3={f@?"mg:f@?P"2,g@?P"3}. As a consequence of this result we obtain, there exist bounded analytic functions, which cannot be represented as the generalized convolution of two bounded analytic functions.

Posted Content
TL;DR: Freyd, Mulry, Rosolini and Scott as mentioned in this paper introduced a category of "pointed complete extensional PERs" and computable maps to provide an instance of an algebraically compact category relative to a restricted class of functors.
Abstract: In the paper "Extensional PERs" by P. Freyd, P. Mulry, G. Rosolini and D. Scott, a category $\mathcal{C}$ of "pointed complete extensional PERs" and computable maps is introduced to provide an instance of an \emph{algebraically compact category} relative to a restricted class of functors. Algebraic compactness is a synthetic condition on a category which ensures solutions of recursive equations involving endofunctors of the category. We extend that result to include all internal functors on $\mathcal{C}$ when $\mathcal{C}$ is viewed as a full internal category of the effective topos. This is done using two general results: one about internal functors in general, and one about internal functors in the effective topos.

Posted Content
TL;DR: In this article, the authors investigated the fields of definition up to isogeny of the abelian varieties called building blocks and gave a characterization of these fields in terms of their associated Galois cohomology class.
Abstract: This paper investigates the fields of definition up to isogeny of the abelian varieties called building blocks. A result of Ribet characterizes the fields of definition of these varieties together with their endomorphisms, in terms of a Galois cohomology class canonically attached to them. However, when the building blocks have quaternionic multiplication, then the field of definition of the varieties can be strictly smaller than the field of definition of their endomorphisms. What we do is to give a characterization of the fields of definition of the varieties in this case (also in terms of their associated Galois cohomology class), by translating the problem into the language of group extensions with non-abelian kernel. We also make the computations that are needed in order to calculate in practice these fields from our characterization.

Book ChapterDOI
01 Jan 2009
TL;DR: In this paper, the authors discuss the unique and persistent surfaces of the source and analyze the judgment making of scientists in grouping, generalizing, and then identifying similarities within difference through the classification of common form.
Abstract: This chapter discusses the unique and persistent surfaces of the source. Form is the similar general shape that many objects have in common, which allows grouping or classification rules to be established. The chapter further analyzes the judgment making of scientists in grouping, generalizing, and then "identifying similarities within difference" through the classification of common form. Terminology is imprecise when describing the blending of features of uniqueness into other features of uniqueness. A generalized name of a uniquely patterned feature is a tool to verbally describe the perception of details in images. A challenge of creating models for the understanding of natural unique patterns is the problem of reducing symmetry from the averaging found in the mathematical models of forms to the generation of lower broken symmetry that results in natural unique pattern formation. Restrictions of which objects belong within a given class are decided upon by the scientists doing the grouping and the measurements made of the objects. It is observed that even though natural objects are unique, they can be grouped together under specified parameters. It is suggested that in addition to the repeatable and unique features of a source, persistency of the source that made an image, impression, or mark is another relevant question that must be answered when examining images.