ppxscal/embedding_network huggingface dataset:
Sound to image transforms: exemplar uses of the chromatic index of music
Authors: Politis Dionysios, Margounakis Dimitrios
Venue: Proceedings of the 9th WSEAS International Conference on Acoustics & Music: Theory & Applications (2008)

Music visualisation is a recent trend in computer music research with many potentialities. Most sound to image transform techniques take into account several attributes of sound. The present paper presents the capabilities of chromatic analysis of music files. An in-depth analysis of the underlying theory of chromaticism is presented through observation, while the microtonal effect on the audience perception is established using mathematical proofs. The Music Information Retrieval tasks and the exemplar uses of the Chromatic Index of music are demonstrated through experimental results.
Rib Suppression for Enhancing Frontal Chest Radiographs Using Independent Component Analysis
Authors: Bilal Ahmed, Tahir Rasheed, Mohammed A. Khan, Seong Jin Cho, Sungyoung Lee, Tae-Seong Kim
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II (2007)

Chest radiographs play an important role in the diagnosis of lung cancer. Detection of pulmonary nodules in chest radiographs forms the basis of early detection. Due to its sparse bone structure and overlapping of the nodule with ribs and clavicles the nodule is hard to detect in conventional chest radiographs. We present a technique based on Independent Component Analysis (ICA) for the suppression of posterior ribs and clavicles which will enhance the visibility of the nodule and aid the radiologist in the diagnosis process.
Step-by-step method in adiabatic Floquet theory for laser pulses
Authors: Alexander V. Shtoff, Michel Rérat
Venue: Journal of Computational Methods in Sciences and Engineering (2008)

A new step-by-step technique of solving the time-dependent Schr&ouml;dinger equation for quantum systems driven by chirped laser pulses is developed. Our approach is based on application of the adiabatic theorem of quantum mechanics to instantaneous Floquet states in an extended Hilbert space and on approximation of the slowly varying pulse parameters by step functions. This approximation and representation of the evolution operator in the form of T-ordered product of operators acting at short time intervals make it possible to reveal a correlation between the proposed method and the iterative solution of the Schr&ouml;dinger equation. By example of a two-level system, the rate of the step-by-step procedure convergence with respect to decreasing of a short time step is analyzed. Applicability of proposed computational procedure is demonstrated by example of Landau-Zener transition probabilities calculation using the Dykhne-Davis-Pechukas formula and by means of the step-by-step method. The developed strategy is applied to describe the response of N-level system under the action of pulse radiation. It is used to calculate final non-adiabatic electronic transitions probabilities, energy levels populations and the field-corrected polarizability of LiH molecule. The contribution of electronic states to the dynamic field-corrected polarizability is analyzed.
Towards low-complexity Internet traffic engineering: The Adaptive Multi-Path algorithm
Authors: Ivan Gojmerac, Peter Reichl, Lasse Jansen
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

In this paper, we describe a novel algorithm for dynamic traffic engineering in the Internet called Adaptive Multi-Path routing (AMP). The main objective of AMP is to distribute load within a network domain in a continuous manner by offloading congested links in real-time. The algorithm's recursive signaling structure represents one of our central contributions, as it restricts information exchange to neighboring nodes while still maintaining global propagation of congestion information. This paper starts with a comprehensive survey of related literature, before we introduce AMP in depth and present our exhaustive performance evaluation which is carried out using full implementations of the algorithm both in packet-level and flow-level simulation environments. The investigated state-of-the-art topologies and traffic models provide a detailed insight into the behavior of AMP in realistic operators' networks of substantial size and complexity, whereas our results demonstrate both the traffic engineering efficiency and the stability of AMP. Finally, we present important areas of application for AMP in emerging networking architectures and conclude the paper with an outlook on future research.
LSI Testing Techniques
Authors: M. Abadir, H. Reghbati
Venue: IEEE Micro (1983)

Tests good for SSI and MSI circuits can't cope with the complexity of LSI. New techniques for test generation and response evaluation are required.
Testing Formal Specifications to Detect Design Errors
Authors: R. A. Kemmerer
Venue: IEEE Transactions on Software Engineering (1985)

Formal specification and verification techniques are now apused to increase the reliability of software systems. However, these proaches sometimes result in specifying systems that cannot be realized or that are not usable. This paper demonstrates why it is necessary to test specifications early in the software life cycle to guarantee a system that meets its critical requirements and that also provides the desired functionality. Definitions to provide the framework for classifying the validity of a functional requirement with respect to a formal specification tion are also introduced. Finally, the design of two tools for testing formal specifications is discussed.
Fast Insolation Computation in Large Territories
Authors: Siham Tabik, Jesús M. Vías, Emilio L. Zapata, Luis F. Romero
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

