ppxscal/embedding_network huggingface dataset:
Comparison of Method Chunks and Method Fragments for Situational Method Engineering
Authors: Brian Henderson-Sellers, Cesar Gonzalez-Perez, Jolita Ralyté
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

Two main candidates for the atomic element to be used in Situational Method Engineering (SME) have been proposed: the “method fragment” and the “method chunk.” These are examined here in terms of their conceptual integrity and in terms of how they may be used in method construction. Also, parallels are drawn between the two approaches. Secondly, the idea of differentiating an interface from a body has been proposed for method chunks (but not for method fragments). This idea is examined and mappings are constructed between the interface and body concepts of method chunks and the concepts used to describe method fragments. The new ISO/IEC 24744 standardmetamodel is used as a conceptual framework to perform these mappings.
Optimal trajectory planning for a redundant mobile manipulator with non-holonomic constraints performing push–pull tasks
Authors: José p. Puga, Luciano e. Chiang
Venue: Robotica (2008)

This work presents a method to generate optimal trajectories for redundant mobile manipulators based on a weighted function that considers simultaneously joint torques, manipulability and preferred joint angle references. This method is applicable to a group of tasks, commonly known as push–pull tasks, in which a redundant mobile manipulator subject to non-holonomic constraints moves slowly while exerting a set of forces against the environment. In practice, this occurs when the manipulator is pulling against an object such as when opening a door or unearthing a buried object. Torque is computed in a quasi-static manner, mainly taking into consideration the effect of multiple external forces while neglecting dynamic effects. The formulation incorporates a criterion for optimizing a starting configuration, and special considerations are made to account for non-holonomic constraints. The application to an existing mobile manipulator is described.
A Study on the Compound Communication Network over the High Voltage Power Line for Distribution Automation System
Authors: Duckhwa Hyun, Younghun Lee
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

Power company have been operated the Automation System for relaying and supervisory controls by using public communication network. But these systems must have the strictest requirements of communication. For these reasons, there are a lot of difficulties to apply to the Automation System considering the cost, location environment, and other characteristics of power lines. But, recently, the existing power line can be used as communication media by using Power Line Communication (PLC). PLC can be adopted as a main communication means, and other wired/wireless can be adopted as second means. In order to this, the high voltage PLC have to be used as a long distance communication network. In our study, in case of accidents, we suggest the intelligent Compound Communication System for optimal roundabout routes in communication network, and verified it's performance and reliability in the real test field.
Service-Orientation and Flexible Service Binding in Distributed Automation and Control Systems
Authors: Andre Pohl, Heiko Krumm, Felix Holland, Franz-Josef Stewing, Ingo Lueck
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

An experimental study shows the feasibility of service-oriented architectures for industrial automation and control systems even with respect to lower, real-time dependent control functions. For that purpose, general SOA-guidelines were refined in order to cover the distribution of control functions between services and the lay-out and management of device-based sensor, actor and control services. Particular emphasis was placed on the dynamic lease-based binding of services which on the one hand provides flexible and loose coupling of system components but on the other hand has to ensure reliable communication and cooperation. The guidelines were applied to the experimental implementation of a manufacturing cell control system using a real-time version of the Java Runtime Environment. The Device Profile for Web Services (DPWS) was used as basic infrastructure technology. Test and evaluation were performed under distributed simulation of technical processes and devices. We shortly describe DPWS, present the architecture guidelines, outline the experimental control system implementation, and report on its evaluation.
Indexing the Java API Using Source Code
Authors: Homan Ma, Robert Amor, Ewan Tempero
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

The basic idea behind software reuse is that software developers use reusable components found in software repositories to reduce the amount of code that has to be written and so increase productivity. A problem arises, however, if the repository is too big - it becomes difficult to find relevant components. What is needed is an effective means to query repositories. Most approaches to developing such means involves creating a good index to which the queries can be applied. Developing a good index requires identifying the relevant information on which to base the index. In this paper, we present the results of a project that used source code as the basis for the index.
K-Tree Trunk and a Distributed Algorithm for Effective Overlay Multicast on Mobile Ad Hoc Networks
Authors: Yamin Li, Shietung Peng, Wanming Chu
Venue: Proceedings of the The International Symposium on Parallel Architectures, Algorithms, and Networks (2008)

