ppxscal/embedding_network huggingface dataset:
Finite element dynamic analysis of anisotropic elastic solids with voids
Authors: G. Iovane, A. V. Nasedkin
Venue: Computers and Structures (2009)

The paper is concerned with dynamic problems of the linear theory of elasticity for anisotropic porous materials according to the Cowin-Nunziato model. In order to take into account the structural damping in elastic media, a new attenuation model which extends the Rayleigh models is used. A set of new finite element schemes is proposed for finding numerical solutions of transient, harmonic, modal and static problems in the context of elastic media with voids. Three-dimensional, plane (plane stress and plane strain) and axisymmetric problems are considered.
Tricolorable torus knots are NP-complete
Authors: Peter Golbus, Robert W. McGrail, Tomasz Przytycki, Mary Sharac, Aleksandar Chakarov
Venue: Proceedings of the 47th Annual Southeast Regional Conference (2009)

This work presents a method for associating a class of constraint satisfaction problems to a three-dimensional knot. Given a knot, one can build a knot quandle, which is generally an infinite free algebra. The desired collection of problems is derived from the set of invariant relations over the knot quandle, applying theory that relates finite algebras to constraint satisfaction problems. This allows us to develop notions of tractable and NP-complete quandles and knots. In particular, we show that all tricolorable torus knots and all but at most 2 non-trivial knots with 10 or fewer crossings are NP-complete.
Usability evaluation of software applications with the use of Usability Logger
Authors: Nektarios Kostaras, Michalis Xenos, Christos Koutsogiannis
Venue: Proceeding of the 2008 conference on Knowledge-Based Software Engineering: Proceedings of the Eighth Joint Conference on Knowledge-Based Software Engineering (2008)

This paper presents the main characteristics and capabilities of Usability Logger software tool, used in the usability evaluation of Human Computer interaction interfaces. Usability Logger can be employed to record the actions performed in workstations, with the use of the I/O devices. In this paper the tool is analyzed, compared with other similar tools and used in a case study involving the usability evaluation of two software systems according to predefined criteria.
Heuristics for multi-period capacity expansion in local telecommunications networks
Authors: Roxane Kouassi, Michel Gendreau, Jean-Yves Potvin, Patrick Soriano
Venue: Journal of Heuristics (2009)

In this paper, different heuristics are devised to solve a multi-period capacity expansion problem for a local access telecommunications network with a tree topology. This expansion is done by installing concentrators at the nodes and cables on the links of the network. The goal is to find a least cost capacity expansion strategy over a number of periods to satisfy the demand. A local search heuristic is first proposed to improve previously reported results on problem instances based on different cost and demand structures. This heuristic is then integrated into a genetic algorithm to obtain further improvements.
Evaluating Perception of Interaction Initiation in Virtual Environments using Humanoid Agents
Authors: Christopher Peters
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

We evaluated user perception of certain attention behaviours, eye head and body orientation in particular, of humanoid agents in a virtual environment for the purposes of interaction initiation. Users were shown a number of scenarios involving agents making gaze, gesture and locomotion behaviours and were asked to report their impressions of how attentive the agents were and their perceived likely-hood to engage in interaction. These evaluation studies are critical for furthering our understanding of the early phases of human-computer interaction where distance may be involved and there is uncertainty as to the intention of the other to interact. Amongst other results, we establish here that the human perception of interest, interaction seeking and openness from a humanoid agent is based, in part, on the time-varying behaviour of its eyes, head, body and locomotion directions. Application domains include social robotics and embodied conversational agents.
Novel robust stability criteria of discrete-time stochastic recurrent neural networks with time delay
Authors: Yijun Zhang, Shengyuan Xu, Zhenping Zeng
Venue: Neurocomputing (2009)

