ppxscal/embedding_network huggingface dataset:
Distributed usage control
Authors: Alexander Pretschner, Manuel Hilty, David Basin
Venue: Communications of the ACM (2006)

Using a server-side architecture to connect specialized enforcement mechanisms with usage control requirements and policies.
Influence of Prosodic Information on the Processing of Split Particles: ERP Evidence from Spoken German
Authors: Frédéric Isel, Kai Alter, Angela D. Friederici
Venue: Journal of Cognitive Neuroscience (2005)

Spoken language comprehension involves the use of different sources of linguistic information such as prosodic, syntactic, lexical, and semantic information. The question, however, of ''when'' and ''how'' these sources of information are exploited by the language processing system still remains unanswered. In the present study, we used event-related brain potentials (ERPs) to investigate the interaction between prosodic, syntactic, and lexical information during the processing of spoken German sentences. The sentence structure was manipulated by positioning a split particle at the end of the sentences after the occurrence of inflected verb whose lexical entry does not contain a split particle (e.g., &ast;Sie alarmierte den Detektiv an [&ast;She alerted at the detective]) [According to linguistic convention, incorrect sentences are marked by an asterisk.]. The prosodic contour of the verb stems was manipulated such that it marked either the presence of a split particle at a later position in the sentence or not. Participants performed an off-line probe-detection task. ERP data indicate that prosodic information of German-inflected verb stems is consulted on-line by the language processing system (''parser'') in order to ''predict'' the presence of a split particle at a later position in the sentence. An N400 effect was observed for the processing of split particles following verb stems which do not take a particle. However, this effect was only observed when the prosody of the verb stem did signal the presence of a split particle. We argue that the N400 component reflects the high costs associated with the lexical search that the language processing system has to perform when confronted with nonexisting words such as these resulting from the combination of the split particle and the verb stem in the present study. Furthermore, as a general reflection of prosodic processes, a Closure Positive Shift (CPS) was found at intonational phrase boundaries. In sum, the present findings provide strong evidence that prosodic information is a good ''predictor'' of upcoming information during the auditory processing of German sentences.
Route Failure Time of Node-Disjoint Paths in Mobile Ad hoc Networks
Authors: Ash Mohammad Abbas
Venue: Proceedings of the 9th International Conference on Information Technology (2006)

In this paper, we analyze the route failure time of nodedisjoint paths in an ad hoc network. We discuss an exact expression for the expected value of route failure time when lifetimes of individual paths are independent and identically distributed random variables. When the lifetimes are not independent, we discuss an upper bound on route failure time. In order to validate the model, we simulate exponentially distributed random variables. The values of route failure time obtained from simulations are close to those obtained analytically.
Computer Simulation of Compositional Flow Using Unstructured Control Volume Finite Element Methods
Authors: Z. Chen, G. Huan, H. Wang
Venue: Computing (2006)

In this paper, we study the computer simulation of gas cycling in a rich retrograde condensate reservoir. Two prediction cases are studied. The first case is gas cycling with constant sales gas removal, and the second case is cycling with some gas sales deferral to enhance pressure maintenance in the early life of this reservoir. In this problem the great majority of cycling takes place at pressure below the dew point pressure, indicating the need for modeling the compositional three-phase, multicomponent flow in the reservoir. This compositional model consists of Darcy's law for volumetric flow velocities, mass conservation for hydrocarbon components, thermodynamic equilibrium for mass interchange between phases, and an equation of state for saturations. The control volume finite element (CVFE) method on unstructured grids is used to discretize the model governing equations for the first time. Numerical experiments are reported for the benchmark problem of the third comparative solution project (CSP) organized by the society of petroleum engineers (SPE). The PVT (pressure-volume-temperature) data are based on a real fluid analysis.
Multi-agent reinforcement learning algorithm to handle beliefs of other agents' policies and embedded beliefs
Authors: Takaki Makino, Kazuyuki Aihara
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

We have developed a new series of multi-agent reinforcement learning algorithms that choose a policy based on beliefs about co-players' policies. The algorithms are applicable to situations where a state is fully observable by the agents, but there is no limit on the number of players. Some of the algorithms employ embedded beliefs to handle the cases that co-players are also choosing a policy based on their beliefs of others' policies. Simulation experiments on Iterated Prisoners' Dilemma games show that the algorithms using on policy-based belief converge to highly mutually-cooperative behavior, unlike the existing algorithms based on action-based belief.
On Weighting Clustering
Authors: Richard Nock, Frank Nielsen
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

