ppxscal/embedding_network huggingface dataset:
A Knowledge-Based Tool for Generating and Verifying Hardware-Ready Embedded Memory Models
Authors: Paul Pao-Fang Cheng
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

Using memory models in a hardware-assisted acceleration/emulation environment, as contrasted with a software simulation environment, is often infused with some very specific problems. This paper describes a novel, yet reliable, methodology to capture the essential functionalities and timings, from a chip designer’s perspective, of commonly used embedded memories. The captured data is placed in a structural template for creating a knowledge base, which is transformed into targeted hardware-ready memories. A testbench is also created to verify the new models against the original behavioral models. This methodology has been used for years in many real design projects with great success.
Change-oriented software engineering
Authors: Peter Ebraert, Jorge Vallejos, Pascal Costanza, Ellen Van Paesschen, Theo D'Hondt
Venue: Proceedings of the 2007 international conference on Dynamic languages: in conjunction with the 15th International Smalltalk Joint Conference 2007 (2007)

We propose a first-class change model for Change-Oriented Software Engineering (COSE). Based on an evolution scenario, we identify a lack of support in current Interactive Development Environments (IDEs) to apply COSE. We introduce a set of five extensions to an existing model of first-class changes and describe the desired behaviour of change-oriented IDEs to support COSE. With the help of an evolution scenario, we show why those extensions are required. Finally we describe ChEOPS: a prototypical implementation of a change-oriented IDE on top of VisualWorks and illustrate how it supports the extended first-class change model. ChEOPS is finally used to validate COSE as a solution for the shortcomings of existing IDEs.
An iterative method for positive real systems
Authors: M. M. Martins, M. E. Trigo, D. J. Evans
Venue: International Journal of Computer Mathematics (2007)

In this paper we present a general form of an iterative method to approximate the solution of the linear system A x = b, when the matrix A + AT is real and positive definite or equivalently A is positive real. Under some assumptions we generalise several results given by Li, Liang and Evans. This iterative method contains an auxiliary matrix D 1 and, for a suitable choice of the matrix D 1, we establish convergence conditions for this iterative method. As a particular case we have the point accelerated over-relaxation method (AOR) and we analyse its convergence. Some comments about the point case of this iterative method and the one presented by Li, Liang and Evans are made in the last remarks of this paper.
Development of Electromagnetic Therapy System with Individually Patterned Protocol for Urine Incontinence Patients
Authors: Si-Cheol Noh, Hae-Ki Min, Woo-Jin Yu, Moon-Kyu Park, Jang-Woo Kwon, Hong-Ki Min, Heung-Ho Choi
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Incontinence is the urination disorder as the leakage of urine without her own volition and the woman's representative disease which reduces the quality of life. The electromagnetic therapy has high possibility of development because it has no needs of operant exercise, no arousing of shame and impossibility of infection. But, it has improvement points such as uniformity of the treatment protocol, patient dependence and absent of patient monitoring system. With these demands, the system which stimulate the pelvic flaw muscle with electromagnetic and monitoring the patient status during the therapy is proposed, in this study. The developed patient adapted electromagnetic therapy system with monitoring device is regarded as the patient affinitive treating method by reducing the risks, improving the efficiency with patterned protocol and pre/post therapy. These results, in this study, can bring the safe and organized treatment method to incontinence patients and can lead to a variable study on electromagnetic therapy in urine incontinence.
Lower bounds for algebraic computation trees with integer inputs
Authors: A. C. -C. Yao
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

A proof is given of a general theorem showing that for certain sets W a certain topological lower bound is valid in the algebraic computation tree model, even if the inputs are restricted to be integers. The theorem can be used to prove tight lower bounds for the integral-constrained form of many basic problems, such as element distinctness, set disjointness, and finding the convex hull. Through further transformations it leads to lower bounds for problems such as the integer max gap and closest pair of a simple polygon. The proof involves a nontrivial extension of the Milnor-Thom techniques for finding upper bounds on the Betti numbers of algebraic varieties.
Towards a Framework for Explicit Platform-Based Transformations
Authors: Frédéric Thomas, Jérôme Delatour, François Terrier, Sébastien Gérard
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

