ppxscal/embedding_network huggingface dataset:
Optimization of the Switches in Storage Networks
Authors: Nianmin Yao, Xiuli Zhao, Huimin Meng, Xinlei Jiang
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

In the Storage Area Network (SAN), the mature network technology is used to substitute for the IO bus. Usually, the common switch is used in the storage network especially in the iSCSI storage system. Because the common switches are not aware of the environment it is used in, it can not make optimization for the storage network. In this paper, an optimization of storage network is presented which can greatly improve the performance and resource utilization of the whole storage system. In this optimization, the IO acknowledgment commands passing through the switch which is used in storage network are transferred in highest priority. This optimization of SAN has been certified by the simulation experiments.
Inference Processes for Quantified Predicate Knowledge
Authors: J. B. Paris, S. R. Rad
Venue: Proceedings of the 15th international workshop on Logic, Language, Information and Computation (2008)

We describe a method for extending an inference process for propositional probability logic to predicate probability logic in the case where the language in purely unary and show that the method is well defined for the Minimum Distance and CM ¿ inference processes.
Model Checking and Preprocessing
Authors: Andrea Ferrara, Paolo Liberatore, Marco Schaerf
Venue: Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing (2007)

Temporal Logic Model Checking is a verification method having many industrial applications. This method describes a system as a formal structure called model; some properties, expressed in a temporal logic formula, can be then checked over this model. In order to improve performance, some tools allow to preprocessing the model so that a set of properties can be verified reusing the same preprocessed model. In this article, we prove that this preprocessing cannot possibly reduce complexity, if its result is bound to be of size polynomial in the size of the input. This result also holds if the formula is the part of the data that is preprocessed, which has similar practical implications.
L.U.N.A. Ads --- Sustaining Wireless Access for Mobile Users
Authors: Alessandro M. Martellone, David Tacconi, Vincenzo Fatto, Giuliana Vitiello
Venue: Proceedings of the 10th international conference on Visual Information Systems: Web-Based Visual Information Search and Management (2008)

The development of wireless communication technologies offers the possibility to provide new services to the users other than the web surfing. Futur3 is a wireless telecommunication company interested in designing, implementing and managing WMANs (Wireless Metropolitan Area Networks ) that has launched a project, called L.U.N.A. (Large Unwired Network Applications), with the objective of covering main locations in the province of Trento (Trentino Alto-Adige, Italy) with a wireless mesh network. The Futur3 business model is based on a very low cost access to the L.U.N.A. network offering users services with tailor made advertising. In this paper we present the L.U.N.A. Ads, a client-side application, able to provide contents together with advertising, considering the usability and accessibility requirements.
PARO: Synthesis of Hardware Accelerators for Multi-dimensional Dataflow-Intensive Applications
Authors: Frank Hannig, Holger Ruckdeschel, Hritam Dutta, Jürgen Teich
Venue: Proceedings of the 4th international workshop on Reconfigurable Computing: Architectures, Tools and Applications (2008)

In this paper, we present the PARO design tool for the automated hardware synthesis of massively parallel embedded architectures for given dataflow dominant applications. Key features of PARO are: (1) The design entry in form of a compact and intuitive functional programming language which allows highly parallel implementations. (2) Advanced partitioning techniques are applied in order to balance the trade-offs in cost and performance along with requisite throughputs. This is obtained by distributing computations onto an array of tightly coupled processor elements. (3) We demonstrate the performance of the FPGA synthesized hardware with several selected algorithms from different benchmarks.
Towards Enhancing OpenMP Expressiveness and Performance
Authors: Haoqiang Jin
Venue: Proceedings of the 3rd international conference on High Performance Computing and Communications (2007)

Since its introduction in 1997, OpenMP has become the de facto standard for shared memory parallel programming. The notable advantages of the model are its global view of memory space that simplifies programming development and its incremental approach toward parallelization. However, it is very challenge to scale OpenMP codes to tens or hundreds of processors. This problem becomes even more profound with the recent introduction of multi-core, multi-chip architectures. Several extensions have been introduced to enhance OpenMP expressiveness and performance, including thread subteams and workqueuing. In this talk, we describe applications that expose the limitation of the current OpenMP and examine the impact of these extensions on application performance. We focus on exploiting multi-level parallelism and dealing with unbalanced workload in applications with these extensions and compare with other programming approaches, such as hybrid. Our experience has demonstrated the importance of the new language features for OpenMP applications to scale well on large shared memory parallel systems.
Design of a web-based visual simulator and its evaluation based on real computer education
Authors: Yoshiro Imai, Keiichi Kaneko, Masaki Nakagawa
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

