ppxscal/embedding_network huggingface dataset:
Artificial neural networks application for stress smoothing in hexaedrons
Authors: Leonardo Ivirma, Mary Vergara, Sebastian Provenzano, Francklin Rivas, Anna Perez, Francisco Fuenmayor
Venue: WSEAS Transactions on Information Science and Applications (2009)

In this paper it is presented the use of artificial neural networks to improve the tension fields obtained from the finite element discretization method. It was significantly reduced the time needed to reach solutions, with accuracy similar to the areas smoothing tensions methods: Superconvergent Patch Recovered (SPR) and Recovery by Equilibrium Patches (REP) improved. It is solved two cases that show the comparative advantages in terms of time spent by the neural network and the techniques described above for making improvements in the original solution: Artificial Neural Networks used only 7% and 70% respectively of the original time spent by the smoothing technique in such cases. As bigger is the magnitude of the problem, the greater the difference in the time required for the solutions, being better the neural network. Data used for this study come from cases of different features: with a smooth solution, a thick wall sphere exposed to inner pressure and one with singularities, a plate loaded with a lateral crack.
Using QuickBooks With High Speed 2008 College Edition
Authors: Emmanuel Ike
Venue:  (2007)

This is one of the best books on learning how to use QuickBooks in the market today. It takes a different approach from other books by arranging the book titles according to the menus and submenus in the QuickBooks software to increase the speed of mastery. In so doing, students will become very proficient on how to use the QuickBooks software. Students will be keying in numbers, completing windows, running reports, and analyzing results. This is a result-driven textbook, an experiential learning tool that leads individuals to a predictable, accurate outcome. The two driving forces of this book are speed and accuracy. The book is written with real numbers and examples for easy comprehension. In no time, students will be creating files, accounts, customers, vendors, and writing checks. Not only that, students will be reconciling bank statements, creating journal entries, and printing financial reports--with ease and accuracy. Additional title pages include the following: Utility Submenus Payroll Setup Job Costing End of Chapter Report End of Chapter Summary Exercises (Teachers Only) True or False Questions (Teachers Only) Multiple Choice Questions (Teachers Only) Final Examination (Teachers Only) Who is eligible to purchase? Students Faculty Schools Libraries Non-Academic (General Public) 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
Designing Knowledge Based Systems as Complex Adaptive Systems
Authors: Karan Sharma
Venue: Proceeding of the 2008 conference on Artificial General Intelligence 2008: Proceedings of the First AGI Conference (2008)

The paper proposes that knowledge based systems must be designed as complex adaptive systems and any other approach is not fundamental, even if sometimes it yields good results. Complex systems are characterized as having global behavior not always explainable from local behavior. Here we propose that the way we perceive knowledge in AI needs to change to Complex Adaptive, hence the need for a paradigm shift is stressed. Almost all historical KBS were not complex systems in an authentic sense. But it is not a good idea to criticize them because with available resources and theories, they did their best. Sooner or later, we will have to design our KBS as complex adaptive systems, so why not sooner. There are three mechanisms that must be part of any knowledge based system, viz., Interdependency and fluidity, mechanisms for attribution of emergent properties and self-organization.
IT Enriched Science Education for Rural Schools
Authors: B. Krishnarajulu Naidu, Jayanthi Sivaswamy
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

This paper reports on our efforts at improving the quality of science education in rural schools in Andhra Pradesh, India. The strategy is to provide IT enriched teaching resources (multimedia content) to rural science teachers. The content development is done primarily by school teachers, through periodic training-cum-development workshops. The teachers thus become partners in the deployment and spread of IT enriched resources for use in teaching. An open-source authoring tool (Squeak) is used for this training as it is easy to use and available as freeware. Experience gained from conducting five such workshops show the viability of this approach.
Networking for multi-agents: beyond a local view
Authors: Sarah N. Lim Choi Keung, Nathan Griffiths
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

Decentralised multi-agent systems have empowered individual agents to actively select their course of action to achieve their goals. However, this leaves agents with a limited view of their environment, limiting awareness mainly to their interaction partners. We believe that through interactions and recommendation exchange, agents can build a network of their environment and expand their local view. Agents can extract emergent information from the relationships and interactions they observe. Analysing and understanding such information can improve an agent's efforts in minimising risk associated with the uncertainty of agent interactions, including collusion detection and the discovery of new providers.
"Days of the week" effect in predicting the time taken to fix defects
Authors: Prasanth Anbalagan, Mladen Vouk
Venue: Proceedings of the 2nd International Workshop on Defects in Large Software Systems: Held in conjunction with the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA 2009) (2009)

