ppxscal/embedding_network huggingface dataset:
Tree-structured neural decoding
Authors: Christian d'Avignon, Donald Geman
Venue: The Journal of Machine Learning Research (2003)

We propose adaptive testing as a general mechanism for extracting information about stimuli from spike trains. Each test or question corresponds to choosing a neuron and a time interval and checking for a given number of spikes. No assumptions are made about the distribution of spikes or any other aspect of neural encoding. The chosen questions are those which most reduce the uncertainty about the stimulus, as measured by entropy and estimated from stimulus-response data. Our experiments are based on accurate simulations of responses to pure tones in the auditory nerve and are meant to illustrate the ideas rather than investigate the auditory system. The results cohere nicely with well-understood encoding of amplitude and frequency in the auditory nerve, suggesting that adaptive testing might provide a powerful tool for investigating complex and poorly understood neural structures.
Glaucoma screening using data mining techniques
Authors: X. Liu
Venue: ACM SIGBIO Newsletter (1998)

Working with Moorfields Eye Hospital, Central Middlesex Hospital, Institute of Ophthalmology and Henri Mondor Hospital, we have developed a number of real-world applications using data mining and intelligent data analysis techniques. These have led not only to novel research results, but also successful fielded applications, e.g. in hospital, GP clinic, and large-scale field investigations.
Assessing design-quality metrics on legacy software
Authors: Joel Troster
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1 (1992)

This paper' reviews the progress-to-date on the application of Design-Quality Metrics analysis to large-scale legacy software products. Basic design-quality metrics are outlined followed by the procedures followed to assess the metrics on a large software product. The unique problems of assessing design-quality metrics on legacy software are outlined. Preliminary results are given relating defect data to the metrics.
Discourse semantics of s-modifying adverbials
Authors: Katherine Margaret Forbes
Venue:  (2003)

In this thesis, we address the question of why certain S-modifying adverbials are only interpretable with respect to the discourse or spatio-temporal context, and not just their own matrix clause. It is not possible to list these adverbials because the set of adverbials is compositional and therefore infinite. Instead, we investigate the mechanisms underlying their interpretation. We present a corpus-based analysis of the predicate argument structure and interpretation of over 13,000 S-modifying adverbials. We use prior research on discourse deixis and clause-level predicates to study the semantics of the arguments of S-modifying adverbials and the syntactic constituents from which they can be derived. We show that many S-modifying adverbials contain semantic arguments that may not be syntactically overt, but whose interpretation nevertheless context. Prior work has investigated only a small subset of these discourse connectives; at the clause-level their semantics has been largely ignored and at the discourse level they are usually treated as &ldquo;signals&rdquo; light on the space of relations imparted by a much wider variety of adverbials. We further show how their predicate argument structure and interpretation can be formalized and incorporated into a rich intermediate model of discourse that alone among other models views discourse connectives as predicates whose syntax and semantics must be specified and recoverable to interpret discourse. It is not only due to their argument structure and interpretation that adverbials have been treated as discourse connectives, however. Our corpus contains adverbials whose semantics alone does not cause them to be interpreted with respect to We explore other explanations for why these adverbials evoke discourse context for their interpretation; in particular, we show how the interaction of prosody with the interpretation of S-modifying adverbials can contribute to discourse coherence, and we also show how S-modifying adverbials can be used to convey implicatures.
A voxel-based representation for evolutionary shape optimization
Authors: Peter Baron, Robert Fisher, Andrew Tuson, Frank Mill, Andrew Sherlock
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1999)

A voxel-based shape representation when integrated with an evolutionary algorithm offers a number of potential advantages for shape optimization. Topology need not be predefined, geometric constraints are easily imposed and, with adequate resolution, any shape can be approximated to arbitrary accuracy. However, lack of boundary smoothness, length of chromosome, and inclusion of small holes in the final shape have been stated as problems with this representation. This paper describes two experiments performed in an attempt to address some of these problems. First, a design problem with only a small computational cost of evaluating candidate shapes was used as a testbed for designing genetic operators for this shape representation. Second, these operators were refined for a design problem using a more costly finite element evaluation. It was concluded that the voxel representation can, with careful design of genetic operators, be useful in shape optimization.
Energy-Optimizing Source Code Transformations for OS-driven Embedded Software
Authors: Yunsi Fei, Srivaths Ravi, Anand Raghunathan, Niraj K. Jha
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

