ppxscal/embedding_network huggingface dataset:
ShreX: managing XML documents in relational databases
Authors: Fang Du, Sihem Amer-Yahia, Juliana Freire
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

We describe ShreX, a freely-available system for shredding, loading and querying XML documents in relational databases. ShreX supports all mapping strategies proposed in the literature as well as strategies available in commercial RDBMSs. It provides generic (mapping-independent) functions for loading shredded documents into relations and for translating XML queries into SQL. ShreX is portable and can be used with any relational database backend.
Single-input CMAC control system
Authors: Ming-Feng Yeh
Venue: Neurocomputing (2007)

This paper attempts to propose a single-input cerebellar model articulation controller (CMAC) control system, which contains only one controller implemented by the CMAC. The single-input CMAC control system adopts two learning stages. An off-line learning stage is to enable the output behavior of the CMAC to approximate the control surface of a fuzzy PD-type controller. An on-line learning stage follows to improve the system stability by the modified learning rule. The linear interpolation scheme is also applied to the recall process at the on-line learning stage to ensure better accuracy of the CMAC output. Simulation results show that the single-input CMAC controller is superior to the fuzzy PD-type controller.
An Energy-Efficient Clustering Using a Round-Robin Method in a Wireless Sensor Network
Authors: Do-hyun Nam, Hong-ki Min
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

The routing algorithm used in the wireless sensor network features the clustering method to reduce the amount of data transmission from the energy efficiency perspective. However, the clustering method results in high energy consumption at the cluster head node. Dynamic clustering is a method used to resolve such a problem by distributing energy consumption through the re-selection of the cluster head node. Still, dynamic clustering modifies the cluster structure every time the cluster head node is re-selected, which causes energy consumption. In other words, the dynamic clustering approaches examined in previous studies involve the repetitive processes of cluster head node selection. This consumes a high amount of energy during the set-up process of cluster generation. In order to resolve the energy consumption problem associated with the repetitive set-up, this paper proposes the Round-Robin Cluster Header (RRCH) method that fixes the cluster and selects the head node in a round-robin method The RRCH approach is an energy-efficient method that realizes consistent and balanced energy consumption in each node of a generated cluster to prevent repetitious set-up processes as in the LEACH method. The propriety of the proposed method is substantiated with a simulation experiment.
Conversion of Predicate-Calculus Axioms to Corresponding Deterministic Programs
Authors: E. Sandewall
Venue: IEEE Transactions on Computers (1976)

The problem of converting axioms in predicate calculus to deterministic programs, which are to be used as "rules" by a general problem solver (GPS)-type supervisor is considered. It is shown that this can be done, but that the "objects" must then contain procedure closures or "FUNARG-expressions" which are later applied.
Cheating in networked computer games: a review
Authors: Steven Daniel Webb, Sieteng Soh
Venue: Proceedings of the 2nd international conference on Digital interactive media in entertainment and arts (2007)

The increasing popularity of Massively Multiplayer Online Games (MMOG) -- games involving thousands of players participating simultaneously in a single virtual world - has highlighted the scalability bottlenecks present in centralised Client/Server (C/S) architectures. Researchers are proposing Peer-to-Peer (P2P) architectures as a scalable alternative to C/S; however, P2P is more vulnerable to cheating as it decentralises the game state and logic to un-trusted peer machines, rather than using trusted centralised servers. Cheating is a major concern for online games, as a minority of cheaters can potentially ruin the game for all players. In this paper we present a review and classification of known cheats, and provide real-world examples where possible. Further, we discuss counter measures used by C/S architectures to prevent cheating. Finally, we discuss several P2P architectures designed to prevent cheating, highlighting their strengths and weaknesses.
Image Registration by Minimizing Tsallis Divergence Measure
Authors: Shaoyan Sun, Chonghui Guo
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

In this paper, a novel image registration method is pro- posed which makes use of the a priori knowledge learned from pre-aligned training images. Two images are regis- tered if the difference between the observed joint distribu- tion estimated from them and the expected joint distribu- tion obtained from the aligned training images is minimized. The difference is measured by the Tsallis divergence mea- sure. The performance of the new method is compared with the classical Shannon mutual information and Tsallis mu- tual information. Experimental results show that the pro- posed method is computationally more efficient with higher registration accuracy and faster registration convergence.
A Survey of the Practice of Design -- Code Correspondence amongst Professional Software Engineers
Authors: Ariadi Nugroho, M. R. V. Chaudron
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

