Página 15 dos resultados de 4609 itens digitais encontrados em 0.106 segundos

e-Termos: a computer-supported collaborative work system for terminological management.

OLIVEIRA, L. H. M. de; ALUÍSIO, S. M.; ALMEIDA, G. M. de B.
Fonte: In: INTERNATIONAL CONFERENCE ON COMPUTATIONAL PROCESSING OF THE PORTUGUESE LANGUAGE, 9., 2010, Porto Alegre. Extended Activities Proceedings... [S.l.: s.n.], 2010. Publicador: In: INTERNATIONAL CONFERENCE ON COMPUTATIONAL PROCESSING OF THE PORTUGUESE LANGUAGE, 9., 2010, Porto Alegre. Extended Activities Proceedings... [S.l.: s.n.], 2010.
Tipo: Resumo em anais de congresso (ALICE) Formato: 2 p.
Português
Relevância na Pesquisa
572.24945%
The e-Termos is a Web Collaborative Environment composed of six working modules to automatize tasks for managing terminological products. Each module is responsible for tasks inherent to the process of creating terminologies having different tools that assist the Natural Language Processing activities and also collaborative tools for supporting the communication and interaction needs of team members. The main contributions of e-Termos are the collaborative aspect instantiated in terminological practice, the flexible creation of Terminological Records and the possibility of being used for teaching terminology, lexicography and translation.; 2010; Propor 2010. Demonstration.

A Robust Loose Coupling for Speech Recognition and Natural Language Understanding

Ringger, Eric K.
Fonte: University of Rochester. Computer Science Department. Publicador: University of Rochester. Computer Science Department.
Tipo: Relatório
Português
Relevância na Pesquisa
573.31312%
The focus of this thesis proposal is to improve the ability of a computational system to understand spoken utterances in a dialogue with a human. Available computational methods for word recognition do not perform as well on spontaneous speech as we would hope. Even a state of the art recognizer achieves slightly worse than 70\% word accuracy on (nearly) spontaneous speech in a conversation about a specific problem. To address this problem, I will explore novel methods for post-processing the output of a speech recognizer in order to correct errors. I adopt statistical techniques for modeling the noisy channel from the speaker to the listener in order to correct some of the errors introduced there. The statistical model accounts for frequent errors such as simple word/word confusions and short phrasal problems (one-to-many word substitutions and many-to-one word concatenations). To use the model, a search algorithm is required to find the most likely correction of a given word sequence from the speech recognizer. The post-processor output should contain fewer errors, thus making interpretation by higher levels, such as parsing, more reliable. Spontaneous speech is also challenging to process because it is more incremental than written language. Utterances frequently form brief phrases and fragments rather than full sentences; they tend to come in installments and refinements. Known methods for parsing do not perform as well as we would like in the face of these linguistic ambiguities and idiosyncrasies. Even state of the art algorithms for parsing spontaneous language sustain high error rates. To address the incrementality of spontaneously spoken utterances...

A Method for Generating Color Descriptions of Objects and Implications for the Perceptual Grounding of Language

Nelson, Randal C.
Fonte: University of Rochester. Computer Science Department. Publicador: University of Rochester. Computer Science Department.
Tipo: Relatório
Português
Relevância na Pesquisa
572.78273%
This paper addresses the issue of how verbal communication arises from the complex and uncertain representations that seem necessary to robustly carry out perception in real-world domains. We propose that the generation of natural language in such domains should be addressed as the optimization problem of finding, under various constraints, the verbalization that has the greatest probability of achieving a specific change that the speaker wants to induce in the mental state or behavior of the listener. This most likely effective or MLE strategy has the advantage of making the problem concrete, and allowing (possibly empathic) models of the perceptual and behavioral processes to be used in a principled way. We illustrate these issues in the context of the specific problem of describing real objects in native domains using basic color language (e.g., "mostly brown," "partly red"). The term "native domains" refers to real-world environments that have not been tailored to suit the application

ISCON: A Network Construction Aid and Simulator for Connectionist Models