The problem of robust global exponential stability is investigated for a class of stochastic uncertain discrete-time recurrent neural networks with time delay. In this paper, the midpoint of the time delay's variation interval is introduced, and the variation interval is divided into two subintervals. Then, by constructing a new Lyapunov-Krasovskii functional and checking its variation in the two subintervals, respectively, some novel delay-dependent stability criteria for the addressed neural networks are derived. Numerical examples are provided to show that the achieved conditions are less conservative than some existing ones in the literature.
Analysing musical performance through functional data analysis: rhythmic structure in Schumann's Traumerei
Authors: Josue Almansa, Pedro Delicado
Venue: Connection Science (2009)

Functional data analysis (FDA) is a relatively new branch of statistics devoted to describing and modelling data that are complete functions. Many relevant aspects of musical performance and perception can be understood and quantified as dynamic processes evolving as functions of time. In this paper, we show that FDA is a statistical methodology well suited for research into the field of quantitative musical performance analysis. To demonstrate this suitability, we consider tempo data for 28 performances of Schumann's Traumerei and analyse them by means of functional principal component analysis (one of the most powerful descriptive tools included in FDA). Specifically, we investigate the commonalities and differences between different performances regarding (expressive) timing, and we cluster similar performances together. We conclude that musical data considered as functional data reveal performance structures that might otherwise go unnoticed.
Virtualizing office hours in CS 50
Authors: David J. Malan
Venue: ACM SIGCSE Bulletin (2009)

