ppxscal/embedding_network huggingface dataset:
An MCU description methodology for initialization code generation software
Authors: Yunfei Bai, Eng Siong Chng, Gorthi Prashant Bhanu
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 02 (2007)

Due to the widespread use of microcontroller unit (MCU) in application and education areas, there is a need for initialization code generation for MCUs to reduce developers&#x2019; effort and to aid beginners&#x2019; learning of MCU programming. A common realization for initialization code generation software is a graphical user interface (GUI) with all the available initialization settings for user selection, and the initialization code can be generated based on the user&#x2019;s configuration. This has been achieved by several software using different implementations. This paper evaluates two current initialization code generation software to identify the existing problems and requirements. It then presents a methodology to describe MCU structure to support the software&#x2019;s initialization code generation functionality to achieve flexibility and effectiveness. Our approach observes low development cost, enables user contribution to define and update MCU structure, and provides suitable guide for user to avoid faulty initialization settings.
Artificial Cell Communication in Distributed Systems
Authors: Michael Hilker, Katja Luther
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

Distributed systems like multi-agent systems, complex adaptive systems, or artificial immune systems use lots of small entities in order to reach the goals of the system, e.g. optimisation problems or network security. In all of these systems, lightweight entities exist and perform tasks autonomously in order to solve the problems. In addition, one of the main problems is the communication between these entities, which is mostly implemented using central servers. In this article, we introduce a novel approach for communication that uses the cell communication of the human body as archetype. The communication is reliable, efficient, and does not use central entities. We show that the artificial cell communication has several advantages compared to common used communication protocols.
Characterizing and Detecting Virus Replication
Authors: Jose Andre Morales, Peter J. Clarke, Yi Deng
Venue: Proceedings of the Third International Conference on Systems (2008)

Newly released computer viruses are spreading faster than ever before and current signature based detection do not protect against these unknown viruses. This paper presents a characterization of virus replication. Two detection models are developed, one using operation sequence matching and the other using frequency measures. The research shows virus replication can be characterized and used to detect known and unknown viruses with minimal false negatives. In our testing using operation sequence matching, over 250 viruses were detected with 43 subsequences. Detection of 130 viruses, 45% of all tested viruses, occured with the replication sequence of just one virus. Our testing using frequency measures detected all test viruses with no false negatives.
A study of collaborative online network and culture exchange project in Taiwan
Authors: Rong-Jyue Fang, Hung Jen Yang, Hua Lin Tsai, Chi Jen Lee
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

Dealing with digital learning and information explosion, English plays as a major role in world communication. All trade areas as well as diversified fields emphasize on English proficiency. Students enhance their global vision via English comprehension. Therefore, through digital multimedia students' interacting with other nations on the web is a very important skill in this digital era. The study of this project intends to understand course material while interacting through online web learning. It stimulates students' cultural experience and expands learning fields. The project provides problem solving model and encourages students to try to solve problems by themselves. The project recruits high schools and primary schools to make international contact. Four hundreds teams of parents, teachers, and students involved in a web platform to discuss international issues. The topics can be related to natural resources, human and society, human and self-renunciation, and there are many more multi-cultural learning. Project also intends to do cross-cultural learning exchange, experience sharing, and will submit findings for related educational administrators and web learners for further reference.
Solving differential equations in terms of bessel functions
Authors: Ruben Debeerst, Mark van Hoeij, Wolfram Koepf
Venue: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (2008)

For differential operators of order 2, this paper presents a new method that combines generalized exponents to find those solutions that can be represented in terms of Bessel functions.
Multiobjective optimization of sleep vector for zigzag power-gated circuits in standard cell elements
Authors: Seungwhun Paik, Youngsoo Shin
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Zigzag power gating (ZPG) has been proposed to alleviate the drawback of power gating in its long wake-up delay, thereby broadening the application of power gating to suppressing active- as well as standby-leakage. However, complicated power network due to the use of nMOS and pMOS switches in zigzag fashion has limited its application to custom circuits. Heterogeneous use of power rails inevitably incurs overhead of area and wirelength during physical design. Furthermore, the use of sleep vector causes additional switching power when entering standby mode and returning back to active mode. The switching power should be minimized not to outweigh the leakage saving by employing ZPG scheme. In this paper, we propose a complete power network architecture, which allows us to use unmodified standard cell elements for implementing ZPG circuits. We formulate selecting sleep vector as a multi-objective optimization problem, minimizing transition energy and total wirelength. We solve the problem by employing multiobjective genetic-based algorithm. Experimental results show the saving of 39% in transition energy and 8% in wirelength, on average, for several benchmark circuits in 65-nm technology. The complete design flow starting from RTL description down to layout is proposed, and assessed with 65-nm technology.
Rocket launching simulation in vertical-type PM LSM rocket launcher system including rotational motion control
Authors: K. Yoshida, Y. Cao
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