Small, S. L. ; Shastri, L. ; Brucks, M. S. ; Kaufman, S. G. ; Cottrell, G. W. ; Addanki, S.
Fonte: University of Rochester. Computer Science Department. Publicador: University of Rochester. Computer Science Department.
Tipo: Relatório
Português
Relevância na Pesquisa
572.77984%
This paper describes the organization and use of an interactive computer program called ISCON, which aids in the development of connectionist models of cognitive processes and neural systems. ISCON was developed during a six week period in Spring 1982 as a prototypic implementation both to help determine the requirements for a useful simulation system and to use as a short-term measure to facilitate research into the construction of connectionist models in various domains, especially language comprehension, motor control, and general control structures. Such models can be explicitly neurobiological in nature, in which connectionist computing units represent neurons, or cognitive in nature, in which these units constitute an architectural substrate for higher-level processes. ISCON development has not stopped with the implementation of the initial system, and new features are being added as they are suggested by ongoing experimentation with existing versions. The design aid and simulation systems are implemented in Franz Lisp and the graphic subsystem is implemented in C.

Preliminary ZENO Language Description

Ball, J. E. ; Williams, G. J. ; Low, J. R.
Fonte: University of Rochester. Computer Science Department. Publicador: University of Rochester. Computer Science Department.
Tipo: Relatório
Português
Relevância na Pesquisa
572.97027%
The specification of ZENO, a programming language intended as the target language for a research project in advanced compiling, is presented. The language is strongly based on EUCLID, with modifications for message-based parallel processing and a somewhat different treatment of data types.

Data shader language and interface specification

Corrie, Brian; Mackerras, Paul
Fonte: Universidade Nacional da Austrália Publicador: Universidade Nacional da Austrália
Tipo: Working/Technical Paper Formato: 225052 bytes; 356 bytes; application/pdf; application/octet-stream
Português
Relevância na Pesquisa
572.9795%
The process of visualizing a scientific data set benefits from an extensive knowledge of the domain in which the data set is created. Because an in-depth knowledge of all scientific domains is not available to the creator of a visualization system, a exible and extensible system is essential in providing a productive tool to the scientist. One approach to providing this exibility is through a shading language that enables users to write programmable data shaders that determine how scientific data sets are rendered. This paper describes the implementation of such a shading system. The system consists of two parts, a shader library and a shader compiler. The shader library does not provide a shading model directly, but instead provides a means of loading and binding externally created shaders to a rendering engine which uses the library. The shader compiler is used to compile a shader description, written in the shading language, into a form that the shader library can load. The shader library has been used in both a ray-tracing geometric renderer and a ray-casting volume renderer.; no

Data flow implementations of a lucid-like programming language / by Andrew Lawrence Wendelborn

Wendelborn, Andrew Lawrence
Fonte: Universidade de Adelaide Publicador: Universidade de Adelaide
Tipo: Tese de Doutorado Formato: 142106 bytes; application/pdf
Publicado em //1985 Português
Relevância na Pesquisa
572.5129%
Thesis (Ph.D.)--University of Adelaide, Dept. of Computer Science, 1985; Bibliography: leaves [238]-244; xi, 244 leaves : ill ; 30 cm.; Title page, contents and abstract only. The complete thesis in print form is available from the University Library.

Innovations in Natural Language Document Processing for Requirements Engineering

Berzins, Valdis; Martell, Craig; Luqi; Adams, Paige
Fonte: Escola de Pós-Graduação Naval Publicador: Escola de Pós-Graduação Naval
Tipo: Artigo de Revista Científica
Português
Relevância na Pesquisa
572.9795%
This paper evaluates the potential contributions of natural language processing to requirements engineering. We present a selective history of the relationship between requirements engineering (RE) and natural-language processing (NLP), and briefly summarize relevant recent trends in NLP. The paper outlines basic issues in RE and how they relate to interactions between a NLP front end and system-development processes. We suggest some improvements to NLP that may be possible in the context of RE and conclude with an assessment of what should be done to improve likelihood of practical impact in this direction.; This work was supported in part by ARO under project P-45614-CI.

Design and specification of an object-oriented data definition language

