ppxscal/embedding_network huggingface dataset:
Motor primitive and sequence self-organization in a hierarchical recurrent neural network
Authors: Rainer W. Paine, Jun Tani
Venue: Neural Networks (2004)

This study describes how complex goal-directed behavior can be obtained through adaptation processes in a hierarchically organized recurrent neural network using a genetic algorithm (GA). Our experiments, using a simulated Khepera robot, showed that different types of dynamic structures self-organize in the lower and higher levels of the network for the purpose of achieving complex navigation tasks. The parametric bifurcation structures that appear in the lower level explain the mechanism of how behavior primitives are switched in a top-down way. In the higher level, a topologically ordered mapping of initial cell activation states to motor primitive sequences self-organizes by utilizing the initial sensitivity characteristics of non-linear dynamical systems. The biological plausibility of the model's essential principles is discussed.
Relative difference sets fixed by inversion (ii): character theoretical approach
Authors: Wei-Hung Liu, Yu Qing Chen, K. J. Horadam
Venue: Journal of Combinatorial Theory Series A (2005)

In this paper, we continue our investigation of relative difference sets fixed by inversion. We exclusively focus our attention on abelian groups. New necessary conditions are obtained and a new family of such relative difference sets with forbidden subgroup Z/4Z is constructed. The methods we use are character theory of abelian groups and Galois rings over Z/4Z.
Persistent Middle Tier Components Without Logging
Authors: David Lomet
Venue: Proceedings of the 9th International Database Engineering & Application Symposium (2005)

Enterprise applications need to be highly available and scalable. In the past, this has required "stateless" applications, which essentially require the application to manage its state explicitly by storing it in transactional resource managers. Despite "stateful" applications being more natural and hence easier to write, and get correct, having rhe system manage this state automatically has been considered too difficult and too costly. The Phoenix/App system showed how to manage state in stateful applications transparently, by logging interactions between components, guaranteeing "exactly once" execution of the application. By introducing some minor restrictions on Phoenix/App components, no logging need be done for middle tier components, thus making it easy to provide both availabiliiy und scalability. Because there is no logging, the performance of failure free application executions is excellent.
New Robotics: Design Principles for Intelligent Systems
Authors: Rolf Pfeifer, Fumiya Iida, Josh Bongard
Venue: Artificial Life (2005)

New robotics is an approach to robotics that, in contrast to traditional robotics, employs ideas and principles from biology. While in the traditional approach there are generally accepted methods (e. g., from control theory), designing agents in the new robotics approach is still largely considered an art. In recent years, we have been developing a set of heuristics, or design principles, that on the one hand capture theoretical insights about intelligent (adaptive) behavior, and on the other provide guidance in actually designing and building systems. In this article we provide an overview of all the principles but focus on the principles of ecological balance, which concerns the relation between environment, morphology, materials, and control, and sensory-motor coordination, which concerns self-generated sensory stimulation as the agent interacts with the environment and which is a key to the development of high-level intelligence. As we argue, artificial evolution together with morphogenesis is not only "nice to have" but is in fact a necessary tool for designing embodied agents.
QoS Support for Time-Critical Grid Workflow Applications
Authors: Ivona Brandic, Siegfried Benkner, Gerhard Engelbrecht, Rainer Schmidt
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

Time critical grid applications as for example simulations for medical surgery or disaster recovery have special Quality of Service requirements. The Vienna Grid Environment, developed and evaluated in the context of the EU Project GEMSS, facilitates the provision of HPC applications as QoS-aware Grid services by providing support for dynamic negotiation of various QoS guarantees like required execution time and price. In this paper, we extend the QoS mechanisms offered by the Vienna Grid Environment to workflow applications. We describe QoS extensions of the Business Process Execution Language and present a first prototype of a corresponding QoS-aware workflow engine which implements different strategies in order to bind the tasks of a workflow to adequate Grid services subject to user-specified QoS constraints. We present different Grid workflow planning approaches as well as first experimental results.
The effect of interface design on e-commerce web sites for product information learning and search performance
Authors: Hyunjeong Kang
Venue:  (2005)

