ppxscal/embedding_network huggingface dataset:
ALOCOM: a generic content model for learning objects
Authors: Katrien Verbert, Erik Duval
Venue: International Journal on Digital Libraries (2008)

e-Learning organizations are focusing heavily on learning content reusability. The ultimate objective is a learning object economy characterized by searchable digital libraries of reusable learning objects that can be exchanged and reused across various learning systems. To enable such approach, basic questions of learning content interoperability need to be addressed. This paper investigates the interoperation of learning content defined according to different specifications. A number of content models are reviewed that define learning objects and their components. On the basis of a comparative analysis, the content models are mapped to a generic model for learning objects to address interoperability questions and to enable share and reuse on a global scale.
Tuplespace-based computing for the semantic web: A survey of the state-of-the-art
Authors: Lyndon j. b. Nixon, Elena Simperl, Reto Krummenacher, Francisco Martin-recuerda
Venue: The Knowledge Engineering Review (2008)

Semantic technologies promise to solve many challenging problems of the present Web applications. As they achieve a feasible level of maturity, they become increasingly accepted in various business settings at enterprise level. By contrast, their usability in open environments such as the Web—with respect to issues such as scalability, dynamism and openness—still requires additional investigation. In particular, Semantic Web services have inherited the Web service communication model, which is primarily based on synchronous message exchange technology such as remote procedure call (RPC), thus being incompatible with the REST (REpresentational State Transfer) architectural model of the Web. Recent advances in the field of middleware propose ‘semantic tuplespace computing’ as an instrument for coping with this situation. Arguing that truly Web-compliant Web service communication should be based, analogously to the conventional Web, on shared access to persistently published data instead of message passing, space-based middleware introduces a coordination infrastructure by means of which services can exchange information in a time-and reference-decoupled manner. In this article, we introduce the most important approaches in this newly emerging field. Our objective is to analyze and compare the solutions proposed so far, thus giving an account of the current state-of-the-art, and identifying new directions of research and development.
Scheduling support system based on meta-heuristics for dynamic manufacturing scheduling
Authors: Ana Madureira
Venue: Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science (2005)

The planning of Manufacturing Systems involves frequently the resolution of a huge amount and variety of combinatorial optimization problems with a important impact on the performance of manufacturing organizations. The proposed approach is in line with reality and away from the approaches that deal with static and classic or basic Job-Shop scheduling problems. In fact, in real world, where problems are essentially of dynamic and stochastic nature, the traditional methods or algorithms are of very little use. This is the case with most algorithms for solving the so-called static scheduling problem for different setting of both single and multimachine systems arrangements. This reality, motivated us to concentrate on tools, which could deal with such dynamic, disturbed scheduling problems, for multi-machine manufacturing settings, even though, due to the complexity of these problems, optimal solutions may not be possible to find.
A Clustering-based Group Key Agreement Protocol for Ad-Hoc Networks
Authors: Maarit Hietalahti
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

Efficient authenticated group key establishment is the pre-requirement for having group-wide encrypted communications in wireless ad hoc networks. Clustering has brought scalability to ad hoc networks in many ways, now we look at its benefits to group key agreement. In this paper, several solutions for authenticated key establishment in clustered ad hoc networks are surveyed and a new efficient solution for clustered group key establishment is presented. It is based on the AT-GDH and the Burmester-Desmedt broadcast group key protocols.
An algorithm for numerical synthesis of optimal control
Authors: A. I. Tyatyushkin, O. V. Morzhin
Venue: Automation and Remote Control (2008)

An algorithm for optimization of goal point-to-point control in a differential system with phase constraints that is based on the results of construction and estimation of sets of attainability (solvability) of the system is represented. Algorithms for the methods of supporting hyperplanes and sections for constructing the indicated sets are given. The efficiency of software-algorithmic implementation of the methods is confirmed by examples. The developed software technology oriented on multiprocessor systems is closely connected with the applied problems under study.
Discrete Event Modeling and Simulation of Wireless Sensor Network Performance
Authors: T. Antoine-Santoni, J.F. Santucci, E. De Gentili, B. Costa
Venue: Simulation (2008)

The wireless distributed microsensor networks have profited from recent technological advances and it seems essential to precisely understand these systems. Modeling and simulation appear to be an essential aspect of predicting the Wireless Sensor Network (WSN) specific behavior under different conditions. We want to provide a new method of modeling, simulation and visualization of WSN using a discrete-event approach. Described by Zeigler in the 1970's, the Discrete Event System Specification is ideal for describing the asynchronous nature of the events occuring in WSN. We have provided a basic model for the analysis of WSN performance, including routing management, energy consumption and relative CPU activity. Our approach uses a detailed definition of node-oriented components and aims to introduce methods of visualizing the network at a different level of abstraction.
Mathematical tools of mixed number algebra
Authors: Md. Shah Alam, M. H. Ahsan, Mushfiq Ahmad
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