Badgett, Robert B.
Fonte: Monterey, California. Naval Postgraduate School Publicador: Monterey, California. Naval Postgraduate School
Tipo: Tese de Doutorado Formato: 33 p.
Português
Relevância na Pesquisa
572.94938%
The problem addressed by this thesis is the inability of traditional data models to efficiently support the new database applications of today, such as Computer-Aided Design and multimedia. Traditional data models were designed for specific business type applications, i.e., record keeping (relational) and product assembly (hierarchical). Because of this, their permitted data types, structures, and query languages are specific and therefore limited. New applications require more complex and varied data structures and data types. The flat representation of data by traditional data models results in complex objects being scattered over many relations losing the correspondence between the user's view and database representation. The approach taken was to develop a new object-oriented data model (O-ODM). The object-oriented approach permits both the structure of complex objects and their operations to be specified by the designer, providing a flexibility not available in traditional data models. As a result an object may be modelled closer to the user's view, permitting the application programmer to easily capture its complexity. The result of this thesis is the specification of an object-oriented data definition language (O- ODDL) for the O-ODM. The O-ODDL incorporates the features of a unique object...

Information Security and Wireless alternate approaches for controlling access to critical information

Nandram, Winsome
Fonte: Monterey, California. Naval Postgraduate School Publicador: Monterey, California. Naval Postgraduate School
Tipo: Tese de Doutorado Formato: xiv, 75 p. : ill. (some col.) ;
Português
Relevância na Pesquisa
572.58832%
Approved for public release; distribution is unlimited; The advent of Wireless Local Area Networking (WLAN) has seen a widespread adoption of its technology and functionality in many different areas. Many studies show more and more organizations are extending their networks to incorporate wireless devices and their applications. Permitting wireless devices to access private networks however, further complicates the tasks of protecting the network and its resources from unauthorized access. Now that they have become a significant element in today's networks, selecting and deploying adequate security measures have become the focus of many research efforts. Typically, network managers implement countermeasures to augment security. The goal of this thesis is to research approaches that compliment existing security measures with fine grain access control measures. The Extensible Markup Language (XML) is adopted to accommodate such granular access control as it provides the mechanisms for scaling security down to the document content level.; Captain, United States Marine Corps

An exact mapping between the Variational Renormalization Group and Deep Learning

Mehta, Pankaj; Schwab, David J.
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 14/10/2014 Português
Relevância na Pesquisa
572.48254%
Deep learning is a broad set of techniques that uses multiple layers of representation to automatically learn relevant features directly from structured data. Recently, such techniques have yielded record-breaking results on a diverse set of difficult machine learning tasks in computer vision, speech recognition, and natural language processing. Despite the enormous success of deep learning, relatively little is understood theoretically about why these techniques are so successful at feature learning and compression. Here, we show that deep learning is intimately related to one of the most important and successful techniques in theoretical physics, the renormalization group (RG). RG is an iterative coarse-graining scheme that allows for the extraction of relevant features (i.e. operators) as a physical system is examined at different length scales. We construct an exact mapping from the variational renormalization group, first introduced by Kadanoff, and deep learning architectures based on Restricted Boltzmann Machines (RBMs). We illustrate these ideas using the nearest-neighbor Ising Model in one and two-dimensions. Our results suggests that deep learning algorithms may be employing a generalized RG-like scheme to learn relevant features from data.; Comment: 8 pages...

Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs

Cohen, Gil
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 14/06/2015 Português
Relevância na Pesquisa
574.2525%
In his 1947 paper that inaugurated the probabilistic method, Erd\H{o}s proved the existence of $2\log{n}$-Ramsey graphs on $n$ vertices. Matching Erd\H{o}s' result with a constructive proof is a central problem in combinatorics, that has gained a significant attention in the literature. The state of the art result was obtained in the celebrated paper by Barak, Rao, Shaltiel and Wigderson [Ann. Math'12], who constructed a $2^{2^{(\log\log{n})^{1-\alpha}}}$-Ramsey graph, for some small universal constant $\alpha > 0$. In this work, we significantly improve the result of Barak~\etal and construct $2^{(\log\log{n})^c}$-Ramsey graphs, for some universal constant $c$. In the language of theoretical computer science, our work resolves the problem of explicitly constructing two-source dispersers for polylogarithmic entropy.

On Some Entertaining Applications of the Concept of Set in Computer Science Course

