ppxscal/embedding_network huggingface dataset:
Teaching and Training System plus Modeling and Simulation - A Plug-In Based Approach
Authors: Marcus Oertel, Jan Himmelspach, Alke Martens
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

Teaching and training simulation systems are usually developed ad hoc and are in most cases not carefully engineered. This leads to a situation, where neither teaching and training content, nor parts of the implemented systems can be re-used. The approach described in this paper is based on the idea of “plug-in” of components. The framework JaBIT (Java Based Intelligent Tutoring) provides for a set of core components which can be used for implementing a teaching and training system. In combination with the modeling and simulation system JAMES II (Java based Agent Modeling Environment for Simulation II a JAva based Multipurpose Environment for Simulation), also modeling and simulation components can be used for development of teaching and training systems. The JaBIT framework and the combination of the framework with JAMES II “plug’n simulate” mechanism are described in the paper.
Assessment of Private Education Based on Mathematical Modeling Techniques
Authors: Sherif E. Hussein, Elrashid O. Khidir
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

As the world evolves, there is always a need for managing the different business and education problems with a well defined policy. However, the field of education is still lacking well defined models that are based on mathematical formulae. Therefore, it was the aim of this research to develop a mathematical model that can help planning and managing the education system. Statistical tools are certainly of value, yet with diversity of data and parameters, the option was to use a model based on system dynamics. The preliminary results points to the validity of that model.
A Fully-Integrated 2.4 GHz Mismatch-Controllable RF Front-end Test Platform in 0.18µm CMOS
Authors: Zahra Sadat Ebadi, Resve Saleh
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

The design and implementation of a prototype testbench for a direct conversion receiver RF front-end targeted for the 2.4 GHz ISM band are described. The developed front-end provides user control of I/Q mismatch and is intended as a test vehicle for evaluation of various I/Q mismatch compensation methods implemented in the back-end. The I and Q path mixers can operate in normal mode, or they can be controlled externally to introduce a known mismatch, or controlled to compensate for the actual mismatch, which results in a dramatic increase in the image rejection ratio (IRR). A prototype of the proposed circuit was fabricated using TSMC 0.18μm CMOS technology and includes a low noise amplifier (LNA), two mixers (with quadrature down-conversion) and a quadrature voltage-controlled oscillator (QVCO). It achieves a conversion gain of 40 dB, and a noise figure of 9.8 dB. The circuit dissipates 25 mW and occupies an active area of 2.5 mm2.
Adaptive Bayesian space--time equalisation for multiple receive-antenna assisted single-input multiple-output systems
Authors: S. Chen, S. Liu, L. Hanzo
Venue: Digital Signal Processing (2008)

This contribution considers nonlinear space-time equalisation (STE) for multiple receive-antenna induced single-input multiple-output (SIMO) systems. By exploiting the inherent symmetry of the underlying optimal Bayesian STE solution, a novel symmetric radial basis function (RBF) based STE scheme is proposed, which is capable of approaching the optimal Bayesian equalisation performance. Adaptive implementation of this symmetric RBF (SRBF) based STE can be achieved conveniently by estimating the SIMO channels using the least mean square channel estimator and computing the optimal RBF centres from the resulting SIMO channel matrix estimate. Simulation results also demonstrate that the performance of this SRBF based STE is robust with respect to the choice of the RBF variance value. The proposed adaptive solution is then extended to the space-time decision feedback equalisation (ST-DFE) structure.
Placement-and-routing-based register allocation for coarse-grained reconfigurable arrays
Authors: Bjorn De Sutter, Paul Coene, Tom Vander Aa, Bingfeng Mei
Venue: Proceedings of the 2008 ACM SIGPLAN-SIGBED conference on Languages, compilers, and tools for embedded systems (2008)