A visual computer simulator has been designed to help learners to understand computer architecture and organization efficiently. It is used in a real education, such as classroom lecture of computer architecture and exercise of assembly programming. Our simulator is written in a pure Java language and works not only as an applet but also as a stand-alone application. Its graphical user interface (GUI) provides visual simulating function in the register-transfer level and assists beginners of computer science to comprehend how a computer works. The simulator also equips built-in e-mail handlers to facilitate communicating function and supports asynchronous information sharing between learners and instructors. We have applied our simulator into a real education and evaluated its simulating and communicating capabilities. This paper reports statistic evaluation of visualization and communication. It is confirmed that capabilities of visualization and communication of our simulator are statistically significant.
Interactive Computer Graphics: Flying High-Part I
Authors: W. Myers
Venue: Computer (1979)

The growth of computer graphics is remarkable even by computer industry standards. This first of a two-part article views some of the latest hardware available from leading graphics manufacturers. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Real-Time Data Driven Wildland Fire Modeling
Authors: Jonathan D. Beezley, Soham Chakraborty, Janice L. Coen, Craig C. Douglas, Jan Mandel, Anthony Vodacek, Zhen Wang
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

We are developing a wildland fire model based on semi-empirical relations that estimate the rate of spread of a surface fire and post-frontal heat release, coupled with WRF, the Weather Research and Forecasting atmospheric model. A level set method identifies the fire front. Data are assimilated using both amplitude and position corrections using a morphing ensemble Kalman filter. We will use thermal images of a fire for observations that will be compared to synthetic image based on the model state.
Multilayer Perceptron Networks Training Using Particle Swarm Optimization with Minimum Velocity Constraints
Authors: Xiaorong Pu, Zhongjie Fang, Yongguo Liu
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

Multilayer perceptron networks have been successfully trai- ned by error backpropagation algorithm. We show that Particle Swarm Optimization(PSO) with minimum velocity constraints can efficiently be applied to train multilayer perceptrons to overcome premature convergence and alleviates the influence of dimensionality increasing. The experiments of two multilayer perceptrons trained by PSO with minimum velocity constraints are carried out. The result clearly demonstrate the improvement of the proposed algorithm over the standard PSO in terms of convergence.
'You are Sooo Cool, Valentina!' Recognizing Social Attitude in Speech-Based Dialogues with an ECA
Authors: Fiorella Rosis, Anton Batliner, Nicole Novielli, Stefan Steidl
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

We propose a method to recognize the 'social attitude' of users towards an Embodied Conversational Agent (ECA) from a combination of linguistic and prosodic features. After describing the method and the results of applying it to a corpus of dialogues collected with a Wizard of Oz study, we discuss the advantages and disadvantages of statistical and machine learning methods if compared with other knowledge-based methods.
Learning to Distinguish a Solution from a Problem
Authors: Robert L. Glass
Venue: IEEE Software (2004)

Software maintenance and software maintainers deserve more respect.
About Fourier series in study of periodic signals
Authors: Mioara Boncut, Amelia Bucur
Venue: Proceedings of the 9th WSEAS International Conference on Neural Networks (2008)

This work is about Fourier Series in study of Periodic Signals. A periodic function can be represented by means of Fourier series, which contains all the information about the harmonic structure. The Fourier series is an infinite sum of sinusoidal and cosenoidal terms, however, when the series is truncated, a high frequency phenomenon appears superimposed to the resulting finite Fourier expansion, referred as Gibbs oscillations. In this paper, such a phenomenon is analyzed for a function which is m times differentiable. The case m = 0 is studied in a discontinuous functions.
Real-Time Randomized Motion Planning for Multiple Domains
Authors: James Bruce, Manuela Veloso
Venue: RoboCup 2006: Robot Soccer World Cup X (2006)

Motion planning is a critical component for autonomous mobile robots, requiring a solution which is fast enough to serve as a building block, yet easy enough to extend that it can be adapted to new platforms without starting from scratch. This paper presents an algorithm based on randomized planning approaches, which uses a minimal interface between the platform and planner to aid in implementation reuse. Two domains to which the planner has been applied are described. The first is a 2D domain for small-size robot navigation, where the planner has been used successfully in various versions for five years. The second is a true 3D planner for autonomous fixed-wing aircraft with kinematic constraints. Despite large differences between these two platforms, the core planning code is shared across domains, and this flexibility comes with only a small efficiency penalty.
A Model for Knowledge Innovation in Online Learning Community
Authors: Qinglong Zhan
Venue: Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment (2008)