The increasing software content of battery-powered embedded systemshas fueled much interest in techniques for developing energy-efficientembedded software. Source code transformations have previouslybeen considered for application software to reduce its energyconsumption. For complex embedded software applications, whichconsist of multiple concurrent processes running with the support ofan embedded operating system (OS), it is known that the OS andthe application-OS interaction significantly affect energy consumption.However, source code transformations explicitly targeting these effectshave not been sufficiently studied.This paper proposes novel transformations for the source code ofOS-driven multi-process embedded software programs in order to reducetheir energy consumption. The key features of our optimizationsare that they span process boundaries, and that they minimize the energyconsumed in the execution of OS functions and services - opportunitieswhich are beyond the reach of conventional compiler optimizationsand source code transformation techniques. We propose fourtypes of transformations, namely process-level concurrency management,message vectorization, computation migration and inter-processcommunication mechanism selection. We discuss how to systematicallyidentify opportunities for the proposed transformations and apply themdirectly to the program source code.We have applied the proposed techniques to several multi-processsoftware benchmark programs, and evaluated their applicability in thecontext of an embedded system containing an Intel StrongARM processorand embedded Linux OS. Our techniques achieve up to 37.9%(23.8% on an average) energy reduction compared to highly compiler-optimizedimplementations.
Website Usability or the WWW as Practice
Authors: Henning Breuer
Venue: Proceedings of the First Conference on Latin American Web Congress (2003)

Since the Web popularized computing technology by means of its usability it became a continuous effort and unique competence to ensure its persisting usability and value. The tutorial provides different perspectives from which to improve and evaluate the quality of websites: the dynamics of projects and the continuants of usability in respect to functionality, content and design. Common evaluation techniques are being performed. The idea is to advance participants reaching their goals online.
Applications of Plotkin-terms: partitions and morphisms for closed terms
Authors: Richard Statman, Henk Barendregt
Venue: Journal of Functional Programming (1999)

This theoretical pearl is about the closed term model of pure untyped lambda-terms modulo &beta;-convertibility. A consequence of one of the results is that for arbitrary distinct combinators (closed lambda terms) M, M&prime;, N, N&prime; there is a combinator H such thatdisplay formula hereThe general result, which comes from Statman (1998), is that uniformly r.e. partitions of the combinators, such that each &lsquo;block&rsquo; is closed under &beta;-conversion, are of the form {H&minus;1{M}}M&isin;&Lambda;&Phi;. This is proved by making use of the idea behind the so-called Plotkin-terms, originally devised to exhibit some global but non-uniform applicative behaviour. For expository reasons we present the proof below. The following consequences are derived: a characterization of morphisms and a counter-example to the perpendicular lines lemma for &beta;-conversion.
The application of FOOM methodology to IFIP conference case study
Authors: Judith Kabeli, Peretz Shoval
Venue: Practicing software engineering in the 21st century (2003)

FOOM (Functional and Object-Oriented Methodology) is an integrated methodology for information systems' analysis and design, which combines two essential software-engineering paradigms: the functional/data approach (or process-oriented) and the object-oriented (OO) approach. Having applied FOOM in a variety of domains, this chapter presents the application of the methodology to the specification of the IFIP Conference system. We focus on the analysis and design phases. FOOM-analysis phase includes data modeling and functional analysis activities and produces an initial Class Diagram and a hierarchy of OO data flow diagrams (OO-DFDs). The products of the design phase include: (a) a complete class diagram; (b) object classes for the menus, forms and reports and (c) a behavior schema, which consists of detailed descriptions of the methods and the application transactions, expressed in pseudocode and message diagrams.
A new modification of the immersed boundaries method for fluid-solid flows: moderate Reynolds numbers
Authors: A. Vikhansky
Venue: Journal of Computational Physics (2003)

In this study we consider a combination of an interpolation technique with the D'Alambert principle that allows the direct numerical simulation of fluid-solid flows on a regular rectangular grid. The method models a no-slip boundary with the second-order accuracy interpolation scheme without explicit calculation of the forces that the particles exert at the fluid. The method is applicable for a wide range of Reynolds numbers from creeping flows up to Re ≈ 100.
Perfect 7-cycle systems
Authors: Enzo Maria Li Marzi
Venue: Discrete Applied Mathematics (2003)

Perfect m-cycle systems are defined. In this paper, it is proven that the class of perfect 7-cycle systems is a variety of quasigroups, and a defining set of identities for this variety is given.
On Minimally 3-Connected Binary Matroids
Authors: Talmage James Reid, Haidong Wu
Venue: Combinatorics, Probability and Computing (2001)

We generalize a minimal 3-connectivity result of Halin from graphs to binary matroids. As applications of this theorem to minimally 3-connected matroids, we obtain new results and short inductive proofs of results of Oxley and Wu. We also give new short inductive proofs of results of Dirac and Halin on minimally k-connected graphs for k &isin; {2,3}.
Improve Performance of Disconnected Operation through Submitting by Probability and Transferring Transactions in Groups
Authors: YanSheng Lu, XiongKai Shao
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

