ppxscal/embedding_network huggingface dataset:
Brief paper: L2 norm performance index of synchronization and LQR control synthesis of complex networks
Authors: Chao Liu, Zhisheng Duan, Guanrong Chen, Lin Huang
Venue: Automatica (Journal of IFAC) (2009)

In this paper, the synchronizability problem of dynamical networks is addressed, where better synchronizability means faster network synchronization with lower vibration. The L"2 norm of the error vector e is taken as a performance index to measure this kind of synchronizability. For the equilibrium synchronization case, it is shown that there is a close relationship between the L"2 norm of the error vector e and the H"2 norm of the transfer function G of the linearized network about the equilibrium point. Consequently, the effect of the network coupling topology on the H"2 norm of the transfer function G is analyzed. Finally, an LQR controller is designed, according to the LQR problem in modern control theory, which can drive the whole network to its equilibrium point and meanwhile minimize the L"2 norm of the output of the linearized network.
Using Discussion Prompts to Scaffold Parent-Child Collaboration Around a Computer-Based Activity
Authors: Jeanette O'Connor, Lucinda Kerawalla, Rosemary Luckin
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

Research has shown that parents' collaborative involvement with their child's learning within the home context can be beneficial in improving their child's motivation and academic performance [1]. However, collaborative dialogue does not necessarily occur spontaneously because two users are sharing the same computer [2]. The current study focuses on the human-centred, iterative design and evaluation of a computer-based activity-Frankie's Fruitful Journey that utilises discussion prompts to scaffold parent-child collaboration around a weight and mass task within the home context. In the first design cycle, we identify when and where parent-child dyads could benefit from computer-based discussion prompts. In the second iteration we implement discussion prompts and report on their effectiveness in significantly increasing the quality of collaboration between parent and child. We conclude by discussing the future possibilities for the use of learner modelling techniques to support the provision of adaptive software scaffolding to guide parent interventions within parent-child dyads.
Learning context-free grammars to extract relations from text
Authors: Georgios Petasis, Vangelis Karkaletsis, Georgios Paliouras, Constantine D. Spyropoulos
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

In this paper we propose a novel relation extraction method, based on grammatical inference. Following a semisupervised learning approach, the text that connects named entities in an annotated corpus is used to infer a context free grammar. The grammar learning algorithm is able to infer grammars from positive examples only, controlling overgeneralisation through minimum description length. Evaluation results show that the proposed approach performs comparable to the state of the art, while exhibiting a bias towards precision, which is a sign of conservative generalisation.
The complexity of query containment in expressive fragments of XPath 2.0
Authors: Balder ten Cate, Carsten Lutz
Venue: Journal of the ACM (JACM) (2009)

XPath is a prominent W3C standard for navigating XML documents that has stimulated a lot of research into query answering and static analysis. In particular, query containment has been studied extensively for fragments of the 1.0 version of this standard, whereas little is known about query containment in (fragments of) the richer language XPath 2.0. In this article, we consider extensions of CoreXPath, the navigational core of XPath 1.0, with operators that are part of or inspired by XPath 2.0: path intersection, path equality, path complementation, for-loops, and transitive closure. For each combination of these operators, we determine the complexity of query containment, both with and without DTDs. It turns out to range from ExpTime (for extensions with path equality) and 2-ExpTime (for extensions with path intersection) to non-elementary (for extensions with path complementation or for-loops). In almost all cases, adding transitive closure on top has no further impact on the complexity. We also investigate the effect of dropping the upward and/or sibling axes, and show that this sometimes leads to a reduction in complexity. Since the languages we study include negation and conjunction in filters, our complexity results can equivalently be stated in terms of satisfiability. We also analyze the above languages in terms of succinctness.
Design principles for simulations in science learning
Authors: Serkan Cankaya, Abdullah Kuzu
Venue: Proceedings of the international conference on Computational and information science 2009 (2009)

Technology is becoming increasingly important in today's classroom. Computer animations and simulations are the most commonly used technological tools for educational purposes. Simulations should be used easily by students, if not, students' attention is focused on the use of simulation rather than on the exploration of scientific concepts. Therefore design principles are very important for students' use of simulation and understanding of scientific concepts. Design principles are an attempt to capture consensus on design approach to make simulations easier to use and more effective to teach scientific concepts. There are many researches investigating various aspects of simulations. And some of them deal with the design issues in simulations. The purpose of this study is to examine, discuss and summarize the design principles for simulation in science learning covered in literature.
Combining different biometric traits with one-class classification
Authors: C. Bergamini, L. S. Oliveira, A. L. Koerich, R. Sabourin
Venue: Signal Processing (2009)

