ppxscal/embedding_network huggingface dataset:
On the Phase Transition Width of K-Connectivity in Wireless Multihop Networks
Authors: Xiaoyuan Ta, Guoqiang Mao, Brian D. O. Anderson
Venue: IEEE Transactions on Mobile Computing (2009)

In this paper, we study the phase transition behavior of k-connectivity (k=1,2,\ldots) in wireless multihop networks where a total of n nodes are randomly and independently distributed following a uniform distribution in the unit cube [0,1]^{d} (d=1,2,3), and each node has a uniform transmission range r(n). It has been shown that the phase transition of k-connectivity becomes sharper as the total number of nodes n increases. In this paper, we investigate how fast such phase transition happens and derive a generic analytical formula for the phase transition width of k-connectivity for large enough n and for any fixed positive integer k in d-dimensional space by resorting to a Poisson approximation for the node placement. This result also applies to mobile networks where nodes always move randomly and independently. Our simulations show that to achieve a good accuracy, n should be larger than 200 when k=1 and d=1; and n should be larger than 600 when k\le 3 and d=2,\ 3. The results in this paper are important for understanding the phase transition phenomenon; and it also provides valuable insight into the design of wireless multihop networks and the understanding of its characteristics.
Sharing a verifiable secret image using two shadows
Authors: Chin-Chen Chang, Chia-Chen Lin, T. Hoang Ngan Le, Hoai Bac Le
Venue: Pattern Recognition (2009)

In this paper, we propose a novel (2,2) verifiable secret sharing (VSS) scheme, which not only protects a secret image but also allows users to verify the restored secret image in the revealing and verifying phase, for all binary, grayscale and color images. Error diffusion and image clustering techniques are adopted to achieve our objective. Experimental results and discussions show that the proposed scheme, with its smaller shadow size and lower computational complexity, obviously outperforms previous VSS schemes designed either with or without the cheating prevention mechanism. Moreover, the use of a halftone logo gives an efficient solution to verifying whether the restored secret image is correct by using a halftone logo.
Neural Networks Sliding Mode Control for a Class of Switched Nonlinear Systems
Authors: Sheng Zhang, Fei Long
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II (2009)

In this paper, based on RBF neural network, an adaptive tracking control scheme is given for a class of switched nonlinear systems under the arbitrary switching. The neural networks are used to approximate the unknown part of the switched nonlinear systems, and its outputs are used as the parameters of the controller to compensate for the effects of system uncertainties. Using this scheme, the error between the plant output and the desired reference output can asymptotically converge to zero under the arbitrary switching.
Introducing Assembly Language, 1st edition
Authors: John P. Flynt
Venue:  (2007)

In 'Introducing Assembly Language', readers find a fundamental introduction to programming using a hands-on approach that allows them to get right into programming. For advanced programmers, the layout of the book makes for ready reference, and for beginning programmers, the layout allows them to progress in a step-by-step fashion toward mastery. The book starts right out by discussing the EMU8086 Windows-based emulator and then teaches users how to write a Hello World program. It then introduces topics on binary and hexadecimal math and the architecture of registers. Exercises are included with ready answers and explanations for review. All the while, readers work with simple programs that help them explore the concepts introduced. Unlike most concept" oriented books on assembly, which typically involve a detailed discussion of technical details followed by an example that simply illustrates the concepts, this book takes the opposite approach -- it shows users how something works and then allows them to build from this to see how what happens can be explained in more detailed, technical ways. 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
Proceedings of the Workshop on Relationships and Associations in Object-Oriented Languages
Venue: European Conference on Object-Oriented Programming (2009)

Welcome to the RAOOL'09 Workshop on Relationships and Associations in Object-Oriented Languages. The workshop is a direct successor of the RAOOL'08 workshop at OOPSLA'08 in Nashville and further relates more loosely to the Roles workshop at ECOOP'07 in Berlin. In this year's workshop an effort was made to gather the growing number of researchers in the object-oriented programming language community who are working on relationship-based and role-based systems to share their research and discuss the future of relationship-based and role-based constructs in programming languages. Input both from members of the programming language community and from members of related areas (e.g., databases, model-driven development) and domains (e.g., program analysis, orthogonal persistence, type systems) who are using relationships and roles is solicited. Some particular areas of interest are: &bull;relationship-based programming languages &bull;libraries/frameworks for relationship support &bull;first-class queries &bull;database integration and serialization &bull;relationship-based system design &bull;program understanding/visualization &bull;ownership and related techniques &bull;dynamic analysis of relationship usage The proceedings contain 6 papers (4 long papers and 2 position papers) that were selected by the program committee out of 9 submissions. Each paper was reviewed by 4 program committee members, with further input from a small number of external reviewers. The reviewing process was managed using the EasyChair Conference System.
Knowledge Extraction and Analysis on Collaborative Interaction
Authors: Ronghuai Huang, Huanglingzi Liu
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

