ppxscal/embedding_network huggingface dataset:
A scheduling framework for general-purpose parallel languages
Authors: Matthew Fluet, Mike Rainey, John Reppy
Venue: Proceeding of the 13th ACM SIGPLAN international conference on Functional programming (2008)

The trend in microprocessor design toward multicore and manycore processors means that future performance gains in software will largely come from harnessing parallelism. To realize such gains, we need languages and implementations that can enable parallelism at many different levels. For example, an application might use both explicit threads to implement course-grain parallelism for independent tasks and implicit threads for fine-grain data-parallel computation over a large array. An important aspect of this requirement is supporting a wide range of different scheduling mechanisms for parallel computation. In this paper, we describe the scheduling framework that we have designed and implemented for Manticore, a strict parallel functional language. We take a micro-kernel approach in our design: the compiler and runtime support a small collection of scheduling primitives upon which complex scheduling policies can be implemented. This framework is extremely flexible and can support a wide range of different scheduling policies. It also supports the nesting of schedulers, which is key to both supporting multiple scheduling policies in the same application and to hierarchies of speculative parallel computations. In addition to describing our framework, we also illustrate its expressiveness with several popular scheduling techniques. We present a (mostly) modular approach to extending our schedulers to support cancellation. This mechanism is essential for implementing eager and speculative parallelism. We finally evaluate our framework with a series of benchmarks and an analysis.
Modeling the Regular Constraint with Integer Programming
Authors: Marie-Claude Côté, Bernard Gendron, Louis-Martin Rousseau
Venue: Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (2007)

Many optimisation problems contain substructures involving constraints on sequences of decision variables. Such constraints can be very complex to express with mixed integer programming (MIP), while in constraint programming (CP), the global constraint regular easily represents this kind of substructure with deterministic finite automata (DFA). In this paper, we use DFAs and the associated layered graph structure built for the regular constraint consistency algorithm to develop a MIP version of the constraint. We present computational results on an employee timetabling problem, showing that this new modeling approach can significantly decrease computational times in comparison with a classical MIP formulation.
On the Liapunov-Krasovskii methodology for the ISS of systems described by coupled delay differential and difference equations
Authors: P. Pepe, I. Karafyllis, Z. -P. Jiang
Venue: Automatica (Journal of IFAC) (2008)

The input-to-state stability of time-invariant systems described by coupled differential and difference equations with multiple noncommensurate and distributed time delays is investigated in this paper. Such equations include neutral functional differential equations in Hale's form (which model, for instance, partial element equivalent circuits) and describe lossless propagation phenomena occurring in thermal, hydraulic and electrical engineering. A general methodology for systematically studying the input-to-state stability, by means of Liapunov-Krasovskii functionals, with respect to measurable and locally essentially bounded inputs, is provided. The technical problem concerning the absolute continuity of the functional evaluated at the solution has been studied and solved by introducing the hypothesis that the functional is locally Lipschitz. Computationally checkable LMI conditions are provided for the linear case. It is proved that a linear neutral system in Hale's form with stable difference operator is input-to-state stable if and only if the trivial solution in the unforced case is asymptotically stable. A nonlinear example taken from the literature, concerning an electrical device, is reported, showing the effectiveness of the proposed methodology.
Mousetrap 2.0
Authors: Venkatesh G. Rao, Brian Petty
Venue: Massively Multi-Agent Technology: AAMAS Workshops, MMAS 2006, LSMAS 2006, and CCMMS 2007 Hakodate, Japan, May 9, 2006 Honolulu, HI, USA, May 15, 2007 Selected and Revised Papers (2008)