It has been demonstrated in the literature that the combining of different biometric traits is a powerful tool to overcome the limitations imposed by a single biometric system. The fusion of different systems can be approached in different ways. In this work, we consider the pattern classification approach, where the scores of the various systems are used as features to feed the classifiers. More specifically, we are interested in one-class classifiers, and we show that one-class classification could be considered as an alternative to biometric fusion, especially when the data are highly unbalanced or when data from only a single class are available. The results reported for one-class classification on two different databases compares with the standard two-class SVM and surpasses all the conventional classifier combination rules tested.
The adaptive k-meteorologists problem and its application to structure learning and feature selection in reinforcement learning
Authors: Carlos Diuk, Lihong Li, Bethany R. Leffler
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

The purpose of this paper is three-fold. First, we formalize and study a problem of learning probabilistic concepts in the recently proposed KWIK framework. We give details of an algorithm, known as the Adaptive k-Meteorologists Algorithm, analyze its sample-complexity upper bound, and give a matching lower bound. Second, this algorithm is used to create a new reinforcement-learning algorithm for factored-state problems that enjoys significant improvement over the previous state-of-the-art algorithm. Finally, we apply the Adaptive k-Meteorologists Algorithm to remove a limiting assumption in an existing reinforcement-learning algorithm. The effectiveness of our approaches is demonstrated empirically in a couple benchmark domains as well as a robotics navigation problem.
A General Model for Epistemic State Revision using Plausibility Measures
Authors: Jianbing Ma, Weiru Liu
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

In this paper, we present a general revision model on epistemic states based on plausibility measures proposed by Friedman and Halpern. We propose our revision strategy and give some desirable properties, e.g., the reversible and commutative properties. Moreover, we develop a notion called plausibility kinematics and show that our revision strategy follows plausibility kinematics. Furthermore, we prove that the revision following plausibility kinematics satisfies the principle of minimal change based on some distance measures. Finally, we discuss a revision operator defined for plausibility functions and its relationship with iterated belief revision proposed by Darwiche and Pearl. We show that the revision operator satisfies all the DP postulates when it is Max-Additive.
Design and fabrication of MEMS-based microneedle arrays for medical applications
Authors: Peiyu Zhang, Colin Dalton, Graham A. Jullien
Venue: Microsystem Technologies (2009)

Fabrication results for MEMS-based microneedle arrays are presented in this paper. The microneedle array was fabricated by employing a bi-mask technique to facilitate sharp tips, a cylindrical body and side openings. The presented array has advantages over previously published microneedle arrays in terms of ease of fabrication and bonding; high needle density and robustness; and side openings, which are expected to minimize the potential for clogging from skin debris during insertion. In addition, control over the process via etch-stop markers employed as stop layers, which assure the depth of long blind holes and the structure of the needle top, allows for different needle lengths and needle top structures to be easily implemented. The preliminary fluid flow and insertion experiments were performed to demonstrate the efficiency of the microneedle arrays.
A comparative study of FFT, STFT and wavelet techniques for induction machine fault diagnostic analysis
Authors: Neelam Mehala, Ratna Dahiya
Venue: Proceedings of the 7th WSEAS international conference on Computational intelligence, man-machine systems and cybernetics (2008)

Motor Current Signature Analysis (MCSA) has been successfully used for fault diagnosis in induction machines. The current spectrum of the induction machine for locating characteristic fault frequencies is used in MCSA. The spectrum is obtained using a Fast Fourier Transformation (FFT) that is performed on the signal under analysis. The fault frequencies occur in the motor current spectra are unique for different motor faults. However FFT does not always achieve good results with non-constant load torque. Other signal processing methods, such as Short-time Fourier Transform (STFT) and Wavelet transforms techniques may also be used for analysis. These techniques are capable of revealing aspects of data like trends, breakdown points, discontinuities in higher derivatives, and self-similarity which are not available in FFT analysis. In the present paper, the comparisons of various techniques are discussed to analyze the experimental results obtained.
Application of particle swarm optimization algorithm for solving bi-level linear programming problem
Authors: R. J. Kuo, C. C. Huang
Venue: Computers Mathematics with Applications (2009)

Bi-level linear programming is a technique for modeling decentralized decision. It consists of the upper-level and lower-level objectives. This paper attempts to develop an efficient method based on particle swarm optimization (PSO) algorithm with swarm intelligence. The performance of the proposed method is ascertained by comparing the results with genetic algorithm (GA) using four problems in the literature and an example of supply chain model. The results illustrate that the PSO algorithm outperforms GA in accuracy.
Scalable and efficient tools for multi-level tiling
Authors: Lakshminarayanan Renganarayana
Venue:  (2008)

