ppxscal/embedding_network huggingface dataset:
Recursive Evaluation of Fault Tolerance Mechanisms for SLA Management
Authors: Kerstin Voss
Venue: Proceedings of the Fourth International Conference on Networking and Services (2008)

Service Level Agreements (SLAs) have been introduced into the Grid in order to build a basis for its commercial uptake. The challenge for Grid providers in agreeing and operating SLA-bound jobs is to ensure their fulfillment even in the case of failures. Hence, fault-tolerance mechanisms are an essential means of the provider's SLA management. The high utilization of commercial operated clusters leads to scenarios in which typically a job migration effects other jobs scheduled. The effects result from the unavailability of enough free resources which would be needed to catch all resource outages. Consequently before initiating a migration, its effects for other jobs have to be compared and the initiation of fault tolerance(FT-) mechanisms have to be evaluated recursively. This paper presents a measurement for the benefit of initiating a FT mechanism,the recursive evaluation, and termination condition. Performing such an impact evaluation of an initiated chain of FT-mechanisms is often more profitable than performing a single FT-mechanism and accordingly this is important for the Grid commercialization.
From goals to components: a combined approach to self-management
Authors: Daniel Sykes, William Heaven, Jeff Magee, Jeff Kramer
Venue: Proceedings of the 2008 international workshop on Software engineering for adaptive and self-managing systems (2008)

Autonomous or semi-autonomous systems are deployed in environments where contact with programmers or technicians is infrequent or undesirable. To operate reliably, such systems should be able to adapt to new circumstances on their own. This paper describes our combined approach for adaptable software architecture and task synthesis from high-level goals, which is based on a three-layer model. In the uppermost layer, reactive plans are generated from goals expressed in a temporal logic. The middle layer is responsible for plan execution and assembling a configuration of domain-specific software components, which reside in the lowest layer. Moreover, the middle layer is responsible for selecting alternative components when the current configuration is no longer viable for the circumstances that have arisen. The implementation demonstrates that the approach enables us to handle non-determinism in the environment and unexpected failures in software components.
TM fields from a coated cylinder with two axial slots
Authors: Muhammad A. Mushref
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

the transverse magnetic (TM) field patterns are investigated for a circular cylinder with two axial slots coated by a dielectric substance. The solution is determined by applying the boundary conditions to the field wave functions. Numerical results are obtained by shortening the infinite series to a finite number of terms and compared to the single slot situation.
Grid Services for MPI
Authors: Camille Coti, Thomas Herault, Sylvain Peyronnet, Ala Rezmerita, Franck Cappello
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

Institutional grids consist of the aggregation of clusters belonging to different administrative domains to build a single parallel machine. To run an MPI application over an institutional grid, one has to address many challenges. One of the first problems to solve is the connectivity of the different nodes not belonging to the same administrative domain. Techniques based on communication relays, dynamic port opening, among others. have been proposed. In this work, we propose a set of Grid or Web Services to abstract this connectivity service, and we evaluate the performances of this new level of communication for establishing the connectivity of an MPI application over an experimental grid.
An integrated agent-based software architecture for mobile and manipulator systems
Authors: Patricio Nebot, Enric Cervera
Venue: Robotica (2007)

Mobile manipulation involves the most important key issue in robotics: integration. While hardware integration seems to be nearly solved due to the increasing dominance of PC-compatible systems, software integration is still a challenge, since a lot of issues arise with the variety of operating systems, device drivers, application libraries, and programming languages which need to be merged in any real-world robotic system. This paper presents a software architecture, which seamlessly integrates robot arms, mobile bases, vision systems and sensing devices, in a distributed, homogeneous agent framework. Based on the Java platform, the agent-based architecture allows great flexibility in the integration of components, and provides a simple yet extensible and powerful software layer to develop further mobile manipulating environments. Detailed software issues, as well as preliminary results are shown, which pave the way towards the development of network-ready applications involving mobile and manipulating artifacts.
Reference marker stability in computer aided orthopedic surgery: A biomechanical study in artificial bone and cadavers
Authors: M. Citak, T. N. Board, Y. Sun, V. Look, C. Krettek, T. Hüfner, D. Kendoff
Venue: Technology and Health Care (2007)