Correspondence between the design and the code of a system is desirable for several purposes in software development, such as predicting properties of the system based on the design, and for using the documentation for understanding and maintaining the system. In this paper we report on a study into the correspondence between the design of a software system, represented by means of UML, and the implementation of the system. We performed a web-based questionnaire among professional software engineers for finding out how they deal with correspondence. The questionnaire elicited the attitude of professional software engineers with respect to: importance of correspondence, common practice in maintaining correspondence and common reasons for deterioration of correspondence. The results of the questionnaire provide a deeper understanding of the aspects of correspondence and their importance in practical software engineering.
An EP algorithm for stability analysis of interval neutral delay-differential systems
Authors: Jun-Juh Yan, Meei-Ling Hung, Teh-Lu Liao
Venue: Expert Systems with Applications: An International Journal (2008)

As well-known, evolutionary programming (EP) algorithms have been considered as promising techniques for global optimal search. The main objective of this paper is to develop a novel EP algorithm for the robust stability analysis of interval neutral delay-differential systems. Two main results are obtained in this paper. First a delay-dependent criterion is derived for ensuring the stability of degenerate neutral time-delay systems, and then by solving some optimization problems, which will be defined later, the robust stability of interval neutral delay-differential systems can be guaranteed. Two numerical examples are given to illustrate the results.
Failure-Tolerant Sequential Machines with Past Information
Authors: Y. Tohma, S. Aoyagi
Venue: IEEE Transactions on Computers (1971)

A sequential machine must have certain redundant information in order to be capable of correcting error. As past inputs and past states are redundant, a sequential machine with error correction capability is constructable by making use of these elements of past information. This paper describes conditions of state assignments, numbers of required redundant state variables, and estimation of reliability of failure-tolerant sequential machines.
An effective algorithm for generation of factorial designs with generalized minimum aberration
Authors: Kai-Tai Fang, Aijun Zhang, Runze Li
Venue: Journal of Complexity (2007)

Fractional factorial designs are popular and widely used for industrial experiments. Generalized minimum aberration is an important criterion recently proposed for both regular and non-regular designs. This paper provides a formal optimization treatment on optimal designs with generalized minimum aberration. New lower bounds and optimality results are developed for resolution-III designs. Based on these results, an effective computer search algorithm is provided for sub-design selection, and new optimal designs are reported.
An ant algorithm for static and dynamic MAX-SAT problems
Authors: Pedro C. Pinto, Thomas A. Runkler, João M. C. Sousa
Venue: Proceedings of the 1st international conference on Bio inspired models of network, information and computing systems (2006)

This paper proposes a modified ant colony optimization algorithm, which is applied to the dynamic variant of the maximum satisfiability problem, or MAX-SAT. In the first part of the article we describe the developed algorithm and validate it using previous results of ant optimization applied to normal MAX-SAT problems. In the second part of the article we describe the changes implemented to optimize the dynamic problem and analyze the parameters of the new algorithm. The adapted ant colony optimization accomplishes very well the task of dealing with systematic changes of dynamic MAX-SAT instances derived from static problems.
Hierarchical Coding of Microcomputers for High-Level Architecture
Authors: Edwin Klingman
Venue: IEEE Micro (1981)

This first of two articles on high-level microcomputer architecture presents a hierarchy of computer codes and introduces "millicoding," a new level within that hierarchy. 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
Spanning cycles in regular matroids without M*(K5) minors
Authors: Hong-Jian Lai, Bolian Liu, Yan Liu, Yehong Shao
Venue: European Journal of Combinatorics (2008)

Catlin and Jaeger proved that the cycle matroid of a 4-edge-connected graph has a spanning cycle. This result can not be generalized to regular matroids as there exist infinitely many connected cographic matroids, each of which contains a M^*(K"5) minor and has arbitrarily large cogirth, that do not have spanning cycles. In this paper, we proved that if a connected regular matroid without a M^*(K"5)-minor has cogirth at least 4, then it has a spanning cycle.
A neural-wavelet architecture for voice conversion
Authors: Rodrigo Capobianco Guido, Lucimar Sasso Vieira, Sylvio Barbon Júnior, Fabrício Lopes Sanchez, Carlos Dias Maciel, Everthon Silva Fonseca, José Carlos Pereira
Venue: Neurocomputing (2007)

In this letter we propose a new architecture for voice conversion that is based on a joint neural-wavelet approach. We also examine the characteristics of many wavelet families and determine the one that best matches the requirements of the proposed system. The conclusions presented in theory are confirmed in practice with utterances extracted from TIMIT speech corpus.
Visualizing Whole-Brain DTI Tractography with GPU-based Tuboids and LoD Management
Authors: Vid Petrovic James Fallon Falko Kuester
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

