ppxscal/embedding_network huggingface dataset:
A Revised EM-Like Algorithm + K-OPT Method for Solving the Traveling Salesman Problem
Authors: Peitsang Wu, Kung-Jiuan Yang, Hsin-Chieh Fang
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

In this study, the main objective is to solve the traveling salesman problems (TSP). TSP belongs to a part of the combinatorial optimization problems and NP-complete problems. Though this problem is easy to describe and understand, when the problems of the dimensions are bigger, it becomes difficult and hard to solve. If we consider all feasible solutions, it may cost a lot of time and not be effective. In this study, we utilize the new meta-heuristic algorithm, called the Electromagnetism-like algorithm (EM) which was proposed by Birbil and Fang[1], to solve the TSP problem. Although EM has been used to solve the TSP[6], the results sometimes can not jump out the local optimum. Therefore, a revised EM-like algorithm + k-opt method is introduced and expects to obtain a better solution than the original EM.
Content-Clipping System Using Multi-modal Analysis
Authors: Haru Ando, Keiko Fujita, Junko Yamagishi, Taro Ishikawa
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

We report on the development of a content authoring system for clipping parts that a user requires from audio-visual e-learning contents. The system can analyze lengthy contents for e-learning by using the contents and information related to the contents. It lets the user easily find parts that he/she wants via the user interface. This system enables users to peruse only the required part of the lesson content, which should improve the efficiency of studying.
Tokens for Anonymous Communications in the Internet
Authors: Arjan Durresi, Vamsi Paruchuri, Leonard Barolli, Raj Jain, Makoto Takizawa
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

With the growth and acceptance of the Internet, there has been increased interest in maintaining anonymity in the network. Using traffic analysis, it is possible to infer who is talking to whom over a public network. This work develops a novel approach to hide the senders and the receivers of messages. Routes are chosen and frames traverse these routes. Each frame consists of a token and a node can send a message through a frame only when the corresponding token is free. The best thing about our protocol is that it poses no bandwidth overhead when there is at least some traffic while posing minimal bandwidth overhead when there is no traffic at all.
Dominating sets in k-majority tournaments
Authors: Noga Alon, Graham Brightwell, H. A. Kierstead, A. V. Kostochka, Peter Winkler
Venue: Journal of Combinatorial Theory Series B (2006)

A k-majority tournament T on a finite vertex set V is defined by a set of 2k - 1 linear orderings of V, with u → v if and only if u lies above v in at least k of the orders. Motivated in part by the phenomenon of "non-transitive dice", we let F(k) be the maximum over all k-majority tournaments T of the size of a minimum dominating set of T.We show that F(k) exists for all k > 0, that F(2) = 3 and that in general C1k/log k ≤ F(k) ≤ C2k log k for suitable positive constants C1 and C2.
A Qualitative Assessment of Communicating Spatial Concepts in Virtual and Physical Environments via a Text-Based Medium
Authors: Onn Azraai Puade, Theodor G. Wyeld
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

The pedagogical exercise described here was used to investigate how spatial communication about the manipulation of objects in a virtual and physical space is communicated between remote partners. It continues work done by others. Where it differs from previous research in this area is in its use of a qualitative methodology to study how these types of interactions are structured, communicated and interpreted via textbased media. What emerged from the qualitative analysis are new insights over the previous quantitative investigations. This paper reports on completed research.
Cycle-time quantile estimation in manufacturing systems employing dispatching rules
Authors: Jennifer E. McNeill, John. W. Fowler, Gerald T. Mackulak, Barry L. Nelson
Venue: Proceedings of the 37th conference on Winter simulation (2005)

The cycle-time distribution of manufacturing systems employing dispatching rules other than FIFO can be both highly skewed and have heavy tails. Previous cycle-time quantile estimation work has suggested that the Cornish-Fisher expansion can be used in conjunction with discrete-event simulation to provide cycle-time quantile estimates for a variety of systems operating under FIFO dispatching without requiring excess data storage. However, when the cycle-time distribution exhibits heavy skewness and kurtosis, the accuracy of quantile estimates obtained using the Cornish-Fisher expansion may degrade, sometimes severely. This paper demonstrates the degradation and motivates the need for a modification to the Cornish-Fisher expansion for estimating quantiles under non-FIFO dispatching rules. A solution approach combining a data transformation, the maximum (minimum)-transformation, with the Cornish-Fisher expansion is presented. Results show that this provides significant improvements in accuracy over using the Cornish-Fisher expansion alone while still retaining the advantage of requiring minimal data storage.
An Empirical Study of Software Changes in Statoil ASA - Origin, Priority Level and Relation to Component Size
Authors: Anita Gupta, Odd Petter N. Slyngstad, Reidar Conradi, Parastoo Mohagheghi, Harald Ronneberg, Einar Landre
Venue: Proceedings of the International Conference on Software Engineering Advances (2006)