Yordzhev, Krasimir; Kostadinova, Hristina
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 17/01/2012 Português
Relevância na Pesquisa
574.2525%
Some aspects of programming education are examined in this work. It is emphasised, based on the entertainment value, the most appropriate examples are chosen to demonstrate the different language constructions and data structures. Such an example is the demonstrated algorithm for solving the widespread nowadays "Sudoku" puzzle. This is made, because of the connection with the term set and putting it into practice in the programming. Using the so built program there are solved some combinatorial problems, connected to the Sudoku matrices. Key words: Education in programming, programming languages, data structures, set, Sudoku matrix, Sudoku puzzle.

Joining Transition Systems of Records: Some Congruency and Language-Theoretic Results

Izadi, Mohammad; Masoudian, Saeed; Mozaffari, Sahand
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 16/11/2015 Português
Relevância na Pesquisa
573.1216%
B\"uchi automaton of records (BAR) has been proposed as a basic operational semantics for Reo coordination language. It is an extension of B\"uchi automaton by using a set of records as its alphabet or transition labels. Records are used to express the synchrony between the externally visible actions of coordinated components modeled by BARs. The main composition operator on the set of BARs is called as join which is the semantics of its counterpart in Reo. In this paper, we define the notion of labeled transition systems of records as a generalization of the notion of BAR, abstracting away from acceptance or rejection of strings. Then, we consider four equivalence relations (semantics) over the set of labeled transition systems of records and investigate their congruency with respect to the join composition operator. In fact, we prove that the finite-traces-based, infinite-traces-based, and nondeterministic finite automata (NFA)-based equivalence relations all are congruence relations over the set of all labeled transition systems of records with respect to the join operation. However, the equivalence relation using B\"uchi acceptance condition is not so. In addition, using these results, we introduce the language-theoretic definitions of the join operation considering both finite and infinite strings notions. Also...

Combining Ontology Development Methodologies and Semantic Web Platforms for E-government Domain Ontology Development

Dombeu, Jean Vincent Fonou; Huisman, Magda
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 26/04/2011 Português
Relevância na Pesquisa
572.68973%
One of the key challenges in electronic government (e-government) is the development of systems that can be easily integrated and interoperated to provide seamless services delivery to citizens. In recent years, Semantic Web technologies based on ontology have emerged as promising solutions to the above engineering problems. However, current research practicing semantic development in e-government does not focus on the application of available methodologies and platforms for developing government domain ontologies. Furthermore, only a few of these researches provide detailed guidelines for developing semantic ontology models from a government service domain. This research presents a case study combining an ontology building methodology and two state-of-the-art Semantic Web platforms namely Protege and Java Jena ontology API for semantic ontology development in e-government. Firstly, a framework adopted from the Uschold and King ontology building methodology is employed to build a domain ontology describing the semantic content of a government service domain. Thereafter, UML is used to semi-formally represent the domain ontology. Finally, Protege and Jena API are employed to create the Web Ontology Language (OWL) and Resource Description Framework (RDF) representations of the domain ontology respectively to enable its computer processing. The study aims at: (1) providing e-government developers...

An Internet Framework to Bring Coherence between WAP and HTTP Ensuring Better Mobile Internet Security

Pathan, Al-Mukaddim Khan; Mottalib, Md. Abdul; Zibran, Minhaz Fahim
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 15/05/2006 Português
Relevância na Pesquisa
573.22902%
To bring coherence between Wireless Access Protocol (WAP) and Hyper Text Transfer Protocol (HTTP), in this paper, we have proposed an enhanced Internet framework, which incorporates a new markup language and a browser compatible with both of the access control protocols. This Markup Language and the browser enables co-existence of both Hyper Text Markup Language (HTML) and Wireless Markup Language (WML) contents in a single source file, whereas the browser incorporates the ability to hold contents compliant with both HTTP and WAP. The proposed framework also bridges the security gap that is present in the existing mobile Internet framework. Keywords: WAP, WML, HTTP, HTML, browser, parser, wireless devices.; Comment: 8th International Conference on Advanced Communication Technology (ICACT 2006)

Emerging Methods and Tools for Sparking New Global Creative Networks

