ppxscal/embedding_network huggingface dataset:
A Tool to Construct a Web Service by Synthesizing Several Web Services
Authors: Juil Kim, Woojin Lee, Kiwon Chong
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

Web application developers are moving towards Web Services as a mechanism for developing component-based Web applications. Accordingly, the number of available web services is steadily increasing, and many applications are being developed by reusing web services. Therefore it is necessary to construct a new web service using several existing web services for reusability and productivity. This paper proposes a tool to construct a new web service by synthesizing several existing web services. The architecture of the tool, the process, and the algorithm to construct a web service are described. Through the tool, developers can construct new web services automatically, rapidly, easily, and inexpensively using existing web services.
A case study of model context for simulation composability and reusability
Authors: Michael Spiegel, Paul F. Reynolds,  Jr., David C. Brogan
Venue: Proceedings of the 37th conference on Winter simulation (2005)

How much effort will be required to compose or reuse simulations? What factors need to be considered? It is generally known that composability and reusability are daunting challenges for both simulations and more broadly software design as a whole. We have conducted a small case study in order to clarify the role that model context plays in simulation composability and reusability. For a simple problem: compute the position and velocity of a falling body, we found that a reasonable formulation of a solution included a surprising number of implicit constraints. Equally surprising, in a challenge posed to a small group of capable individuals, no one of them was able to identify more than three-quarters of the ultimate set of validation constraints. We document the challenge, interpret its results, and discuss the utility our study will have in future investigations into simulation composition and reuse.
Supermarket Game: An Adaptive Intelligent Computer Game for Attention Deficit/Hyperactivity Disorder Diagnosis
Authors: Leila Cristina Vasconcelos de Andrade, Luis Alfredo Vidal Carvalho, Cabral Lima, Adriano Cruz, Paulo Mattos, Carlos Franco, Adriana Soares, Bruno Grieco
Venue: Proceedings of the Fifth Mexican International Conference on Artificial Intelligence (2006)

The This work reports the research and the application of an adaptive intelligent computer game with a fuzzy decision system developed specifically to help in the diagnosis process of the Attention Deficit/Hyperactivity Disorder (ADHD). ADHD is a neuropathology, its main signal is the severe performance impairment of activities that involves executive functions: planning, volition, problem resolution and aim oriented works. The specification, implementation and other relevant aspects of The Supermarket Game are here discussed.
Using a temporal constraint network for business process execution
Authors: Ruopeng Lu, Shazia Sadiq, Vineet Padmanabhan, Guido Governatori
Venue: Proceedings of the 17th Australasian Database Conference - Volume 49 (2006)

Business process management (BPM) has emerged as a dominant technology in current enterprise systems and business solutions. However, the technology continues to face challenges in coping with dynamic business environments where requirements and goals are constantly changing. In this paper, we present a modelling framework for business processes that is conducive to dynamic change and the need for flexibility in execution. This framework is based on the notion of process constraints. Process constraints may be specified for any aspect of the process, such as task selection, control flow, resource allocation, etc. Our focus in this paper is on a set of scheduling constraints that are specified through a temporal constraint network. We will demonstrate how this specification can lead to increased flexibility in process execution, while maintaining a desired level of control. A key feature and strength of the approach is to use the power of constraints, while still preserving the intuition and visual appeal of graphical languages for process modelling.
Optimal spike-timing-dependent plasticity for precise action potential firing in supervised learning
Authors: Jean-Pascal Pfister, Taro Toyoizumi, David Barber, Wulfram Gerstner
Venue: Neural Computation (2006)

In timing-based neural codes, neurons have to emit action potentials at precise moments in time. We use a supervised learning paradigm to derive a synaptic update rule that optimizes by gradient ascent the likelihood of postsynaptic firing at one or several desired firing times. We find that the optimal strategy of up- and downregulating synaptic efficacies depends on the relative timing between presynaptic spike arrival and desired postsynaptic firing. If the presynaptic spike arrives before the desired postsynaptic spike timing, our optimal learning rule predicts that the synapse should become potentiated. The dependence of the potentiation on spike timing directly reflects the time course of an excitatory postsynaptic potential. However, our approach gives no unique reason for synaptic depression under reversed spike timing. In fact, the presence and amplitude of depression of synaptic efficacies for reversed spike timing depend on how constraints are implemented in the optimization problem. Two different constraints, control of postsynaptic rates and control of temporal locality, are studied. The relation of our results to spike-timing-dependent plasticity and reinforcement learning is discussed.
Regular multidimensional linear phase FIR digital filter banks and wavelet bases
Authors: T. Cooklev, A. Nishihara, T. Yoshida, M. Sablatash
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