Overlay multicast protocols construct a virtual mesh spanning all member nodes of a multicast group. It employs standard unicast routing and forwarding to fulfill multicast functionality. The advantages of this approach are robustness and low overhead. However, efficiency and stability are the issues that must be addressed in the mobile ad hoc network (MANET) environment. In this paper, we propose an effective structure for overlay multicast to solve these problems in MANET. Instead of using a spanning tree on the virtual mesh, we introduce a simple structure called k-tree trunk for multicast. A k-tree trunk of a tree is a subtree with k leaves that minimizes the sum of the distances of all vertices to the subtree plus the size of the subtree. The k-tree trunk is more stable and easier to maintain than the spanning tree in MANET. The simulation results show that our approach handles the flexibility and mobility issues in an overlay multicast protocol effectively, especially when the group size is large.
Barrier Coverage with Mobile Sensors
Authors: Changxiang Shen, Weifang Cheng, Xiangke Liao, Shaoliang Peng
Venue: Proceedings of the The International Symposium on Parallel Architectures, Algorithms, and Networks (2008)

Barrier coverage, which guarantees that every movement crossing a barrier of sensors will be detected, is known to be an appropriate model of coverage for moving detection and boundary guard. The related problems about barrier coverage with stationary sensors are extensively studied. When sensors are randomly deployed, we require much more sensors to achieve barrier coverage than deterministic deployment. In this paper we study barrier coverage with mobile sensors, in which the sensors can be relocated after deployment, and we are able to utilize much fewer mobile sensors than stationary sensors to achieve barrier coverage with random deployment. We study the energy-efficient relocation problem for barrier coverage, and propose a centralized barrier algorithm, which computes the relocated positions based on knowing the initial positions of all sensors. For practicability and scalability, we further design a distributed barrier algorithm based on our proposed virtual force model. We conduct extensive simulations to study the effectiveness of the proposed algorithms.
Traceable Quantitative Risk Assessment Applied to Investment Decision for Local Backups
Authors: Steffen Weiss, Martin Wahl, Michael Tielemann, Klaus Meyer-Wegener
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Most organizations have critical data, i.e. customer data or large databases. If these data are lost, organization's existence is in danger. As a consequence, backups for the systems are produced. However, some data are stored only on the computers of employees. These data are usually less critical, but their value cannot be neglected. At DATEV eG in Nuremberg, the question has risen whether it is economically justified to install backup mechanisms for these data. To answer this question, we first present a model to perform an assessment. With the help of this model, we calculate the expected annual cost of repair employees’ computers and data including all side effects. Finally the break-even point in cost-efficiency is computed for the example of DATEV eG.
A confidence based recognition system for TV commercial extraction
Authors: Yijun Li, Danqing Zhang, Xiangmin Zhou, Jesse S. Jin
Venue: Proceedings of the nineteenth conference on Australasian database - Volume 75 (2008)

Automatic real-time recognition of TV commercials is an essential step for TV broadcast monitoring. It comprises two basic tasks: rapid detection of known commercials that are stored in a database, and accurate recognition of unknown ones that appear for the first time in TV streaming. The existing approaches, however, can not perform robust commercial detection because they highly rely on the assumption that black frames are inserted before commercial breaks. In this paper, we propose a novel confidence-based recognition system to address this challenging issues. Those known commercials are detected by applying a fast search algorithm to a pre-built commercial database, and those unknown ones are determined by managing a buffer containing possible yet unconfirmed commercial spots. A new concept of confidence level is defined for each candidate, therefore commercial breaks can be accurately determined based on a confidence threshold. Experimental results using two 48-hour TV broadcasting indicate the high performance of our proposed method.
Cooperation learning in Multi-Agent Systems with annotation and reward
Authors: Tetsuya Yoshida
Venue: International Journal of Knowledge-based and Intelligent Engineering Systems (2007)