DSP architectures often feature multiple register files with sparse connections to a large set of ALUs. For such DSPs, traditional register allocation algorithms suffer from a lot of problems, including a lack of retargetability and phase-ordering problems. This paper studies alternative register allocation techniques based on placement and routing. Different register file models are studied and evaluated on a state-of-the art coarse-grained reconfigurable array DSP, together with a new post-pass register allocator for rotating register files.
Weaving the Mesh: Finding Remedies in Cyberspace
Authors: Joseph A. Cannataci, Jeanne Pia Mifsud-Bonnici
Venue: International Review of Law, Computers and Technology (2007)

This paper will categorise cyberspace as a microcosm of Darwinistic evolution, tracing the organic growth that has resulted in the increasingly tangled web of rules that today stretches throughout the on-line world. This evolution has produced a complementarity and interdependence between private and state regulation in a manner that will probably long affect current and future trends in the governance of cyberspace. The paper concludes that, while rule systems will continue to converge, the driving force will remain the perennial search to provide remedies to the needs of clients. The latter drive for real-time remedies for real problems will probably produce workable rule-systems faster because they are pushed by the needs of millions of customers operating within the context of on-line market economics. This is in direct contrast to the development of formal rules for Internet governance by states. Lawyers need practical solutions for their clients and this paper identifies a number of private international law problems that will increasingly dominate public law issues in cyberlaw.
A mass conserving boundary condition for the lattice Boltzmann equation method
Authors: Jie Bao, Peng Yuan, Laura Schaefer
Venue: Journal of Computational Physics (2008)

In lattice Boltzmann (LB) simulations, the widely used wall boundary conditions (BCs) proposed by Filipova and Hanel (FH) and Mei, Luo and Shyy (MLS) result in constant mass leakage in certain circumstances. In this paper, we have analyzed the source of the leakage. Based on this analysis, we propose a second-order accurate mass conserving wall BC. In our BC, the distribution function at a wall node is decomposed into its equilibrium and non-equilibrium parts. The mass conservation is guaranteed by enforcing a mass conserving rule in the construction of the fictitious equilibrium distribution part. We have shown through several benchmark test problems involving steady and unsteady flows that our new BC not only eliminates the constant mass leakage, but also has many other advantages over the FH and MLS BCs.
A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs
Authors: Jørgen Bang–Jensen, Gregory Gutin, Anders Yeo
Venue: Journal of Graph Theory (1998)

We describe a polynomial algorithm for the Hamiltonian cycle problem for semicomplete multipartite digraphs. The existence of such an algorithm was conjectured in G. Gutin, Paths and cycles in digraphs. Ph. D. thesis, Tel Aviv Univ., 1993. (see also G. Gutin, J Graph Theory 19 (1995) 481&ndash;505). &copy; 1998 John Wiley & Sons, Inc. J. Graph Theory 29: 111&ndash;132, 1998
The Worst Case Execution Time Tool Challenge 2006: The External Test
Authors: Lili Tan
Venue: Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (2006)

The first Worst Case Execution Time (WCET) Tool Challenge, performed in 2006, attempted to evaluate the state-of-the-art in timing analysis for real-time systems and so to encourage research and activities in the WCET community. It applied two evaluation approaches to the tools submitted, self-evaluation and external evaluation. In order to balance users' effects and to achieve a comparable evaluation, an independent test person has been assigned by the WCET Challenge Working Group to perform the external tool evaluation. The test person visited the tool developers and evaluated the tools entered. This paper describes the testing procedures applied, the results obtained, and the evaluation made in the Challenge.
Survey of existing languages to model interactive web applications
Authors: Jevon Wright, Jens Dietrich
Venue: Proceedings of the fifth on Asia-Pacific conference on conceptual modelling - Volume 79 (2008)