This paper describes the results of analyzing change requests from 4 releases of a set of reusable components developed by a large Oil and Gas company in Norway, Statoil ASA. These components are total 20348 SLOC (Source Lines of Code), and have been programmed in Java. Change requests in our study cover any change in the requirements. We have investigated the distribution of change requests over the categories perfective, adaptive and preventive changes that characterize aspects of software maintenance and evolution. In total there are 208 combined perfective, adaptive and preventive changes. The results reveal that 59% of changes are perfective, 27% of changes are adaptive and 14% of changes are preventive. The corrective changes (223 in total) are excluded in this paper, since they will be analyzed in future work. We have also investigated the relation between customers' and developers' priority on change requests and found no significant difference between customer and developers' priority of change requests. Larger components had more change requests as expected and priority level of change requests increases with component size. The results are important in that they characterize and explain the changes to components. This is an indication as to which components require more effort and resources in managing software changes at Statoil ASA.
Using Multiple Segmentations to Discover Objects and their Extent in Image Collections
Authors: Bryan C. Russell, William T. Freeman, Alexei A. Efros, Josef Sivic, Andrew Zisserman
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

Given a large dataset of images, we seek to automatically determine the visually similar object and scene classes together with their image segmentation. To achieve this we combine two ideas: (i) that a set of segmented objects can be partitioned into visual object classes using topic discovery models from statistical text analysis; and (ii) that visual object classes can be used to assess the accuracy of a segmentation. To tie these ideas together we compute multiple segmentations of each image and then: (i) learn the object classes; and (ii) choose the correct segmentations. We demonstrate that such an algorithm succeeds in automatically discovering many familiar objects in a variety of image datasets, including those from Caltech, MSRC and LabelMe.
Plugging 3G Mobile Networks into the Internet: A Prototype-Based Evaluation
Authors: Adetola Oredope, Antonio Liotta
Venue: Proceedings of the 15th International Conference on Computing (2006)

The Third Generation Mobile Network aims at providing present and future Internet services everywhere and at anytime using cellular technologies. This is based on its all-IP core network known as the IP Multimedia Subsystem which provides end-users with better QoS, charging and integration of different services. However, certain interoperability and interconnectivity limitations still exist, indicating that the convergence of the Internet and 3G networks is still not complete. We provide a prototype-based evaluation on the signalling interworking of end-toend services across the networks. Our results show crucial performance shortcomings of the standardised approach which requires immediate attention.
Stability analysis of robust adaptive filter used in feedforward and feedback compensation
Authors: M. Kajiki, J. Xin, H. Ohmori, A. Sano
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

This paper proposes robust adaptive algorithms for adjusting coefficients of an adaptive filter which is used for feedforward control together with a feedback compensator. The filtered-x algorithm which is widely employed in adaptive signal processing cannot always assure the stability. Stability-guaranteed adaptive algorithms are given in time domain and frequency domain on a basis of the strictly positive real property of adaptive systems in the presence of unknown disturbances. Time domain algorithms can be applied to an IIR or FIR adaptive filter, while frequency domain approaches use a structure of adaptive frequency sampling filter. Numerical simulations and experimentally obtained results exhibited significant improvement on convergency and stability of the proposed adaptive algorithms in application to adaptive active noise control.
Detecting chaotic behavior in HRV signals in a human cardiac transplant recipient
Authors: M. Vinson, L. Khadra, T. Maayah, H. Dickhaus
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

An investigation of the chaotic behavior in heart rate variability (HRV) signals of a normal person and a heart transplant recipient is presented. A statistical approach of chaos identification in time series is described and applied to HRV signals. This method compares the short-term predictability for a given time series to an ensemble of random data which has the same Fourier spectrum as the original time series. The forecasting error is computed as a statistic for performing statistical hypothesis testing. The results suggest that the HRV signal of the transplant recipient recorded three months after the transplanting shows the same dynamical behavior as that of the HRV signal for a normal person.
Applying Software Component Technology to NP-based System for Novel Network Services
Authors: Xian-Cheng Xu, Ling Zhang, Shou-Bin Dong
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