Recent papers and patents in iterative unsupervised learning have emphasized a new trend in clustering. It basically consists of penalizing solutions via weights on the instance points, somehow making clustering move toward the hardest points to cluster. The motivations come principally from an analogy with powerful supervised classification methods known as boosting algorithms. However, interest in this analogy has so far been mainly borne out from experimental studies only. This paper is, to the best of our knowledge, the first attempt at its formalization. More precisely, we handle clustering as a constrained minimization of a Bregman divergence. Weight modifications rely on the local variations of the expected complete log-likelihoods. Theoretical results show benefits resembling those of boosting algorithms and bring modified (weighted) versions of clustering algorithms such as k\hbox{-}\rm means, fuzzy c\hbox{-}\rm means, Expectation Maximization (EM), and k\hbox{-}\rm harmonic means. Experiments are provided for all these algorithms, with a readily available code. They display the advantages that subtle data reweighting may bring to clustering.
Making a difference with attention to content, technology, and scale: a session honoring the memory of Jim Kaput
Authors: Stephen Hegedus, Dick Lesh, Jeremy Roschelle
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

The theme of this year's ICLS, "making a difference," resonates with the life-work of our dear colleague, Jim Kaput, who unexpectedly passed away in summer 2005. Kaput's approach to making a difference was grounded in the Learning Sciences and distinctively attended to the nature of mathematical content, the role of technology, and the problematic of scale. In this symposium, we honor his memory by discussing the current projects of three investigators who continue to drive Kaput's vision forward. These projects address: (1) "foundations for the future" based in a deep reconceptualization of mathematical content (2) technology as representational and connectivity infrastructure that democratizes access to mathematics worth knowing and (3) scale as a challenging problematic essential to "making a difference."
FROSTY: a program for fast extraction of high-level structural representation from circuit description for industrial CMOS circuits
Authors: Lei Yang, C.-J. Richard Shi
Venue: Integration, the VLSI Journal (2006)

This paper presents FROSTY, a computer program for automatically extracting the high-level structural representation of a large-scale digital CMOS circuit from its transistor-level netlist and a library of subcircuit descriptions. To handle the complexity and diversity of industrial circuits, FROSTY combines traditional structural recognition and pattern matching methods into a two-step extraction process. First, logic structures based on channel-connected-components are recognized from a circuit netlist and from all library subcircuits, and are condensed into "macro devices" or called logic gates. This leads to hybrid netlists that contain the recognized logic gates and remaining transistors. Then annotated graphs representing the connectivity and properties of logic gates and remaining transistors are constructed. Compared to transistor-level netlists, these hybrid graphs are much smaller in size, more distinguishable in structure, and are thus more suitable for labeling-based pattern matching. An efficient pattern matching algorithm is then applied to extract the high-level structural representation from these condensed circuit graphs. FROSTY has demonstrated to be orders of magnitude faster than the pattern matching-based extraction program SubGemini, and can extract entire industrial designs with several hundreds of thousands of transistors in a few minutes on a modern Sun workstation. Furthermore, the FROSTY algorithm scales well with the size of a circuit.
On Modular Counting with Polynomials
Authors: Kristoffer Arnsfelt Hansen
Venue: Proceedings of the 21st Annual IEEE Conference on Computational Complexity (2006)

For any integers m and l, where m has r sufficiently large (depending on l) factors, that are powers of r distinct primes, we give a construction of a (symmetric) polynomial over Z_m of degree O(\sqrt n) that is a generalized representation (commonly also called weak representation) of the MODl function. We give a detailed study of the case when m has exactly two distinct prime factors, and classify the minimum possible degree for a symmetric representing polynomial.
The p-sized partitioning algorithm for fast computation of factorials of numbers
Authors: Ahmet Ugur, Henry Thompson
Venue: The Journal of Supercomputing (2006)

Computing products of large numbers has always been a challenging task in the field of computing. One such example would be the factorial function. Several methods have been implemented to compute this function including naive product, recursive product, Boiten split, and prime factorization, and linear difference. The method presented here is unique in the sense that it exploits finite order differences to reduce the number of multiplications necessary to compute the factorial. The differences generated are regrouped into a new sequence of numbers, which have at most half as many elements of the original sequence. When the terms of this new sequence are multiplied together, the factorial value is obtained. The cardinality of the new sequence can further be reduced by partitioning. The sequence is computed by using several difference tables that assist in establishing the pattern that determines the sequence. An analysis of the algorithm is presented. The analysis shows that the execution time can be reduced significantly by the algorithm presented.
On the role of metaphor and language in design of third party payments in eBanking: Usability and quality
Authors: Catherine S. Weir, James N. Anderson, Mervyn A. Jack
Venue: International Journal of Human-Computer Studies (2006)