The e-commerce environment is emerging as a critical factor in a firm's success. Different web interface designs may determine whether firms keep or lose their customers. Web site design should allow customers to navigate and search product information naturally and with minimal cognitive effort. This study will suggest a cognitive process model of human users in transacting with the web site interface; it also will examine the effect of information search guidance in a web site on the understanding of the product and the acceptance of the Web information system. Declarative knowledge and production knowledge of a unified cognitive learning model will be investigated to explain how information is gained through web site navigation. Information search guidance in a web site will be objective web site characteristics (i.e., breadth and depth of hypertext structure), as well as subjectively perceived evaluation of the web site interface design. The current study also will investigate the effect of Web navigation experience on a user's attitudes and beliefs (i.e., self-efficacy, task support satisfaction, and interface satisfaction). The result of Partial Least Square (PLS) and Multivariate Analysis of Variance (MANOVA) analyses shows that declarative knowledge of the product is not significantly related to antecedent variables of web site interface attributes, nor to the dependent variables. Procedural knowledge, however, presents strong associations with interface design and web site system satisfaction and self-efficacy. Discussion about the results and conclusions is provided.
A Software Cost Estimation Model for a Product Line Engineering Approach: Supporting tool and UML Modeling
Authors: Sana Ben Abdallah Ben Lamine, Lamia Labed Jilani, Henda Hajjami Ben Ghezala
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

The Product Line Engineering approaches (PLE) to software development are promising in matter of quality, productivity and time-to-market. Some results achieved in industry can prove that. But managers need quantitative models reassuring them concerning the important initial investment they are going to commit. This paper reports on the need for such economic models for reuse as well as the underlying supported tools. Thus, we introduce a new Software Cost Estimation Model for Product Line Engineering that we denote as SoCoEMo-PLE. This model is based on two previous models: the integrated cost estimation model for reuse in general and Poulin's model for PLE. In fact, we present a new model which takes into account PLE software development cycle approach and takes some features of the two previous cost estimation models. The tool supporting SoCoEMo-PLE is described and an UML modeling is presented. Results of a preliminary experiment in the use of the model and the tool are reported.
Learning structured prediction models: a large margin approach
Authors: Ben Taskar, Vassil Chatalbashev, Daphne Koller, Carlos Guestrin
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

We consider large margin estimation in a broad range of prediction models where inference involves solving combinatorial optimization problems, for example, weighted graph-cuts or matchings. Our goal is to learn parameters such that inference using the model reproduces correct answers on the training data. Our method relies on the expressive power of convex optimization problems to compactly capture inference or solution optimality in structured prediction models. Directly embedding this structure within the learning formulation produces concise convex problems for efficient estimation of very complex and diverse models. We describe experimental results on a matching task, disulfide connectivity prediction, showing significant improvements over state-of-the-art methods.
A Seamless Handoff Scheme with new AP Module for Wireless LANs Support VoIP
Authors: Thavisak Manodham, Luis Loyola, Gustavo Atoche, Mitsuo Hayasaka, Tetsuya Miki
Venue: Proceedings of the International Symposium on Applications on Internet (2006)

Recently, wireless LANs based on the IEEE 802.11 standard have become popular and widely used, and Voice over IP (VoIP) is one of the most promising to be used in mobile devices over wireless networks. Up to date, new technologies have improved providing high data rate to support various kind of real-time applications. However, besides the need for higher data rates, seamless handoff is another important issue to be addressed in order to continue supporting realtime services across wireless LANs. In this paper, we proposed a Seamless Handoff Scheme that uses Access Point (AP) Module with 2 transceivers in order to improve network efficiency in terms of supporting seamless handoff and balancing the traffic load in wireless network. In our proposed scheme, APs use the second transceiver to search for information of neighbor STAs in the transmission range, and later send the result back to associate AP, which in turn compare and analyze whether the STA should perform a handoff or not. The initial results from our simulations show the proposed handoff scheme is more effective than the conventional scheme in terms of low latency and traffic load is fairly balanced.
Hierarchical Spherical Distance Fields for Collision Detection
Authors: Christoph Funfzig, Torsten Ullrich, Dieter W. Fellner
Venue: IEEE Computer Graphics and Applications (2006)

This article presents a fast collision detection technique for all types of rigid bodies demonstrated with polygon soups. During the preprocessing step, a spherical sampling of the model is performed and then stored in a wavelet-like representation. This representation is space-efficient and allows the on-the-fly generation of spherical shell bounding volumes. In contrast to the commonly used filter banks, this construction uses the max-plus algebra. This guarantees that each low-resolution version of a bounding volume encloses all versions of higher resolution. The technique is scalable in the information it gives in collision determination. If it reports a single triangle per spherical shell then the collision time only depends on the sampling density and the extent of spherical shells, used as bounding volumes, but not on the primitives' count of the model. Due to this fact, it's possible to estimate the time bounds for the collision test tightly. For bounding volume hierarchies known worst-case time bounds are not tight, as the bounding volumes can overlap in space. As an intermediate approach it's possible to report a single triangle per layer of each model. For surface models this information together with surface neighborhood is often sufficient for collision response. If we check all triangle pairs inside a spherical shell for intersection, then the approach is most general and works well in situations with few collisions, which are the most relevant in practice.
Tractable particle filters for robot fault diagnosis
Authors: Vandi Verma
Venue:  (2005)