Over the last few years, the web is establishing increased importance in society with the rise of social networking sites and the semantic web, facilitated and driven by the popularity of client-side scripting commonly known as AJAX. These allow extended functionality and more interactivity in web applications. Engineering practices dictate that we need to be able to model these applications. However, languages to model web applications have fallen behind, with most existing web modelling languages still solely focused on the hypertext structure of web sites, with little regard for user interaction or common web-specific concepts. This paper provides an overview of technologies in use in today's web applications, along with some concepts we propose are necessary to model these. We present a brief survey of existing web modelling languages including WebML, UWE, W2000 and OOWS, along with a discussion of their capability to describe these new modelling approaches. Finally, we discuss the possibilities of extending an existing language to handle these new concepts.
Space-time mixture model of Infant mortality in peninsular Malaysia from 1990-2000
Authors: Nuzlinda Abdul Rahman, Abdul Aziz Jemain
Venue: Proceedings of the 12th WSEAS International Conference on Applied Mathematics (2007)

Disease mapping is a method used to display the geographical distribution of disease occurrence. Recently, this method has received much attention from many researchers including epidemiologists, biostatisticians and medical demographers. Some traditional methods of classification for detection of high or low risk area such as traditional percentiles method and significant method have been used in disease mapping for map construction. However, as described by several authors, the classifications based on these traditional methods have some disad vantages for describing the spatial distribution of the risk of the disease concerned. To overcome these limitations, an approach using mixture model within an empirical Bayes framework is described in this paper. The aim of this study is to investigate the geographical distribution of infant mortality in Peninsular Malaysia from the year 1991 to 2000 using space-time mixture model. The analysis showed that in the early year of 1990's the spatial heterogeneity effect was more prominent; however, towards the end of 1990's this pattern tends to disappear. Indirectly, this may indicate that the provisions of health services throughout the Peninsular Malaysia are uniformly distributed over the period of the study, particularly towards the year 2000.
ADAM: run-time agent-based distributed application mapping for on-chip communication
Authors: Mohammad Abdullah Al Faruque, Rudolf Krist, Jörg Henkel
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Design-time decisions can often only cover certain scenarios and fail in efficiency when hard-to-predict system scenarios occur. This drives the development of run-time adaptive systems. To the best of our knowledge, we are presenting the first scheme for a run-time application mapping in a distributed manner using agents targeting for adaptive NoC-based heterogeneous multi-processor systems. Our approach reduces the overall traffic produced to collect the current state of the system (monitoring-traffic), needed for runtime mapping, compared to a centralized mapping scheme. In our experiment, we obtain 10.7 times lower monitoring traffic compared to the centralized mapping scheme proposed in [8] for a 64 x 64 NoC. Our proposed scheme also requires less execution cycles compared to a non-clustered centralized approach. We achieve on an average 7.1 times lower computational effort for the mapping algorithm compared to the simple nearest-neighbor (NN) heuristics proposed in [6] in a 64 x 32 NoC. We demonstrate the advantage of our scheme by means of a robot application and a set of multimedia applications and compare it to the state-of-the-art run-time mapping schemes proposed in [6, 8, 19].
Agent-Based Trust Management Model for Wireless Sensor Networks
Authors: Haiguang Chen, Huafeng Wu, Jinchu Hu, Chuanshan Gao
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

In Wireless Sensor Networks (WSNs), these sensor nodes cooperate with each other to form a network without using any infrastructure. WSNs has a wide application. But the security of WSNs is still an issue. Traditionally cryptographic mechanisms such as authentication and encryption only address part of the problem of security in WSNs. Recently, the use of reputation and trust systems has become an important mechanism in WSNs. In this paper, we develop a distributed agent-based trust management scheme. The agent node use watchdog mechanism to observe the behavior of the sensor nodes and computes the trust rating for them. We consider Packet-Dropping and Hello Flood Attack in our simulation, the simulation results and analysis show that our scheme can fast detect the malicious nodes and scale well for wireless sensor networks.
Surgical Scene Generation for Virtual Reality-Based Training in Medicine, 1 edition
Authors: Matthias Harders
Venue:  (2008)