This paper describes how to introduce the mechanism of knowledge innovation into online learning community (OLC) and constructs a model which can facilitate innovative knowledge and develop online learner's ability of knowledge innovation. The model is represented by three levels, namely: individual, collaborative and intermediary level, which is based on theories of knowledge creation and management, cognitive and social constructivism. Individual knowledge innovation begins with internalization, via combination, externalization and socialization, which is different from Nonaka's SECI. In collaborative knowledge innovation, learners in OLC share, compare, negotiate, create and integrate knowledge together. Individual knowledge innovation and collaborative knowledge innovation need certain intermediary. In doing so, individual knowledge applied to OLC situation can produce, promote and create new knowledge of OLC.
Sincere-Strategy Preference-Based Approval Voting Broadly Resists Control
Authors: Gábor Erdélyi, Markus Nowak, Jörg Rothe
Venue: Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science (2008)

We study sincere-strategy preference-based approval voting (SP-AV), a system proposed by Brams and Sanver [8], with respect to procedural control. In such control scenarios, an external agent seeks to change the outcome of an election via actions such as adding/deleting/partitioning either candidates or voters. SP-AV combines the voters' preference rankings with their approvals of candidates, and we adapt it here so as to keep its useful features with respect to approval strategies even in the presence of control actions. We prove that this system is computationally resistant (i.e., the corresponding control problems are np-hard) to at least 16 out of 20 types of constructive and destructive control. Thus, for the 20 control types studied here, SP-AV has more resistances to control, by at least two, than is currently known for any other natural voting system with a polynomial-time winner problem.
Testing Stochastic Arithmetic and CESTAC Method Via Polynomial Computation
Authors: René Alt, Jean-Luc Lamotte, Svetoslav Markov
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

The CESTAC method and its implementation known as CADNA software have been created to estimate the accuracy of the solution of real life problems when these solutions are obtained from numerical methods implemented on a computer. The method takes into account uncertainties on data and round-off errors. On another hand a theoretical model for this method in which operands are gaussian variables called stochastic numbers has been developed. In this paper numerical examples based on the Lagrange polynomial interpolation and polynomial computation have been constructed in order to demonstrate the consistency between the CESTAC method and the theory of stochastic numbers. Comparisons with the interval approach are visualized.
Techniques for evaluating fault prediction models
Authors: Yue Jiang, Bojan Cukic, Yan Ma
Venue: Empirical Software Engineering (2008)

Many statistical techniques have been proposed to predict fault-proneness of program modules in software engineering. Choosing the "best" candidate among many available models involves performance assessment and detailed comparison, but these comparisons are not simple due to the applicability of varying performance measures. Classifying a software module as fault-prone implies the application of some verification activities, thus adding to the development cost. Misclassifying a module as fault free carries the risk of system failure, also associated with cost implications. Methodologies for precise evaluation of fault prediction models should be at the core of empirical software engineering research, but have attracted sporadic attention. In this paper, we overview model evaluation techniques. In addition to many techniques that have been used in software engineering studies before, we introduce and discuss the merits of cost curves. Using the data from a public repository, our study demonstrates the strengths and weaknesses of performance evaluation techniques and points to a conclusion that the selection of the "best" model cannot be made without considering project cost characteristics, which are specific in each development environment.
Theory of Composing Non-linear Machines with Predictable Cyclic Structures
Authors: Debdeep Mukhopadhyay, Dipanwita Roychowdhury, Chester Rebeiro
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

The paper proposes construction techniques for group non-linear Cellular Automata (CA) composing smaller non-linear invertible CA with linear group CA. We prove that such a scheme generates machines with state transitions having predictable cyclic properties. We show that with appropriate choice of the rules of the linear CA we may obtain invertible, balanced Boolean mappings with strong non-linearity. Extensive experimental results are provided to support the claims made.
Tasking and Real-Time
Authors: John Barnes
Venue: Ada 2005 Rationale: The Language, The Standard Libraries (2008)

This chapter describes various improvements in the tasking and real-time areas for Ada 2005.There are only a few changes to the core tasking model itself. One major extension, however, is the ability to combine the interface feature described in an earlier chapter with the tasking model; this draws together the object-oriented and tasking models of Ada which previously were disjoint aspects of the language.There are also many additional predefined packages in the Real-Time Systems annex concerning matters such as scheduling and timing; these form the major topic of this chapter. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
3rd Workshop on Computational Chemistry and Its Applications (3rd CCA)
Authors: Ponnadurai Ramasami
Venue: Proceedings of the 8th international conference on Computational Science, Part II (2008)