Design methods for regular multidimensional perfect reconstruction (PR) filter banks are described. A systematic method for two-channel and four-channel filter banks is presented. The main novelties are: (1) the filters have impulse response with square support, rather than diamond support, (2) regular designs that have rectangular support are also presented, which are highly efficient in practice, since expensive memory is saved; (3) in addition to new diamond filters for the two-channel case, hexagonally-symmetric filters are also derived; and (4) novel 3-D filter banks are also designed. In all cases the filters are linear phase, achieve arbitrarily high regularity and can be used to obtain biorthogonal wavelet bases. The filter banks can be implemented in a structurally perfect-reconstruction manner.
Fast communication: Convolution invariance and corrected impulse invariance
Authors: Eduard Eitelberg
Venue: Signal Processing (2006)

The impulse invariant method of digital implementation of analog filters is re-interpreted as a convolution invariance. This leads automatically to the corrected impulse invariant method that was recently introduced by Mecklenbrauker [Remarks on and correction to the impulse invariant method for the design of IIR digital filters. Signal Processing 80 (2000) 1687-1690] and Jackson [A correction to impulse invariance. IEEE Signal Processing Lett. 7 (10) (2000) 273-275] and extends its application to a larger class of transfer functions.
A Conceptual Structure of Knowledge as a Basis for Instructional Designs
Authors: Sjir Nijssen, Rita Bijlsma
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

As in the knowledge economy life-long learning is becoming the rule, instructional design requires a similar solid base as e.g. bridge engineering. Bridges seldom fall apart thanks to design in accordance with well tested and commonly accepted design rules, based on a even more thoroughly tested and commonly accepted model, namely physics. Given the increasing importance of instructional design [6], well tested design rules become desirable for instructional design as well. As a contribution to the discussion of design rules, this paper proposes a model for verbalizable knowledge from which a complete set of design rules follows and which bases instructional design for cognitive tasks solidly on logic, the intrinsic structure of knowledge and proven didactical principles. This model for knowledge driven instructional design (KD-ID) allows for extensive quantification in instructional design and training and is compatible with modern ontology approaches, especially the World Wide Web standard OWL [3].
I. The Neurocognitive Profile of Williams Syndrome: A Complex Pattern of Strengths and Weaknesses
Authors: Ursula Bellugi, Liz Lichtenberger, Wendy Jones, Zona Lai, Marie St. George
Venue: Journal of Cognitive Neuroscience (2000)

The rare, genetically based disorder, Williams syndrome (WMS), produces a constellation of distinctive cognitive, neuroanatomical, and electrophysiological features which we explore through the series of studies reported here. In this paper, we focus primarily on the cognitive characteristics of WMS and begin to forge links among these characteristics, the brain, and the genetic basis of the disorder. The distinctive cognitive profile of individuals with WMS includes relative strengths in language and facial processing and profound impairment in spatial cognition. The cognitive profile of abilities, including what is &lsquo;typical&rsquo; for individuals with WMS is discussed, but we also highlight areas of variability across the group of individuals with WMS that we have studied. Although the overall cognitive abilities (IQs) of individuals with WMS are typically in the mild-to-moderate range of mental retardation, the peaks and valleys within different cognitive domains make this syndrome especially intriguing to study across levels. Understanding the brain basis (and ultimately the genetic basis) for higher cognitive functioning is the goal we have begun to undertake with this line of interdisciplinary research.
Processing Words with Emotional Connotation: An fMRI Study of Time Course and Laterality in Rostral Frontal and Retrosplenial Cortices
Authors: M. Allison Cato, Bruce Crosson, Didem Gökçay, David Soltysik, Christina Wierenga, Kaundinya Gopinath, Nathan Himes, Heather Belanger, Russell M. Bauer, Ira S. Fischler, Leslie Gonzalez-rothi, Richard W. Briggs
Venue: Journal of Cognitive Neuroscience (2004)

Responses of rostral frontal and retrosplenial cortices to the emotional significance of words were measured using functional magnetic resonance imaging (fMRI). Twenty-six strongly right-handed participants engaged in a language task that alternated between silent word generation to categories with positive, negative, or neutral emotional connotation and a baseline task of silent repetition of emotionally neutral words. Activation uniquely associated with word generation to categories with positive or negative versus neutral emotional connotation occurred bilaterally in rostral frontal and retrosplenial cortices. Furthermore, the time courses of activity in these areas differed, indicating that they subserve different functions in processing the emotional connotation of words. Namely, the retrosplenial cortex appears to be involved in evaluating the emotional salience of information from external sources, whereas the rostral frontal cortex also plays a role in internal generation of words with emotional connotation. In both areas, activity associated with positive or negative emotional connotation was more extensive in the left hemisphere than the right, regardless of valence, presumably due to the language demands of word generation. The present findings localize specific areas in the brain that are involved in processing emotional meaning of words within the brain's distributed semantic system. In addition, time course analysis reveals diverging mechanisms in anterior and posterior cortical areas during processing of words with emotional significance.
Using partial evaluation in distributed query evaluation
Authors: Peter Buneman, Gao Cong, Wenfei Fan, Anastasios Kementsietsidis
Venue: Proceedings of the 32nd international conference on Very large data bases (2006)