E-learning is popularized so fast and Collaborative Learning (CL) becomes so important an instructional strategy. There are huge Group Session (GS) texts needed to be analyzed to evaluate CL, thus the automatic or semi-automatic methods of analyzing the GS texts become very important. In this paper we present a method called Interaction Analysis depended on Knowledge Extraction (IAKE) to analyze collaborative learning by extracting knowledge from the GS texts. This method is based on a GS text analysis approach we proposed it as Theme based Knowledge Extraction (TKE).
Fireworks controller
Authors: Hanli Zhao, Ran Fan, Charlie C. L. Wang, Xiaogang Jin, Yuwei Meng
Venue: Computer Animation and Virtual Worlds (2009)

This paper presents the fireworks controller, a novel real-time shape-constrained fireworks animation system. We depict the shape of a firework by a 3D mesh. In order to approximate the mesh using evenly distributed points, we propose a fast point sampling method by extending the dual depth peeling algorithm. The samples are then taken as input to shape-constrained fireworks whose physically plausible animations are based on inverse dynamics. We present a highly parallel iterative clustering algorithm to support multi-level fireworks explosion. In order to simulate natural fuzzy fireworks, we impose extra random particles with a parallel random number generator. Several novel intuitive user interfaces are introduced to improve the usability of the system. Experimental results demonstrate the prettiness and efficiency of the proposed approach. Copyright &copy; 2009 John Wiley & Sons, Ltd. This paper presents the fireworks controller, a novel real-time shape-constrained fireworks animation system. We propose highly parallel point sampling and iterative clustering algorithms to support multi-level fireworks explosion. Several novel intuitive user interfaces are introduced to improve the usability of the system.
Educational Robot --A Case Study for Robot Learning Companion
Authors: Sheng-Hui Hsu, Jen-Hang Wang, Ben Chang, Jwu-E. Chen, Kuo-Chin Fan, Tak-Wai Chan
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 describes the concept of educational robots and gives an experiment of using a facial expression robot as the interface of learning companion. After surveying learning companion systems we found some deficiencies about these systems. Therefore we make use of the facial expression robot in learning and try to find out a solution to make up the deficiency.
Algebraic properties of modulo q complete ℓ-wide families
Authors: BÁlint Felszeghy, GÁbor HegedŰs, Lajos RÓnyai
Venue: Combinatorics, Probability and Computing (2009)