To reduce the cost of launching rocket, various researches are performed. A new vertical-type linear synchronous motor rocket launcher system is proposed by the first author Yoshida. The linear launcher is accelerated to a peak speed with loading the rocket, and after releasing the rocket, it is decelerated with no-load to be brought to rest at the upper end of underground guide tube near the earth surface. After the rocket is released from the launcher and takes off with a high initial-speed, the rocket continues to ascend with no control subject to the Coriolis force in the guide-direction under the force of gravity in the rise-direction. This paper presents the rocket launching numerical simulation in vertical-type PM LSM rocket launcher system including rotational motion control. We have verified the stability of rolling, pitching and yawing motion control by the simulation results in a small experimental model on the ground.
Diregular c-partite tournaments are vertex-pancyclic when c &ge; 5
Authors: Anders Yeo
Venue: Journal of Graph Theory (1999)

In [Volkmann, to appear] it is conjectured that all diregular c-partite tournaments, with c &ge; 4, are pancyclic. In this article, we show that all diregular c-partite tournaments, with c &ge; 5, are in fact vertex-pancyclic. &copy; 1999 John Wiley & Sons, Inc. J Graph Theory 32: 137&ndash;152, 1999
A Study of the Relationship between Two Musical Rhythm Characteristics and Heart Rate Variability (HRV)
Authors: Shih-Hsiang Lin, Yu-Chieh Huang, Ching-Yen Chien, Yi-Cheng Chen, Lei-Chun Chou, Sheng-Chieh Huang, Ming-Yie Jan
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

Heart rate variability (HRV) is a measure of variations in the heart rate. Over the last 25 years, HRV analysis has became more and more popular as a non-invasive research and clinical tool for indirectly investigating both cardiac and autonomic nervous system (ANS) function in both health and disease area. How the musical rhythmic characteristics, tempo and complexity, affect the performance of HRV is studied in this work. By understanding the relationship between music and the function of ANS, we can improve our life and health by music – non-invasively and simply.
Approximation theorems for localized sza´sz--Mirakjan operators
Authors: Linsen Xie, Tingfan Xie
Venue: Journal of Approximation Theory (2008)

In the present paper, we investigate the convergence and the approximation order of the localized Sza'sz-Mirakjan operators, and obtain some new results to improve the results due to Omey [Note on operators of Sza'sz-Mirakjan type, J. Approx. Theory 47 (1986) 246-254].
A new model-free adaptive sliding controller for active suspension system
Authors: Hung-Yi Chen, Shiuh-Jer Huang
Venue: International Journal of Systems Science (2008)

Active suspension systems are designed to provide better ride comfort and handling capability in the automotive industry. Since the active suspension system has nonlinear and time-varying characteristics, it is difficult to establish an accurate dynamic model for designing a model-based controller. Here, a functional approximation (FA) based adaptive sliding controller with fuzzy compensation is proposed for an active suspension system. The FA technique is employed to represent the unknown functions, which releases the model-based requirement of the sliding mode control. In addition, a fuzzy control scheme with online learning ability is employed to compensate for the modeling error of the FA with finite number of terms for reducing the implementation difficulty. To guarantee the control system stability, the update laws of the coefficients in the approximation function and the fuzzy tuning parameters are derived from the Lyapunov theorem. The proposed controller is employed on a quarter-car active suspension system. The simulation results and experimental results show that the proposed controller can suppress the oscillation amplitude of the sprung mass effectively. To evaluate the performance improvement of inducing a fuzzy compensator in this FA adaptive controller, the dynamic responses of the proposed hybrid controller are compared with those of FA-based adaptive sliding controller only.
A Multiple Layered Audiovisual Streaming System Using the Two-Phase Synchronization and FGS/BSAC Techniques
Authors: Chung-Ming Huang, Chung-Wei Lin, Cheng-Yen Chuang
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