In this paper, we investigate the effect of calendar on the activity of fixing defects in a project, i.e., whether the days of the week when defects are reported have an impact on the time taken to fix them. Interestingly, we show that there is an effect, and that this can be used to predict the time taken to fix defects.
Linguistically motivated large-scale NLP with C&C and boxer
Authors: James R. Curran, Stephen Clark, Johan Bos
Venue: Proceedings of the 45th Annual Meeting of the ACL on Interactive Poster and Demonstration Sessions (2007)

The statistical modelling of language, together with advances in wide-coverage grammar development, have led to high levels of robustness and efficiency in NLP systems and made linguistically motivated large-scale language processing a possibility (Matsuzaki et al., 2007; Kaplan et al., 2004). This paper describes an NLP system which is based on syntactic and semantic formalisms from theoretical linguistics, and which we have used to analyse the entire Gigaword corpus (1 billion words) in less than 5 days using only 18 processors. This combination of detail and speed of analysis represents a break-through in NLP technology.
Exploiting agent diagnosis for plan repair in MAS
Authors: Roberto Micalizio, Pietro Torasso
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

In this paper we formalize a local strategy for plan repair in a Multi Agent Plan, where agents exhibit a collaborative behavior to reach a common global goal in a partially observable environment. The recovery strategy is based on a plan failure analysis where two main results are inferred: the agent diagnosis (which explains the action failure in terms of faults in agent functionalities) and the set of missing goals (i.e. services that the faulty agent can no longer provide to the other agents). Relying on the agent diagnosis, a faulty agent activates a local re-planner to restore the healthy status in its functionalities and achieve the set of missing goals.
Variational Transform Invariant Mixture of Probabilistic PCA
Venue: Proceedings of the 2008 IEEE Workshop on Applications of Computer Vision (2008)

In many video based object recognition applications, the object appearances are acquired by visual tracking and are inconsistent due to misalignments caused by tracking drifting. We believe the misalignments can be removed if we can reduce the inconsistency in the object appearances caused by misalignments through clustering the objects in appearance, space and time domain simultaneously. We therefore propose to learn Transform Invariant Mixtures of Probabilistic PCA (TIMPPCA) model from the data while at the same time eliminating the misalignments. The model is formulated in a generative framework, and the misalignments are considered as hidden variables in the model. Variational EM update rules are then derived based on Variational Message Passing (VMP) techniques. The proposed TIMPPCA is applied to improve head pose estimation performance and to detect the change of attention focus in meeting room video for meeting room video indexing/retrieval and achieved promising performance. 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
Reinforcement Learning with Classifier Selection for Focused Crawling
Authors: Ioannis Partalas, Georgios Paliouras, Ioannis Vlahavas
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

Focused crawlers are programs that wander in the Web, using its graph structure, and gather pages that belong to a specific topic. The most critical task in Focused Crawling is the scoring of the URLs as it designates the path that the crawler will follow, and thus its effectiveness. In this paper we propose a novel scheme for assigning scores to the URLs, based on the Reinforcement Learning (RL) framework. The proposed approach learns to select the best classifier for ordering the URLs. This formulation reduces the size of the search space for the RL method and makes the problem tractable. We evaluate the proposed approach on-line on a number of topics, which offers a realistic view of its performance, comparing it also with a RL method and a simple but effective classifier-based crawler. The results demonstrate the strength of the proposed approach.
Skip-and-prune: cosine-based top-k query processing for efficient context-sensitive document retrieval
Authors: Jong Wook Kim, K. Selçuk Candan
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

Keyword search and ranked retrieval together emerged as popular data access paradigms for various kinds of data, from web pages to XML and relational databases. A user can submit keywords without knowing much (sometimes nothing) about the complex structure underlying a data collection, yet the system can identify, rank, and return a set of relevant matches by exploiting statistics about the distribution and structure of the data. Keyword-based data models are also suitable for capturing user's search context in terms of weights associated to the keywords in the query. Given a search context, the data in the database can also be re-interpreted for semantically correct retrieval. This option, however, is often ignored as the cost of re-assessing the content in the database naively tends to be prohibitive. In this paper, we first argue that top-k query processing can help tackle this challenge by re-assessing only the relevant parts of the database, efficiently. A road-block in this process, however, is that most efficient implementations of top-k query processing assume that the scoring function is monotonic, whereas the cosine-based scoring function needed for re-interpretation of content based on user context is not. In this paper, we develop an efficient top-k query processing algorithm, skip-and-prune (SnP), which is able to process top-k queries under cosine-based non-monotonic scoring functions. We compare the use of proposed algorithm against the alternative implementations of the context-aware retrieval, including naive top-k, accumulator-based inverted files, and full-scan. The experiment results show that while being fast, naive top-k is not an effective solution due to the non-monotonicity of underlying scoring function. The proposed technique, SnP, however, matches the precision of accumulator-based inverted files and full-scan, yet it is orders of magnitude faster than these.
On the b-Coloring of Cographs and P 4-Sparse Graphs
Authors: Flavia Bonomo, Guillermo Dur&#x00e1;n, Frederic Maffray, Javier Marenco, Mario Valencia-Pabon
Venue: Graphs and Combinatorics (2009)