One promising solution for meeting the demands of constantly-evolving Real-Time Embedded (RTE) software is the model-driven development (MDD) paradigm, based on the principle of separating the description of an application from its platform-specific implementation. Existing model-driven approaches strive to achieve this separation through dedicated model transformations which actually embed a given computing platform model. This is a major impediment for MDD dissemination in an industrial context. The resulting dearth of customizable transformations hampers description of reusable generative processes. We therefore propose to explicitly describe the targeted computing platforms in the design process. The main benefit expected from explicit platform models is a true separation of concerns that enables efficient, reusable and customizable generative processes. This proposal is strongly promoted by the new OMG (Object Management Group) standard profile for Modeling and Analysis of Real-Time and Embedded systems (MARTE), with its software multitasking platforms. In this paper, we first describe the MARTE feature and then propose a framework for integrating explicit platform descriptions into a model-based generative process.
An iterative learning control based identification for a class of MIMO continuous-time systems in the presence of fixed disturbances and measurement noises
Authors: Tae-Hyoung Kim, Toshiharu Sugie
Venue: International Journal of Systems Science (2007)

This article presents an identification method based on an iterative learning control (ILC) for a class of linear MIMO (multi-input, multi-output) continuous-time systems with unknown but fixed input disturbances. For this purpose, a formula of a specific type of ILC which updates the input in an appropriate parameter space is extended to the case of MIMO systems with fixed disturbances. Then a concrete procedure to construct such an ILC is given to apply the ILC to the continuous-time system identification. Finally, numerical examples demonstrate how the parameter estimation can be achieved through the proposed ILC method in the presence of heavy measurement noises.
Secure and Privacy-Friendly Logging for eGovernment Services
Authors: Karel Wouters, Koen Simoens, Danny Lathouwers, Bart Preneel
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

In this paper we present a scheme for building a logging-trail for processes related to eGovernment services. A citizen can reconstruct the trail of such a process and verify its status if he is the subject of that process. Reconstruction is based on hand-overs, special types of log events, that link data stored by multiple logging servers, which are not necessarily trusted. Our scheme is privacy-friendly in the sense that only the authorised subject, i.e. the citizen, can link the different log entries related to one specific process. The scheme is also auditable; it allows logging servers to show that they behave according to a certain policy.
Routing protocols in ad hoc networks
Authors: Dan Galatchi, Roxana Zoican
Venue: Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics (2005)

Ad hoc networking involves computers, typically wireless mobile nodes (MNs), that cooperatively form a network without specific user administration or configuration. In other words, ad hoc networking allows an arbitrary collection of MNs to create a network on demand. A node in the ad hoc network, whether it be a laptop, autonomous agent, or sensor, is in charge of routing information between its neighbors, thus maintaining connectivity of the network. In this paper, we perform a simulation and performance study on some routing protocols for ad hoc networks. Distributed Bellman-Ford (DBF), a traditional table-driven routing algorithm, is simulated to evaluate its performance in multihop wireless networks. In addition, two on-demand routing protocols, Dynamic Source Routing (DSR) and Associativity-Based Routing (ABR), with distinctive route selection algorithms are simulated in a common environment to quantitatively measure and contrast their performance.
IBM POWER6 SRAM arrays
Authors: D. W. Plass, Y. H. Chan
Venue: IBM Journal of Research and Development (2007)

The IBM POWER6™ microprocessor presented new challenges to array design because of its high-frequency requirement and its use of 65-nm silicon-on-insulator (SOI) technology. Advancements in performance (2X to 3X improvement over the 90-nm generation) and design margins (cell stability, writability, and redundancy coverage) were major focus areas. Key elements of the POWER6 processor chip arrays include paradigm shifts such as thin memory cell layout, large signal read (without a sense amplifier), segmented bitline structure, unclamped column-half-select scheme, multidimensional programmable timing control, and separate elevated static random access memory (SRAM) power supply. There are two main array categories on the POWER6 microprocessor chip: core and nest. Processor core arrays use a single-port, 0.75-µm2, six-transistor (6T) cell and operate at full frequency, whereas the surrounding nest arrays use a smaller 0.65-µm2 cell that operates at half or one-quarter of the core frequency in order to achieve better density and power efficiency. The core arrays include the 96-KB instruction cache (I-cache) and the 64-KB data cache (D-cache), with associate lookup-path SRAM macros. The I-cache is a four-way set-associative, single-port design, whereas the D-cache is an eight-way design with dual read ports to handle multithreading capability. The lookup-path arrays contain content-addressable memory (CAM) and RAM macros with integrated dynamic hit logic circuitry. In the nest portion, an 8-MB level 2 (L2) D-cache and a level 3 (L3) directory (1.2 MB) make up the largest arrays. The latter macro designs use longer bitlines and orthogonal word-decode layouts to achieve high array-area efficiency.
Automated cross-modal mapping in robotic eye/hand systems using plastic radial basis function networks
Authors: Qinggang Meng, M. H. Lee
Venue: Connection Science (2007)