Recent years have brought about a drastic change in patient awareness and acceptance of adverse effects in medical care. The combination of this process with an increasing focus on patient safety has put traditional educational paradigms in the medical area to the test. The potential of training approaches using virtual reality techniques has been recognized for sometime and a key element of VR-based training is the ability to generate various scenarios. Therefore, the book examines in detail the main components required to define a scenario, in the context of surgical scene generation: Generation of the scene geometry - Modelling of organ appearance - Definition of biomechanical parameters. The book is the ideal reference for any reader involved in generating training scenarios, as well as in VR-based training in general.
RF MEMS capacitive switch on semi-suspended CPW using low-loss high-resistivity silicon substrate
Authors: M. Fernández-Bolaños, J. Perruisseau-Carrier, P. Dainesi, A. M. Ionescu
Venue: Microelectronic Engineering (2008)

A high capacitive ratio RF MEMS switch, with low-actuation voltage is designed, fabricated and experimentally validated on high-resistivity silicon (HRS) substrate. Thanks to very good fabrication control of all steps and to the high dielectric constant of TiO"2, a down/up capacitive ratio close to 200 is achieved with 8V pull-in. It is also demonstrated that, using a passivated-surface HRS and semi-suspended conductors on air, the microwave losses in the CPW line are as low as 0.1dB/mm at 20GHz. The reported RF MEMS shunt capacitor is expected to serve as core device for phase shifting applications in the 10-20GHz range, both for switching operations and as a variable capacitor in distributed MEMS transmission lines (DMTLs).
Robust boosting algorithm against mislabeling in multiclass problems
Authors: Takashi Takenouchi, Shinto Eguchi, Noboru Murata, Takafumi Kanamori
Venue: Neural Computation (2008)

We discuss robustness against mislabeling in multiclass labels for classification problems and propose two algorithms of boosting, the normalized Eta-Boost.M and Eta-Boost.M, based on the Eta-divergence. Those two boosting algorithms are closely related to models of mislabeling in which the label is erroneously exchanged for others. For the two boosting algorithms, theoretical aspects supporting the robustness for mislabeling are explored. We apply the proposed two boosting methods for synthetic and real data sets to investigate the performance of these methods, focusing on robustness, and confirm the validity of the proposed methods.
Learning an intersection of k halfspaces over a uniform distribution
Authors: A. Blum
Venue: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science (1993)

We present a polynomial-time algorithm to learn an intersection of a constant number of halfspaces in n dimensions, over the uniform distribution on an n-dimensional ball. The algorithm we present in fact can learn an intersection of an arbitrary (polynomial) number of halfspaces over this distribution, if the subspace spanned by the normal vectors to the bounding hyperplanes has constant dimension. This generalizes previous results for this distribution, in particular a result of E.B. Baum (1990) who showed how to learn an intersection of 2 halfspaces defined by hyperplanes that pass through the origin (his results in fact held for a variety of symmetric distributions). Our algorithm uses estimates of second moments to find vectors in a low-dimensional "relevant subspace". We believe that the algorithmic techniques studied here may be useful in other geometric learning applications.
What do large commits tell us?: a taxonomical study of large commits
Authors: Abram Hindle, Daniel M. German, Ric Holt
Venue: Proceedings of the 2008 international working conference on Mining software repositories (2008)

Research in the mining of software repositories has frequently ignored commits that include a large number of files (we call these large commits). The main goal of this paper is to understand the rationale behind large commits, and if there is anything we can learn from them. To address this goal we performed a case study that included the manual classification of large commits of nine open source projects. The contributions include a taxonomy of large commits, which are grouped according to their intention. We contrast large commits against small commits and show that large commits are more perfective while small commits are more corrective. These large commits provide us with a window on the development practices of maintenance teams.
On Precision-Redundancy Relation in the Design of Source Coding Algorithms
Authors: Yuriy A. Reznik
Venue: Proceedings of the Data Compression Conference (2008)