This paper presents a new model for the computation of the insolation in large territories. The main novelty of this work consists in that it reduces significatively the number of necessary arithmetic operations, and simplifies the calculations introducing errors that are inferior to the ones imposed by the climate in a territory. In particular, a faster algorithm to compute the horizon at all points of a terrain is provided. This algorithm is also useful for shading and visibility applications. Moreover, parallel computing is introduced into this model using grid computing technology to extend its application to very large territories.
Multi-Valued MSO Logics OverWords and Trees
Authors: Manfred Droste, Werner Kuich, George Rahonis
Venue: Fundamenta Informaticae (2008)

We introduce multi-valued B&uuml;chi and Muller automata over distributive lattices and a multi-valued MSO logic for infinite words. For this logic, we prove the expressive equivalence of &omega;-recognizable and MSO-definable infinitary formal power series over distributive lattices with negation function. Then we consider multi-valued Muller tree automata and a multi-valued MSO logic for trees over distributive lattices. For this logic, we establish a version of Rabin's theorem for infinitary tree series.
Anomaly Characterization in Flow-Based Traffic Time Series
Authors: Anna Sperotto, Ramin Sadre, Aiko Pras
Venue: Proceedings of the 8th IEEE international workshop on IP Operations and Management (2008)

The increasing number of network attacks causes growing problems for network operators and users. Not only do these attacks pose direct security threats to our infrastructure, but they may also lead to service degradation, due to the massive traffic volume variations that are possible during such attacks. The recent spread of Gbps network technology made the problem of detecting these attacks harder, since existing packet-based monitoring and intrusion detection systems do not scale well to Gigabit speeds. Therefore the attention of the scientific community is shifting towards the possible use of aggregated traffic metrics. The goal of this paper is to investigate how malicious traffic can be characterized on the basis of such aggregated metrics, in particular by using flow, packet and byte frequency variations over time. The contribution of this paper is that it shows, based on a number of real case studies on high-speed networks, that all three metrics may be necessary for proper time series anomaly characterization.
Effect of Feedback Strength in Coupled Spiking Neural Networks
Authors: Javier Iglesias, Jordi García-Ojalvo, Alessandro E. Villa
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part II (2008)

We simulated the coupling of two large spiking neural networks (104 units each) composed by 80% of excitatory units and 20% of inhibitory units, randomly connected by projections featuring spike-timing dependent plasticity, locality preference and synaptic pruning. Only the first network received a complex spatiotemporal stimulus and projected on the second network, in a setup akin to coupled semiconductor lasers. In a series of simulations, the strength of the feedback from the second network to the first was modified to evaluate the effect of the bidirectional coupling on the firing dynamics of the two networks. We observed that, unexpectedly, the number of neurons which activity is altered by the introduction of feedback increases in the second network more than in the first network, suggesting a qualitative change in the dynamics of the first network when feedback is increased.
Cluster Analysis for Users' Modeling in Intelligent E-Learning Systems
Authors: Danuta Zakrzewska
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

In the paper, the data driven approach for users' modeling in intelligent e-learning system is considered. Individual models are based on preferred learning styles dimensions, according to which students focus on different types of information and show different performances in educational process. Building individual models of learners allows for adjusting teaching paths and materials into their needs. In the presented approach, students are divided into groups by unsupervised classification. Application of two-phase hierarchical clustering algorithm which enables tutors to determine such parameters as maximal number of groups, clustering threshold and weights for different learning style dimensions is described. Experimental results connected with modeling real groups of students are discussed.
Extensional Uniformity for Boolean Circuits
Authors: Pierre Mckenzie, Michael Thomas, Heribert Vollmer
Venue: Proceedings of the 22nd international workshop on Computer Science Logic (2008)

Imposing an extensional uniformity condition on a non-uniform circuit complexity class $\mathcal{C}$ means simply intersecting $\mathcal{C}$ with a uniform class $\mathcal{L}$. By contrast, the usual intensional uniformity conditions require that a resource-bounded machine be able to exhibit the circuits in the circuit family defining $\mathcal{C}$. We say that $(\mathcal{C},\mathcal{L})$ has the Uniformity Duality Property if the extensionally uniform class $\mathcal{C}\cap\mathcal{L}$ can be captured intensionally by means of adding so-called $\mathcal{L}$ -numerical predicates to the first-order descriptive complexity apparatus describing the connection language of the circuit family defining $\mathcal{C}$.This paper exhibits positive instances and negative instances of the Uniformity Duality Property.
Cryptanalysis of Rabbit
Authors: Yi Lu, Huaxiong Wang, San Ling
Venue: Proceedings of the 11th international conference on Information Security (2008)