Experience has shown that even carefully designed and tested robots may encounter anomalous situations. It is therefore important for robots to monitor their state so that anomalous situations may be detected in a timely manner. Robot fault diagnosis typically requires tracking a very large number of possible faults in complex non-linear dynamic systems with noisy sensors. Traditional methods either ignore the uncertainly or use linear approximations of nonlinear system dynamics. Such approximations are often unrealistic, and as a result faults either go undetected or become confused with non-fault conditions. Probability theory provides a natural representation for uncertainty, but an exact Bayesian solution for the diagnosis problem is intractable. Classical Monte Carlo methods, such as particle filters, suffer from substantial computational complexity. This is particularly true with the presence of rare, yet important events, such as many system faults. The thesis presents a set of complementary algorithms that provide an approach for computationally tractable fault diagnosis. These algorithms leverage probabilistic approaches to decision theory and information theory to efficiently track a large number of faults in a general dynamic system with noisy measurements. The problem of fault diagnosis is represented as hybrid (discrete/continuous) state estimation. Taking advantage of structure in the domain it dynamically concentrates computation in the regions of state space that are currently most relevant without losing track of less likely states. Experiments with a dynamic simulation of a six-wheel rocker-bogie rover show a significant improvement in performance over the classical approach.
Modeling Software Reliability Growth with Genetic Programming
Authors: Eduardo Oliveira Costa, Silvia R. Vergilio, Aurora Pozo, Gustavo Souza
Venue: Proceedings of the 16th IEEE International Symposium on Software Reliability Engineering (2005)

Reliability Models are very useful to estimate the probability of the software fail along the time. Several different models have been proposed to estimate the reliability growth, however, none of them has proven to perform well considering different project characteristics. In this work, we explore Genetic Programming (GP) as an alternative approach to derive these models. GP is a powerful machine learning technique based on the idea of genetic algorithms and has been acknowledged as a very suitable technique for regression problems. The main motivation to choose GP for this task is its capability of learning from historical data, discovering an equation with different variables and operators. In this paper, experiment were conducted to confirm this hypotheses and the results were compared with traditional and Neural Network models.
Similarity-based Partial Image Retrieval System for Engineering Drawings
Authors: Takayuki Baba, Rujie Liu, Susumu Endo, Shuichi Shiitani, Yusuke Uehara, Daiki Masumoto, Shigemi Nagata
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

Designers of mechanical products frequently refer to engineering drawings which are stored as image data in databases to design a new mechanical product efficiently. Multiple mechanical parts are usually drawn on each engineering drawing. Therefore designers want to find engineering drawings containing parts similar to a query image in the shape of a part drawn on an engineering drawing. In this paper, we propose a novel similarity-based partial image retrieval system for engineering drawings. A unique aspect of this system is that a graph representation is utilized to robustly find engineering drawings containing similar parts which are invariant to the size, position, and rotation. We verified the performance for the similarity-based partial image retrieval system through experiments using industrial engineering drawings. The results show that the top five similar engineering drawings for every query image are always accurately retrieved by our proposed system. This finding suggests that this system could be useful for the reuse of stored engineering drawings.
A Workflow based E-learning Architecture in Service Environment
Authors: KONG Weining, LUO Junzhou, ZHANG Tiantian
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Many e-learning systems integrate advanced network technologies like web services, grid computing to achieve learning at anywhere anytime. However, most of them have not taken account of the process of study activities; learners are difficult to navigate the learning resources adaptive to their own pace. Though several recent researches provide workflow-based e-learning, formal definition and analysis of learning process, organization of distributed learning objects still have not be fully considered. This paper first introduced the formal definition method of workflow-based courses using fuzzy Petri nets, and then proposed a workflow based elearning architecture by utilizing workflow technology and learning object services. This architecture provides teachers tool for designing courses as composition of learning object services, and gives students the opportunities to achieve an orderly learning experience through adaptive navigating e-learning services step by step under the control of certain learning strategy. Some questions in application and future works are also discussed.
SAGE: system for algebra and geometry experimentation
Authors: William Stein, David Joyner
Venue: ACM SIGSAM Bulletin (2005)