We study the effects of finite-precision representation of source's probabilities on the efficiency of classic source coding algorithms, such as Shannon, Gilbert-Moore, or arithmetic codes. We derive several bounds for redundancy of such codes, and show how the problem of efficient constuction of such codes is related to one of finding simultaneous Diophantine approximations.
An algorithm for point cluster generalization based on the Voronoi diagram
Authors: Haowen Yan, Robert Weibel
Venue: Computers Geosciences (2008)

This paper presents an algorithm for point cluster generalization. Four types of information, i.e. statistical, thematic, topological, and metric information are considered, and measures are selected to describe corresponding types of information quantitatively in the algorithm, i.e. the number of points for statistical information, the importance value for thematic information, the Voronoi neighbors for topological information, and the distribution range and relative local density for metric information. Based on these measures, an algorithm for point cluster generalization is developed. Firstly, point clusters are triangulated and a border polygon of the point clusters is obtained. By the border polygon, some pseudo points are added to the original point clusters to form a new point set and a range polygon that encloses all original points is constructed. Secondly, the Voronoi polygons of the new point set are computed in order to obtain the so-called relative local density of each point. Further, the selection probability of each point is computed using its relative local density and importance value, and then mark those will-be-deleted points as 'deleted' according to their selection probabilities and Voronoi neighboring relations. Thirdly, if the number of retained points does not satisfy that computed by the Radical Law, physically delete the points marked as 'deleted' forming a new point set, and the second step is repeated; else physically deleted pseudo points and the points marked as 'deleted', and the generalized point clusters are achieved. Owing to the use of the Voronoi diagram the algorithm is parameter free and fully automatic. As our experiments show, it can be used in the generalization of point features arranged in clusters such as thematic dot maps and control points on cartographic maps.
Provenance in Comparative Analysis: A Study in Cosmology
Authors: Erik W. Anderson, James P. Ahrens, Katrin Heitmann, Salman Habib, Cláudio T. Silva
Venue: Computing in Science and Engineering (2008)

Provenance—the logging of information about how data came into being and how it was processed—is an essential aspect of managing large-scale simulation and data-intensive projects. Using a cosmology code comparison project as an example, this article presents how a provenance system can play a key role in such applications.
Dynamic iso-resistive trunk extension simulation: Contributions of the intrinsic and reflexive mechanisms to spinal stability
Authors: S. Zeinali Davarani, A. Shirazi-Adl, H. Hemami, S. J. Mousavi, M. Parnianpour
Venue: Technology and Health Care (2007)

The effects of external resistance on the recruitment of trunk muscles and the role of intrinsic and reflexive mechanisms to ensure the spinal stability are significant issues in spinal biomechanics. A computational model of spine under the control of 48 anatomically oriented muscle actions was used to simulate iso-resistive trunk movements. Neural excitation of muscles was attained based on inverse dynamics approach along with the stability-based optimization. The effect of muscle spindle reflex response on the trunk movement stability was evaluated upon the application of a perturbation moment. In this study, the trunk extension movement at various resistance levels while extending from 60&deg; flexion to the upright posture was investigated. Incorporation of the stability condition as an additional constraint in the optimization algorithm increased antagonistic activities for all resistance levels demonstrating that the co-activation caused an increase in the intrinsic stiffness of the spine and its stability in a feed-forward manner. During the acceleration phase of the movement, extensors activity increased while flexors activity decreased in response to the higher resistance. The co-activation ratio noticed in the braking phase of the movement increased with higher resistance. In presence of a 30 Nm flexion perturbation moment, reflexive feed-back noticeably decreased the induced deviation of the velocity and position profiles from the desired ones at all resistance levels. The stability-generated co-activation decreased the reflexive response of muscle spindles to the perturbation demonstrating that both intrinsic and reflexive mechanisms contribute to the trunk stability. The rise in muscle co-activation can ameliorate the corruption of afferent neural sensory system at the expense of higher loading of the spine.