Diffusion Tensor Imaging (DTI) of the human brain, coupled with tractography techniques, enable the extraction of large-collections of three-dimensional tract pathways per subject. These pathways andpathway bundles represent the connectivity between different brain regions and are critical for the understanding of brain related diseases. A flexible and efficient GPU-based rendering technique for DTI tractography data is presented that addresses common performance bottlenecks and image-quality issues, allowing interactiverender rates to be achieved on commodity hardware. An occlusion query-based pathway LoD management system for streamlines/streamtubes/tuboids is introduced that optimizes input geometry, vertex processing, and fragment processing loads, and helps reduce overdraw. The tuboid, a fully-shaded streamtube impostor constructed entirely on the GPU from streamline vertices, is also introduced. Unlike full streamtubes and other impostor constructs, tuboids require little to no preprocessing or extra space over the original streamline data. The supported fragment processing levels of detail range from texture-based draft shading to full raycast normal computation, Phong shading, environment mapping, and curvature-correct text labeling. The presented text labeling technique for tuboids provides adaptive, aesthetically pleasing labels that appear attached to the surface of the tubes. Furthermore, an occlusion query aggregating and scheduling scheme for tuboids is described that reduces the query overhead. Results for a tractography dataset are presented, and demonstrate that LoD-managed tuboids offer benefits over traditional streamtubes both in performance and appearance.
The Need for Software Engineering
Authors: W. Myers
Venue: Computer (1978)

Early in this decade a set of programming practices began to appear that seemed to offer a way out of the software difficulties accompanying the development of large systems. These practices, developed by Brooks,1 Baker,2 Dijkstra,3 Mills,4,5 and others, included structured programming, top-down development, chief programmer teams, HIPO (hierarchy/input-process-output) documentation, development support library, and structured walk-throughs. But despite the increasing amount of software development ment and its rising cost relative to the defense budget, corporation expenditures, and even the gross national product, the new programming techniques have not been adopted by acclamation. McClure,6 surveying the scene at COMPCON '76 Spring, saw "the great masses of programmers conducting their business exactly as they did five years ago." Nor was there the slightest sign in McClure's 5-year projection of "strong winds of change." His intuition was later supported by a survey of major Los Angeles area corporations,7 which concluded that, for all the fanfare, "the techniques are simply not widely used."
Collaborative curriculum and instruction design for personalized online instruction delivery
Authors: Apple W. P. Fok, Horace H. S. Ip
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

Education and learning environments are rapidly extending outside the classrooms/schools. To empower teachers with the capability to meet the challenges of supporting ubiquitous learning, advanced e-pedagogy and associated technologies should be designed and offered for leading them to a convenient and valuable teaching and learning environment. The current demands on placing emphases on introduction pedagogical approaches into IT tools in teaching and learning and the studies on the feasibilities of collaborative teaching and learning through a web-based environment are an important stepping-stone for our education growth. In this paper, we introduce a web-based curriculum and instruction design tool that supports collaborative teaching, encourage teachers to share invaluable pedagogical design and deliver constructive online instructions, through the implementation of a successful ITEd capacity building framework that strengthens communication and promotes sharing among schools and teachers.
Automatic Handwriting Identification on Medieval Documents
Authors: Marius Bulacu, Lambert Schomaker
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

In this paper, we evaluate the performance of text-independent writer identification methods on a handwriting dataset containing medieval English documents. Applicable identification rates are achieved by combining textural features (joint directional probability distributions) with allographic features (grapheme-emission distributions). The aim is to develop an automatic handwriting identification tool that can assist the paleographer in the task of determining the authorship of historical manuscripts.
Design and testing of a self-powered 3D integrated SOI CMOS system
Authors: Z. Dilli, N. Goldsman, M. Peckerar, A. Akturk, G. Metze
Venue: Microelectronic Engineering (2008)

A self-powering 3D integrated circuit built using an SOI CMOS process is presented. The 3D integrated circuit has three tiers connected by vertical vias through the intertier oxides. The circuit elements are a photodiode array, a charge-integrating capacitor, and a local oscillator with an output buffer, each on a separate tier. The final system size is 250@mmx250@mmx696@mm. Our results demonstrate the circuit as a feasible proof-of-concept 3D ''system''. The photodiode array stores charge on the capacitor and powers the oscillator as designed.
The Further Reduction of CC-Tables
Authors: H. A. Curtis
Venue: IEEE Transactions on Computers (1971)

Paull and Unger [1] were the first to develop methods for solving the problem of minimizing the number of internal states of incompletely specified sequential machines. Grasselli and Luccio [2] improved upon these methods by introducing rules for reducing the size of the problem and by transforming the problem into a linear integer programming problem. House and Stevens [3] have provided a means of further reducing the size of the problem by developing an additional rule.
UNISIM: An Open Simulation Environment and Library for Complex Architecture Design and Collaborative Development
Authors: David August, Jonathan Chang, Sylvain Girbal, Daniel Gracia-Perez, Gilles Mouchard, David A. Penry, Olivier Temam, Neil Vachharajani
Venue: IEEE Computer Architecture Letters (2007)

