ppxscal/embedding_network huggingface dataset:
An ontology for accessing transcription systems (OATS)
Authors: Steven Moran
Venue: Proceedings of the First Workshop on Language Technologies for African Languages (2009)

This paper presents the Ontology for Accessing Transcription Systems (OATS), a knowledge base that supports interoperation over disparate transcription systems and practical orthographies. The knowledge base includes an ontological description of writing systems and relations for mapping transcription system segments to an interlingua pivot, the IPA. It includes orthographic and phonemic inventories from 203 African languages. OATS is motivated by the desire to query data in the knowledge base via IPA or native orthography, and for error checking of digitized data and conversion between transcription systems. The model in this paper implements these goals.
An AFSA-TSGM Based Wavelet Neural Network for Power Load Forecasting
Authors: Dongxiao Niu, Zhihong Gu, Yunyun Zhang
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III (2009)

An intelligent methodology for power load forecasting was developed. In this forecasting system, wavelet neural network techniques were used in combination with a new evolutionary learning algorithm. The new evolutionary learning algorithm introduced the Tabu Search Algorithm and Genetic Mutation Operator into Artificial Fish Swarm Algorithm (AFSA) to construct a hybrid optimizing algorithm, and is thus called ASFA-TSGM. The hybrid algorithm can greatly improve the ability of searching the global excellent result and the convergence property and accuracy. The effectiveness of the ASFA-TSGM based WNN was demonstrated through the power load forecasting. The simulated results show its feasibility and validity.
Querying text databases and the web: beyond traditional keyword search
Authors: Luis Gravano
Venue: Proceedings of the First International Workshop on Keyword Search on Structured Data (2009)

Traditional keyword search---where a query is a list of keywords and query results are a relevance-ordered list of documents---is, of course, a powerful query paradigm for text databases and the Web. However, more expressive query paradigms, where both queries and their results can exhibit a richer structure than in traditional keyword search, are often desirable. Information extraction systems identify and extract intrinsically structured data that is embedded in natural-language text documents, hence enabling these alternative query paradigms. Unfortunately, information extraction is a time-consuming process, often involving complex text analysis, so exhaustively processing all documents in a large text database --or on the Web-- could be prohibitively expensive. Beyond efficiency, query result quality is also important: information extraction is error-prone and not all extracted data is equally likely to be correct, so result quality is an important consideration during query processing. In this talk, I will discuss recent work on cost-based optimization of structured queries in this information extraction scenario, where modeling query result quality--in addition to execution efficiency-- is a distinctive and important challenge.
Comparing State Spaces in Automatic Security Protocol Analysis
Authors: Cas J. Cremers, Pascal Lafourcade, Philippe Nadeau
Venue: Formal to Practical Security: Papers Issued from the 2005-2008 French-Japanese Collaboration (2009)

There are several automatic tools available for the symbolic analysis of security protocols. The models underlying these tools differ in many aspects. Some of the differences have already been formally related to each other in the literature, such as difference in protocol execution models or definitions of security properties. However, there is an important difference between analysis tools that has not been investigated in depth before: the explored state space. Some tools explore all possible behaviors, whereas others explore strict subsets, often by using so-called scenarios.We identify several types of state space explored by protocol analysis tools, and relate them to each other. We find previously unreported differences between the various approaches. Using combinatorial results, we determine the requirements for emulating one type of state space by combinations of another type.We apply our study of state space relations in a performance comparison of several well-known automatic tools for security protocol analysis. We model a set of protocols and their properties as homogeneously as possible for each tool. We analyze the performance of the tools over comparable state spaces. This work enables us to effectively compare these automatic tools, i.e., using the same protocol description and exploring the same state space. We also propose some explanations for our experimental results, leading to a better understanding of the tools.
ARMAX modelling of international tourism demand
Authors: Christine Lim, Michael McAleer, Jennifer C. H. Min
Venue: Mathematics and Computers in Simulation (2009)

Box-Jenkins (1970) models are often used to capture the autoregressive moving average of past observations of tourist arrivals from Japan to Taiwan and New Zealand. However, other explanatory variables, such as real income in the origin country, have also affected the demand for international travel. The purpose of this paper is to use the ARMAX model to investigate the dynamic relationship between tourism demand and real income of Japan, and to compare the findings with the single-equation model. Unit root tests and diagnostics are performed before estimating the income elasticity of travel demand by Japan for New Zealand and Taiwan based on seasonally unadjusted quarterly data for 1980(1) to 2004(2). The empirical results of the ARMAX model support the economic theory that the demand for international travel is positively related to income of the origin country.
Developing classification criteria for programming tasks
Authors: Bronius Skupas, Valentina Dagiene, Miguel Revilla
Venue: ACM SIGCSE Bulletin (2009)