Horon, Jeff
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 28/02/2015 Português
Relevância na Pesquisa
572.8873%
Emerging methods and tools are changing the ways participants in global creative networks become aware of each other and proceed to interact. Some web-based resources intended to spark new collaborations in creative networks have been plagued by dependence on fragmented or out-of-date information, having shallow recall (e.g. limited to a list of manually curated keywords), offering poor interconnectivity with other systems, and/or obtaining low end-user adoption. Increased availability of information about creative network participants' activities and outputs (e.g. completed sponsored research projects and published results, aggregated into global databases), coupled with advancement in information processing techniques like Natural Language Processing, enables new web-based technologies for discovering subject matter experts, facilities, and networks of current and potential collaborators. Large-scale data resources and NLP allow modern versions of these tools to avoid the problems of having sparse data and also provide for deep recall across many disciplinary vocabularies. These are "passive" technologies, from the perspective of the network participant, because the agent must undertake an action to use the information resources. Emerging "active" methods and tools utilize the same types of information and technologies...

Curry-style type Isomorphisms and Game Semantics

De Lataillade, Joachim
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 29/05/2007 Português
Relevância na Pesquisa
574.2525%
Curry-style system F, ie. system F with no explicit types in terms, can be seen as a core presentation of polymorphism from the point of view of programming languages. This paper gives a characterisation of type isomorphisms for this language, by using a game model whose intuitions come both from the syntax and from the game semantics universe. The model is composed of: an untyped part to interpret terms, a notion of game to interpret types, and a typed part to express the fact that an untyped strategy plays on a game. By analysing isomorphisms in the model, we prove that the equational system corresponding to type isomorphisms for Curry-style system F is the extension of the equational system for Church-style isomorphisms with a new, non-trivial equation: forall X.A = A[forall Y.Y/X] if X appears only positively in A.; Comment: Accept\'e \`a Mathematical Structures for Computer Science, Special Issue on Type Isomorphisms

Hiding Inside HTML and Other Source Codes

Al_Qaheri, Hameed; Dey, Sandipan; Sanyal, Sugata
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 17/03/2010 Português
Relevância na Pesquisa
573.3807%
Many steganographic techniques were proposed for hiding secret message inside images, the simplest of them being the LSB data hiding. In this paper, we suggest a novel data hiding technique in an HTML Web page and also propose some simple techniques to extend the embedding technique to source codes written in any programming language (both case insensitive like HTML, Pascal and case sensitive languages like C, C++, Java). We basically try to exploit the case-redundancy in case-insensitive language, while we try hiding data with minimal changes in the source code (almost not raising suspicion). HTML Tags are case insensitive and hence an alphabet in lowercase and one in uppercase present inside an HTML tag are interpreted in the same manner by the browser, i.e., change in case in a web page is imperceptible to the browser. We first exploit this redundancy and use it to embed secret data inside an web page, with no changes visible to the user of the web page, so that he can not even suspect about the data hiding. The embedded data can be recovered by viewing the source of the HTML page. This technique can easily be extended to embed secret message inside any piece of source-code where the standard interpreter of that language is case-insensitive. For case-sensitive programming languages we do minimal changes in the source code (e.g....

PrologPF: Parallel Logic and Functions on the Delphi Machine

Lewis, Ian
Fonte: University of Cambridge; Computer Laboratory; Girton College Publicador: University of Cambridge; Computer Laboratory; Girton College
Tipo: Thesis; doctoral; PhD
Português
Relevância na Pesquisa
572.4462%
PrologPF is a parallelising compiler targeting a distributed system of general purpose workstations connected by a relatively low performance network. The source language extends standard Prolog with the integration of higher-order functions. The execution of a compiled PrologPF program proceeds in a similar manner to standard Prolog, but uses oracles in one of two modes. An oracle represents the sequence of clauses used to reach a given point in the problem search tree, and the same PrologPF executable can be used to build oracles, or follow oracles previously generated. The parallelisation strategy used by PrologPF proceeds in two phases, which this research shows can be interleaved. An initial phase searches the problem tree to a limited depth, recording the discovered incomplete paths. In the second phase these paths are allocated to the available processors in the network. Each processor follows its assigned paths and fully searches the referenced subtree, sending solutions back to a control processor. This research investigates the use of the technique with a one-time partitioning of the problem and no further scheduling communication, and with the recursive application of the partitioning technique to effect dynamic work reassignment. For a problem requiring all solutions to be found...