With the explosion of low-cost bandwidth availability, many desirable e-business features require new functionality in enterprise networking systems, and thus force the network components to be both flexible and powerful. Programmable routers (typically NP-based systems) as a platform on which to implement the enterprise applications seem to fit the bill. Meanwhile, the demands for accommodating an increasingly diverse range of novel network services in such system are still keep growing. To meet these challenges, this paper presents a novel methodology for building control plane software using component technology in programmable network environment. The proposed approach can facilitate the developing of scalable, flexible modular NP-based systems that are required to the e-business world.
Agile Project Initiation Techniques - The Inception Deck and Boot Camp
Authors: Jonathan Rasmusson
Venue: Proceedings of the conference on AGILE 2006 (2006)

Many Agile projects are doomed to fail before they even begin. Most projects fail not because of the technical ability of the team, but because project goals, objectives and context have not been taken into account when forming the project plan. Further, most teams new to Agile often lack the basic training required to be successful on their first Agile project. Using a lightweight project initiation framework (an inception deck), combined with an Agile boot camp, teams can drastically improve their project's chances of success. This will both ensure more Agile projects are delivered successfully, and aid Agile's adoption into the greater software community.
Multi-layer key management for secure multimedia multicast communications
Authors: Yan Sun, K. J. R. Liu
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

An important application of multicasting is group-oriented multimedia communication, such as video-on-demand and video conferencing. Before these services can be successfully deployed, security infrastructures must be developed to ensure access control to multicast content. In this paper, we present a multi-group key management scheme tailored to multimedia multicast services that distribute data in multi-layer or multi-object format. Compared with the existing tree-based key management schemes that are used for generic data multicasting services, the proposed scheme can reduce the communication overhead by a factor of (M + 1)/2 and M is the number of layers. For example, when the multimedia data is encoded into three layers according to different quality requirements, the proposed scheme reduces the communication overhead associated with key updating by 50%.
Detecting Edges in Noisy Multimedia Environments
Authors: Ethan E. Danahy, Sos S. Agaian, Karen A. Panetta
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

This paper examines the process of detecting edges using partial derivatives of Boolean functions in noisy multimedia environments. Applicable to binary and multi-bit (grayscale) data, this novel approach examines the binary representation of the original data to reconstruct edge locations within the scene. Competitive with traditional detectors in noise-free situations, the strength is its ability to detect edges in corrupted signals with no need for pre-filtering. Evaluation is performed on several synthetic and natural 2D images corrupted with impulse noise.
Knowledge-Based Support of Network Management Tasks Using Active Information Resource
Authors: Susumu Konno, Abar Sameera, Yukio Iwaya, Toru Abe, Tetsuo Kinoshita
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

A network system is a kind of large and complex systems and the network administrators are required exhaustive work to maintain the quality and functions of the network system. To reduce the load of administrators, systematic and intelligent facilities for the network management tasks should be realized and provided for administrators. In this paper, we propose a knowledge-based support method of the network management tasks using the active information resource (AIR) which has knowledges and functions for its information resource. Furthermore, a novel network management support system based on this method, called AIR-NMS, is also proposed by using the agent-based computing technologies. In the AIR-NMS, a lot of AIRs are defined and utilized in order to monitor and collect the status information of the network automatically. The AIRs are collaborated each other and inspect the behavior of the network. The network administrator can obtain useful supports for management in responses of AIR-NMS. Moreover, a prototype system is implemented to demonstrate and evaluate the essential functions of the AIR-NMS.
Grid Service Platform: Design and Implementation of Grid Middleware for Telecom Carriers
Authors: Soichi Shigeta, Nobutaka Imamura, Haruyasu Ueda, Hiromichi Kobashi, Miho Murata, Taketoshi Yoshida, Atsushi Kubota, Akira Asato, Yoshimasa Kadooka
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

We have developed the Grid Service Platform (GSP), which is a grid middleware for telecom carriers. GSP can support not only non-interactive batch style services, but also interactive real-time services. Moreover, GSP attains autonomous resource sharing between services based on the priority of each service. We conducted a field trial of GSP on a testbed that consisted of three sites in Japan and France. Two different types of services were implemented on GSP: a video conferencing service (interactive) and a batch queuing service (non-interactive). As a result, the performance of both services were simultaneously enhanced. The session capacity of the video conferencing service was improved by up to 30%, while the total execution time of batch jobs was reduced by 12%.
Indexing narrative structure and semantics in motion pictures with a probabilistic framework
Authors: B. Adams, C. Dorai, S. Venkatesh, H. H. Bui
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