The chapters in this book describe a variety of algorithms, infrastructure ideas, and applications involving large numbers of coordinated agents: Massive Multi Agent Systems (MMAS) in short. History tells us though, that powerful technological revolutions, like MMAS promises to be, often shape up in ways we cannot imagine. What Einstein said about nature holds for future technology as well - it is not only weirder than we imagine, but weirder than we can imagine. Vannevar Bush, for instance, first imagined something like the Internet in his idea for a `Memex' in a popular article, As We May Think, published in the Atlantic Monthly back in 1948. While his vision inspired the original architects of the Internet, what we see today, 60 years later, would certainly dazzle even an exceptional visionary like Bush.
Prediction of Aortic Diameter Values in Healthy Turkish Infants, Children and Adolescents Via Adaptive Network Based Fuzzy Inference System
Authors: Bayram Akdemir, Salih Güneş, Bülent Oran
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

The aorta diameter size one of the cardiac value is very important to guess for child before adult age, due to growing up body. In conventional method, the experts use curve charts to decide whether their measured aortic diameter size is normal or not. Our proposed method presents a valid virtual aortic diameter result related to age, weight and sex. The proposed method comprises of two stages: (i) data normalization using a normalization method called Line Base Normalization Method (LBNM) that is firstly proposed by us, (ii) normalized aortic diameter prediction using Adaptive Network Based Fuzzy Inference Systems (ANFIS). Data set includes real Turkish infants, children and adolescents values and divided into two groups as 50% training -50% testing split of whole dataset to show performance of ANFIS. LBNM compared to three normalization methods including Min-Max normalization, Z-score, and decimal scaling methods. The results were compared to real aortic diameters values by expert with nine year experiences in medical area.
The Zariski spectrum as a formal geometry
Authors: Peter Schuster
Venue: Theoretical Computer Science (2008)

We choose formal topology to deal in a basic manner with the Zariski spectra of commutative rings and their structure sheaves. By casting prime and maximal ideals in a secondary role, we thus wish to prepare a constructive and predicative framework for abstract algebraic geometry. In contrast to the classical approach, neither points nor stalks need occur, let alone any instance of the axiom of choice. As compared with the topos-theoretic treatments that may be rendered predicative as well, the road we follow is built from more elementary material. The formal counterpart of the structure sheaf which we present first is our guiding example for a notion of a sheaf on a formal topology. We next define the category of formal geometries, a natural abstraction from that of locally ringed spaces. This allows us to eventually phrase and prove, still within the language of opens and sections, the universal property of the Zariski spectrum. Our version appears to be the only one that is explicitly point-free.
Optimal signed-binary recoding for cryptography
Authors: Rajendra S. Katti
Venue:  (2007)

The central topic of this dissertation is the alternating greedy expansion and the minimal joint weight expansion of integers. Both expansions are defined to be signed-binary representations with digits {-1, 0, 1} as opposed to {0,1} in the normal binary number system. The alternating greedy expansion of an integer is the unique expansion with the property that nonzero digits have alternating signs. The minimal joint weight expansion of integers has the minimal number of nonzero columns among all possible expansions with {-1, 0, 1} of the given integers. This dissertation first gives two algorithms for computing the alternating greedy expansion of an integer from unisigned-binary expansion and signed-binary expansion from left to right; i.e., from the column with the most significant bits towards the column with the least significant bits, respectively. It then proposes an algorithm for computing a minimal joint weight expansion of d integers (d &ge; 1) from their normal binary representation with alternating greedy expansion as the intermediate step. This algorithm operates from left to right. The minimal joint weight expansion is very useful in speeding up the operations in public-key elliptic curve cryptosystems.
A Warranty of Cyberworthiness
Authors: Roland L. Trope
Venue: IEEE Security and Privacy (2004)

Explores the possibilities of a written warranty that vouches for an application's capabilities to protect confidential information from unauthorized access from, or disclosure to, cyberspace, a warranty of cyberworthiness. Software makers have much to gain if they consider offering a limited warranty that addresses their customers' most manageable, serious concerns.
Rational Agents That Blush
Authors: Paolo Turrini, John-Jules Ch. Meyer, Cristiano Castelfranchi
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

A student, supported by his classmates, throws a piece of chalk at the teacher who is writing on the blackboard. The teacher rapidly turns back and promptly catches him in the act. The student blushes and suddenly realizes how bad it was what he did.
Recognizing Meter Parameters Symbols Based on the Combined Features and Support Vector Machine
Authors: Yanling Zhang, Renhuang Wang
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

A novel method to recognize meter parameters symbols, based on the combined features of Hu moment & compactness and support vector machine, is proposed. In the process of analyzing invariant moment features of discrete status, a new method that a feature is divided another feature is introduced to eliminate the influence of scale factor for these features. At last, support vector machine is used to recognize meter parameters symbols. Experiments results show the present method achieves recognition accuracy of 97.77% and has more obvious advantages.
Multilingual Question Answering through Intermediate Translation: LCC's PowerAnswer at QA@CLEF 2007
Authors: Mitchell Bowden, Marian Olteanu, Pasin Suriyentrakorn, Thomas D'Silva, Dan Moldovan
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

This paper reports on Language Computer Corporation's QA@CLEF 2007 preparation, participation and results. For this exercise, LCC integrated its open-domain PowerAnswer Question Answering system with its statistical Machine Translation engine. For 2007, LCC participated in the English-to-French and English-to-Portuguese cross-language tasks. The approach is that of intermediate translation, only processing English within the QA system regardless of the input or source languages. The output snippets were then mapped back into the source language documents for the final output of the system and submission. What follows is a description of the improved system and methodology and updates from QA@CLEF 2006.
Planning in Multiagent Expedition with Collaborative Design Networks
Authors: Yang Xiang, Frank Hanshar
Venue: Proceedings of the 20th conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence (2007)

DEC-POMDPs provide formal models of many cooperative multiagent problems, but their complexity is NEXP-complete in general. We investigate a sub-class of DEC-POMDPs termed multiagent expedition. A typical instance consists of an area populated by mobile agents. Agents have no prior knowledge of the area, have limited sensing and communication, and effects of their actions are uncertain. Success relies on planing actions that result in high accumulated rewards. We solve an instance of multiagent expedition based on collaborative design network, a decision theoretic multiagent graphical model. We present a number of techniques employed in knowledge representation and demonstrate the superior performance of our system in comparison to greedy agents experimentally.
An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs
Authors: Zhi-Zhong Chen, Ruka Tanahashi
Venue: Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management (2007)

We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of $\frac{468}{575}$. This improves on the previous best (trivial) ratio of $\frac{4}{5}$.
A fast high-order finite difference algorithm for pricing American options
Authors: D. Y. Tangman, A. Gopaul, M. Bhuruth
Venue: Journal of Computational and Applied Mathematics (2008)

We describe an improvement of Han and Wu's algorithm [H. Han, X.Wu, A fast numerical method for the Black-Scholes equation of American options, SIAM J. Numer. Anal. 41 (6) (2003) 2081-2095] for American options. A high-order optimal compact scheme is used to discretise the transformed Black-Scholes PDE under a singularity separating framework. A more accurate free boundary location based on the smooth pasting condition and the use of a non-uniform grid with a modified tridiagonal solver lead to an efficient implementation of the free boundary value problem. Extensive numerical experiments show that the new finite difference algorithm converges rapidly and numerical solutions with good accuracy are obtained. Comparisons with some recently proposed methods for the American options problem are carried out to show the advantage of our numerical method.
Educational technology associations as change agents: a case study
Authors: Christine Stephenson
Venue:  (2007)

This research addressed the role of educational technology associations as change agents within education with particular emphasis on issues of advocacy and leadership. Using a poststructural feminist lens and the metaphor of interview and analysis as storytelling, it explored the perspectives of nineteen individuals belonging to a national level educational technology association. This research addressed a single research question: How do the various stakeholders (staff, volunteers, and members) in an educational technology association describe the organization&rsquo;s contribution to the educational system in terms of its role as a change agent? Data for this research were collected over twelve months and were taken from four main sources: the researcher&rsquo;s journal, individual interviews, observations, and association publications (both internal and external). Data from the interviews, observations, and documents were analyzed over the course of the year-long data collection process using a modified constant comparative method. The trustworthiness of this research should be considered in light of poststructural epistemological concepts of substantive contribution, aesthetic merit, reflexivity, impact, and expression of reality. The results indicated that the participants have a complex relationship with their educational technology association and that ideas of change agency, advocacy, and leadership play an important role in how they perceive that organization and how they experience their own involvement with it. Regardless of the nature of their engagement, the association&rsquo;s staff, volunteers, and members perceive it as an instrument of and an ally for improving teaching and learning through the medium of educational technology. They also experience their connection to the association as both a support for and reflection of their professionalism. The participants believe that the association offers a number of benefits that make membership worthwhile and at the same time, provides important benefits to the discipline and to education as a whole. They also perceive their association as a leader and an advocate for educational technology, not just as a teaching tool, but as a medium for transforming teaching and learning.
Suspending and resuming tasks in BDI agents
Authors: John Thangarajah, James Harland, David Morley, Neil Yorke-Smith
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1 (2008)

Intelligent agents designed to work in complex, dynamic environments must respond robustly and flexibly to environmental and circumstantial changes. An agent must be capable of deliberating about appropriate courses of action, which may include reprioritising goals, aborting particular tasks, or scheduling tasks in a particular order. This paper investigates the incorporation of a mechanism to suspend and reconsider tasks within a BDI-style architecture. Such an ability provides an agent designer greater flexibility to direct agent operation, and it offers a generic means for handling conflicts between tasks. We investigate conditions under which a goal or a plan may be suspended, the process for suspending it, and the appropriate behaviours upon resumption. We give an operational semantics for suspending tasks in terms of the abstract agent language CAN, thus providing a general mechanism that can be incorporated into any BDI-based agent programming language.
Image Registration by Combining Feature Consensus with Affine Model
Authors: Xiangyu Yu, Lihua Guo
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

As an important task in image processing, image registration has applications in medical analysis, remote sensing and computer vision etc.. However, since images taken by different sensors, automatic image registration, especially automatic feature matching, is difficult. Depending on the fact that the distortion between those images is near affine transformation, affine model is selected as the coarse model, and its parameters are determined by improved feature consensus method together with convex hull of points set. Control points pairs are formed by searching the counterpart points within a threshold in the coarse registration result. Parameters of mapping polynomials are determined by control point pairs to refine the registration. Experimental results indicated that this approach is an efficient way to align images using feature points automatically.
On dipole moments of overlapping atoms. Application to H in 1 s, 2 s, and 2p$_{o}$ states
Authors: Bruno Linder
Venue: Journal of Computational Methods in Sciences and Engineering (2007)

The dipole moments of two overlapping H atoms in the dissimilar states 1 s, 2 s and 2p$_{o}$ were calculated for both the triplet (destructive overlap) and the singlet (constructive overlap) states at large separations. The results are based on the Heitler-London method, using elliptical coordinates with the nucleus of the larger, more diffused orbital, located at a on the Z-axis of the coordinate system, and the nucleus of the smaller, less diffused orbital, located at b on the Z-axis. The origin of the coordinate system is midway between a and b. We find it instructive to identify three types of moments - a moment associated with the orbital on a, a moment associated with the orbital on b, and the overall moment, which is the sum of these two. It is shown that in the region of small overlap the calculated values of the dipoles on a and on b point towards each other in the triplet state, and away from each other in the singlet state. In every case, the total or net dipole moment points from the more diffused orbital towards the more compact orbital. The absolute value of the more diffused orbital is always found to be greater than of the more rigid orbital.
Actions, Causation and Logic Programming
Authors: Vladimir Lifschitz
Venue: Inductive Logic Programming: 16th International Conference, ILP 2006, Santiago de Compostela, Spain, August 24-27, 2006, Revised Selected Papers (2007)

Reasoning about changes caused by the execution of actions has long been at the center of attention of researchers in the area of logic-based AI. Logical properties of causal dependencies turned out to be similar to properties of rules in logic programs. This fact allows us to apply methods of logic programming to computational problems related to action and change. Ideas of answer set programming, based on the concept of a stable model, turned out to be particularly useful. In the past they have been applied primarily to the problem of plan generation. There is now increasing interest also in using logic programming for learning action descriptions.
Particle Attrition Analysis in a High Temperature Rotating Drum
Authors: B. R. Vijayarangan, Samir Moujaes, Michael Flores
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

Particle attrition is one of the important studiesto be investigated as part of solid particle solarreceiver design and developmental program.Two types of mechanism encountered in attritionare (a) Abrasion: wearing down by friction.Particles of much smaller size break away fromthe original particle. (b)Fragmentation: thebreaking-away process gives rise to a number ofparticles of size smaller than the original one.In general, attrition takes place by an abrasivetype mechanism. The attrition phenomenon isbetween the son particles and the fines produced.The mass of fines produced will thereforeprovide a means of measurement of the degree ofattrition.The phenomenon of attrition in a fluidized bed isanalyzed and its merits and demerits arediscussed with respect to particle attrition insolar receiver, specifically at high temperatureclose to 1000 oC. The possible fluidized beddemerits are overcome through an appropriatedesign and development of high temperature (upto 1000 oC) rotating drum, and this is analyzedin this paper.