In the era of many-core systems, application performance will come from parallelism and data locality. Effective exploitation of these require explicit (re)structuring of the applications. Multilevel (or hierarchical) tiling is one such structuring technique used in almost all high-performance implementations. Lack of tool support has limited the use of multi-level tiling to program optimization experts. We present solutions to two fundamental problems in multi-level tiling, viz., optimal tile size selection and parameterized tiled loop generation. Our solutions provide scalable and efficient tools for multi-level tiling. Parameterized tiled code refers to tiled loops where the tile sizes are not (fixed) compile-time constants but are left as symbolic parameters. It can enable selection and adaptation of tile sizes across a spectrum of stages through compilation to run-time. We introduce two polyhedral sets, viz., inset and outset, and use them to develop a variety of scalable and efficient multi-level tiled loop generation algorithms. The generation efficiency and code quality are demonstrated on a variety of benchmarks such as stencil computations and matrix subroutines from BLAS. Our technique can generate tiled loop nests with parameterized, fixed or mixed tile sizes, thereby providing a one-size-fits all solution ideal for inclusion in production compilers. Optimal tile size selection (TSS) refers to the selection of tile sizes that optimize some cost (e.g., execution time) model. We show that these cost models share a fundamental mathematical property, viz., positivity, that allows us to reduce optimal TSS to convex optimization problems. Almost all TSS models proposed in the literature for parallelism, caches, and registers, lend themselves to this reduction. We present the reduction of five different TSS models proposed in the literature by different authors in a variety of tiling contexts. Our convex optimization based TSS framework is the first one to provide a solution that is both efficient and scalable to multiple levels of tiling.
The performance of PC solid-state disks (SSDs) as a function of bandwidth, concurrency, device architecture, and system organization
Authors: Cagdas Dirik, Bruce Jacob
Venue: Proceedings of the 36th annual international symposium on Computer architecture (2009)