Let q be a power of a prime p, and let n, d, ℓ be integers such that 1 ≤ n, 1 ≤ ℓ q. Consider the modulo q complete ℓ-wide family: <disp-formula><graphic xlink="S0963548308009619_eqnU1" mime-subtype="gif"><alt-text>\[ \cF = \bigl\{F\subseteq[n]\,:\, \exists\,f\in\Z~~\text{s.t.}~~ d\leq f We describe a Gröbner basis of the vanishing ideal I(<private-char><inline-graphic mime-subtype="gif" xlink="S0963548308009619_char1"/></private-char>) of the set of characteristic vectors of <private-char><inline-graphic mime-subtype="gif" xlink="S0963548308009619_char1"/></private-char> over fields of characteristic p. It turns out that this set of polynomials is a Gröbner basis for all term orderings ≺, for which the order of the variables is xn ≺ xn−1 ≺ ⋅⋅⋅ ≺ x1. We compute the Hilbert function of I(<private-char><inline-graphic mime-subtype="gif" xlink="S0963548308009619_char1"/></private-char>), which yields formulae for the modulo p rank of certain inclusion matrices related to <private-char><inline-graphic mime-subtype="gif" xlink="S0963548308009619_char1"/></private-char>. We apply our results to problems from extremal set theory. We prove a sharp upper bound of the cardinality of a modulo q ℓ-wide family, which shatters only small sets. This is closely related to a conjecture of Frankl [13] on certain ℓ-antichains. The formula of the Hilbert function also allows us to obtain an upper bound on the size of a set system with certain restricted intersections, generalizing a bound proposed by Babai and Frankl [6]. The paper generalizes and extends the results of [15], [16] and [17].
ROC curves for the CART Algorithm in STATISTICA Data Miner
Authors: Bohumil Jakoubek
Venue: Proceeding of the 2007 conference on Information Modelling and Knowledge Bases XVIII (2007)

ROC curves are widely used as a tool to evaluate classification models. This paper describes the use of the macro language STATISTICA Visual Basic to construct receiver operating characteristics curves (ROC) for the CART algorithm implemented in the data mining system STATISTICA Data Miner. STATISTICA has an option of ROC curves only for neural networks, therefore the macro presented here is useful for evaluation and comparison the classification models that are built with the CART algorithm. The possibilities of this macro are presented on one data set.
Toward automatic artifact matching for tool evaluation
Authors: Yan Liang
Venue: Proceedings of the 47th Annual Southeast Regional Conference (2009)

Before performing software maintenance and evolution tasks, developers must expend significant effort to understand the design of the subject software system. Reverse engineering and reengineering tools can extract artifacts, such as class diagrams, from source code so that the effort expended on program comprehension can be greatly reduced. Choosing suitable and appropriate tools is itself a difficult process. Many metrics and benchmarks have been proposed to evaluate the quality of reengineering tools, but the process is still complicated and requires much human effort. Furthermore, ignored by most evaluation experiments and approaches is the understanding of differences and similarities of the output artifacts produced by different tools. This paper proposes a novel approach for tool evaluation making a direct comparison of the output artifacts of the chosen tools. We apply our methodology on class diagrams extracted from source code. We utilize a class matching model to automate the process. In this study, we use ten open-source programs as test cases and two open source reverse engineering tools Doxygen and StarUML. We evaluate the output of these two tools based on class matching given the same input. This approach, we believe, provides developers with good guidance in tool selection.
Stream Differences in Asynchronous Online Discussions: Analysing Student Cohesion and Roles in Technology-Mediated Project Work Classrooms
Authors: Azilawati Jamaludin, Choon Lang Quek
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 study aims to investigate stream Two streams were investigated: Express and Normal. Express stream students sit for the GCE 'O' levels after 4 years of secondary education while Normal stream students take an additional year of study, 5 years, before they sit for the GCE 'O' levels. differences in asynchronous online discussions in the context of Project Work. Empirical evidence from literature shows that knowledge construction in asynchronous online discussions is strongly associated with cohesion and role structure in online networks. We analysed the social networks in two eighth grade classes from two different streams for cohesion and role structures. A total of 80 students in 16 project groups were involved in this study. All groups were facilitated by the same teacher. The findings revealed no significant stream difference for cohesion. It was found that groups which are more cohesive had high correlation values of structural role equivalence while less cohesive groups had lower correlation values of structural role equivalence, indicating the strong presence of dominating and lurking members. The findings provide evidence that asynchronous online discussions in Project Work classrooms provide possibilities for equal participatory activities and cohesive structures in groups of different learning abilities (express and normal stream).
Elaborating domain descriptions
Authors: Andreas Herzig, Laurent Perrussel, Ivan Varzinczak
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)

In this work we address the problem of elaborating domain descriptions (alias action theories), in particular those that are expressed in dynamic logic. We define a general method based on contraction of formulas in a version of propositional dynamic logic with a solution to the frame problem. We present the semantics of our theory change and define syntactical operators for contracting a domain description. We establish soundness and completeness of the operators w.r.t. the semantics for descriptions that satisfy a principle of modularity that we have defined in previous work.
Design and implementation of Anycast communication model in IPv6
Authors: Xiaonan Wang, Huanyan Qian
Venue: International Journal of Network Management (2009)

The existing designs for providing Anycast services are either to confine each Anycast group to a preconfigured topological region or to distribute members of Anycast groups over global regions. The former brings an Anycast scalability problem and the latter causes the routing tables to grow proportionally to the number of all global Anycast groups in the entire Internet. Therefore, both of the above designs restrict and hinder the application and development of Anycast services. A new kind of Anycast communication model is proposed in this paper which solves some existing problems, such as scalability and communication errors between clients and servers. In this paper, the Anycast communication model is analyzed in depth and discussed, and the experimental data of this Anycast communication model demonstrate its feasibility and validity.
Assessing the correlation between contextual patterns and biological entity tagging
Authors: M. Krallinger, M. Padrón, C. Blaschke, A. Valencia
Venue: Proceedings of the International Joint Workshop on Natural Language Processing in Biomedicine and its Applications (2004)

The tagging of biological entities, and in particular gene and protein names, is an essential step in the analysis of textual information in Molecular Biology and Biomedicine. The problem is harder than was originally thought because of the highly dynamic nature of the research area, in which new genes and their functions are constantly being discovered, and because of the lack of commonly accepted standards. An impressive collection of techniques has been used to detect protein and gene names in the last four-five years, ranging from typical NLP to purely bioinformatics approaches. We explore here the relationship between protein/gene names and expressions used to characterize protein/gene function. These expressions are captured in a collection of patterns derived from an original set of manually derived expressions, extended to cover lexical variants and filtered with known cases of association patterns/names. Applying these patterns to a large collection of curated sentences, we found a significant number of patterns with a very strong tendency to appear only in sentences in which a protein/gene name is simultaneously present. This approach is part of a larger effort to incorporate contextual information so as to make biological information less ambiguous.
Island Reasoning for ALCHI Ontologies
Authors: Sebastian Wandelt, Ralf Moeller
Venue: Proceeding of the 2008 conference on Formal Ontology in Information Systems: Proceedings of the Fifth International Conference (FOIS 2008) (2008)

In the last years, the vision of the Semantic Web fostered the interest in reasoning over ever larger sets of assertional statements in ontologies. It is easily conjectured that, soon, real-world ontologies will not fit into main memory anymore. If this was the case, state-of-the-art description logic reasoning systems cannot deal with these ontologies any longer, since they rely on in-memory structures. We propose a way to overcome this problem by reducing instance checking for an individual in an ontology to a (usually small) relevant subset of assertional axioms. This subset can then be processed by state-of-the-art description logic reasoning systems to perform sound and complete instance checks for the given individual. We think that this technique will support description logic systems to deal with the upcoming large amounts of assertional data.
Cyclic and negacyclic codes over the Galois ring GR(p2,m)
Authors: R. Sobhani, M. Esmaeili
Venue: Discrete Applied Mathematics (2009)

This paper deals with cyclic codes over the Galois ring GR(p^2,m). A unique set of generators for these codes and an algorithm for finding these generators are presented. The form of dual codes is studied. The obtained results on cyclic codes are extended to the class of negacyclic codes.
Planar rectilinear shortest path computation using corridors
Authors: Rajasekhar Inkulu, Sanjiv Kapoor
Venue: Computational Geometry: Theory and Applications (2009)

The rectilinear shortest path problem can be stated as follows: given a set of m non-intersecting simple polygonal obstacles in the plane, find a shortest L"1-metric (rectilinear) path from a point s to a point t that avoids all the obstacles. The path can touch an obstacle but does not cross it. This paper presents an algorithm with time complexity O(n+m(lgn)^3^/^2), which is close to the known lower bound of @W(n+mlgm) for finding such a path. Here, n is the number of vertices of all the obstacles together.
ROX: run-time optimization of XQueries
Authors: Riham Abdel Kader, Peter Boncz, Stefan Manegold, Maurice van Keulen
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

Optimization of complex XQueries combining many XPath steps and joins is currently hindered by the absence of good cardinality estimation and cost models for XQuery. Additionally, the state-of-the-art of even relational query optimization still struggles to cope with cost model estimation errors that increase with plan size, as well as with the effect of correlated joins and selections. In this research, we propose to radically depart from the traditional path of separating the query compilation and query execution phases, by having the optimizer execute, materialize partial results, and use sampling based estimation techniques to observe the characteristics of intermediates. The proposed technique takes as input a Join Graph where the edges are either equi-joins or XPath steps, and the execution environment provides value- and structural-join algorithms, as well as structural and value-based indices. While run-time optimization with sampling removes many of the vulnerabilities of classical optimizers, it brings its own challenges with respect to keeping resource usage under control, both with respect to the materialization of intermediates, as well as the cost of plan exploration using sampling. Our approach deals with these issues by limiting the run-time search space to so-called "zero-investment algorithms for which sampling can be guaranteed to be strictly linear in sample size. All operators and XML value indices used by ROX for sampling have the zero-investment property. We perform extensive experimental evaluation on large XML datasets that shows that our run-time query optimizer finds good query plans in a robust fashion and has limited run-time overhead.
SiNuPrOs: mathematical model of human cortical bone
Authors: M. Racila, J. M. Crolet
Venue: Proceedings of the 10th WSEAS international conference on Mathematics and computers in biology and chemistry (2009)

We present here a mathematical model of the human cortical bone which allows studying the mechanical behavior of this heterogeneous and complex structure knowing the properties of its basics components (collagen, hydroxyapatite (Hap) and bony fluid) and its architectural configuration. At long term it could be helpful to understand the bone remodeling which obviously needs the knowledge of the mechanical information transfer. One uses the asymptotic homogenization method (AHM) [1] in a piezoelectric framework (since collagen is piezoelectric) and a finite element method is developed for solving the cells problems obtained by homogenization. The developed computational methods have been packed into a software (called SiNuPrOs) made in Matlab; it is in free access on the website http://isifc.univ-fcomte.fr/SINUPROS/accueil.htm.