The 3rd workshop on computational chemistry and its applications (3rd CCA) will be held, as part of ICCS-2008, from 23rd to 25th June 2008 in Kraków, Poland. This workshop is the third one after being two successful events in Reading, UK and Beijing, China for ICCS-2006 and ICCS-2007 respectively. The main aim of this workshop is to consider only high standards, original work not published, after peer reviewing.Computational chemistry is one of the fields of computational science and hence this workshop is suitable for the ICCS conference. Computational chemistry is rapidly expanding with the explosive growth of computational power. It is widely used in research and more interestingly in interdisciplinary research involving computational science.
Japanese Students' Attitudes towards Hybrid Learning
Authors: Yoko Hirata, Yoshihiro Hirata
Venue: Proceedings of the 1st international conference on Hybrid Learning and Education (2008)

This paper summarizes the research work conducted for a survey of a group of Japanese University students' attitudes towards a hybrid language learning course. It determines how two different ways of teaching, traditional in-class structured and online unstructured lessons, significantly affected their perceptions about their learning English in a foreign language (EFL) course. As an introduction to the reader, a brief background of implementation of hybrid learning into the classroom is provided, followed by the description of hybrid approaches in Japanese educational settings. Then the objectives and the results of the present study are explained. The findings suggest that some instructional factors, such as flexibility, goal focused approach as well as closely connected relationships between in-class and online instructions, are indispensable for students to acquire a set of skills and strategies for successful language learners in hybrid learning environments.
Hide-and-seek games on a tree to which Eulerian networks are attached
Authors: Steve Alpern
Venue: Networks (2008)

We analyze the hide-and-seek game &Gamma;(G) on certain networks G. The hider picks a hiding point yin Gand the searcher picks a unit speed path S(t) in G, starting at any point S(0). The payoff in this zero-sum game is the capture time T = T(S,y) = min{t: S(t) = y}. Such games have been studied before, but mainly with the simplifying assumption that the searcher's starting point S(0) is specified and known to the hider. We call a network partly Eulerian if it consists of a tree (of length aand radius r) to which a finite number of disjoint Eulerian networks (of total length b) are attached, each at a single point. We show that for such networks, a strategy consisting equiprobably of a minimal (Chinese Postman) covering path and its reverse path is optimal for the searcher, while the optimal hider strategy is to assume that the searcher must start at the center of the tree, and to optimize in that (known) game. The value of the game &Gamma;(G) is a+b-2 -r. This simplifies and extends a similar result of Dagan and Gal for search games on trees. &copy; 2008 Wiley Periodicals, Inc. NETWORKS, 2008
Assessing the Impact of Aspects on Exception Flows: An Exploratory Study
Authors: Roberta Coelho, Awais Rashid, Alessandro Garcia, Fabiano Ferrari, Nélio Cacho, Uirá Kulesza, Arndt Staa, Carlos Lucena
Venue: Proceedings of the 22nd European conference on Object-Oriented Programming (2008)

Exception handling mechanisms are intended to support the development of robust software. However, the implementation of such mechanisms with aspect-oriented (AO) programming might lead to error-prone scenarios. As aspects extend or replace existing functionality at specific join points in the code execution, aspects' behavior may bring new exceptions, which can flow through the program execution in unexpected ways. This paper presents a systematic study that assesses the error proneness of AOP mechanisms on exception flows of evolving programs. The analysis was based on the object-oriented and the aspect-oriented versions of three medium-sized systems from different application domains. Our findings show that exception handling code in AO systems is error-prone, since all versions analyzed presented an increase in the number of uncaught exceptions and exceptions caught by the wrong handler. The causes of such problems are characterized and presented as a catalogue of bug patterns.
Computing the Minimal Tiling Path from a Physical Map by Integer Linear Programming
Authors: Serdar Bozdag, Timothy J Close, Stefano Lonardi
Venue: Proceedings of the 8th international workshop on Algorithms in Bioinformatics (2008)

We study the problem of selecting the minimal tiling path (MTP) from a set of clones arranged in a physical map. We formulate the constraints of the MTP problem in a graph theoretical framework, and we derive an optimization problem that is solved via integer linear programming. Experimental results show that when we compare our algorithm to the commonly used software FPC, the MTP produced by our method covers a higher portion of the genome, even using a smaller number of MTP clones. These results suggest that if one would employ the MTP produced by our method instead of FPC's in a clone-by-clone sequencing project, one would reduce by about 12% the sequencing cost.