The Online Judge (http://icpcres.ecs.baylor.edu) is an on-line programming trainer created by University of Valladolid in 1995 with the aim of training users who participate in programming competitions. Currently this tool has over 64,000 users from many countries and more than 2,000 tasks. In 2007 the project "Integrating On-line Judge into effective e-learning", funded by the European Commission under the Life Long Learning Programme (grant number 135221-LLP-1-2007-1-ES-KA3-KA3MP), was launched in order to satisfy the users' demand for greater pedagogic character and to facilitate the use of the Online Judge in courses of informatics in higher and secondary education. The Online Judge has been maintaining a task database, which can be very useful for teaching algorithms at various levels. However it is not easy for teachers to find proper tasks which fit particular students. At the moment it is possible to weight task difficulty by the percentage of participants who provide correct solutions. It is impossible to find which topics or algorithms are required to solve tasks. An attempt to classify the existing tasks by possible solution algorithms was started by the Online Judge members, using a Wiki (http://www.algorithmist.com/index.php/Categories). However the process is ad hoc and needs systematic revision and analysis. We are providing several schemas for classification of the tasks: (1) Categories proposed by task authors, e.g. by providing comments on the best solution. (2) Categories proposed by the Online Judge administrators, e.g. length of source code or time required for solving the task. This type of classification can only be done by the administrators as other users do not have any access to the solutions and statistical data. (3) Categories proposed by participants ranking the difficulty of solved tasks. (4) Categories proposed by teachers who have used the tasks for several years in their courses, e.g. task topics and difficulty. To make an easier classification process we propose to develop a set of keywords or key phrases. Applying these key phrases to each task will provide more information to users. Initial set of keywords and key phrases can include: (1) Theory or algorithms [1] needed to solve the task (Fig. 1). Fig. 1. Number of Online Judge tasks classified by algorithms (2) Task difficulty, e.g. involves required knowledge, no mathematics, basic mathematics, no algorithms, no data structures, no abstract data structures, suitable for first year students, correct algorithm is not obvious, & (3) Recommending prior tasks that should be solved first. (4) Task type by solution output format, e.g. output is unambiguous, output is ambiguous, output is one number, & (5) Task type by source, e.g. Which competition or course proposed this task? Who is the author?
Microsoft C#.NET program and electromagnetic depth sounding for large loop source
Authors: K. Prabhakar Rao, G. Ashok Babu
Venue: Computers Geosciences (2009)

A program, in the C# (C Sharp) language with Microsoft.NET Framework, is developed to compute the normalized vertical magnetic field of a horizontal rectangular loop source placed on the surface of an n-layered earth. The field can be calculated either inside or outside the loop. Five C# classes with member functions in each class are, designed to compute the kernel, Hankel transform integral, coefficients for cubic spline interpolation between computed values and the normalized vertical magnetic field. The program computes the vertical magnetic field in the frequency domain using the integral expressions evaluated by a combination of straightforward numerical integration and the digital filter technique. The code utilizes different object-oriented programming (OOP) features. It finally computes the amplitude and phase of the normalized vertical magnetic field. The computed results are presented for geometric and parametric soundings. The code is developed in Microsoft.NET visual studio 2003 and uses various system class libraries.
A majorization-minimization algorithm for (multiple) hyperparameter learning
Authors: Chuan-Sheng Foo, Chuong B. Do, Andrew Y. Ng
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

We present a general Bayesian framework for hyperparameter tuning in L2-regularized supervised learning models. Paradoxically, our algorithm works by first analytically integrating out the hyperparameters from the model. We find a local optimum of the resulting non-convex optimization problem efficiently using a majorization-minimization (MM) algorithm, in which the non-convex problem is reduced to a series of convex L2-regularized parameter estimation tasks. The principal appeal of our method is its simplicity: the updates for choosing the L2-regularized subproblems in each step are trivial to implement (or even perform by hand), and each subproblem can be efficiently solved by adapting existing solvers. Empirical results on a variety of supervised learning models show that our algorithm is competitive with both grid-search and gradient-based algorithms, but is more efficient and far easier to implement.
Robust image watermarking using local Zernike moments
Authors: Nitin Singhal, Young-Yoon Lee, Chang-Su Kim, Sang-Uk Lee
Venue: Journal of Visual Communication and Image Representation (2009)

In this work, we propose a robust image watermarking algorithm using local Zernike moments, which are computed over circular patches around feature points. The proposed algorithm locally computes Zernike moments and modifies them to embed watermarks, achieving robustness against cropping and local geometric attacks. Moreover, to deal with scaling attacks, the proposed algorithm extracts salient region parameters, which consist of an invariant centroid and a salient scale, and transmits them to the decoder. The parameters are used at the decoder to normalize a suspect image and detect watermarks. Extensive simulation results show that the proposed algorithm detects watermarks with low error rates, even if watermarked images are distorted by various geometric attacks as well as signal processing attacks.
Development of a Mobile-Learning Environment to Foster Science Communication about the Moon
Authors: M. Suzuki, H. Miyata, T. Akamatsu, M. Nanbara, M. Fukahori
Venue: Proceeding of the 2007 conference on Supporting Learning Flow through Integrative Technologies (2007)

According to the results of previous research, it was inferred that on-going conversations about scientific phenomena such as the changing phases of the moon would enhance prospective teachers' scientific knowledge and knowledge about the nature of science. However, some thought that it would be hard to keep observing the moon outside of classes and that they couldn't do this, even though they realized that observations of the moon would be useful for learning about the moon. The authors developed a mobile moon observation system to facilitate the prospective teachers' ability to continue observation of the moon and a PC system to share observations. Based on the prospective teachers' answers and descriptions, they thought that the mobile system was useful and convenient. In addition, many chose the mobile & PC system rather than paper sheets as an observation tool & a data sharing tool. The more prospective teachers observed the moon, the more they could demonstrate understanding the moon's phases.
Branching-Time Model-Checking of Probabilistic Pushdown Automata
Authors: Tomáš Brázdil, Václav Brožek, Vojtěch Forejt
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

In this paper we study complexity of the model-checking problem for probabilistic pushdown automata (pPDA) and qualitative fragments of two branching-time logics PCTL* and PECTL*. We prove tha this problem is in 2-EXPTIME for pPDA and qualitative PCTL*. Consequently, we prove that model-checking of stateless pPDA (pBPA) and both qualitative PCTL* and qualitative PECTL* is 2-EXPTIME-hard. These results combined with results of several other papers give us that the model-checking problem for pPDA (and also for pBPA) and both qualitative PCTL* and qualitative PECTL* is 2-EXPTIME-complete. Finally, we survey known results on model-checking of pPDA and branching-time logics.
A study on the use of radar data in air traffic control
Authors: Robert J. Skovira
Venue:  (2007)

Air travel can be extremely dangerous. The use of radar technology has made piloting airplanes and managing air traffic in our nation's skies safer. Radar technology provides controllers with more information, more precise data, and faster, than traditional pilot voice communications alone would provide. Radar technology has allowed air traffic controllers to manage more airplanes in a much safer environment than prior to the advent of radar. Air traffic in the United States has gradually increased over the past several years since September 11, 2001, and the Federal Aviation Administration (FAA) projects this growth to continue. To manage the increase in air traffic, the FAA reduced the separation distance between aircraft within radar control to not less than five miles, and in some cases, three miles between airplanes. However, wireless communications' industry has recently required an increased use of the radio spectrum to satisfy the user demand for emerging technologies. This increased use of and further demand for more radio spectrum, now used by air traffic control, may reduce the efficiency and capacity of the national airspace system. Can air traffic controllers manage air traffic safely and maintain required separation distances given the encroachment of wireless technologies in air traffic control radio spectrum? U.S. Government studies show that wireless technologies, when operating on the same radio frequency as air traffic control radars, induce lost or corrupt radar data. This study examined how controllers use ground-based radar and transponder system data and whether lost or corrupt data would make a difference in managing air traffic. Additionally, this study uncovered how technical specialists support the air traffic mission in terms of radar data. This project used an ethnographic method of inquiry, including observations of, and interviews with, participants in an air route traffic control center. The results of this ethnographic study can provide the basis for other studies on interference to radar used for air traffic control. This research also forms the basis for further study on how corrupt or lost radar data affects air traffic controllers' ability to track aircraft.
Improving experiences of computation
Authors: Luke Church
Venue: Proceedings of the 2008 IEEE Symposium on Visual Languages and Human-Centric Computing (2008)

Experiences of computation vary widely between people. For computer scientists, computation is not only a powerful tool to be used to perform tasks on their behalf, but a fundamental property of nature to be studied, characterised and harnessed. 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
Comparison of pixel-based and object-oriented knowledge-based classification methods using SPOT5 imagery
Authors: Minjie Chen, Wei Su, Li Li, Chao Zhang, Anzhi Yue, Haixia Li
Venue: WSEAS Transactions on Information Science and Applications (2009)

Land cover mapping is very important for evaluating natural recourses, understanding the societal and business activities. The remote sensing techniques provide effective and efficient methods to create such maps. To high spatial resolution imagery such as SPOT5 imagery, the land cover classification precision will be improved with the knowledge, Digital Elevation Model (DEM) data and the spatial information such as texture and. Both the pixel-based classification method based on the knowledge rule and the object-oriented fuzzy classification methods have been studied in this paper using SPOT5 high spatial resolution imagery. Some GIS dataset and the texture are integrated into the two knowledge-based classifications in this paper. And the result of accuracy assessment indicates that the two classifications can catch good classification precision, but the objected-oriented classification method does better. Besides, the shape and context information can be used fully to distinguish the roads from the buildings with the objected-oriented fuzzy classification method, which is hard to accomplish in pixel-based classification. Furthermore, the objected-oriented classification method is more suitable in land cover mapping due to its meaningful objects.
Ambidexterity in Technology Sourcing: The Moderating Role of Absorptive Capacity
Authors: Frank T. Rothaermel, Maria Tereza Alexandre
Venue: Organization Science (2009)

A firm's organizational and technological boundaries are two important demarcation lines when sourcing for technology. Based on this theoretical lens, four possible combinations of exploration and exploitation emerge. Applying an ambidexterity perspective to a firm's technology sourcing strategy, we hypothesize that a curvilinear relationship exists between a firm's technology sourcing mix and its performance. We further introduce a contingency element by proposing that a firm's absorptive capacity exerts a positive moderating effect on this relationship. We empirically test these hypotheses on a random, multi-industry sample of U.S. manufacturing companies. We find support for the notion that the relationship between technology sourcing mix and firm performance is an inverted U-shape. Moreover, higher levels of absorptive capacity allow a firm to more fully capture the benefits resulting from ambidexterity in technology sourcing.
Generic and effective semi-structured keyword search
Authors: Arash Termehchy, Marianne Winslett
Venue: Proceedings of the First International Workshop on Keyword Search on Structured Data (2009)

Current semi-structured keyword search and natural language query processing systems use ad hoc approaches to take advantage of structural information. Although intuitive, they are ultimately ad hoc. We have developed the concept of coherency ranking based on the statistical properties of data to rank the keyword search results. We demonstrate how the coherency ranking works for two real-world XML databases and show its advantages over the previously proposed XML keyword search methods.
Developing a VR-based Projectile System using Haptic Device for Learning Physics
Authors: Atsushi Kanbe, Yukihiro Matsubara, Noriyuki Iwane, Kimiko Hirayama
Venue: Proceeding of the 2006 conference on Learning by Effective Utilization of Technologies: Facilitating Intercultural Understanding (2006)

The learning support system with experience was developed in this study. Then, force-feedback device was introduced to the system to link bodily movement to the action in the virtual laboratory. We evaluated efficacy of using the force-feedback device and the way to hold the device, and the student could naturally feel the action in the virtual laboratory, and feeling of immersion, realistic feeling and operational feeling were increased. So, the student could effectively learn.
An Improved Recursive Decomposition Ordering for Term Rewriting Systems Revisited
Authors: Munehiro Iwami
Venue: Proceeding of the 2005 conference on Advances in Logic Based Intelligent Systems: Selected Papers of LAPTEC 2005 (2005)

Simplification orderings, like the recursive path ordering and the improved recursive decomposition ordering, are widely used for proving the termination property of term rewriting systems. The improved recursive decomposition ordering is known as the most powerful simplification ordering. In this paper, we investigate the improved recursive decomposition ordering for proving termination of term rewriting systems. We completely show that the improved recursive decomposition ordering is closed under substitutions.
Adequate motion simulation and collision detection for soccer playing humanoid robots
Authors: Martin Friedmann, Karen Petersen, Oskar von Stryk
Venue: Robotics and Autonomous Systems (2009)

In this paper a humanoid robot simulator based on the multi-robot simulation framework (MuRoSimF) is presented. Among the unique features of this simulator is the scalability in the level of physical detail in both the robot's motion and sensing systems. It facilitates the development of control software for humanoid robots which is demonstrated for several scenarios from the RoboCup Humanoid Robot League. Different requirements exist for a humanoid robot simulator. E.g., testing of algorithms for motion control and postural stability require high fidelity of physical motion properties whereas testing of behavior control and role distribution for a robot team requires only a moderate level of detail for real-time simulation of multiple robots. To meet such very different requirements often different simulators are used which makes it necessary to model a robot multiple times and to integrate different simulations with high-level robot control software. MuRoSimF provides the capability of exchanging the simulation algorithms used for each robot transparently, thus allowing a trade-off between computational performance and fidelity of the simulation. It is therefore possible to choose different simulation algorithms which are adequate for the needs of a given simulation experiment, for example, motion simulation of humanoid robots based on kinematical, simplified dynamics or full multi-body system dynamics algorithms. In this paper also the sensor simulation capabilities of MuRoSimF are revised. The methods for motion simulation and collision detection and handling are presented in detail including an algorithm which allows the real-time simulation of the full dynamics of a 21 DOF humanoid robot. Merits and drawbacks of the different algorithms are discussed in the light of different simulation purposes. The simulator performance is measured and illustrated in various examples, including comparison with experiments of a physical humanoid robot.