Disconnected operation is an important research topic in mobile computing area. This paper provides two methods to improve the performance of disconnected operation. These methods are: submitting tentative transaction by probability; transferring transaction log in groups. In the case of very high conflict frequency, the method to submit tentative transactions according to conflict probability can be used. In long tentative transactions, if the position of conflict data item is in the front part of the tentative transaction log, the method of transferring tentativetransactions in groups can be used. It can reduce the communication cost and avoid unnecessary reexecution of tentative transactions that would be doomed to abort, so it improves the overall performance of disconnection operation. This paper also compares and analyzes their performance.
The process of converting consultants' tacit knowledge to organisational explicit knowledge: case studies in management consulting firms
Authors: Ricky Laupase
Venue: Knowledge management: current issues and challenges (2003)

Management consulting firms are typical examples of knowledge-intensive organisations in which the consultants' knowledge, in particular tacit knowledge, is critical to the success of the firms. The firm's success depends on its continuous effort to retain the consultant's tacit knowledge. This chapter will explore the conversion processes of consultants' tacit knowledge to the organisational explicit knowledge by focusing on how organisational structure, culture and information technologies support the conversion processes. For the purpose of this study, Nonaka and Takeuchi's (1995) spiral evolution knowledge conversion model will be revisited. To address the issue, three case studies on management consulting firms in Australia were conducted. Findings of research will report on the respondents' perception of the importance of tacit knowledge and conversion of consultants' tacit knowledge to organisational explicit knowledge with reference to organisational structure, culture and information technology. From the findings, the researcher will establish the so-called guidelines for converting such knowledge and, hence, propose a suggestion for future research.
Noise threshold: Merzbow and the end of natural sound
Authors: Paul Hegarty
Venue: Organised Sound (2001)

When we ask what noise is, we would do well to remember that no single definition can function timelessly - this may well be the case with many terms, but one of the arguments of this essay is that noise is that which always fails to come into definition. Generally speaking, noise is taken to be a problem: unwanted sound, unorganised sound, excessively loud sound. Metaphorically, when we hear of noise being generated, we understand it to be something extraneous. Historically, though, noise has just as often signalled music, or pleasing sound, as its opposite. In the twentieth century, the notion of a clear line between elements suitable for compositional use (i.e. notes, created on instruments) and the world of noises was broken down. Russolo's &lsquo;noisy machines&rsquo;, Var&egrave;se and Satie's use of ostensibly non-musical machines to generate sounds, musique concr&egrave;te, Cage's rethinking of sound, noise, music, silence . . .
An abstract interpretation-based framework for software watermarking
Authors: Patrick Cousot, Radhia Cousot
Venue: Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2004)

Software watermarking consists in the intentional embedding of indelible stegosignatures or watermarks into the subject software and extraction of the stegosignatures embedded in the stegoprograms for purposes such as intellectual property protection. We introduce the novel concept of abstract software watermarking. The basic idea is that the watermark is hidden in the program code in such a way that it can only be extracted by an abstract interpretation of the (maybe non-standard) concrete semantics of this code. This static analysis-based approach allows the watermark to be recovered even if only a small part of the program code is present and does not even need that code to be executed. We illustrate the technique by a simple abstract watermarking protocol for methods of Java™ classes. The concept applies equally well to any other kind of software (including hardware originally specified by software).
Concurrency and loose semantics of open graph transformation systems
Authors: Reiko Heckel, Mercé Llabrés, Hartmut Ehrig, Fernando Orejas
Venue: Mathematical Structures in Computer Science (2002)

Graph transitions represent an extension of the DPO approach to graph transformation for the specification of reactive systems. In this paper, we develop the theory of concurrency for graph transitions. In particular, we prove a local Church&ndash;Rosser theorem and define a notion of shift-equivalence that allows us to represent both intra-concurrency (within the specified subsystem) and inter-concurrency (between subsystem and environment). Via an implementation of transitions in terms of DPO transformations with context rules, a second, more restrictive notion of equivalence is defined that captures, in addition, the extra-concurrency (between operations of the environment). As a running example and motivation, we show how the concepts of this paper provide a formal model for distributed information systems.
Style mining of electronic messages for multiple authorship discrimination: first results
Authors: Shlomo Argamon, Marin Šarić, Sterling S. Stein
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