This paper describes results of a usability study of contrasting user-interface designs for Internet Banking (eBanking). Two specific interface metaphors were compared in the first experiment, linear form filling and array editing interaction modes. Terminology in the interaction dialogue was compared in the second experiment, using typical banking language and a generic, plain language interface. This research aimed to perform usability evaluation and comparison of the alternative interface designs to illuminate the development of new eBanking services. This research involved sixty-one participants (Internet users and customers of the involved Bank) exploring the designs in controlled experiments involving hands-on experience. Banks are interested in ensuring their eBanking services are highly customer-centric and that the interface matches customer expectations in order to drive customers towards this lower cost channel. The results of the first experiment (N=32, where N indicates the number of participants in the cohort) concluded that the simple form-filling metaphor, taken from the traditional paper-based procedure, was generally more usable than a Spreadsheet metaphor. In the second experiment (N=29), it was found that although banking terminology was not completely understood across the cohort, the instructional language changes did not impact significantly on usability.
Improving reinforcement learning with context detection
Authors: Bruno C. da Silva, Eduardo W. Basso, Filipo S. Perotto, Ana L. C. Bazzan, Paulo M. Engel
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

In this paper we propose a method for solving reinforcement learning problems in non-stationary environments. The basic idea is to create and simultaneously update multiple partial models of the environment dynamics. The learning mechanism is based on the detection of context changes, that is, on the detection of significant changes in the dynamics of the environment. Based on this motivation, we propose, formalize and show the efficiency of a method for detecting the current context and the associated model of prediction, as well as a method for updating each of the incrementally built models.
Learning Non-Unanimous Ontology Concepts to Communicate with Groups of Agents
Authors: Mohsen Afsharchi, Behrouz H. Far, Jorg Denzinger
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

We present an extension to the definition of a concept in an ontology that allows an agent to simultaneously communicate with a group of agents that might have different understandings of some concepts. We also provide a way to learn such non-unanimous concepts by using a method for learning concepts from a group of teachers. The general idea of non-unanimous concepts is to use the teachers to identify the core of a concept everyone agrees on and what else at least some of the teachers think belongs into the concept. The learning agent also decides what belongs to the concept for itself and whenever it needs to communicate with a group of other agents and needs to be precise it makes use of these three concept aspects by providing additional example objects for what might be misunderstood.
Perspectives and problem solving in an algebra classroom
Authors: Carla van de Sande
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

Perspective theory, an extension and generalization of schema theory, adapts the notion of perspective from psycholinguistics to capture the cognitive and interactional creativity in reasoning and problem solving. This poster applies perspective theory to two problem solving episodes of classroom mathematical discourse. The episodes illustrate the negotiation of differing perspectives, participants' commitment to perspective and demonstrate how perspectival constructions can be interactively achieved. Characteristics of task and positioning may encourage participation in exploratory perspectival construction.
The role of technology in preservice teachers' images of their future classroom
Authors: Theresa A. Cullen
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

Participant drawings, descriptive essays, surveys, and interviews were used to assess how 160 beginning preservice teachers envisioned technology in future classrooms. Results were analyzed with the constant comparative method (Glaser & Strauss, 1967) and trait coding (Haney, Russel, & Bebell, 2004). Data demonstrated persistence of teacher-centered technology uses and inconsistencies between espoused views and participant drawings. Results could be used to design interventions for transfer through a better understanding of beginning beliefs of preservice teachers.
Efficient Generation of Shape-Based Reference Frames for the Corpus Callosum for DTI-based Connectivity Analysis
Authors: Hui Sun, Paul A. Yushkevich, Hui Zhang, James C. Gee, Tony J. Simon
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

Yushkevich et.al. [17, 18] established a PDE-based deformable modeling approach called continuous medial representation (cm-rep), in which the geometric relationship between the medial axis of a 3D object and its boundary is captured. Continuous medial description of an object not only provides useful shape features for object characterization and comparison; it also imposes a shape-based reference frame on the interior of that object. Such a reference frame provides a useful means of representing different instances of an anatomical structure using a common canonical parametrization domain. This paper presents an efficient method to construct continuous medial shape models for 2D objects. A closed form solution for the ordinary differential equation (ODE) is derived via Pythagorean hodograph (PH) curves. That closed form solution reduces the computation complexity from solving an ODE system to pure algebraic manipulation. Using this method, we generate shape-based reference frames, and demonstrate how they can be applied to the analysis of anatomical connectivity of corpora callosa, obtained by fiber tracking in diffusion tensor magnetic resonance imaging (DTI) in a chromosome 22q11.2 deletion syndrome study.
Extremal Throughputs in Free-Choice Nets
Authors: Anne Bouillard, Bruno Gaujal, Jean Mairesse
Venue: Discrete Event Dynamic Systems (2006)