The stream cipher Rabbit is one candidate to the ECRYPT Stream Cipher Project (eSTREAM) on the third evaluation phase. It has a 128-bit key, 64-bit IV and 513-bit internal state. Currently, only one paper [1] studied it besides a series of white papers by the authors of Rabbit. In [1], the bias of the keystream sub-blocks was studied and a distinguishing attack with the estimated complexity 2247 was proposed based on the largest bias computed.In this paper, we first computed the exact bias of the keystream sub-blocks by Fast Fourier Transform (FFT). Our result leads to the best distinguishing attack with the complexity 2158 so far, in comparison to 2247 in [1]. Meanwhile, our result also indicates that the approximation assumption used in [1] is critical for estimation of the bias and cannot be ignored. Secondly, our distinguishing attack is extended to a multi-frame key-recovery attack, assuming that the relation between part of the internal states of all frames is known. Our attack uses 251.5 frames and the first three keystream blocks of each frame. It takes memory O(232), precomputation O(232) and time O(297.5) to recover the keys for all frames. This is the first known key-recovery attack on Rabbit, though the attack assumption is unusually strong. Lastly, as an independent result, we introduced the property of Almost-Right-Distributivity of the bit-wise rotation over the modular addition for our algebraic analysis.This allows to solve the nonlinear yet symmetric equation system more efficiently for our problem.
Modified MUF and EDF algorithms for overloaded soft real time systems
Authors: Sandeep Agrawal, Pankaj Bhatt, K. K. Shkula
Venue: Proceedings of the 7th WSEAS International Conference on Applied Computer and Applied Computational Science (2008)

This paper proposes static and dynamic mechanisms by which MUF scheduling algorithm can be made more effective in overloaded soft real time systems (such as multimedia) using the concept of Random Dropping (RD) and negative laxity check. With introduction of RD, both algorithms result in higher values of DMTR as compared to without RD. Using negative laxity check and appropriate random dropping, EDF gives better results as compared to MUF across all tasks - important and less important.
Eliciting Adaptation Knowledge from On-Line Tutors to Increase Motivation
Authors: Teresa Hurley, Stephan Weibelzahl
Venue: Proceedings of the 11th international conference on User Modeling (2007)

In the classroom, teachers know how to motivate their students and how to exploit this knowledge to adapt or optimize their instruction when a student shows signs of demotivation. In on-line learning environments it is much more difficult to assess a learner's motivation and to have adaptive intervention strategies and rules of application to help prevent attrition or drop-out. In this paper, we present results from a survey of on-line tutors on how they motivate their learners. These results will inform the development of an adaptation engine by extracting and validating selection rules for strategies to increase motivation depending on the learner's self-efficacy, goal orientation, locus of control and perceived task difficulty in adaptive Intelligent Tutoring Systems.
Switching code data compression technique using an Adaptive Huffman coding
Authors: Rajesh Daheriya, Mitesh Bargadiya, Sushil Kumar
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

A number of data compression techniques have been introduced to reduce the text/data storage and transmission costs. The Proposed compression method in this paper is based on Switching code data compression technique using adaptive Huffman coding. The encoding process of the system encodes frequently occurring characters with shorter bit code and infrequently occurring appearing characters with longer bit codes, same code can be use for three symbols for alphabet, number and special character. The decoding process expands the encoded data back to the original data and works very much like the encoder process. Proposed method is more effective than Adaptive Huffman coding because it reduce the codeword length of the characters and can be use same codeword for three different groups character. Their size of the symbol-codeword table is also reduces which transmitted with the compressed data. This process enhancing compression efficiency up to 12% more then Adaptive Huffman Coding which provide compression ratio up to 52.51%(+12%). The developed system is very effective for compressing text file, which hold numbers and special symbols approximately equi-probable to alphabets like Math's Books/database files in a real time environment.
High Accuracy Navigation in Unknown Environment Using Adaptive Control
Authors: Fernando Ribeiro, Ivo Moutinho, Nino Pereira, Fernando Oliveira, José Fernandes, Nuno Peixoto, Antero Salgado
Venue: RoboCup 2007: Robot Soccer World Cup XI (2008)