Advanced autonomous artificial systems will need incremental learning and adaptive abilities similar to those seen in humans. Knowledge from biology, psychology and neuroscience is now inspiring new approaches for systems that have sensory-motor capabilities and operate in complex environments. Eye/hand coordination is an important cross-modal cognitive function, and is also typical of many of the other coordinations that must be involved in the control and operation of embodied intelligent systems. This paper examines a biologically inspired approach for incrementally constructing compact mapping networks for eye/hand coordination. We present a simplified node-decoupled extended Kalman filter for radial basis function networks, and compare this with other learning algorithms. An experimental system consisting of a robot arm and a pan-and-tilt head with a colour camera is used to produce results and test the algorithms in this paper. We also present three approaches for adapting to structural changes during eye/hand coordination tasks, and the robustness of the algorithms under noise are investigated. The learning and adaptation approaches in this paper have similarities with current ideas about neural growth in the brains of humans and animals during tool-use, and infants during early cognitive development.
A framework to determine bounds of maximum loss rate parameter of RED queue for next generation routers
Authors: Bing Zheng, Mohammed Atiquzzaman
Venue: Journal of Network and Computer Applications (2008)

Random early detection (RED) is expected to eliminate global synchronization by random active packet drop. Its packet drop probability is decided by the maximum packet drop probability in its drop function, buffer thresholds, and average queue length. It has been observed that for a large number of connections, a small value of the maximum packet drop probability may not eliminate global synchronization. Furthermore, since RED uses four parameters to regulate its performance, it is necessary to relate its maximum drop probability with those parameters. The objective of this paper is to develop a framework for the bounds of the maximum drop probability of RED, based on TCP channel model and traffic characteristics. The value of the maximum drop probability obtained by our model will make RED queue achieve its targeted goals.
Using multi-dimensional in-depth long-term case studies for information visualization evaluation
Authors: Eliane R. A. Valiati, Carla M. D. S. Freitas, Marcelo S. Pimenta
Venue: Proceedings of the 2008 conference on BEyond time and errors: novel evaLuation methods for Information Visualization (2008)

Information visualization is meant to support the analysis and comprehension of (often large) datasets through techniques intended to show/enhance features, patterns, clusters and trends, not always visible even when using a graphical representation. During the development of information visualization techniques the designer has to take into account the users' tasks to choose the graphical metaphor as well as the interactive methods to be provided. Testing and evaluating the usability of information visualization techniques are still a research question, and methodologies based on real or experimental users often yield significant results. To be comprehensive, however, experiments with users must rely on a set of tasks that covers the situations a real user will face when using the visualization tool. The present work reports and discusses the results of three case studies conducted as Multi-dimensional In-depth Long-term Case studies. The case studies were carried out to investigate MILCs-based usability evaluation methods for visualization tools.
Privacy-Preserving Data Mining: Models and Algorithms, 1 edition
Authors: Charu C. Aggarwal, Philip S. Yu
Venue:  (2008)

Advances in hardware technology have increased the capability to store and record personal data about consumers and individuals, causing concerns that personal data may be used for a variety of intrusive or malicious purposes. Privacy-Preserving Data Mining: Models and Algorithms proposes a number of techniques to perform the data mining tasks in a privacy-preserving way. These techniques generally fall into the following categories: data modification techniques, cryptographic methods and protocols for data sharing, statistical techniques for disclosure and inference control, query auditing methods, randomization and perturbation-based techniques. This edited volume contains surveys by distinguished researchers in the privacy field. Each survey includes the key research content as well as future research directions. Privacy-Preserving Data Mining: Models and Algorithms is designed for researchers, professors, and advanced-level students in computer science, and is also suitable for industry practitioners.
UWB interference mitigation technique on UMTS terminal in non-cooperative scenario
Authors: Annalisa Durantini, Romeo Giuliano, Franco Mazzenga, Jorge Hernandez
Venue: Proceedings of the 2nd international conference on Mobile multimedia communications (2006)

The Ultra-wideband (UWB) spread spectrum technology provides a unique platform for (integrated) communication services spanning a wide range of bit rates (from few kbit/s up to hundreds Mbit/s). The acceptance of the UWB technology worldwide is mainly related to coexistence issues with other existing narrowband and wideband systems sharing the spectrum with UWB. In this paper, we present a proposal for a "detect and avoid" (DAA) procedure that UWB devices would use to mitigate interference to indoor broadband wireless communications services and ensure that the appropriate protection criteria are met. We analyze the performance of an UWB system when the proposed procedure is applied. We assess the UWB system throughput and the time actually available to UWB for transmitting. We analyze the dependence of the UWB system performance on the DAA procedure parameters and on the characteristics of the victim system.
Broadband characterization of antennas
Authors: Zbynek Raida, Petr Šmíd, Jaroslav Láčík, Zbynek Lukeš, Milan Motl
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