A b-coloring of a graph is a coloring such that every color class admits a vertex adjacent to at least one vertex receiving each of the colors not assigned to it. The b-chromatic number of a graph G, denoted by &#x03c7; b (G), is the maximum number t such that G admits a b-coloring with t colors. A graph G is b-continuous if it admits a b-coloring with t colors, for every $$t = \chi(G), \ldots, \chi_b(G)$$. We define a graph G to be b-monotonic if &#x03c7; b (H 1) &#x2265; &#x03c7;b (H 2) for every induced subgraph H 1 of G, and every induced subgraph H 2 of H 1. In this work, we prove that P 4-sparse graphs (and, in particular, cographs) are b-continuous and b-monotonic. Besides, we describe a dynamic programming algorithm to compute the b-chromatic number in polynomial time within these graph classes.
Did He Jump or Was He Pushed? Abductive Practical Reasoning
Authors: Floris Bex, Trevor Bench-Capon, Katie Atkinson
Venue: Proceeding of the 2008 conference on Legal Knowledge and Information Systems: JURIX 2008: The Twenty-First Annual Conference (2008)

In this paper we present an approach to abductive reasoning in law by examining it in the context of an argumentation scheme for practical reasoning. We present a particular scheme, based on an established scheme for practical reasoning, that can be used to reason abductively about how an agent might have acted to reach a particular scenario, and the motivations for doing so. Plausibility here depends on a satisfactory explanation of why this particular agent followed these motivations in the particular situation. The scheme is given a formal grounding in terms of Action-based Alternating Transition Systems and we illustrate the approach with a running legal example.
BGP-lens: patterns and anomalies in internet routing updates
Authors: B. Aditya Prakash, Nicholas Valler, David Andersen, Michalis Faloutsos, Christos Faloutsos
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

The Border Gateway Protocol (BGP) is one of the fundamental computer communication protocols. Monitoring and mining BGP update messages can directly reveal the health and stability of Internet routing. Here we make two contributions: firstly we find patterns in BGP updates, like self-similarity, power-law and lognormal marginals; secondly using these patterns, we find anomalies. Specifically, we develop BGP-lens, an automated BGP updates analysis tool, that has three desirable properties: (a) It is effective, able to identify phenomena that would otherwise go unnoticed, such as a peculiar 'clothesline' behavior or prolonged 'spikes' that last as long as 8 hours; (b) It is scalable, using algorithms are all linear on the number of time-ticks; and (c) It is admin-friendly, giving useful leads for phenomenon of interest. We showcase the capabilities of BGP-lens by identifying surprising phenomena verified by syadmins, over a massive trace of BGP updates spanning 2 years, from the publicly available site datapository.net.
Process instantiation
Authors: G. Decker, J. Mendling
Venue: Data Knowledge Engineering (2009)

Although several process modeling languages allow one to specify processes with multiple start elements, the precise semantics of such models are often unclear, both from a pragmatic and from a theoretical point of view. This paper addresses the lack of research on this problem and introduces the CASU framework (from Creation, Activation, Subscription, Unsubscription). The contribution of this framework is a systematic description of design alternatives for the specification of instantiation semantics of process modeling languages. We classify six prominent languages by the help of this framework. We validate the relevance of the CASU framework through empirical investigations involving a large set of process models from practice. Our work provides the basis for the design of new correctness criteria as well as for the formalization of Event-driven Process Chains (EPCs) and extension of the Business Process Modeling Notation (BPMN). It complements research such as the workflow patterns.
Lips Recognition for Biometrics
Authors: Michał Choraś
Venue: Proceedings of the Third International Conference on Advances in Biometrics (2009)

One of the most interesting emerging method of human identification, which originates from the criminal and forensic practice, is human lips recognition. In this paper we consider lips shape features in order to determine human identity. The major contribution of this paper are novel geometrical parameters developed in order to describe human lips shape for biometric applications.
Computational and experimental investigation on the performance characteristics of the micro gas compressor
Authors: Jae Sung Yoon, Jong Won Choi, Min Soo Kim
Venue: Microelectronic Engineering (2009)