In Fall 2007, we introduced "virtual office hours" into Harvard College's introductory computer science course, CS 50, so that students could meet with teaching fellows (TFs) online to discuss problem sets at any hour from anywhere. Our goals were to lower the bar to interaction among TFs and students and to improve the efficiency and convenience of the same. Rather than rely on email alone, we experimented with Elluminate, third-party software that not only allowed students and TFs to chat via IM and VOIP, it also enabled the latter to see and even share control of the former's screens (eg, code in students' terminal windows). Students, in turn, were able to troubleshoot bugs with TFs by their (virtual) side. We surveyed our nearly 300 students on their experiences with office hours, both physical and virtual. Although most students responded positively to the idea of virtual office hours, only 55% logged in at least once. However, nearly the same number (62%) attended the physical. We ultimately judged our virtual office hours a net positive, with 14% of students attending the virtual (and 21% the physical) "often." But our experiment was not without some unexpected results. We found that wait times online sometimes matched or exceeded those in the physical lab, partly the result of the software's own shortcomings and students' habits online. Ultimately, the audience for these virtual office hours was entirely self-selecting. Those students who liked the experience online opted in, whereas those who preferred more traditional help opted out.
A Short-Term Load Forecasting Model Based on LS-SVM Optimized by Dynamic Inertia Weight Particle Swarm Optimization Algorithm
Authors: Dongxiao Niu, Bingen Kou, Yunyun Zhang, Zhihong Gu
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II (2009)

Short-term load forecasting is very important for power system, how to improve the accuracy of load forecasting is the keystone people pay attention to. A combined model of least squares support vector machines optimized by an improved particle swarm. Optimization algorithm is proposed in this paper to do the short-term load forecasting. Least squares support vector machines (LS-SVM) are new kinds of support vector machines (SVM) which regress faster than the standard SVM, they are adopt to do the forecasting here, and an improved particle swarm optimization (PSO) algorithm is employed to optimize the parameters gamma and sigma of LS-SVM, the new PSO outperforms the standard PSO especially in the search of orientation because of the dynamic inertia weight. A real case is experimented with to test the performance of the model, the result shows that the proposed algorithm can reduce training error and testing error of LS-SVM model, so to improve the accuracy of load forecasting.
Pivoting in Linear Complementarity: Two&#x00a0;Polynomial-Time Cases
Authors: Jan Foniok, Komei Fukuda, Bernd G&#x00e4;rtner, Hans-Jakob L&#x00fc;thi
Venue: Discrete Computational Geometry (2009)

We study the behavior of simple principal pivoting methods for the P-matrix linear complementarity problem (P-LCP). We solve an open problem of Morris by showing that Murty&#x2019;s least-index pivot rule (under any fixed index order) leads to a quadratic number of iterations on Morris&#x2019;s highly cyclic P-LCP examples. We then show that on K-matrix LCP instances, all pivot rules require only a linear number of iterations. As the main tool, we employ unique-sink orientations of cubes, a useful combinatorial abstraction of the P-LCP.
Diagnosis of Simple Temporal Networks
Authors: Nico Roos, Cees Witteveen
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

In many domains successful execution of plans requires careful monitoring and repair. Diagnosis of plan execution supports this process by identifying causes of plan failure. Most plans have to satisfy temporal constraints. An important and common occurring problem during plan execution are violations of temporal plan constraints. This paper addresses diagnosis of such temporal constraint violations by modeling the temporal aspects of a plan as a Simple Temporal Network (STN). We investigate the computational properties of standard diagnostic concepts but we also argue that traditional notions of preferred diagnoses such as minimum diagnosis are not adequate. A new notion of a maximum confirmation diagnosis is introduced.
Adaptive feedback cancellation for audio applications
Authors: Toon van Waterschoot, Marc Moonen
Venue: Signal Processing (2009)

Acoustic feedback occurs in many audio applications involving musical sound signals. However, research efforts in acoustic feedback control have mainly been focused on speech applications. Since sound quality is of prime importance in audio applications, a proactive approach to acoustic feedback control is preferred to avoid ringing, howling, and excessive reverberation. Adaptive feedback cancellation (AFC) using a prediction-error-method (PEM)-based approach is a promising proactive solution, but existing algorithms are again designed for speech applications only. We propose to replace the all-pole near-end speech signal model in the PEM-based approach with a cascade of two near-end signal models: a tonal components model and a noise components model. We derive the identifiability conditions for joint identification of the acoustic feedback path and the cascaded near-end signal models. Depending on the model structure that is used for the near-end tonal components, three different PEM-based AFC algorithms are considered. By applying some relevant model approximations, the computational overhead of the proposed algorithms compared to the normalized least mean squares (NLMS) algorithm can be reduced to 25% of the NLMS complexity. Simulation results for both room acoustic and hearing aid scenarios indicate a significant performance improvement in terms of the misadjustment and the maximum stable gain increase.
Mediated Communication Behavior in Distributed Networks of Practice
Authors: Eli Hustad
Venue: Proceeding of the 2006 conference on Cooperative Systems Design: Seamless Integration of Artifacts and Conversations -- Enhanced Concepts of Infrastructure for Communication (2006)

This study examines mediated communication behavior in distributed networks of practice (DNoPs) in a multinational enterprise working in the marine insurance industry. The study describes and compares mediated communication behavior in five different distributed networks of practice as a combination of the knowledge activities that take place during communicative action, the media used to support communication, the networks' perceptions of different media, and the contextual factors that influence both communication and media selection. The networks experienced several challenges in the communication process such as technological instabilities that excluded participation, complex and highly equivocal messages, physical and social-psychological distance between participants, and media limitations. Different theoretical perspectives for mediated communication provide a framework for discussion and integration of the empirical findings in this study.
Improving historical research by linking digital library information to a global genealogical database
Authors: Douglas J. Kennard, William B. Lund, Bryan S. Morse
Venue: Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries (2009)

Journals, letters, and other writings are of great value to historians and those who research their own family history; however, it can be difficult to find writings by specific people, and even harder to find what others wrote about them. We present a prototype web-based system that enables users to discover information about historical people (including their own ancestors) by linking digital library content to unique PersonIDs from a genealogical database. Users can contribute content such as scanned journals or information about where items can be found. They can also transcribe content and tag it with PersonIDs to identify who it is about. Additional features provide tools for users to explore historical contexts and relationships. These include the ability to tag places and to create a historical social network by specifying non-family relationships or by using a mechanism we call rosters to imply participation in some group or event.
Equitable coloring of random graphs
Authors: Michael Krivelevich, Balázs Patkós
Venue: Random Structures Algorithms (2009)

An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes differ by at most one. The least positive integer k for which there exists an equitable coloring of a graph G with k colors is said to be the equitable chromatic number of G and is denoted by &chi;=(G). The least positive integer k such that for any k&prime; &ge; k there exists an equitable coloring of a graph G with k&prime; colors is said to be the equitable chromatic threshold of G and is denoted by &chi;=*(G). In this paper, we investigate the asymptotic behavior of these coloring parameters in the probability space G(n,p) of random graphs. We prove that if n-1-5+&epsi; < p < 0.99 for some 0 < &epsi;, then almost surely &chi;(G(n,p)) &le; &chi;=(G(n,p)) = (1 + o(1))&chi;(G(n,p)) holds (where &chi;(G(n,p)) is the ordinary chromatic number of G(n,p)). We also show that there exists a constant C such that if C-n < p < 0.99, then almost surely &chi;(G(n,p)) &le; &chi;=(G(n,p)) &le; (2 + o(1))&chi;(G(n,p)). Concerning the equitable chromatic threshold, we prove that if n-(1-&epsi;) < p < 0.99 for some 0 < &epsi;, then almost surely &chi;(G(n,p)) &le; &chi;=* (G(n,p)) &le; (2 + o(1))&chi;(G(n,p)) holds, and if ${{\log^{1+\epsilon}n}\over {n}}$ < p < 0.99 for some 0 < &epsi;, then almost surely we have &chi;(G(n,p)) &le; &chi;=*(G(n,p)) = O&epsi;(&chi;(G(n,p))). &copy; 2009 Wiley Periodicals, Inc. Random Struct. Alg., 2009
Partial Halting and Minimal Parallelism Based on Arbitrary Rule Partitions
Authors: Artiom Alhazov, Marion Oswald, Rudolf Freund, Sergey Verlan
Venue: Fundamenta Informaticae (2009)

We consider a new variant of the halting condition in P systems, i.e., a computation in a P system is already called halting if not for all membranes a rule is applicable anymore at the same time, whereas usually a computation is called halting if no rule is applicable anymore in the whole system. This new variant of partial halting is especially investigated for several variants of P systems using membrane rules with permitting contexts and working in different transition modes, especially for minimal parallelism. Both partial halting and minimal parallelism are based on an arbitrary set of subsets from the set of rules assigned to the membranes.
Aligning Music Genre Ontologies with Controlled Vocabularies
Authors: C. J. Mitchell, D. J. E. Nunn, M. Cirstea
Venue: Proceeding of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006 (2006)

This paper introduces the concepts and practices in aligning music genre ontologies. It establishes a technique for merging these structures and shows how the technique can increase the accuracy and reduce the computational complexity. This technique is described through the use of a practical application involving Mpeg7's controlled vocabularies, Mpeg1's id tag and two semantic web ontology languages.
Soft design science methodology
Authors: Richard Baskerville, Jan Pries-Heje, John Venable
Venue: Proceedings of the 4th International Conference on Design Science Research in Information Systems and Technology (2009)

This paper proposes and evaluates a soft systems approach to design science research. Soft Design Science provides an approach to the development of new ways to improve human organizations, especially with consideration for social aspects, through the activities of design, development, instantiation, evaluation and evolution of a technological artifact. The Soft Design Science approach merges the common design science research process (design, build-artifact, evaluation) together with the iterative soft systems methodology. The design-build artifact-evaluation process is iterated until the specific requirements are met. The generalized requirements are adjusted as the process continues to keep alignment with the specific requirements. In the end, the artifact represents a general solution to a class of problems shown to operate in one instance of that class of problems. The proposed methodology is evaluated by an analysis of how it differs from, and could have informed and improved, a published design science study, which used a design-oriented action research method.
Deriving explanations from causal information
Authors: Ph. Besnard, M. -O. Cordier, Y. Moinard
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

We define an inference system to capture explanations based on causal statements, using an ontology in the form of an IS-A hierarchy. We introduce a simple logical language which makes it possible to express that a fact causes another fact and that a fact explains another fact. We present a set of formal inference patterns from causal statements to explanation statements. We introduce an elementary ontology which gives greater expressiveness to the system while staying close to propositional reasoning. We provide an inference system that captures the patterns discussed, in a datalog (limited predicate) framework.
Application of computer simulation for the assessment and optimization of induction electric motors aiming to energy conservation
Authors: Mário Cesar E. S. Ramos, Hédio Tatizawa, Geraldo F. Burani, Mário Cesar G. Ramos
Venue: Proceedings of the 10th WSEAS international conference on Automation & information (2009)

This paper shows a methodology for the assessment and optimization of induction electric motors aiming to energy conservation, through substitution of older electric motors by high-efficiency ones, including motor resizing, aided by computer simulation. This study and its application were carried out through the Electric Energy Efficiency Program promoted by the Brazilian Electric Energy Agency. The methodology adopted for the substitution of these motors included an initial study, by means of measurements of electrical parameters, through the use of a power quality analyzer. Afterwards, by using a specific simulation software, the operating conditions of the electric motor and the expected economy obtained by the use of high-efficiency motors were estimated. When necessary, the motor resizing analysis provides the best rated power for the drive. The motor substitutions carried out in this motor drives efficiency improvement program resulted in yearly savings of 3.1 GWh, equivalent to 4.52% of the previously required energy.
Online Feature Compensation Using Modified Quantile Based Noise Estimation for Robust Speech Recognition
Authors: Heungkyu Lee, Ohil Kwon, June Kim
Venue: Proceeding of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006 (2006)

This paper proposes online adaptation method using the modified quantile based noise estimation for feature compensation that is based on Gaussian mixture model for robust speech recognition interface. Proposed method is designed for active online model adaptation method to cope with varying environmental noise conditions. This method is compensated on logarithmic filter-bank energies domain, and modified quantile based noise estimation using beta-order harmonic mean is applied for online noise estimation. Experimental evaluation is done by using Aurora 2 database, and it showed that the proposed method is more robust than other comparative algorithms.
Microsoft Office Access 2007 Introductory, 1 edition
Authors: Linda O'Leary
Venue: The O'Leary Series (2007)

Timothy and Linda O'Leary and the Computer Information Technology Team at McGraw-Hill Higher Education offer your students a fully integrated learning program with time-tested quality and reliability. It’s theme of “Making Office Relevant” helps students understand why they need this course and these skills. Student success is assured through clear step-by-step instruction, plentiful screen captures and conceptual explanations. Each Lab, designed to be covered in 1 hour of class time, combines conceptual coverage with detailed software-specific instructions. Each Lab opens with a running case study that highlights real-world applications of each software program and leads students from problem to solution. The O'Leary Series helps students learn specific applications skills along with those that cross all Office applications, which is especially important in mastering this version of Office. This Introductory version, versus the Brief version, contains more content including 3 additional labs. Table of contentsAccess Intro TOCIntroduction to 2007 Microsoft Office SystemsOverview of 2007 Microsoft Office SystemsLab 1: Creating a DatabaseLab 2: Modifying and Filtering a Table and Creating a FormLab 3: Querying Tables and Creating ReportsWorking Together 1: Exporting DataLab 4: Importing and Querying TablesLab 5: Creating Custom FormsLab 6: Creating Custom Reports, Charts, Pivot Charts, and Mailing LabelsWorking Together 2: Linking and Splitting DatabasesCommand SummaryGlossaryAppendix: More About Access 2007Reference 1: Data File ListReference 2: MCAS SkillsIndex 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