Simulator development is already a huge burden for many academic and industry research groups; future complex or heterogeneous multi-cores, as well as the multiplicity of performance metrics and required functionality, will make matters worse. We present a new simulation environment, called UNISIM, which is designed to rationalize simulator development by making it possible and efficient to distribute the overall effort over multiple research groups, even without direct cooperation. UNISIM achieves this goal with a combination of modular software development, distributed communication protocols, multi-level abstract modeling, interoperability capabilities, a set of simulator services APIs, and an open library/repository for providing a consistent set of simulator modules.
Testing linearity in a cointegrating STR model for the money demand function: International evidence from G-7 countries
Authors: Chien-Chiang Lee, Pei-Fen Chen, Chun-Ping Chang
Venue: Mathematics and Computers in Simulation (2007)

The motivation behind this paper is to re-investigate the stability of the long-run money demand function (MDF) in a non-linear cointegrating framework for G-7 countries. Previous studies on non-linearity in the MDF are only related to the short-run dynamics and assume that long-run cointegrating relations are linear, which according to economic theory need not be the case. Thus, we really need to focus on the variables in the long-run MDF and their determinants through the adoption of a cointegrating smooth transition regression (CSTR) test developed by [I. Choi, P. Saikkonen, Testing linearity in cointegrating smooth transition regressions, Economet. J. 7 (2004) 341-365]. The reason is due to this model being more general than the traditional STR model in that it may contain several transition functions and has more than a single transition variable. Our evidence demonstrates the existence of a non-linear cointegrating relationship, and as such several transition variables should be of more concern under the non-linear hypothesis. Overall, we propose more possibilities that will bring about the unstable phenomenon of the long-run MDF.
Spatial data algorithm extension to TRAKLA2 environment
Authors: Jussi Nikander
Venue: Proceedings of the 6th Baltic Sea conference on Computing education research: Koli Calling 2006 (2006)

In this paper an extension that brings spatial data algorithm support to the TRAKLA2 system is described. The different exercise types and the problems implementing them are discussed, and suggestions for future work and ideas for better spatial data support to the system are given.
A novel method for shelf life prediction of a packaged moisture sensitive snack using multilayer perceptron neural network
Authors: Ubonrat Siripatrawan, Pantipa Jantawat
Venue: Expert Systems with Applications: An International Journal (2008)

A novel method for shelf life prediction was established for a packaged moisture sensitive snack. Artificial neural network (ANN) based on multilayer perceptrons (MLP) with back propagation algorithm was developed to predict the shelf life of packaged rice snack stored at 30^oC and 75% RH, 30^oC and 85% RH and 40^oC and 75% RH, comparable to tropical storage conditions. The MLP predicted shelf lives were then compared to the actual shelf lives. Using MLP algorithm, many factors could be incorporated into the model including food characteristics, package properties, and storage environments. The MLP neural network comprised an input layer, one hidden layer and an output layer. The network was trained using Lavenberg-Marquardt (LM) algorithm. The performance of a MLP neural network was measured using regression coefficient (R^2) and mean squared error (MSE). The MLP algorithm gave R^2 of 0.98, and MSE of 0.12. MLP offers several advantages over conventional digital computations, including faster speed of information processing, learning ability, fault tolerance, and multi-output ability.
Fully discrete mixed finite element method for a quasilinear Stefan problem with a forcing term in non-divergence form
Authors: H. Y. Lee, M. R. Ohm, J. Y. Shin
Venue: Journal of Applied Mathematics and Computing (2007)

Based on a mixed Galerkin approximation, we construct the fully discrete approximations of Uy as well as U to a single-phase quasilinear Stefan problem with a forcing term in non-divergence form. We prove the optimal convergence of approximation to the solution {U,S} and the superconvergence of approximation to Uy.
RankMass crawler: a crawler with high personalized pagerank coverage guarantee
Authors: Junghoo Cho, Uri Schonfeld
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Crawling algorithms have been the subject of extensive research and optimizations, but some important questions remain open. In particular, given the unbounded number of pages available on the Web, search-engine operators constantly struggle with the following vexing questions: When can I stop downloading the Web? How many pages should I download to cover "most" of the Web? How can I know I am not missing an important part when I stop? In this paper we provide an answer to these questions by developing, in the context of a system that is given a set of trusted pages, a family of crawling algorithms that (1) provide a theoretical guarantee on how much of the "important" part of the Web it will download after crawling a certain number of pages and (2) give a high priority to important pages during a crawl, so that the search engine can index the most important part of the Web first. We prove the correctness of our algorithms by theoretical analysis and evaluate their performance experimentally based on 141 million URLs obtained from the Web. Our experiments demonstrate that even our simple algorithm is effective in downloading important pages early on and provides high "coverage" of the Web with a relatively small number of pages.