Mixed number is the sum of a scalar and a vector. The quaternion can also be written as the sum of a scalar and a vector but the product of mixed numbers and the product of quaternions are different. Mixed product is better than the quaternion product because Mixed product is directly consistent with Pauli matrix algebra and Dirac equation but the quaternion product is not directly consistent with Pauli matrix algebra and Dirac equation. Mixed numbers are successfully applied in Quantum mechanics and special relativity. We can develop a new most general Lorentz Transformation using mixed number algebra, which we called Mixed number Lorentz Transformation. Most general Lorentz Transformation has some limitations but Mixed number Lorentz Transformation has free from those limitations. In this paper we have represented the complete mathematical tools of mixed number algebra.
Teaching Computer Security using Xen in a Virtual Environment
Authors: Dong Hu, YuYan Wang
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

This paper presents a new teaching method by introducing Xen into a computer security course. To provide students with hands-on exercises in computer security course, we have designed a laboratory environment for computer security education. It is based on Xen and Linux, all of which are free. Xen provides a secure environment within which students may install, configure, and experiment with the design and test of the system security. Based on this environment, we have developed several labs, covering a wide range of security principles.
Skippy: a new snapshot indexing method for time travel in the storage manager
Authors: Ross Shaull, Liuba Shrira, Hao Xu
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

The storage manager of a general-purpose database system can retain consistent disk page level snapshots and run application programs "back-in-time" against long-lived past states, virtualized to look like the current state. This opens the possibility that functions, such as on-line trend analysis and audit, formerly available in specialized temporal databases, can become available to general applications in general-purpose databases. Up to now, in-place updating database systems had no satisfactory way to run programs on-line over long-lived, disk page level, copy-on-write snapshots, because there was no efficient indexing method for such snapshots. We describe Skippy, a new indexing approach that solves this problem. Using Skippy, database application code can run against an arbitrarily old snapshot, and iterate over snapshot ranges, as efficiently it can access recent snapshots, for all update workloads. Performance evaluation of Skippy, based on theoretical analysis and experimental measurements, indicates that the new approach provides efficient access to snapshots at low cost.
A Model to Optimize DNA Sequences Based on Particle Swarm Optimization
Authors: Noor Khafifah Khalid, Tri Basuki Kurniawan, Zuwairie Ibrahim, Zulkifli Md Yusof, Marzuki Khalid, Andries P. Engelbrecht
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

In DNA based computation and DNA nanotechnology, the design of good DNA sequences has turned out to be an elementary problem and one of the most practical and important research topics. Although the design of DNA sequences is dependent on the protocol of biological experiments, it is highly required to establish a method for the systematic design of DNA sequences, which could be applied to various design constraints. Therefore, much work has focused on designing the DNA sequences to avoid incorrect or undesirable DNA computations. In this paper, a model for Particle Swarm Optimization (PSO) implementation is proposed to solve the DNA sequence design problem. PSO simulates a commonly observed social behavior where members of a group tend to follow the leader of the group. To demonstrate the correctness of the proposed model, a basic PSO with 10 particles is implemented to minimize an objective of DNA sequence design, which is the H-measure.
On the functional decomposition of multivariate laurent polynomials (abstract only)
Authors: Stephen M. Watt
Venue: ACM Communications in Computer Algebra (2008)

Determining whether a univariate polynomial may be written as the functional composition of two others of lower degree is a question that has been studied since at least the work of Ritt [1]. Algorithms by Barton and Zippel [2] and then by Kozen and Landau [3] have been incorporated in many computer algebra systems. Generalizations have been studied for functional decomposition of rational functions [4], algebraic functions [5], multivariate polynomials [6] and univariate Laurent polynomials [7]. We explore the functional decomposition problem for multivariate Laurent polynomials, considering the case f = g o h where g is univariate and h may be multivariate. We present an algorithm to find such a decomposition if it exists. The algorithm proceeds as follows: First, a variable weighting is chosen to make the weighted degree zero term in f constant. The positive degree and negative degree parts of h are then reconstructed separately, in a manner similar to that of Kozen and Landau, but by treating the homogeneous collections of terms by grade rather than individual monomials. Then terms of the univariate polynomial g are reconstructed degree by degree using a generic univariate projection of h.
Connecting Algebraic and Logical Descriptions of Concurrent Systems
Authors: Naijun Zhan
Venue: Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (2006)