As their prices decline, their storage capacities increase, and their endurance improves, NAND Flash Solid State Disks (SSD) provide an increasingly attractive alternative to Hard Disk Drives (HDD) for portable computing systems and PCs. This paper presents a study of NAND Flash SSD architectures and their management techniques, quantifying SSD performance under user-driven/PC applications in a multi-tasked environment; user activity represents typical PC workloads and includes browsing files and folders, emailing, text editing and document creation, surfing the web, listening to music and playing movies, editing large pictures, and running office applications. We find the following: (a) the real limitation to NAND Flash memory performance is not its low per-device bandwidth but its internal core interface; (b) NAND Flash memory media transfer rates do not need to scale up to those of HDDs for good performance; (c) SSD organizations that exploit concurrency at both the system and device level (e.g. RAID-like organizations and Micron-style (superblocks) improve performance significantly; and (d) these system- and device-level concurrency mechanisms are, to a significant degree, orthogonal: that is, the performance increase due to one does not come at the expense of the other, as each exploits a different facet of concurrency exhibited within the PC workload.
Multi-objective scheduling for MUD based ad-hoc networks
Authors: M. Bouharras, Z. Dziong, F. Gagnon, M. Haidar
Venue: Proceedings of the 4th Annual International Conference on Wireless Internet (2008)

Common channel multi-hop Ad Hoc networks have some inherent constraints related to throughput and Quality of Service (QoS). Multiuser detection (MUD) based Medium Access Control (MAC) can relax some of these constraints and provide significant gains in throughput and Quality of Service (QoS). These gains can be realized by implementing a distributed neighborhood scheduling algorithm that needs to choose one from several possible transmission configurations in each frame. This feature allows formulating different scheduling performance objectives such as delay minimization or throughput maximization. In this paper we focus on analysis and comparison of the system performance under different objectives including multi-objective formulations. First we implement a scheduling scheme that minimize delay using Start Time Fair Queuing (STFQ) algorithm and compare its performance with scheduling that maximises the throughput. Then we formulate multi-objective functions that are used to achieve a trade-off between delay and throughput performance. One of these formulations is based on the Nash arbitration scheme from cooperative game theory. The numerical results demonstrate the flexibility and efficiency of the proposed approach.
Learning Environment for Designing Physics Experiment: DEEP
Authors: Takahito Toumoto, Tomoya Horiguchi, Tsukasa Hirashima, Akira Takeuchi
Venue: Proceeding of the 2006 conference on Learning by Effective Utilization of Technologies: Facilitating Intercultural Understanding (2006)

In this paper, we explain the importance of the task to design physics experiment in learning of physics. The design and development of a learning environment that supports a learner to design physics experiments, which we call “Designing Experiment Environment for Physics: DEEP”, and the preliminary evaluation are also reported.
Vocal Telekinesis: towards the development of voice-physical installations
Authors: Sama&#x2019;a Al Hashimi
Venue: Universal Access in the Information Society (2009)

Lately, developers have attempted to explore the relationship between voice and visuals by creating various mappings between them. Hardly any developers, however, delved into forming physical mappings between voice and real objects. Programming non-verbal voice to control inanimate objects has yet to be implemented in highly interactive applications. This paper introduces the concept of Vocal Telekinesis to refer to the physical control of inanimate objects via paralinguistic vocal input. It highlights existing applications that could be considered forms of Vocal Telekinesis and presents some practical implementations of this concept. The aim is to expand the scope of interactive media through exploring various voice-physical mappings which will extend beyond the graphical output to include physical feedback such as changes in the size, brightness, speed, direction, and height of real objects.
The Hydra battle and Cichon&#x2019;s principle
Authors: Georg Moser
Venue: Applicable Algebra in Engineering, Communication and Computing (2009)

In rewriting the Hydra battle refers to a term rewrite system proposed by Dershowitz and Jouannaud. To date, withstands any attempt to prove its termination automatically. This motivates our interest in term rewrite systems encoding the Hydra battle, as a careful study of such systems may prove useful in the design of automatic termination tools. Moreover it has been an open problem, whether any termination order compatible with has to have the Howard–Bachmann ordinal as its order type, i.e., the proof theoretic ordinal of the theory of one inductive definition. We answer this question in the negative, by providing a reduction order compatible with , whose order type is at most , the proof theoretic ordinal of Peano arithmetic.
Limitations of restricted branching in clause learning
Authors: Matti Järvisalo, Tommi Junttila
Venue: Constraints (2009)

The techniques for making decisions, that is, branching, play a central role in complete methods for solving structured instances of constraint satisfaction problems (CSPs). In this work we consider branching heuristics in the context of propositional satisfiability (SAT), where CSPs are expressed as propositional formulas. In practice, there are cases when SAT solvers based on the Davis-Putnam-Logemann-Loveland procedure (DPLL) benefit from limiting the set of variables the solver is allowed to branch on to so called input variables which provide a strong unit propagation backdoor set to any SAT instance. Theoretically, however, restricting branching to input variables implies a super-polynomial increase in the length of the optimal proofs for DPLL (without clause learning), and thus input-restricted DPLL cannot polynomially simulate DPLL. In this paper we settle the case of DPLL with clause learning. Surprisingly, even with unlimited restarts, input-restricted clause learning DPLL cannot simulate DPLL (even without clause learning). The opposite also holds, and hence DPLL and input-restricted clause learning DPLL are polynomially incomparable. Additionally, we analyze the effect of input-restricted branching on clause learning solvers in practice with various structured real-world benchmarks.
Analysis of m-learning applications quality
Authors: Catalin Boja, Lorena Batagan
Venue: WSEAS Transactions on Computers (2009)

The exponential growth of mobile technology in recent years, increasing availability of network infrastructures, advances in wireless technologies and popularity of handheld devices, have opened up new accessibility opportunities for education. In his research Kinshuk (2003), [2], concludes that the true potential of e-learning as "anytime and anywhere" has finally started to be realized with the advent of mobile learning, m-learning. A characteristic of today's society is the increasing use of modern information and communication technologies in all areas. Investment in mobile device is an important step to improve the quality of life in our dynamic society. The paper analyses the impact of m-learning on the educational process and describes software characteristics of m-learning applications. There are taken into consideration the fields that define m-learning processes as education, technology and software development. For the evaluation of characteristics levels are described metrics and measured values are used to determine the m-learning application overall quality level. The value is determined by aggregating each factor value and taking into consideration importance coefficient.
Searching Trees: An Essay
Authors: Henning Fernau, Daniel Raible
Venue: Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation (2009)

We are reviewing recent advances in the run time analysis of search tree algorithms, including indications to open problems. In doing so, we also try to cover the historical dimensions of this topic.
Tcl and Tk Programming for the Absolute Beginner, 1st edition
Authors: Kurt Wall
Venue:  (2007)

Tcl/Tk is enjoying a resurgence of popularity and interest in the computing community due to the fact that it is relatively easy to learn, powerful, fast, permits rapid development, and runs on all computing platforms. Until now, there has not been a guide book available that teaches Tcl/Tk to those with little or no programming experience. Covering the newest versions of Tcl and Tk, Tcl and Tk Programming for the Absolute Beginner teaches beginning and novice programmers concepts such as loops, conditional execution, input and output, and events, and shows readers how to implement these concepts using the grammar and syntax of the Tcl language. As part of the for the absolute beginner series, the book teaches all the concepts through the creation of simple computer games. Not only will this learn by doing approach provide you with an instant sense of accomplishment, but its also a fun way to learn. Plus, in addition to learning Tcl and Tk, youll also learn the basics of computer programming, so youll have a solid foundation from which you can confidently jump to other programming languages. 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