Aiming to reduce cycle time and improving the accuracy on tracking, a modified adaptive control was developed, which adapts autonomously to changing dynamic parameters. The platform used is based on a robot with a vision based sensory system. Goal and obstacles angles are calculated relatively to robot orientation from image processing software. Autonomous robots are programmed to navigate in unknown and unstructured environments where there are multiple obstacles which can readily change their position. This approach underlies in dynamic attractor and repulsive forces. This theory uses differential equations that produce vector fields to control speed and direction of the robot. This new strategy was compared with existing PID method experimentally and it proved to be more effective in terms of behaviour and time-response. Calibration parameters used in PID control are in this case unnecessary. The experiments were carried out in robot Middle Size League football players built for RoboCup. Target pursuit, namely, ball, goal or any absolute position, was tested. Results showed high tracking accuracy and rapid response to moving targets. This dynamic control system enables a good balance between fast movements and smooth behaviour.
Robust real-time vision modules for a personal service robot in a home visual sensor network
Authors: Gerard Medioni
Venue:  (2007)

The Intelligent Home, which integrates information, communication and sensing technologies with/for everyday objects, is emerging as a viable environment in industrialized countries. It offers the promise to provide security for the population at large, and possibly assist members of an aging population. In the intelligent home context, personal service robots are expected to play an important role as interactive assistants, due to their mobility and action ability which complement other sensing nodes in the home network. As an interactive assistant, a personal service robot must be endowed with visual perception abilities, such as detection and identification of people in its vicinity, recognition of people's actions or intentions. We propose to frame the problems in terms of distributed sensor network architecture with fixed visual sensing nodes (wall-mounted cameras) and mobile sensing/actuating nodes such as one (or more) personal service robot. Each fixed node processes its video input stream to detect and track people, and to perform some level of behavior analysis, given the limited resolution. It may also communicate with the robot, directing it to move to a specific area. The robot, in addition to navigation, must process visual input from the on-board camera(s) to also perform person detection and tracking, but at a finer level, since it is closer to the person. In particular, it should locate a person's face, possibly identify the person, in order to interact with humans in a social setting. Each sensor node is connected to the intelligent home network, and performs its task independently, according to the range of interaction and the object of perception. Each fixed camera node on the wall detects and tracks people in its field of view, and analyzes their behavior. It may then trigger other sensor nodes, or communicate with the robot for further sensing and closer analysis, by integrating multiple sensing nodes in various levels, according to the range of interaction, mobility, or required resolution. We also extend this strategy to the fusion of different kinds of sensing, such as sound and vision, as human robot interaction is multi-modal. This fusion strategy can provide robustness and efficiency, compared to the traditional image level analysis from a single camera, through a certain level of redundancy, as well as the cooperation among the sensor nodes. We have obtained encouraging results with this framework on a real robot in a realistic environment, such as multiple, different types of sensor nodes in several different places, changing illumination, and uninterrupted processing for long period of time.
The ROI of Software Dependability: The iDAVE Model
Authors: Barry Boehm, LiGuo Huang, Apurva Jain, Ray Madachy
Venue: IEEE Software (2004)

The Information Dependability Attribute Value Estimation model helps users reason about the return on investment of software dependability investments. iDAVE estimates the relative ROI for achieving the desired values for dependability attributes and helps select the most effective software dependability strategies. The authors describe its overall structure and illustrate its use in determining the ROI of dependability investments for a commercial order-processing system and a NASA planetary rover project.
Managing the Evolution of Service Specifications
Authors: Vasilios Andrikopoulos, Salima Benbernou, Mike P. Papazoglou
Venue: Proceedings of the 20th international conference on Advanced Information Systems Engineering (2008)

The ability to cope with multiple competing stakeholders, fluid requirements, emergent behavior, and susceptibility to external pressures that can cause changes across an entire organization, coupled with the ability to support service diversification, is a key to an enterprise's competitiveness. Web services equip enterprises with the potential to react to change by addressing two interrelated sets of requirements: the ability to accommodate service changes that demand rapid response and to support service variation according to customers' needs and requirements. In this paper we introduce the concept of service evolution management, which provides an understanding of change impact, service changes control, tracking and auditing of service versions, and status accounting. To achieve this, we develop a formal model and theory for service evolution that allows multiple active service versions to be created consistently and co-exist, while executing schema changes effectively.
A precise model for contextual roles: The programming language ObjectTeams/Java
Authors: Stephan Herrmann
Venue: Applied Ontology (2007)

A number of proposals exist concerning how to support the concept of roles at the level of programming languages. While some of these proposals indeed exhibit very promising properties, the concept of roles has not found its way into mainstream programming languages. We argue that this is due to the richness of the concept of roles and the fact that each existing proposal focuses on some aspects of roles while neglecting others. We present the programming language ObjectTeams/Java and using the categories of Steimann (2000) we demonstrate that this language covers more aspects of roles than previous approaches. We suggest that a thoroughly defined programming language featuring roles may contribute to a better understanding also in other fields using roles.