A basic idea in parallel query processing is that one is prepared to do more computation than strictly necessary at individual sites in order to reduce the elapsed time, the network traffic, or both in the evaluation of the query. We develop this idea for the evaluation of boolean XPath queries over a tree that is fragmented, both horizontally and vertically over a number of sites. The key idea is to send the whole query to each site which partially evaluates, in parallel, the query and sends the results as compact boolean functions to a coordinator which combines these to obtain the result. This approach has several advantages. First, each site is visited only once, even if several fragments of the tree are stored at that site. Second, no prior constraints on how the tree is decomposed are needed, nor is any structural information about the tree required, such as a DTD. Third, there is a satisfactory bound on the total computation performed on all sites and on the total network traffic. We also develop a simple incremental maintenance algorithm that requires communication only with the sites at which changes have taken place; moreover the network traffic depends neither on the data nor on the update. These results, we believe, illustrate the usefulness and potential of partial evaluation in distributed systems as well as centralized xml stores for evaluating XPath queries and beyond.
The Meaningful Infinity
Authors: Chefi Ketata, Mysore G. Satish, M. Rafiqul Islam
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

Chaos is the order of nature. Nature is characterized by its chaotic variables and processes. These variables and processes are described by numbers and words. Numbers in classical mathematics are static and rigid. However, nature is dynamic and evolutionary. Therefore, it is vital to propose new definitions and meanings for the numbers in order to describe properly nature behavior and therefore know its chaos. For example, the mysterious numbers zero and infinity lack precision. Infinity is defined as being always unlimited. However, when solving mathematical equations, infinity becomes limited, which is contradictory to the previous and original concept. This paper introduces infinity as a dynamic and evolutionary number, which adds meaning and precision to it. The various chaos arithmetic operations involving infinity are defined. They include addition, subtraction, multiplication, and division. This paper represents a novel and essential contribution to establish a new branch of mathematics that is chaos arithmetic.
The Right Hemisphere Involvement in the Processing of Morphologically Derived Words
Authors: Paola Marangolo, Chiara Incoccia, Luigi Pizzamiglio, Umberto Sabatini, Alessandro Castriota-scanderbeg, Cristina Burani
Venue: Journal of Cognitive Neuroscience (2003)

It is widely documented that the left hemisphere is dominant in all complex linguistic tasks, including the processing of inflectional morphology. Both in Italian and in other languages, patients with brain damage with a selective deficit in derivational morphology have never been reported. Here we present the unusual case of two patients with very similar right-hemisphere lesions, who in the absence of aphasic disorders showed a selective inability in producing derivational morphology. Although both patients were unimpaired in producing verb infinitives, they both showed a selective deficit in producing nouns derived from verbs. This difficulty was not present in deriving nouns from other grammatical categories, such as adjectives. Interestingly, both patients mostly substituted the derived noun with the past participle of the verb. This pattern of results documents for the first time a right-hemisphere contribution in the domain of derivational morphology.
Information Technology in Health Care Systems: Barriers to Adoption
Authors: Stefanos Zenios
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2006)

The security flaws of the current the IEEE 802.11 standard are well known and have widely been publicized. To provide improvements in security and enhance the current 802.11 MAC, the IEEE 802.11i task group has proposed a new security architecture called Robust Security Network (RSN). The proposed improvements in the new architecture focus on two areas; the IEEE 802.1X standard for access control and encryption using Advanced Encryption Standard (AES). RSN uses a pair-wise key exchange protocol utilizing 802.1X for mutual authentication. In this paper, we present two alternative pair-wise key exchange protocols to provide mutual authentication in Robust Security Networks. We utilize the same message structures used in RSN and reduce the number of handshake messages. These alternative protocols improve the timing requirements for mobility in WLANs, reduce channel contention, and decrease computational load on all users in WLANs. We also discuss the advantages and disadvantages of our proposed protocols in terms of complexity and vulnerabilities.
Generalized (η,ρ)-Invex Functions and Global Semiparametric Sufficient Efficiency Conditions for Multiobjective Fractional Programming Problems Containing Arbitrary Norms
Authors: G. J. Zalmai
Venue: Journal of Global Optimization (2006)

The purpose of this paper is to develop a fairly large number of sets of global semiparametric sufficient efficiency conditions under various generalized (&eta;, &rho;)-invexity assumptions for a multiobjective fractional programming problem involving arbitrary norms.
Orthography Influences the Perception of Speech in Alexic Patients
Authors: Kimberly M. Miller, Diane Swick
Venue: Journal of Cognitive Neuroscience (2003)