This paper considers the use of computational stylistics for performing authorship attribution of electronic messages, addressing categorization problems with as many as 20 different classes (authors). Effective stylistic characterization of text is potentially useful for a variety of tasks, as language style contains cues regarding the authorship, purpose, and mood of the text, all of which would be useful adjuncts to information retrieval or knowledge-management tasks. We focus here on the problem of determining the author of an anonymous message, based only on the message text. Several multiclass variants of the Winnow algorithm were applied to a vector representation of the message texts to learn models for discriminating different authors. We present results comparing the classification accuracy of the different approaches. The results show that stylistic models can be accurately learned to determine an author's identity.
Continuous improvement experiences in information development
Authors: S. G. Pearce
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1 (1992)

Efforts to shorten cycle time and lower the number of errors in the information development process may uncover problems and, in some cases, even create new ones. This paper describes changes to the information development process, various problems that change has uncovered, and some solutions to these new found problems.
An L-G & SPNG Based Model for Brain Biometrics
Authors: N. Bourbakis, S. Makrogiannis
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

This paper presents a brain based biometrics methodology using local global (L-G) and stochastic Petri net (SPN) graphs. In particular, today's most used lying detection systems(polygraph) are based on blood pressure under certain psychological conditions and have been proven inadequate and inaccurate for determining if a person is saying the truth or not. The main reason behind this inaccuracy is the psychological conditions under the test is contacting. Innocent persons with psychological fear to police or FBI agents may inappropriately react during the test producing false alarms, while at the same time guilty persons with acting capabilities may be lying and pass the test. Here in this paper we present a methodology based on fMRI and the way that the brain cells or brain regions interact regarding thinking and/or executing certain tasks. More specifically, fMRI provides color images for the active regions of the brain during thinking and/or performing certain tasks. These region-images are extracted and geometrically (topologically) are associated with the L-G graphs. Then using SPN graphs we represent their functionality. Thus, comparing the L-G and SPN graphs extracted from the candidate fMRI images to a set of "correct" generic L-G and SPN graph models available in an L-G/SPN graph Database offers a more accuratemeasurement of the truth of false answers during the test. The main reason about the accuracy is that a liar will be detected because he/she will try to "think" how to avoid the truth.
Lempel-Ziv Compression of Structured Text
Authors: Joaquín Adiego, Gonzalo Navarro, Pablo de la Fuente
Venue: Proceedings of the Conference on Data Compression (2004)

We describe a novel Lempel-Ziv approach suitable for compressing structureddocuments, called LZCS, which takes advantage of redundant informationthat can appear in the structure.The main idea is that frequently repeatedsubtrees may exist and these can be replaced by a backward reference to theirfirst occurence.The main advantage is that compressed documents generatedby LZCS are easy to display, access at random, and navigate.In a secondstage, processed documents can be further compressed using some semiadaptivetechnique, so that random access and navigability remain possible.LZCSis especially efficient to compress collections of highly structured data, such asXML forms, invoices, e-commerce and web-service exchange documents.Thecomparison against structure-based and standard compressors shows that LZCSis a competitive choice for this type of documents, while the others are not well-suitedto support navigation or random access.
Empirical studies on the disambiguation of cue phrases
Authors: Julia Hirschberg, Diane Litman
Venue: Computational Linguistics (1993)

Cue phrases are linguistic expressions such as now and well that function as explicit indicators of the structure of a discourse. For example, now may signal the beginning of a subtopic or a return to a previous topic, while well may mark subsequent material as a response to prior material, or as an explanatory comment. However, while cue phrases may convey discourse structure, each also has one or more alternate uses. While incidentally may be used sententially as an adverbial, for example, the discourse use initiates a digression. Although distinguishing discourse and sentential uses of cue phrases is critical to the interpretation and generation of discourse, the question of how speakers and hearers accomplish this disambiguation is rarely addressed.This paper reports results of empirical studies on discourse and sentential uses of cue phrases, in which both text-based and prosodic features were examined for disambiguating power. Based on these studies, it is proposed that discourse versus sentential usage may be distinguished by intonational features, specifically, pitch accent and prosodic phrasing. A prosodic model that characterizes these distinctions is identified. This model is associated with features identifiable from text analysis, including orthography and part of speech, to permit the application of the results of the prosodic analysis to the generation of appropriate intonational features for discourse and sentential uses of cue phrases in synthetic speech.
Tripos theory in retrospect
Authors: Andrew M. Pitts
Venue: Mathematical Structures in Computer Science (2002)

The notion of tripos (Hyland et al. 1980; Pitts 1981) was motivated by the desire to explain in what sense Higg's description of sheaf toposes as H-valued sets and Hyland's realizability toposes are instances of the same construction. The construction itself can be seen as the universal solution to the problem of realizing the predicates of a first order hyperdoctrine as subobjects in a logos with effective equivalence relations. In this note it is shown that the resulting logos is actually a topos if and only if the original hyperdoctrine satisfies a certain comprehension property. Triposes satisfy this property, but there are examples of non-triposes satisfying this form of comprehension.