This work constitutes the first attempt to extract an important narrative structure, the 3-Act story telling paradigm, in film. This narrative structure is prevalent in the domain of film as it forms the foundation and framework in which the film can be made to function as an effective tool for story telling, and its extraction is a vital step in automatic content management for film data. A novel act boundary likelihood function for Act 1 is derived using a Bayesian formulation under guidance from film grammar, tested under many configurations and the results are reported for experiments involving 25 full length movies. The formulation is shown to be a useful tool in both the automatic and semi-interactive setting for semantic analysis of film.
An Approximate Algorithm for Resource Allocation Using Combinatorial Auctions
Authors: Viswanath Avasarala, Himanshu Polavarapu, Tracy Mullen
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties exist to the adoption of CAs in time-constrained environments. The first difficulty involves the computational complexity of winner determination. The second difficulty entails the computational complexity of eliciting utility valuations for all possible combinations of resources to different tasks. To address both issues, we developed a new algorithm, Seeded Genetic Algorithm (SGA) for finding high quality solutions quickly. SGA uses a novel representational schema that produces only feasible solutions. We compare the winner determination performance of our algorithm with Casanova, another local stochastic search procedure, on typically hard-to-solve bid distributions. We show that SGA converges to a better solution than Casanova for large problem sizes. However, for many bid distributions, exact winner determination using integer programming approaches is very fast, even for large problem sizes. In these cases, SGA can still provide significant time savings by eliminating the requirement for formulating all possible bids.
The danger of short-term validation for lake models
Authors: M. Dahl, D. I. Wilson
Venue: International Journal of Modelling and Simulation (2006)

Lake models have the potential to assist decision-making authorities regarding issues in environmental planning. However, validating ecosystem models over relatively short time spans can lead to deceptively good results, especially if the initial conditions of poorly known states are themselves regressed. This is most noticeable when the ecosystem is not in a steady periodic cycle, such as is the case with large lakes. These problems are illustrated using a water-quality lake model for Lake Vänern in Sweden compared with over a century of validation data. This paper shows that it is possible to construct a convincing, but erroneous, 30-year simulation at the expense of exhausting the accumulated phosphorus in the sediment. To address this problem, it is necessary to use validation data collected over much longer time spans, such as 100 years. Consequently, this work highlights the extensive data collection requirements for the adequate validation of freshwater ecosystems.
Synthesizing Free-Viewpoint Images from Multiple View Videos in Soccer Stadium
Authors: Kunihiko Hayashi, Hideo Saito
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

We propose a new method for synthesizing freeviewpoint images from multiple view videos in soccer stadium. The previous method[1] can synthesize virtual viewpoint images at only intermediate viewpoint between real cameras. The previous method estimates only pixel-wise correspondences between input images for synthesizing virtual viewpoint images without a 3D reconstruction. In this paper, we propose a new method that can synthesize virtual viewpoint images at free-viewpoints which are not limited at intermediate viewpoint by reconstructing simple 3D models. To reconstruct the object soccer scene, we perform camera calibration without marker objects because we can save labor to put such objects on the soccer ground. For reconstructing of dynamic regions, we employ a billboard representation of dynamic regions. The position of the billboard is determined by tracking the players. The billboard representation can realize a simple 3D reconstruction and transform textures into the appropriate appearance of the aspect of dynamic regions at virtual viewpoint. We also introduce the choice of optimal cameras for rendering on the billboard. We choose the optimal camera that has the most similar texture at virtual viewpoint. By applying our method to a soccer scene, we can synthesize free-viewpoint images by employing only pixel values of real images.
A Technique and Markup Language for Business Process Automation
Authors: Kuldar Taveter
Venue: Proceedings of the 10th IEEE on International Enterprise Distributed Object Computing Conference Workshops (2006)

In this article, we propose a technique and markup language for complementing the automation of public business processes between enterprises by an intelligent support by software agents for decision-making within an enterprise. The article first argues that the ROADMAP and RAP/AOR methodologies can be jointly used for business process modelling. The ROADMAP methodology enables to create the models of the goals to be achieved and the roles needed for achieving them, while with the RAP/AOR methodology we can model when are the goals to be achieved and how they are to be achieved. Next, we describe the markup language defined by us and show how business process models represented by means of RAP/AOR can be transformed into the markup language. Finally, we show how the business process models represented in the markup language can be executed by software agents. The approach introduced in the article constitutes an efficient way of implementing business process automation systems based on XML and software agents.