This paper proposes a novel approach for enabling agents to learn to cooperate each other based on annotation and reward in Multi-Agent Systems (MAS). We propose two methods toward cooperation learning in MAS: 1) a cooperation method, and 2) a learning method. As for 1), our method enables each agent to interact with other agents by sending its proposal and receiving the counterproposals for the proposal from the agents. The counterproposals are constructed by modifying the communicated proposal, and are utilized for clarifying the difference in opinions among agents. Conflict resolution is conducted to reduce the difference to facilitate cooperation. Furthermore, annotation, which acts as a kind of design rationale, is added onto the communicated proposal and counterproposals to facilitate conflict resolution. As for 2), we propose an extension of reinforcement learning method so that agents can learn the appropriate behavior based on the reward which is given through the interaction among agents. We define two kinds of reward for each agent: the reward for the proposal constructed by the agent, and the reward for coherence among agents. Comparative simulation studies for micro satellite design, which fits for cooperative problem solving by MAS, were conducted to evaluate the proposed approach. The results are encouraging and show that it is worth following this path. Especially, the results indicate that the appropriate balance between exploration and exploitation, which is important in cooperative problem solving in general, can be learned with the proposed approach.
Highly nonlinear balanced S-boxes with improved bound on unrestricted and generalized nonlinearity
Authors: Khoongming Khoo, Chu-Wee Lim, Guang Gong
Venue: Applicable Algebra in Engineering, Communication and Computing (2008)

We construct two classes of balanced S-boxes with high nonlinearity 2 n-1&#x2212;2(n-1)/2 for n odd. From known results, it can be deduced that for any S-box which has nonlinearity 2 n-1&#x2212;2(n-1)/2, the unrestricted nonlinearity is lower bounded by 2 n-1&#x2212;2(m+n-1)/2 while the generalized nonlinearity is lower bounded by 2 n-1&#x2212;(2 m &#x2212;1)2(n-1)/2. We prove that the lower bound on the unrestricted nonlinearity of both our S-box constructions can be increased to 2 n-1&#x2212;2(m+n)/2-1. For the first class of S-box, the lower bound on generalized nonlinearity can be increased to 2 n-1&#x2212;2(n-1)/2+m-1. For the second class, the generalized nonlinearity is proven to be exactly 2 n-1&#x2212;2(m+n)/2-1, which is much higher than the lower bound for our first construction. The first class of S-boxes have low maximum differential while the second class corresponds to GMW sequences, whose algebraic structure allows us to construct a larger family of S-boxes. Moreover, both classes of S-boxes can attain high algebraic degree. We also compare our constructions with some known functions with high unrestricted and/or generalized nonlinearity.
New methods for text categorization
Authors: Hana Kopackova, Ludek Kopacek, Renata Bilkova, Karel Naiman
Venue: Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics (2006)

Text categorization - the assignment of texts to one or more predefined categories based on their content-represents an important component of different information organization and management tasks. Significance of text categorization leads many researchers to find more and more effective methods for this task. It has recently been shown that artificial immune system (AIS) can be successfully used in many machine learning tasks so it can be also used for text categorization task. The aim of this paper is to check applicability of AIS algorithms (Immunos-1, Immunos-2 and Immunos-2A) on text classification task. The results are compared with some classical document classification methods: naïve Bayesian classifier and K-NN classifier.
Software Architecture Knowledge Management
Authors: Hans van Vliet
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

Software architecture is a recognized and indispensable part of system development. Software architecture is often defined in terms of components and connectors, or the "high-level conception of a system." In recent years, there has been an awareness that not only the design itself is important to capture, but also the knowledge that has led to this design. This so-called architectural knowledge concerns the set of design decisions and their rationale. Capturing architectural knowledge is difficult. Part of it is tacit and difficult to verbalize. Like developers, software architects are not inclined to document their solutions. Establishing ways to effectively manage and organize architectural knowledge is one of the key challenges of the field of software architecture. This architectural knowledge plays a role during development, when architects, developers, and other stakeholders must communicate about the system to be developed, possibly in a global setting. It also plays a role during the evolution of a system, when changes are constrained by decisions made earlier.
Service science: catalyst for change in business school curricula
Authors: M. M. Davis, I. Berdrow
Venue: IBM Systems Journal (2008)

For a service delivery system to produce optimal solutions to service-related business problems, it must be based on an approach that involves many of the traditional functional areas in an organization. Unfortunately, most business school curricula mirror the older traditional organizational structure that dominated businesses throughout most of the twentieth century. This structure typically consisted of vertically organized functions (or silos), such as production, marketing, and finance, with each silo operating largely independently of the others. Similarly, business schools today are usually organized by functional departments-such as marketing, finance, accounting, and operations management-with little interaction among them. Within this traditional silo-structured environment, it is very difficult to properly develop a curriculum, or even a course, in service management. Consequently, a significant gap exists between the education received by business school graduates and the skills that they need to succeed in today's service-intense environment. This paper explores the underlying causes of this gap and suggests ways in which the emerging field of service science can facilitate the changes in business school curricula that will make them more relevant in meeting the needs of today's businesses and organizations.
Analysis of the contribution of computer-supported learning to organizational knowledge management
Authors: Francisco Milton Mendes Neto
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