For a ubiquitous multimedia streaming, an adaptive multimedia streaming scheme with multiple layered audiovisual (AV) coding is required over heterogeneous networks. This paper proposes a multiple layered audiovisual streaming scheme denoted ML-AVSS to deliver layered audiovisual data. Fine-granular scalability (FGS) and bit sliced arithmetic coding (BSAC) techniques are used to segment video and audio data into individual base-layer and multiple enhancement-layer bitstreams. With advantages of layered coding, two phases of streaming synchronization, including a human-perceptual based transmission scheme, de-jitter procedure, conditional retransmission and playout synchronization, are proposed to transmit hybrid multiple layered audiovisual bitstreams. Experiment results show that the proposed ML-AVSS is a feasible streaming scheme to overcome challenges of the ubiquitous multimedia streaming, e.g., constrained available bandwidth, quality degradation, unsmooth playback, etc.
A framework for block-based timing sensitivity analysis
Authors: Sanjay V. Kumar, Chandramouli V. Kashyap, Sachin S. Sapatnekar
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Since process and environmental variations can no longer be ignored in high-performance microprocessor designs, it is necessary to develop techniques for computing the sensitivities of the timing slacks to parameter variations. This additional slack information enables designers to examine paths that have large sensitivities to various parameters: such paths are not robust, even though they may have large nominal slacks and may hence be ignored in traditional timing analysis. We present a framework for block-based timing analysis, where the parameters are specified as ranges -- rather than statistical distributions which are hard to know in practice. We show that our approach -- which scales well with the number of processors -- is accurate at all values of the parameters within the specified bounds, and not just at the worst-case corner. This allows the designers to quantify the robustness of the design at any design point. We validate our approach on circuit blocks extracted from a commercial 45nm microprocessor.
Efficient Certificate Path Validation and Its Application in Mobile Payment Protocols
Authors: Rafael Martinez-Peláez, Cristina Satizábal, Francisco Rico-Novella, Jordi Forné
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Certification path validation is a complex task that implies high computational cost. In this process is necessary to verify the binding between the owner ofthe certificate and his public key. In SET protocol, the customer and merchant require to verify the certification path of their certificates to trust each other. The customer and merchant carry out several cryptographic operations to complete SET protocol including the authentication process. Because mobile devices are limited in terms of processing and storage capacities, it is relevant to reduce the computational cost required by the cryptographic operations. In this paper, we apply TRUTHC (TrustRelationship Using Two Hash Chains) to reduce thecomputational cost of cryptographic operations carried out by the customer and merchant to complete the certification path validation. In addition, we compare the results using RSA and ECDSA protocols, with a typical PKI.
A Formal Model of Semantic Web Service Ontology (WSMO) Execution
Authors: Hai H. Wang, Nick Gibbins, Terry Payne, Ahmed Saleh, Jun Sun
Venue: Proceedings of the 13th IEEE International Conference on on Engineering of Complex Computer Systems (2008)

Semantic Web Services have been one of the most significant research areas within the Semantic Web vision, and have been recognized as a promising technology that exhibits huge commercial potential. Current Semantic Web Service research focuses on defining models and languages for the semantic markup of all relevant aspects of services, which are accessible through a Web service interface. The Web Service Modelling Ontology (WSMO) is one of the most significant Semantic Web Service framework proposed to date. To support the standardization and tool support of WSMO, a formal semantics of the language is highly desirable. As there are a few variants of WSMO and it is still under development, the semantics of WSMO needs to be formally defined to facilitate easy reuse and future development. In this paper, we present a formal Object-Z semantics of WSMO. Different aspects of the language have been precisely defined within one unified framework. This model provides a formal unambiguous specification, which can be used to develop tools and facilitate future development.
On the isentropic Forchheimer's sound waves propagation in a cylindrical tube filled with a porous media
Authors: H. M. Dwairi
Venue: Proceedings of the 1st WSEAS International Conference on Computational Chemistry (2007)

A theory of sound waves propagation in porous media that includes the nonlinear effects of the Forchheimer type with the nonzero radial velocity effects is laid out by using variational solutions. It is shown that the main parameters governing the propagation of sound waves are the shear wave number s = R√ρω/µ, the reduced frequency number k = wR/a, the porosity ε, the Darcy number Da = R/K and the 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 increasing of Darcy number and Forchheimer number increased wave's attenuations and phase velocities for both forward and backward sound waves, while the increasing of porosity decreased attenuation and phase velocities. The effect of increasing reduced frequency is found to increase the attenuation of the forward waves and decrease attenuation and phase velocities of the forward and backward sound waves. 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, respectively.
The memetic self-organizing map approach to the vehicle routing problem
Authors: Jean-Charles Cr&#x00e9;put, Abderrafia&#x00e2; Koukam
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2008)