We study and implement concrete methods for the verification of both imperative as well as functional programs in the frame of the Theorema system. The distinctive features of our approach consist in the automatic generation of loop invariants (by using combinatorial and algebraic techniques), and the generation of verification conditions as first-order logical formulae which do not refer to a specific model of computation.
On reliable modular testing with vulnerable test access mechanisms
Authors: Lin Huang, Feng Yuan, Qiang Xu
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

In modular testing of system-on-a-chip (SoC), test access mechanisms (TAMs) are used to transport test data between the input/output pins of the SoC and the cores under test. Prior work assumes TAMs to be error-free during test data transfer. The validity of this assumption, however, is questionable with the ever-decreasing feature size of today's VLSI technology and the ever-increasing circuit operational frequency. In particular, when functional interconnects such as network-on-chip (NoC) are reused as TAMs, even if they have passed manufacturing test beforehand, failures caused by electrical noise such as crosstalk and transient errors may happen during test data transfer and make good chips appear to be defective, thus leading to undesired test yield loss. To address the above problem, in this paper, we propose novel solutions that are able to achieve reliable modular testing even if test data may sometimes get corrupted during transmission with vulnerable TAMs, by designing a new "jitter-aware" test wrapper and a new "jitter-transparent" ATE interface. Experimental results on an industrial circuit demonstrate the effectiveness of the proposed technique.
Forchheimer's sound waves propagation in a cylindrical tube filled with a porous media
Authors: H. M. Duwairi
Venue: Proceedings of the 1st WSEAS International Conference on Computational Chemistry (2007)

A rigid frame, cylindrical capillary theory of sound propagation in porous media that includes the nonlinear effects of the Forchheimer type is laid out by using variational solutions. It is shown that the five main parameters governing the propagation of sound waves in a fluid contained in rigid cylindrical tubes filled with a saturated porous media are shear wave number, s = R √ρω/µ, reduced frequency parameter, k=wR/a, porosity, ε, Darcy number, Da = R/K, and Forchheimer number, Cs* = 2CF. The manner in which the flow influences the attenuation and the phase velocities of the forward and backward propagating isentropic acoustic waves is deduced. It is found that the inclusion of the solid matrix increases wave's attenuations and phase velocities for both forward and backward sound waves, while increasing the porosity and the reduced frequency number decreased attenuation and phase velocities. The effect of the steady flow is found to decrease the attenuation and phase velocities for forward sound waves and enhance them for the backward sound waves.
Clock gating for power optimization in ASIC design cycle theory & practice
Authors: Jairam S, Madhusudan Rao, Jithendra Srinivas, Parimala Vishwanath, Udayakumar H, Jagdish Rao
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

In this tutorial we present a comprehensive analysis of the available clock gate (CG) optimization approaches with re-cent innovations available in EDA tools as they have developed in time. Based on these approaches, we propose an integrated and additive design methodology spanning the backend design space. We show that over 30% power savings in dynamic power can be achieved through this methodology subject to application scenarios of the design.
Spectrally segmented principal component analysis of hyperspectral imagery for mapping invasive plant species
Authors: F. Tsai, E. -K. Lin, K. Yoshino
Venue: International Journal of Remote Sensing (2007)

Principal component analysis (PCA) is one of the most commonly adopted feature reduction techniques in remote sensing image analysis. However, it may overlook subtle but useful information if applied directly to the analysis of hyperspectral data, especially for discriminating between different vegetation types. In order to accurately map an invasive plant species (horse tamarind, Leucaena leucocephala) in southern Taiwan using Hyperion hyperspectral imagery, this study developed a spectrally segmented PCA based on the spectral characteristics of vegetation over different wavelength regions. The developed algorithm can not only reduce the dimensionality of hyperspectral imagery but also extracts helpful information for differentiating more effectively the target plant species from other vegetation types. Experiments conducted in this study demonstrated that the developed algorithm performs better than correlation-based segmented principal component transformation (SPCT) and conventional PCA (overall accuracy: 86%, 76%, 66%; kappa value: 0.81, 0.69, 0.57) in detecting the target plant species, as well as mapping other vegetation covers.
From ISA to application design via RTOS— a course design framework for embedded software
Authors: Pao-Ann Hsiung, Shang-Wei Lin
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 02 (2007)