The competitive advantage of organizations is more and more related to the competence of the workers and to the capacity the organization shows in improving the organizational learning. Computer-supported learning (CSL) contributes to improve the organizational learning by supporting the knowledge sharing process. Sharing knowledge, however, is not sufficient to increase the intellectual capital of an organization. It is necessary to share the kind of knowledge that can be useful to add value to the organization business. This kind of knowledge can be identified and mapped by applying knowledge management (KM) processes. However, although positive effects of a comprehensive approach that addresses both CSL (formal learning) and KM (informal learning) could seem obvious, and despite the fact that organizations are starting to perceive the interrelations among CSL and KM, these integrations ideas are rarely implemented in practice and, in many cases, are not technologically operational. This paper fills in this gap by discussing how CSL can be useful for satisfying the requirements of KM.
Energy Optimization for Data Flow in Mobile Ad Hoc Wireless Networks Using Cooperative Communication
Authors: Hu Haiyang, Hu Hua
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

In order to reduce the energy consumption of dataflows in the mobile ad hoc network and direct thenodes’ movement, this paper takes advantage of cooperative communication (CC) models that allows combining partial signals containing the same information to obtain the complete data. By an effective use of the partial signals, we present a distributed energy-efficient flow protocol named DEEF that supports data transmission in flow paths with less transmission power for each node and design the relevant algorithms and protocols for enabling local decision-making on controlled mobility.
Using a hierarchical multi-resolution mechanism for the classification and semantic extraction of landuse maps for Beer-Sheva, Israel
Authors: D. G. Blumberg, G. Zhu
Venue: International Journal of Remote Sensing (2007)

The spatial analysis of remotely sensed images evolves in three stages: physical classification, semantic extraction, and information recognition. The traditional approaches to image processing use only the first stage. In this paper, a hierarchical multi-resolution structure was developed by the use of segmentation to integrate the three stages into one common platform. Following a spatial segmentation, hierarchical multi-resolution layers were formed to handle the various information needs inherent in the various ground features identified within the image. The relationship between image objects in one layer, or several layers, characterized the segmental objects in spectral, spatial, and hierarchical perspectives, generating new additional layers of information for image analysis. Consequently when the classification was finished, the semantic hierarchy of the ground features and information hidden within the image pixels were extracted. Finally this classification is achieved through image processing by initially decomposing the image into the most basic physical objects and the recomposing into semantic objects. The superiority of the method is obvious: (i) semantic extraction and information recognition can be synthetically performed with the classification procedure in the image processing; (ii) the way that per-pixel handling is promoted to per-object analysis makes image processing more natural; and (iii) the mechanism analysing the relationship in a multi-resolution hierarchy yields a better understanding of the image objects, both semantically and physically.
So many sensors, so little data
Authors: Seth Holloway, Drew Stovall, Angela Dalton, Christine Julien
Venue: Proceedings of the 1st international workshop on Software architectures and mobility (2008)

Future networks are ones in which mobile users are immersed in sensor networks. Application domains such as smart homes, intelligent construction sites, and social networking require users moving through an environment to collect and process data available in that environment. However, even as sensors become increasingly prevalent in our environments, only a handful of applications are available to interact with and process the available sensor data. Poor usability accounts for a good portion of this disparity. In this paper we discuss our directions in creating an architecture for making such sensor data usable by application developers. This has the potential to widen the accessibility of developing mobile applications on embedded sensor networks beyond the niche markets it now enjoys.
Brief paper: Synchronizing linear systems via partial-state coupling
Authors: S. Emre Tuna
Venue: Automatica (Journal of IFAC) (2008)

A basic result in the synchronization of linear systems via output coupling is presented. For identical discrete-time linear systems that are detectable from their outputs and neutrally stable, it is shown that a linear output feedback law exists under which the coupled systems globally asymptotically synchronize for all fixed connected (asymmetrical) network topologies. An algorithm is provided to compute such a feedback law based on individual system parameters.