We give a method to compute the throughput in a timed live and bounded free-choice Petri net under a total allocation (i.e. a 0---1 routing). We also characterize and compute the conflict-solving policies that achieve the smallest throughput in the special case of a 1-bounded net. They do not correspond to total allocations, but still have a small period.
Multi-Class SVMs Based on Fuzzy Integral Mixture for Handwritten Digit Recognition
Authors: Hassiba Nemmour, Youcef Chibani
Venue: Proceedings of the conference on Geometric Modeling and Imaging: New Trends (2006)

The major drawback of Support Vector Machines (SVMs) is that the training time grows fastly with respect to the number of training samples. This issue becomes more critical for multi-class problems where a set of binary SVMs must be performed. This is the case of the One-Against-All (OAA) approach, which is the most widely used implementation of multi-class SVMs. In this paper, we propose a new divide-and-conquer method to reduce the training time of OAA-based SVMs. Experimental analysis is conducted on handwritten digit recognition task. The results obtained indicate that the proposed scheme allows a significant training and testing time improvement. In addition, a significant improvement in generalization performance was obtained.
Existence and uniqueness of solutions for singular fourth-order boundary value problems
Authors: Xiaoning Lin, Daqing Jiang, Xiaoyue Li
Venue: Journal of Computational and Applied Mathematics (2006)

By mixed monotone method, the existence and uniqueness are established for singular fourth-order boundary value problems. The theorems obtained are very general and complement previous known results.
Implantable medical devices as agents and part of multiagent systems
Authors: Touby Drew, Maria Gini
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

The consideration of medical implants as an increasingly important population of isolated agents is a valuable perspective that should not be ignored by the agent community. Implanted Medical Device (IMD) applications are complex, naturally distributed, and could benefit from such attention. This paper explores implantable medical devices and their attributes in an agent context and terminology. It submits that an increasing body of IMDs should be considered agents and that there are opportunities for incorporating these implantable agents into multiagent systems (MAS). This will include: (i) Discussion of several IMDs in traditional agent terms. (ii) Discussion of trends and issues in IMDs related to their potential role in MAS. (iii) Experimental exploration of some potential MAS applications in the problem of medical monitoring. (iv) Broader discussion of the value of framing IMDs and applications involving them in the agent paradigm.
SIGEST
Authors: The Editors
Venue: SIAM Review (2006)

It is not terribly common for a paper published in a SIAM journal to be referred to as "classical"---many of our topics and areas are too young for that term to apply. However, several of the nominators of this issue&apos;s SIGEST paper, "Some New Aspects of the Coupon Collector&apos;s Problem," by Amy Myers and Herbert Wilf, used that term in a very complimentary sense. Indeed they found the paper to be classical in two regards: in the problem it addresses, and in the mathematical techniques it uses. These characteristics, along with the paper&apos;s excellent results, broad appeal, and clear exposition, are the reasons it is the SIGEST selection from the SIAM Journal on Discrete Mathematics. The classical coupon collector&apos;s problem is the analysis of how many trials it will take for one collector to obtain a full set of d coupons if at each trial the collector has an equal chance of selecting any one of the d possible coupons. More precisely, it determines the probability of the collector first assembling a full set of d coupons after n trials, for each n \geq d. The paper by Myers and Wilf extends this problem to one in which two people each are collecting the same d coupons simultaneously and independently. It asks and answers a number of questions related to this scenario, including the probability that each person first collects a full set of d coupons after the same particular number n of trials, and the probability that the person who first collects a full set of coupons is always ahead (or tied) in terms of the number of different coupons collected, up until and including the time that the full set is obtained. One of the interesting and appealing aspects of this paper is that the solution techniques are fairly direct and accessible. The key is the utilization of classical lattice path techniques. Another interesting aspect is that while many probabilities are initially expressed as infinite sums, the authors show that they can be evaluated in finite terms. Indeed, the paper shows that this phenomenon is true for a general set of infinite series of the type that occur in their analyses. We hope that this paper will serve to familiarize a broad range of SIAM readers with a very interesting, enumerative problem area.