Interactive models of reading propose that phonological representations directly activate and/or constrain orthographic representations through feedback. These models also predict that spoken words should activate their orthographic forms. The effect of word orthography on auditory lexical access was investigated in two patients with alexia without agraphia. Several theories of alexia suggest that letter-by-letter reading results from impaired access to orthographic representations. Although alexics can often correctly identify orally spelled words and spell to dictation, it is unknown whether they can access the whole orthographic "word-form" as a unit via auditory presentation. The nonobligatory activation of orthography was examined in an auditory lexical decision task, in which the orthographic and phonological similarity between prime and target was manipulated. In controls, the combined effect of phonological and orthographic relatedness (OP) produced greater facilitation than phonological relatedness alone, indicating that orthography can influence auditory lexical decisions. The alexics displayed patterns of facilitation comparable to controls, suggesting they can quickly access whole-word orthographic information via the auditory modality. An alternate account posits that the OP advantage does not require on-line access of orthography, but instead is a developmental by-product of learning to read an orthographically inconsistent language. The results have implications for cognitive theories of alexia and provide support for interactive models of word recognition.
Rachael SPARC: An Open Source 32-bit Microprocessor Core for SoCs
Authors: Michael Cowell, Adam Postula
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

SoC design methodology is totally dependent on the availability of reliable, easily interfaced and well supported IP cores. Complex cores such as microprocessors can be very expensive if licenced from commercial providers. Research projects, and even small companies, look for open source cores despite the problems associated with this source. The Rachael embedded processor discussed in this paper is a result of an open source initiative, supported both by a commercial design firm and a university. The processor is based on the proven SPARC architecture and was developed in Verilog with systematic methodology as used in industry. Rachael has a flexible memory architecture and is interfaced to the AMBA on chip bus. It is supported by a suite of development tools and is made available as an open source core. Rachel was extensively tested on Virtex4, an earlier version was used in a commercial chip, and a full version is to be fabricated. We discuss architectural issues and trade-offs in the design of Rachael, present its architecture, and analyse performance factors. The Verilog pre-processor developed for the project is briefly introduced. The open source project is presented and analysed from both the university and industry perspectives. Rachael runs at speed on Xilinx's ML401 board and it can be demonstrated executing various software applications.
Algorithms for non-uniform size data placement on parallel disks
Authors: Srinivas Kashyap, Samir Khuller
Venue: Journal of Algorithms (2006)

We study an optimization problem that arises in the context of data placement in a multimedia storage system. We are given a collection of M multimedia objects (data items) that need to be assigned to a storage system consisting of N disks d1, d2,...,dN. We are also given sets U1, U2,...,UM such that Ui is the set of clients seeking the ith data item. Data item i has size si. Each disk dj is characterized by two parameters, namely, its storage capacity Cj which indicates the maximum total size of data items that may be assigned to it, and a load capacity Lj which indicates the maximum number of clients that it can serve. The goal is to find a placement of data items to disks and an assignment of clients to disks so as to maximize the total number of clients served, subject to the capacity constraints of the storage system.We study this data placement problem for homogeneous storage systems where all the disks are identical. We assume that all disks have a storage capacity of k and a load capacity of L. Previous work on this problem has assumed that all data items have unit size, in other words si = 1 for all i. Even for this case, the problem is NP-hard. For the case where si ∈ {1,..., Δ} for some constant Δ, we develop a polynomial time approximation scheme (PTAS). This result is obtained by developing two algorithms, one that works for constant k and one that works for arbiuary k. The algorithm for arbitrary k guarantees that a solution where at least ((k-Δ)/(k + Δ))(1 - 1/(1 + √k/(2Δ))2)- fraction of all clients are assigned to a disk (under certain assumptions). In addition we develop an algorithm for which we can prove tight bounds when si ∈ {1,2}. In fact, we can show that a (1 - 1/(1 + √⌊k/2⌋)2)-fraction of all clients can be assigned (under certain natural assumptions), regardless of the input distribution.
A Model and Language for Bitemporal Schema Versioning in Data Warehouses
Authors: Ericka-Janet Rechy-Ramirez, Edgard Benitez-Guerrero
Venue: Proceedings of the 15th International Conference on Computing (2006)

A Data Warehouse (DW) is a vast collection of historical data built to support multidimensional data analysis applications. In this context, an important problem is that of evolving the implementation (multidimensional, relational) schema of a DW to incorporate new requirements. This paper introduces a conceptual evolution model based on bitemporal versioning of multidimensional schemas, which allows one to modify the DWschema (a) in an implementation-independent manner, and (b) without affecting the operation of existing applications. It also presents a SQL-like language associated to this model, which offers expressions to create and change versions of multidimensional schemas.