SAGE is a framework for number theory, algebra, and geometry computation that is initially being designed for computing with elliptic curves and modular forms. The current implementation is primarily due to William Stein. It is open source and freely available under the terms of the GNU General Public License (GPL).
Protein Structure Prediction and Interpretation with Support Vector Machines and Decision Trees
Authors: Yi Pan
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Prediction of protein structures from protein sequences using computers is an important step to discover proteins' 3D conformation structures and their functions and hence has profound theoretical and practical significance in areas such as protein engineering and drug design. In this talk, we will discuss our new results in protein secondary structure and Transmembrane protein prediction using Support Vector Machines. We will also discuss how to use a combination of Support Vector Machine and Decision Tree to understand how a prediction is reached through rule extraction. Clearly, a good interpretation is useful for guiding biological experiments and may lead further prediction improvement. A novel approach of rule clustering for super-rule generation will also be briefly discussed.
Wrist and tendon dynamics as contributory risk factors in work-related musculoskeletal disorders: Research Articles
Authors: Yongku Kong, Hyunkook Jang, Andris Freivalds
Venue: Human Factors in Ergonomics Manufacturing (2006)

Many studies have shown that repetitive wrist motion is a major risk factor for work-related musculoskeletal disorders (WMSDs). Specific contributory factors include wrist and tendon dynamics. The authors present recent methodological advances, epidemiological studies, and biomechanical models estimating the effects of wrist dynamics on internal tendon force as a theoretical basis for the risk of incurring a WMSD. These biomechanical models utilize either the reduction method or the optimization method to solve the indeterminate problem resulting from too many internal variables. Generally, the optimization methods show the best agreement with direct in vivo tendon force studies. For the models of pinch grips, the average ratio of tendon forces to external forces ranges from 1.8 to 3.5, while for direct tendon measurements, the ratio ranges from 1.73 to 7.92. Similarly, high contributions of flexor tendons for pinches and grasps are found in both the models and direct tendon measurements. These high tendon forces combined with wrist dynamics may be a significant factor in the development of WMSDs. &copy; 2006 Wiley Periodicals, Inc. Hum Factors Man 16: 83&ndash;105, 2006.
Agent Based Transaction Support in Commercial Grid
Authors: Florian Lang, Freimut Bodendorf
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

Peak load management is a typical application that relies on dynamic sourcing of grid services and is characterized by instantaneous, dynamic needs that must be served on short notice. Therefore, decision support by autonomous systems is not an option but a must on a grid market. To achieve efficient resource utilization by contract customization without neutralizing its welfare effects by excessive transaction cost, customization must be automated by software agents that negotiate for several attributes of an SLA. Grid and agent technology are increasingly regarded complementary and emerge as a combined field of research.
A Moderated Fuzzy Matchmaking forWeb Services
Authors: Chun-Lung Huang, Kuo-Ming Chao, Chi-Chun Lo
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

A number of matchmaking methods have been proposed and used for various applications. However, the issues associated with matchmaking for web services that involve data repository are not well addressed by the existing methods which focus on service capabilities, interface signatures, and so on. This results from that the information and data in repository are not considered for matchmaking. In our previous work, we proposed a fuzzy matchmaking framework which exploits fuzzy logic to abstract and classify the underlying data of web services as fuzzy terms and rules. As a result, it increases the efficiency of the discovery of web services and allows imprecise or vague terms incorporated in the search. However, the assumption of unified (consensus) value between service providers and consumers for the service is made. In this paper, a fuzzy moderator is introduced in order to provide a tracking mechanism for feedbacks and moderate their values.
Supporting Cooperative Caching in Ad Hoc Networks
Authors: Liangzhong Yin, Guohong Cao
Venue: IEEE Transactions on Mobile Computing (2006)

Most researches in ad hoc networks focus on routing and not much work has been done on data access. A common technique used to improve the performance of data access is caching. Cooperative caching, which allows the sharing and coordination of cached data among multiple nodes, can further explore the potential of the caching techniques. Due to mobility and resource constraints of ad hoc networks, cooperative caching techniques designed for wired networks may not be applicable to ad hoc networks. In this paper, we design and evaluate cooperative caching techniques to efficiently support data access in ad hoc networks. We first propose two schemes: CacheData, which caches the data, and CachePath, which caches the data path. After analyzing the performance of those two schemes, we propose a hybrid approach (HybridCache), which can further improve the performance by taking advantage of CacheData and CachePath while avoiding their weaknesses. Cache replacement policies are also studied to further improve the performance. Simulation results show that the proposed schemes can significantly reduce the query delay and message complexity when compared to other caching schemes.