This paper describes the performance characteristics of a micro gas compressor, which is fabricated on the silicon substrates. The micro gas compressor consists of silicon membrane, compression chamber, port holes and cantilever check valves. The compressor is driven by a piezoelectric actuator, which is a bimorphemic structure of a silicon membrane and a piezoelectric ceramic plate. The actuator pulsates and reciprocates so that the gas is compressed and transported through the valves. The performance of the gas compressor has been numerically calculated, thus a flow rate is obtained for various back pressures. The simulation has been done taking the thermodynamic properties of the gas, the elasticity and angular moment of the valves into account. The flow rate has been also measured by experiments using the vapor of R-123. The major parameters are the geometry of the compressor, driving voltage and frequency of the actuator. The performance of the gas compressor is described in terms of the relationship between the flow rate and the back pressure.
Can Help Seeking Be Tutored? Searching for the Secret Sauce of Metacognitive Tutoring
Authors: Ido Roll, Vincent Aleven, Bruce M. McLaren, Kenneth R. Koedinger
Venue: Proceeding of the 2007 conference on Artificial Intelligence in Education: Building Technology Rich Learning Contexts That Work (2007)

In our on-going endeavor to teach students better help-seeking skills we designed a three-pronged Help-Seeking Support Environment that includes (a) classroom instruction (b) a Self-Assessment Tutor, to help students evaluate their own need for help, and (c) an updated version of the Help Tutor, which provides feedback with respect to students' help-seeking behavior, as they solve problems with the help of an ITS. In doing so, we attempt to offer a comprehensive help-seeking suite to support the knowledge, skills, and dispositions students need in order to become more effective help seekers. In a classroom evaluation, we found that the Help-Seeking Support Environment was successful in improving students' declarative help-seeking knowledge, but did not improve students' learning at the domain level or their help-seeking behavior in a paper-and-pencil environment. We raise a number of hypotheses in an attempt to explain these results. We question the current focus of metacognitive tutoring, and suggest ways to reexamine the role of help facilities and of metacognitive tutoring within ITSs.
Discontinuous Galerkin methods on hp-anisotropic meshes II: a posteriori error analysis and adaptivity
Authors: Emmanuil H. Georgoulis, Edward Hall, Paul Houston
Venue: Applied Numerical Mathematics (2009)

We consider the a posteriori error analysis and hp-adaptation strategies for hp-version interior penalty discontinuous Galerkin methods for second-order partial differential equations with nonnegative characteristic form on anisotropically refined computational meshes with anisotropically enriched elemental polynomial degrees. In particular, we exploit duality based hp-error estimates for linear target functionals of the solution and design and implement the corresponding adaptive algorithms to ensure reliable and efficient control of the error in the prescribed functional to within a given tolerance. This involves exploiting both local isotropic and anisotropic mesh refinement and isotropic and anisotropic polynomial degree enrichment. The superiority of the proposed algorithm in comparison with standard hp-isotropic mesh refinement algorithms and an h-anisotropic/p-isotropic adaptive procedure is illustrated by a series of numerical experiments.
Geographically intelligent disclosure control for flexible aggregation of census data
Authors: Caroline Young, David Martin, Chris Skinner
Venue: International Journal of Geographical Information Science (2009)

This paper describes a geographically intelligent approach to disclosure control for protecting flexibly aggregated census data. Increased analytical power has stimulated user demand for more detailed information for smaller geographical areas and customized boundaries. Consequently, it is vital that improved methods of statistical disclosure control are developed to protect against the increased disclosure risk. Traditionally methods of statistical disclosure control have been aspatial in nature. Here we present a geographically intelligent approach that takes into account the spatial distribution of risk. We describe empirical work illustrating how the flexibility of this new method, called local density swapping, is an improved alternative to random record swapping in terms of risk-utility.
Brief paper: Vector L2-gain and stability of feedback switched systems
Authors: Jun Zhao, David J. Hill
Venue: Automatica (Journal of IFAC) (2009)

A concept of vector L"2-gain is presented for switched systems. Each subsystem does not necessarily have L"2-gain in the classic sense but is assumed to have individual L"2-gain during any time interval when the subsystem is active. Stability is derived from this vector L"2-gain under some constraints on inactive storage functions. Asymptotic stability is also achieved if in addition a small-time norm-observability property is imposed. A small-gain theorem for feedback switched systems with vector L"2-gain assured for each subsystem is established. The small-gain condition is given in terms of the L"2-gains of the coupled active subsystems and the changes of inactive storage functions. A switching law design method is also given to achieve vector L"2-gain.