Introduction: In computer assisted orthopaedic surgery, rigid fixation of the Reference Marker (RM) system is essential for reliable computer guidance. A minimum shift of the RM can lead to substantial registration errors and inaccuracies in the navigation process. Various types of RM systems are available but there is little information regarding the relative stabilities of these systems. The aim of this study was to test the rotational stability of three commonly used RM systems. Materials and methods: One hundred and thirty Synbones and 15 cadavers were used to test the rotational stability of three different RM systems (Schanz' screw, RM B and RM C adjustment systems). Using a specially developed testing device, the peak torque sustained by each RM system was assessed in various anatomical sites. Results: Comparison of means for Synbone showed that the RM C was the most stable (mean peak torque 5.60 &plusmn; 1.21 Nm) followed by the RM B system (2.53 &plusmn; 0.53 Nm) and the RM A (0.77 &plusmn; 0.39 Nm) (p<0.01). The order of stability in relation to anatomical site was femoral shaft, distal femur, tibial shaft, proximal tibia, anterior superior iliac spine, iliac crest and talus. Results from the cadaver experiments showed similar results. Bi-cortical fixation was superior to mono-cortical fixation in the femur (p<0.01) but not the tibia (p=0.22). Conclusion: The RM system is the vital link between bone and computer and as such the stability of the RM is paramount to the accuracy of the navigation process. In choosing RM systems for computer navigated surgery surgeons should be aware of their relative stability. Anatomical site of RM placement also affect the stability. Mono-cortical fixation is generally less stable than bi-cortical.
The Security System Design in Online Game for u Entertainment
Authors: Hangbae Chang, Jong Hyuk Park, Hongsuk Kang
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

This study focused on the infringement of online video game security, which up until now has relatively been considered relatively insignificant when compared to the online game industry’s rapid growth these days. In this study, the state of infringement cases in the Korean game industry and related proposed security solutions corresponding to for such cases were examined and arranged. These cases were then also classified according to the infringement type of game security defined in advance infringement. Based on the classified infringement types of game security upon this classification, this study analyzed the causes that gave give rise to infringement of online infringement of game security, and developed technical solutions to solve such cases for such cases. Finally, this study verified whether or not these technical solutions can could be applied or not into online game sites.
Forward-time simulations of non-random mating populations using simuPOP
Authors: Bo Peng, Christopher I. Amos
Venue: Bioinformatics (2008)

Summary: Computer simulations play an important role in studies of non-random mating populations. Because of implementation difficulties, only very limited types of non-random mating schemes are provided in the currently available simulation programs. Starting with version 0.8.5, simuPOP provides a few mating schemes that can be used to simulate arbitrary non-random mating models. This article describes the concepts and methods behind these mating schemes and demonstrates their uses in a few examples, including partial self-mating, positive assortative mating, non-random outbreeding, and simulation of overlapping generations in age-structured populations. Availability: simuPOP is freely available at http://simupop.sourceforge.net, distributed under a GPL license. Cited examples are in the doc/cookbook directory of a simuPOP distribution. Contact: bpeng@mdanderson.org
A research agenda for service-oriented architecture
Authors: Kostas Kontogiannis, Grace A. Lewis, Dennis B. Smith
Venue: Proceedings of the 2nd international workshop on Systems development in SOA environments (2008)

It is clear that Service-Oriented Architecture (SOA) is having a substantial impact on the way software systems are developed. However, although significant progress is being made in several fronts, current efforts seem to evolve in many directions. There is danger that important research needs will be overlooked, while other efforts will focus on issues of peripheral long-term significance in practice. As a research community that has gone through a substantial "growth spurt" we find ourselves facing a great opportunity and challenge: to better channel our research efforts, we should attempt to reflect upon our progress to date and recognize how our efforts and results build on each other, and to identify--and potentially prioritize--the areas that we still need to investigate. The purpose of this work is to provide a long-term consensus SOA research agenda, classified into research issues pertaining to the business, engineering and operation aspects of service-oriented systems, plus a set of cross-cutting aspects. An additional goal is to assemble an international research group to analyze the current state of the practice and current research initiatives in SOA and create a community of interest around SOA research to share results and ideas on how to improve SOA adoption and the development of service-oriented systems.
Human influence network for understanding leadership behavior
Authors: Naohiro Matsumura, Yoshihiro Sasaki
Venue: International Journal of Knowledge-based and Intelligent Engineering Systems (2007)

We determined the results of the questionnaire for 97 staff members working in dot-jp, a non-profit organization in Japan, to understand the degrees of satisfaction of staff members with leaders. We then extracted human influence networks from the archives of e-mail used at dot-jp to understand relationships among leaders and other staff members. By integrating these two approaches, we revealed ideal leadership behavior. We discovered that leaders should receive messages from staff members as well as send messages to construct reliable relationships. Otherwise, leaders become smug and lose trusts from other staff members.
Incorporating model identifiability into equation discovery of ODE systems
Authors: Dirk J.W. De Pauw, Bernard De Baets
Venue: Proceedings of the 2008 GECCO conference companion on Genetic and evolutionary computation (2008)

Equation discovery is a machine learning technique that tries to automate the discovery of equations from measured data. In this contribution an equation discovery system based on genetic programming was developed in order to generate mechanistic models for systems described by ordinary differential equations. A problem often encountered with automatic model generation is that overly complex models are generated that "overfit" the measured data. This issue was addressed by incorporating a model identifiability measure (expressing which fraction of the model parameters can be given a unique value given the available data) into the fitness function of the individuals. Using noisy artificially generated data for a river water quality example case, it was shown that the developed system was able to generate model equations that fitted the data well and were also fully identifiable. Correct model equations were generated when starting from a model with minimum prior knowledge but also when starting from an overly complex model. As such, it was demonstrated that the developed equation discovery system is able to generate models with optimal complexity with regard to the available data.
A robust fuzzy credit assignment cerebellar model articulation controller (FCA-CMAC) with fast learning applied to control system
Authors: Yan-Ping Wang, Zne-Jung Lee, Shun-Feng Su
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

In this paper, a robust fuzzy credit assignment CMAC (FCA-CMAC) is proposed to speed up the learning ability and to increase the robust capability of CMAC. The FCA-CMAC is to combine the fuzzy logic concept and credit assignment ideas to provide fast and accurate learning for CMAC. With fuzzified blocks, FCA-CMAC can increase its precision and resolution; Meanwhile, the learning approach is to replace the logic AND and OR operations in the CMAC with the commonly used t-norm and t-conorm operations, respectively. Furthermore, the calculated errors are assigned proportional to the inverse of learning times, which are viewed as the creditability of addressed hypercubes. Besides, we also embed the robust learning algorithm (i.e. M-estimators) and tune the learning constant in the CMAC learning algorithm to control system of an inverse dynamic plant. From simulation results, it shows that the proposed algorithm of FCA-CMAC has better learning capability and performance than other CMACs.
Constructing a Message-Pruning Tree with Minimum Cost for Tracking Moving Objects in Wireless Sensor Networks Is NP-Complete and an Enhanced Data Aggregation Structure
Authors: Bing-Hong Liu, Wei-Chieh Ke, Chin-Hsien Tsai, Ming-Jer Tsai
Venue: IEEE Transactions on Computers (2008)

Wireless sensor networks have often been used to monitor and report the locations of moving objects. Since sensors can also be used for storage, a wireless sensor network can be considered a distributed database, enabling us to update and query the location information of moving objects. Many researchers have studied the problem of how to construct message-pruning trees that can update a database and query objects with minimum cost (the Minimum Cost Message-Pruning Tree problem). The trees are constructed in such a way that the total cost of updating the database and querying objects is kept as minimum as possible, while the hardness of the Minimum Cost Message-Pruning Tree problem remains unknown. In this paper, we first show that the Minimum Cost Message-Pruning Tree problem is NP-complete. Subsequently, since the message-pruning tree with minimum cost is hard to be constructed in polynomial time, we propose a new data aggregation structure, a message-pruning tree with shortcuts, instead of the message-pruning tree. Simulation results show that the proposed data aggregation structure significantly reduces the total cost of updating the database and querying objects, as compared to the message-pruning tree.
The "mental map" versus "static aesthetic" compromise in dynamic graphs: a user study
Authors: Peter Saffrey, Helen Purchase
Venue: Proceedings of the ninth conference on Australasian user interface - Volume 76 (2008)

The design of automatic layout algorithms for single graphs is a well established field, and some recent studies show how these algorithms affect human understanding. By contrast, layout algorithms for graphs that change over time are relatively immature, and few studies exist to evaluate their effectiveness empirically. This paper presents two new dynamic graph layout algorithms and empirical investigations of how effective these algorithms are with respect to human understanding. Central to each algorithm is the "mental map": the degree to which the layout supports continuous understanding. This work aims to evaluate the importance of the mental map, alongside traditional static graph aesthetics, in answering questions about dynamic graphs. We discover that a simple concept of the mental map is not sufficient for increasing understanding of the graph.
Finitely additive extensions of distribution functions and moment sequences: The coherent lower prevision approach
Authors: Enrique Miranda, Gert de Cooman, Erik Quaeghebeur
Venue: International Journal of Approximate Reasoning (2008)

We study the information that a distribution function provides about the finitely additive probability measure inducing it. We show that in general there is an infinite number of finitely additive probabilities associated with the same distribution function. Secondly, we investigate the relationship between a distribution function and its given sequence of moments. We provide formulae for the sets of distribution functions, and finitely additive probabilities, associated with some moment sequence, and determine under which conditions the moments determine the distribution function uniquely. We show that all these problems can be addressed efficiently using the theory of coherent lower previsions.
ON ACC and threshold circuits
Authors: A. C. -C. Yao
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

It is proved that any language in ACC can be approximately computed by two-level circuits of size 2 raised to the (log n)/sup k/ power, with a symmetric-function gate at the top and only AND gates on the first level. This implies that any language in ACC can be recognized by depth-3 threshold circuits of that size. This result gives the first nontrivial upper bound on the computing power of ACC circuits.
The impact of random device variation on SRAM cell stability in sub-90-nm CMOS technologies
Authors: Kanak Agarwal, Sani Nassif
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

The impact of process variation on SRAM yield has become a serious concern in scaled technologies. In this paper, we propose a methodology to analyze the stability of an SRAM cell in the presence of random fluctuations in the device parameters. First, we develop a theoretical framework for characterizing the dc noise margin of a memory cell. The framework is based on the concept that an SRAM cell is on the verge of instability when the gain across the loop formed by the cross-coupled inverters in the cell is unity. The noise margin criteria developed in this manner can be used to verify a cell stability in the presence of arbitrary DC noise offsets at the two storage nodes in the cell. We also develop metrics for estimating the cell stability during read and write operations and verify these models by extensive Monte Carlo simulations in a 65-nm CMOS process. Our results show that the proposed robustness metrics can be used to estimate cell failure probabilities in an efficient and accurate manner.
Sixth workshop on software quality
Authors: Barry Boehm, Sunita Chulani, June Verner, Bernard Wong
Venue: Companion of the 30th international conference on Software engineering (2008)

Software Quality has been a major challenge throughout Information Technology projects. Whether it is in software development, in software integration or whether it is in the implementation or customization of shrink-wrapped software, quality is regarded as a major issue. In the last couple of decades, much software engineering research has focussed on standards, methodologies and techniques for improving software quality, measuring software quality and software quality assurance. Most of this research is focused on the internal/development view of quality. More recent studies have made attempts to understand the stakeholder view of quality. With globalisation, many new challenges affect software quality. Not only do we need to understand the many stakeholder views of quality, we now need to consider the cultural issues, and the outsourcing issues. The Sixth Workshop on Software Quality aims to bring together academic, industrial and commercial communities interested in software quality topics to discuss the different technologies being defined and used in the software quality area.
Person-independent head pose estimation using biased manifold embedding
Authors: Vineeth Nallure Balasubramanian, Sreekar Krishna, Sethuraman Panchanathan
Venue: EURASIP Journal on Advances in Signal Processing (2008)

Head pose estimation has been an integral problem in the study of face recognition systems and human-computer interfaces, as part of biometric applications. A fine estimate of the head pose angle is necessary and useful for several face analysis applications. To determine the head pose, face images with varying pose angles can be considered to be lying on a smooth low-dimensional manifold in high-dimensional image feature space. However, when there are face images of multiple individuals with varying pose angles, manifold learning techniques often do not give accurate results. In this work, we propose a framework for a supervised formof manifold learning called Biased Manifold Embedding to obtain improved performance in head pose angle estimation. This framework goes beyond pose estimation, and can be applied to all regression applications. This framework, although formulated for a regression scenario, unifies other supervised approaches to manifold learning that have been proposed so far. Detailed studies of the proposed method are carried out on the FacePix database, which contains 181 face images each of 30 individuals with pose angle variations at a granularity of 1. Since biometric applications in the real world may not contain this level of granularity in training data, an analysis of the methodology is performed on sparsely sampled data to validate its eectiveness. We obtained up to 2average pose angle estimation error in the results from our experiments, which matched the best results obtained for head pose estimation using related approaches.
A new fuzzy Lyapunov controller for nonholonomic mobile vehicles
Authors: Francesco M. Raimondi, Maurizio Melluso
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

This paper presents a new fuzzy Lyapunov controller for nonholonomic mobile vehicles. A symbiosis between classical backstepping techniques and fuzzy logic was realized. The control system ensures a good robustness with respect to outside perturbations. These perturbations can interact with the vehicle. They are sources of uncertainty for the system model and can perturb the validity of the nonholonomic constraints. Therefore the trajectory tracking problem with noise is considered. The asymptotic stability of the fuzzy kinematical control system is guaranteed by Lyapunov's method. The algorithm efficiency, error minimization and noises reject are confirmed through simulation examples in Matlab environment.