In this paper, we search for a suitable way of characterizing antennas in a wide band of frequencies. First, a canonical antenna is characterized by conventional parameters in frequency domain (directivity pattern, gain, input impedance) on each separate harmonics, and their mean-value counterparts are formulated and discussed. Second, the analysis is performed in the time domain, and following the frequency domain characterization, time-domain parameters are formulated. The correspondence between frequency-domain parameters and time-domain ones is shown using Parseval's theorem. Conclusions are illustrated by numerical examples. A novel formulation of time-domain antenna parameters and using Parseval's theorem to show the correspondence between mean-value time-domain parameters and mean-value frequency-domain ones are the original contributions of this paper.
Clock-directed modular code generation for synchronous data-flow languages
Authors: Dariusz Biernacki, Jean-Louis Colaço, Gregoire Hamon, Marc Pouzet
Venue: Proceedings of the 2008 ACM SIGPLAN-SIGBED conference on Languages, compilers, and tools for embedded systems (2008)

The compilation of synchronous block diagrams into sequential imperative code has been addressed in the early eighties and can now be considered as folklore. However, separate, or modular, code generation, though largely used in existing compilers and particularly in industrial ones, has never been precisely described or entirely formalized. Such a formalization is now fundamental in the long-term goal to develop a mathematically certified compiler for a synchronous language as well as in simplifying existing implementations. This article presents in full detail the modular compilation of synchronous block diagrams into sequential code. We consider a first-order functional language reminiscent of LUSTRE, which it extends with a general n-ary merge operator, a reset construct, and a richer notion of clocks. The clocks are used to express activation of computations in the program and are specifically taken into account during the compilation process to produce efficient imperative code. We introduce a generic machine-based intermediate language to represent transition functions, and we present a concise clock-directed translation from the source to this intermediate language. We address the target code generation phase by describing a translation from the intermediate language to JAVA and C.
Fuzzy orders and fuzzifying topologies
Authors: Jinming Fang, Yue Qiu
Venue: International Journal of Approximate Reasoning (2008)

The paper presents the essential connections between fuzzy preorders and fuzzifying topologies. In detail, we establish systematic procedure indicating how fuzzifying topologies are induced from fuzzy preordered relations on a set X, and conversely, we will answer the problem that the specialization order can be induced by a fuzzifying topology on a set X. Moveover, a powerful method generating fuzzy preordered relations is obtained.
System with driving simulation device for HMI measurements
Authors: Petr Bouchner, Stanislav Novotny
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

Investigation of Human Machine Interface (HMI) is on the top level of the interest when studying the reliability of the human operators. We do this investigation using a complex measuring system involving a realistic Car Driving Simulators. The first part of this paper gives an overview of requirement on design of such an experimental laboratory equipped with driving simulator. Our research is mainly focused on the reliability of the interaction processes between the driver and vehicles so main part of the article deals with examples of usage and development of the methodology which we apply on experimentations on vehicle simulators.
The impact of product development on the lifecycle of defects
Authors: Rudolf Ramler
Venue: Proceedings of the 2008 workshop on Defects in large software systems (2008)

This paper investigates the defects of a large embedded software development project over a period of about two years. It describes how software development and product development are organized in parallel branches. By mapping the defects reported on product development branches to the releases on the main line of software development, the paper shows the impact of the product development strategy on the defect lifecycle in software development.
Going Critical: Perspective and Proportion in the Epistemology of Rob Kling
Authors: John Leslie King, Suzanne Iacono, Jonathan Grudin
Venue: The Information Society (2007)

One foundational element of Rob Kling's research and writing is his critical perspective on the nature, role, and dynamics of computerization. His main argument was that one should view as dubious any statements that are not grounded in empirical evidence or theoretical analysis. Rob's work was replete with critical refutation, in which he challenged assumptions or statements about computerization and provided alternative interpretations. Much of his work delivered indictments against hyperbolic statements that claimed either utopian or dystopian outcomes from computerization. However, some of his own writings on emerging technologies tended to be dismissive and marginalizing, revealing in his own work some of the weaknesses he pointed out in others' rhetoric and writing. This article identifies intellectual traps inherent in critical perspectives that can catch even the most acute practitioners. The objective is to help elucidate and stabilize the epistemological foundations for Rob's critical perspective on the role of computerization.