The paper presents an extension of the self- organizing map (SOM) by embedding it into an evolutionary algorithm to solve the Vehicle Routing Problem (VRP). We call it the memetic SOM. The approach is based on the standard SOM algorithm used as a main operator in a population based search. This operator is combined with other derived operators specifically dedicated for greedy insertion moves, a fitness evaluation and a selection operator. The main operators have a similar structure based on the closest point findings and local moves performed in the plane. They can be interpreted as performing parallels and massive insertions, simulating the behavior of agents which interact continuously, having localized and limited abilities. This self-organizing process is intended to allow adaptation to noisy data as well as to confer robustness according to demand fluctuation. Selection is intended to guide the population based search toward useful solution compromises. We show that the approach performs better, with respect to solution quality and/or computation time, than other neural network applications to the VRP presented in the literature. As well, it substantially reduces the gap to classical Operations Research heuristics, specifically on the large VRP instances with time duration constraint.
Sensor Data Collection of the Single Location Surveillance Point System
Authors: T. Räty, J. Oikarinen, M. Nieminen, M. Lindholm
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

The Single Location Surveillance Point (SLSP) is a distributed multi-sensor surveillance software system. It contains an arbitrary amount of sensors that collect readings from a single location, which is the surveillance point. The SLSP system contains the following realized sensors: a fingerprint sensor, a video camera, an audio sensor, and a network analyzing monitor. The sensors are located in an indoor region. Each sensor automatically collects information from its environment. Each sensor automatically routes its crude sensor data to a session server, which handles the connections among the components. The session server conveys the crude sensor data to the logical decision making service. The logical decision making server (LDMS) automatically derives the situation at the surveillance point based on the received sensor data. The intention is to deduct the situation which is transpiring in the surveyed area based on the received crude data from the sensors. By deriving the situation of a surveyed area, the surveillance personnel may utilize refined information cogent to occurring events of the surveyed area. This branch of the SLSP intends to facilitate the collection of data from a surveillance point and decrement the amount of superfluous information and rendered to the surveillance personnel, by acquiring automatically sensor data and providing automatically derived information to the surveillance personnel’s end-device. The operability of the constructed prototype indicates that this endeavor is attained. The research is based on the constructive method of the related publications and technologies and the results are derived by the implemented branch of the SLSP system.
On the maximum degree of a random planar graph
Authors: Colin Mcdiarmid, Bruce Reed
Venue: Combinatorics, Probability and Computing (2008)

Let the random graph Rn be drawn uniformly at random from the set of all simple planar graphs on n labelled vertices. We see that with high probability the maximum degree of Rn is Θ(ln n). We consider also the maximum size of a face and the maximum increase in the number of components on deleting a vertex. These results extend to graphs embeddable on any fixed surface.
Query-based partitioning of documents and indexes for information lifecycle management
Authors: Soumyadeb Mitra, Marianne Winslett, Windsor W. Hsu
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

Regulations require businesses to archive many electronic documents for extended periods of time. Given the sheer volume of documents and the response time requirements, documents that are unlikely to ever be accessed should be stored on an inexpensive device (such as tape), while documents that are likely to be accessed should be placed on a more expensive, higher-performance device. Unfortunately, traditional data partitioning techniques either require substantial manual involvement, or are not suitable for read-rarely workloads. In this paper, we present a novel technique to address this problem. We estimate the future access likelihood for a document based on past workloads of keyword queries and the click-through behavior for top-K query answers, then use this information to drive partitioning decisions. Our overall best scheme, the document-split inverted index, does not require any parameter tuning and yet performs close to the optimal partitioning strategy. Experiments show that document-split partitioning improves performance on a large intranet query workload by a factor of 4 when we add a fast storage server that holds 20% of the data.
Embedding arbitrary finite simple graphs into small strongly regular graphs
Authors: Robert Jajcay, Dale Mesner
Venue: Journal of Graph Theory (2000)

It is well known that any finite simple graph &Gamma; is an induced subgraph of some exponentially larger strongly regular graph $\overline{&Gamma;}$ (e.g., [2, 8]). No general polynomial-size construction has been known. For a given finite simple graph &Gamma; on &nu; vertices, we present a construction of a strongly regular graph $\overline{&Gamma;}$ on O(&nu;4) vertices that contains &Gamma; as its induced subgraph. A discussion is included of the size of the smallest possible strongly regular graph with this property. &copy; 2000 John Wiley Sons, Inc. J Graph Theory 34: 18, 2000
Output tracking with constrained inputs via inverse optimal adaptive recurrent neural control
Authors: Luis J. Ricalde, Edgar N. Sanchez
Venue: Engineering Applications of Artificial Intelligence (2008)

This paper extends previous results to the output tracking problem of nonlinear systems with unmodelled dynamics and constrained inputs. A recurrent high order neural network is used to identify the unknown system dynamics and a learning law is obtained using the Lyapunov methodology. A stabilizing control law for the output tracking error dynamics is developed using the Lyapunov methodology and the Sontag control law for nonlinear systems with constrained inputs.