Embedded systems have pervaded every aspect of our daily lives, however their design and verification are often accomplished using ad hoc and trial-and-error methods. Courses introducing systematic and more formal methods are required. However, currently there is little consensus on what a standard syllabus for an undergraduate course on embedded software design should cover. This paper proposes a course design that have undergone thorough experimentations and evaluations through the last four years in actual classes. The course starts from the ARM instruction set architecture and concludes with an introduction of Java-based wireless application design. The design of standalone, as well as, RTOS-based embedded software are all introduced. The course has culminated in the generation of embedded software engineers that significantly contribute to the technical industry in Taiwan, spanning from handheld devices to home appliances and from networked systems to personal computer accessories. We hope the proposed curriculum becomes a standard effort at training embedded software engineers in both theory and practice.
Designing a Web-based assessment environment for improving pre-service teacher assessment literacy
Authors: Tzu-Hua Wang, Kuo-Hua Wang, Shih-Chieh Huang
Venue: Computers Education (2008)

Teacher assessment literacy is a key factor in the success of teaching, but some studies concluded that teachers lack it. The aim of this research is to propose the ''Practicing, Reflecting and Revising with WATA system (P2R-WATA) Assessment Literacy Development Model'' for improving pre-service teacher assessment literacy. WATA system offers personalized learning resources and opportunities for pre-service teachers to assemble tests and administer them to students on-line. Furthermore, WATA system facilitates performance of test analysis and item analysis, and enables pre-service teachers to review statistical information from the test and item analyses to revise test items. Sixty pre-service teachers participated in this research. The research results indicate that pre-service teachers using P2R-WATA Assessment Literacy Development Model have better effectiveness in improving their assessment knowledge and assessment perspectives.
Optimal scheduling and routing for maximum network throughput
Authors: Emilio Leonardi, Marco Mellia, Marco Ajmone Marsan, Fabio Neri
Venue: IEEE/ACM Transactions on Networking (TON) (2007)

In this paper we consider packet networks loaded by admissible traffic patterns, i.e., by traffic patterns that, if optimally routed, do not overload network resources. We prove that simple distributed dynamic routing and scheduling algorithms based upon link state information can achieve the same network throughput as optimal centralized routing and scheduling algorithms with complete traffic information. Our proofs apply the stochastic Lyapunov function methodology to a flow-level abstract model of the network, and consider elastic traffic, i.e., we assume that flows can adapt their transmission rates to network conditions, thus resembling traffic engineering and quality-of-service approaches being currently proposed for IP networks. Although the paper mainly brings a theoretical contribution, such dynamic routing and scheduling algorithms can be implemented in a distributed way. Moreover we prove that maximum throughput is achieved also in case of temporary mismatches between the actual links state and the link state information used by the routing algorithm. This is a particularly relevant aspect, since any distributed implementation of a routing algorithm requires a periodic exchange of link state information among nodes, and this implies delays, and thus time periods in which the current link costs are not known.
A Hidden Markov Model approach to predicting yeast gene function from sequential gene expression data
Authors: Xutao Deng, Huimin Geng, Hesham H. Ali
Venue: International Journal of Bioinformatics Research and Applications (2008)

Existing data mining tools can only achieve about 40% precision in function prediction of unannotated genes. We developed a gene function prediction tool based on profile Hidden Markov Models (HMMs). Each function class was modelled using a distinct HMM whose parameters were trained using yeast time-series gene expression profiles. Two structural variants of HMMs were designed and tested, each of them on 40 function classes. The highest overall prediction precision achieved was 67% using double-split HMM with leave-one-out cross-validation. We also attempted to generalise HMMs to dynamic Bayesian networks for gene function prediction using heterogeneous data sets.
Wavelet Transform Application in: Time Frequency Enhancement for Ventricular Late Potential Better Detection
Authors: Saeid Rahati, Ghasem Sadeghy Bajestani, Homa Falsoleiman, Alireza HeidariBokavi
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

According to the wide application of time frequency distributions in Biomedical signal analyses, especially in ECG signals, and due to existence of high energy and low frequency components and sharp templates in ECG signals, the components which have very low amplitude do not appear clearly in time-frequency displays. In this research, a suitable method for preprocessing the biological signals by wavelet factors based on noise reduction has been presented. This method improves the features of time-frequency signal by reducing the effects resulting from the ignorance of low amplitude components. The results gained through the application of this method on ECG as well as the simulated data prove the positive effect of this method.
An algorithm for text categorization
Authors: Anestis Gkanogiannis, Theodore Kalamboukis
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

A novel and efficient learning algorithm is proposed for the binary linear classification problem. The algorithm is trained using the Rocchio's relevance feedback technique and builds a classifier by the intermediate hyperplane of two common tangent hyperplanes for the given category and its complement. Experimental results presented are very encouraging and justify the need for further research.