ppxscal/embedding_network huggingface dataset:
Hybrid Fuzzy-Genetic Algorithm Approach for Crew Grouping
Authors: Hongbo Liu, Zhanguo Xu, Ajith Abraham
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

Crew grouping is an important problem and formulating a good solution always involves many challenges. For example, grouping soldiers intelligently to tank combat units, we should take into consideration the combined technical proficiency of the soldiers, the amount of military training, the units from which the soldiers come, their service age, personal background, etc. In this paper, we propose a hybrid Fuzzy-Genetic Algorithm (FGA) approach to solve the crew grouping problem. Fuzzy logic based controllers are applied to fine-tune dynamically the crossover and mutation probability in the genetic algorithms, in an attempt to improve the algorithm performance. The FGA approach is compared with the Standard Genetic Algorithm (SGA). Empirical results clearly demonstrates that while the SGA approach gives satisfactory solutions for the problem, the FGA method usually performs significantly better.
Modeling Interactions using Role-Driven Patterns
Authors: Isabel Diaz, Oscar Pastor, Alfredo Matteo
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

Recently, great interest in model-driven approaches that are based on the automatic transformation of models has emerged. In this software development paradigm, the models and their transformations are specified at a high abstraction level supporting evolution, refinement and code generation. One of the benefits that these approaches try to achieve is improving the software quality through the reusability of well proven patterns. In order to achieve this goal, this paper presents an approach that defines patterns to transform Use Case Models into Interaction Models. This approach uses roles to capture the linguistic abstractions on the use case text as well as to describe the corresponding interaction. The roles are defined as model elements to guarantee genericity. In this way, the transformation patterns are independent of a specific domain or a technological platform. The defined patterns have been validated. Some of the validation results are also presented in this paper.
Effectively Maintaining Single View Consistency in Web Warehouses
Authors: Yan Zhang, Xiangdong Qin
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Web warehouse provides high availability and efficiency by utilizing materialized webviews, which should be refreshed in time to keep freshness. During the refreshing, the consistency between a webview and its base data, which is formally named single view consistency (abbreviated as SVC), must be guaranteed. Since the base data changes in a web warehousing environment do not propagate from data sources to the information consumers, which is far different from the case in the traditional data warehouses, we must pursue new maintenance methods. In this paper we first introduce the definition for SVC, and then we present an algorithm RCA to keep SVC as well as an effective base data change detection method SAA. We illustrate that RCA and SAA can guarantee SVC and they are effective in the web environment.
Multi-step motion planning: application to free-climbing robots
Authors: Stephen M. Rock
Venue:  (2005)

This dissertation addresses the problem of planning the motion of a multi-limbed robot to &ldquo;free-climb&rdquo; vertical rock surfaces. Free-climbing relies on natural features and friction (such as holes or protrusions) rather than special fixtures or tools. It requires strength, but more importantly it requires deliberate reasoning: not only must the robot decide how to adjust its posture to reach the next feature without falling, it must plan an entire sequence of steps, where each one might have future consequences. This process of reasoning is called multi-step planning. A multi-step planning framework is presented for computing non-gaited, free-climbing motions. This framework derives from an analysis of a free-climbing robot's configuration space, which can be decomposed into constraint manifolds associated with each state of contact between the robot and its environment. An understanding of the adjacency between manifolds motivates a two-stage strategy that uses a candidate sequence of steps to direct the subsequent search for motions. Three algorithms are developed to support the framework. The first algorithm reduces the amount of time required to plan each potential step, a large number of which must be considered over an entire multi-step search. It extends the probabilistic roadmap (PRM) approach based on an analysis of the interaction between balance and the topology of closed kinematic chains. The second algorithm addresses a problem with the PRM approach, that it is unable to distinguish challenging steps (which may be critical) from impossible ones. This algorithm detects impossible steps explicitly, using automated algebraic inference and machine learning. The third algorithm provides a fast constraint checker (on which the PRM approach depends), in particular a test of balance at the initially unknown number of sampled configurations associated with each step. It is a method of incremental precomputation, fast because it takes advantage of the sample distribution. Validation with real hardware was done with a four-limbed, free-climbing robot called LEMUR (developed by the Mechanical and Robotic Technologies Group at NASA-JPL). Using the multi-step planner presented in this dissertation, LEMUR free-climbed an indoor, near-vertical surface with artificial rock features. It did so with limited control and sensing, demonstrating that planning is absolutely critical.
Achieving a More Accurate Skeleton through the Refinement of Skeletonization Triangles
Authors: Paul Morrison, Ju Jia Zou
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

Skeletonization using the Constrained Delaunay Triangulation technique has proven very effective, with respect to efficiency, accuracy and robustness against noise. This paper presents three algorithms that further improve this successful skeletonization method. Each of the three algorithms presented here deals with the refinement of the three types of triangles produced by triangulation, namely end triangles, normal triangles and junction triangles. Results show that these algorithms produce a skeleton that complies much better to a human's perception of the underlying image, without detracting from the superior efficiency inherent in the original triangulation method.
SEVA: sensor-enhanced video annotation
Authors: Xiaotao Liu, Mark Corner, Prashant Shenoy
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

In this paper, we study how a sensor-rich world can be exploited by digital recording devices such as cameras and camcorders to improve a user's ability to search through a large repository of image and video files. We design and implement a digital recording system that records identities and locations of objects (as advertised by their sensors) along with visual images (as recorded by a camera). The process, which we refer to as sensor-enhanced video annotation (SEVA), combines a series of correlation, interpolation, and extrapolation techniques. It produces a tagged stream that later can be used to efficiently search for videos or frames containing particular objects or people. We present detailed experiments with a prototype of our system using both stationary and mobile objects as well as GPS and ultrasound. Our experiments show that: (i) SEVA has zero error rates for static objects, except very close to the boundary of the viewable area; (ii) for moving objects or a moving camera, SEVA only misses objects leaving or entering the viewable area by 1-2 frames; (iii) SEVA can scale to 10 fast moving objects using current sensor technology; and (iv) SEVA runs online using relatively inexpensive hardware.
Inventory simulation and optimization using system dynamics, structural modeling equations and genetic algorithms in the drivetrain division of an automotive manufacturer
Authors: Ali Kashef, Ronald O'Meara
Venue:  (2005)

Strategic planning and control are among the most critical activities that modern enterprises require to succeed in the global economy. This research is an original study that investigated the combination of tools and methodologies in order to apply them to a midwestern tractor manufacturer. The current study identified the constraints applicable to a polishing line in the Drivetrain Division of a major tractor manufacturer interested in exploring alternative techniques to improve its worldwide manufacturing operations. The specific questions that this project tried to respond are stated as follows: (1) What were the most important variables that affected inventory levels of an assembly line of an automotive manufacturer? (2) What were the significant effects of the causal relationships identified in order to determine an initial model structure? (3) What constrains restrict the behavior and improvement of the selected variables? (4) What levels of the selected variables could be used in order to improve production levels? The current research explored the impact of a series of variables (work-in process, process utilization, cycle time, queue size, utilization of work centers, capacity, and others) in order to examine their impact in the overall performance of the polishing line. Two main models were developed based on two algorithms created for each of the selected part families (PTO and Covers), and in combination determined material flow, resource utilization, and sequencing within and outside the automatic polishing line. The two computer models combined both dynamic and discrete simulation to establish a reference to be used for improvement of similar processes within the company using structural equations modeling, path analysis, scatter plot diagrams, and eigen value plot. Besides, the results of this research indicated that: (a) cycle time can be improved with the addition of a new transporter in order to reduce the moving time within and between work centers; (b) the queue sizes of the polishing line were not improved significantly using either genetic algorithms (GA) and full factorial designs because of the low initial variability of the system; (c) the structural modeling equations model allowed to identify possible material flow errors based on its relationships, in this way it is possible to have a benchmark to compare both the results of the current study and the outcomes of similar studies developed by the company. In summary, a new methodology has been developed in order to study and optimize manufacturing systems, and avoid cost reductions without any statistical significance that might affect the strategic position of the company in the long run. The current study did not give a simple answer to the complexity of the discussed problem, but an alternative to many of the current academic and industrial solutions that can have more than one correct answer.
What hath got Roth: horrors of the wax museum
Authors: Paul F. Roth
Venue: ACM SIGSIM Simulation Digest (1975)

I was in Atlanta earlier this year and had the occasion to visit the wax museum at Underground Atlanta. Near the end of the tour, two events occured which have a bearing on Charlie McCarthy.
No Junk, no Peeking, Serious Offers Only: P2P File Exchange in Wireless Ad-hoc Networks
Authors: Ryan Vogt, Ioanis Nikolaidis, Pawel Gburzynski
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

We consider the problem of anonymous file exchange in wireless ad-hoc networks. We propose a new protocol, dubbed RASH (Roam And SHare), to address the problem. RASH is a peer-to-peer (P2P) protocol which fulfills three objectives: (a) protection of user privacy (understood as the confidentiality of their interests), (b) support for a high degree of file authentication and integrity (to reduce or eliminate false downloads and spoofs), and (c) enforcement of reciprocity (to remove freeloaders from the system). The environment of our scheme is purely ad-hoc, in that it does not assume pre-established trust, fixed-infrastructure, or the existence of specialized nodes.
Multi-sensor agent-based intrusion detection system
Authors: Richard A. Wasniowski
Venue: Proceedings of the 2nd annual conference on Information security curriculum development (2005)

The purpose of this paper is to discuss implementation of prototype multi-sensor agent-based intrusion detection system. We assume that it is possible to obtain data in tcpdump format. Using this standard allows a consistent presentation and interpretation of network traffic. We are especially interested in analyzing traffic that has an abnormal or malicious character and should prompt a closer look. In this paper we propose a framework for a multi-sensor agent-based intrusion detection system to support such analyses and response. A specific feature of the model is that the agents use multiple sensors to generate log files. We have developed a prototype based on this framework. This paper discusses also the issues of combining intelligent agent technology with intrusion detection methodology.
Computing dynamic output feedback laws with pieri homotopies on a parallel computer
Authors: Yusong Wang
Venue:  (2005)

The output feedback pole placement problem asks to find laws to feed the output of a plant governed by a linear system of differential equations back to the input of the plant, so that the resulting closed-loop system has a desired set of eigenvalues. In 1981, R. W. Brocket and C. I. Byrnes published the theoretical relations between the static output feedback pole placement problem and enumerative geometry problem. In 1996, M. S. Ravi, J. Rosenthal, and X. Wang generalized the theory to solve the dynamic output feedback pole placement problem for general Multi-Input-Multi-Output (MIMO) systems. The output feedback pole placement problem was still stated as an open problem at this time, since there was no algorithm to solve it. In 1998, B. Huber, F. Sottile, and B. Sturmfels proposed &ldquo;numerical Schubert calculus&rdquo;, which led to an efficient homotopy algorithm to solve the enumerative geometry problem. In this thesis, we present symbolic-numeric algorithms to turn the solutions of the homotopies to the output feedback laws of the pole placement problem. Despite the wider application range of the dynamic output feedback laws, the realization of the output of the numerical homotopies as a machine to control the plant in the time domain has not been addressed before. Since the numeric calculation of the Smith normal form is essential for minimal realization of the output feedback laws and the inverse of a polynomial matrix, an original algorithm through computing the extended GCD of two polynomials with the root matching method is implemented. To efficiently solve high dimensional problems with a very large number of solutions, a parallel Pieri homotopy algorithm is designed and implemented. We successfully applied our numerical approach for solving the output feedback pole placement problem to several applications from the literature. Both the realization algorithm and parallel Pieri homotopies are implemented in PHCpack (ACM TOMS 795), a publicly available software package for solving polynomial system with homotopy methods.
Z-Ring: Fast Prefix Routing via a Low Maintenance Membership Protocol
Authors: Qiao Lian, Zheng Zhang, Shaomei Wu, Ben Y. Zhao
Venue: Proceedings of the 13TH IEEE International Conference on Network Protocols (2005)

In this paper, we introduce Z-Ring, a fast prefix routing protocol for peer-to-peer overlay networks. Z-Ring incorporates cost-efficient membership protocol to achieve fast routing with small maintenance cost. Z-Ring achieves routing in logGN steps, where N is the network size and G is the size of a group that can be maintained by a membership protocol with low cost. With G=4096, it translates to one-hop routing for intranet environments (N
Multi-Planar Projection by Fixed-Center Pan-Tilt Projectors
Authors: Ikuhisa Mitsugami, Norimichi Ukita, Masatsugu Kidode
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

We describe a new steerable projector, whose projection center precisely corresponds with its rotation center, which we call a "fixed-center pan-tilt (FC-PT) projector." This mechanism allows it be set up more easily to display graphics precisely on the planes in the environment than for other steerable projectors; wherever we would like to display graphics, all we have to do are locating the FC-PT projector in the environment, and directing it to the corners of the planes whose 2D sizes have been measured. Moreover, as the FC-PT projector can recognize automatically whether each plane is connected to others, it can display visual information that lies across the boundary line of two planes in a similar way to a paper poster folded along the planes.
The Round Functions of Cryptosystem PGM Generate the Symmetric Group
Authors: A. Caranti, F. Dalla. Volta
Venue: Designs, Codes and Cryptography (2006)

S. S. Magliveras et al. have described symmetric and public key cryptosystems based on logarithmic signatures (also known as group bases) for finite permutation groups.In this paper we show that if G is a nontrivial finite group which is not cyclic of order a prime, or the square of a prime, then the round (or encryption) functions of these systems, that are the permutations of G induced by the exact-transversal logarithmic signatures (also known as transversal group bases), generate the full symmetric group on G.This answers a question of S. S. Magliveras, D. R. Stinson and Tran van Trung.
Supporting Development and Evolution of Service-based Processes
Authors: Martin Henkel, Jelena Zdravkovic
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

When designing executable enterprise processes, the alignment between business and technical requirements is still one of the central problems. Process specifications obtained from the pure business perspective commonly cannot be executed "as-is" due to constraints of information systems given in the form of existing software services. In this paper we introduce several concepts targeted towards aligning business processes and service-based systems. The notion of realization levels is introduced to discern the level of business conformance. Furthermore, a model of system constraints is introduced to guide the developer to process realizations with high business conformance. By the combined use of the concepts, structured development and evolution of process realizations is enabled by continuous tracking of the alignment between business and the supporting technology.
A web-based system for collaborative annotation of large image and video collections: an evaluation and user study
Authors: Timo Volkmer, John R. Smith, Apostol (Paul) Natsev
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

Annotated collections of images and videos are a necessary basis for the successful development of multimedia retrieval systems. The underlying models of such systems rely heavily on quality and availability of large training collections. The annotation of large collections, however, is a time-consuming and error prone task as it has to be performed by human annotators. In this paper we present the IBM Efficient Video Annotation (EVA) system, a server-based tool for semantic concept annotation of large video and image collections. It is optimised for collaborative annotation and includes features such as workload sharing and support in conducting inter-annotator analysis. We discuss initial results of an ongoing user-evaluation of this system. The results are based on data collected during the 2005 TRECVID Annotation Forum, where more than 100 annotators have been using the system.
Optimality of an $(s, S)$ Policy with Compound Poisson and Diffusion Demands: A Quasi-variational Inequalities Approach
Authors: Alain Bensoussan, R. H. Liu, Suresh P. Sethi
Venue: SIAM Journal on Control and Optimization (2005)

We prove that an $(s, S)$ policy is optimal in a continuous-review stochastic inventory model with a fixed ordering cost when the demand is a mixture of (i) a diffusion process and a compound Poisson process with exponentially distributed jump sizes, and (ii) a constant demand and a compound Poisson process. The proof uses the theory of impulse control. The Bellman equation of dynamic programming for such a problem reduces to a set of quasi-variational inequalities (QVI). An analytical study of the QVI leads to showing the existence of an optimal policy as well as the optimality of an $(s, S)$ policy. Finally, the combination of a diffusion and a general compound Poisson demand is not completely solved. We explain the difficulties and what remains open. We also provide a numerical example for the general case.
An Efficient Support Vector Machine Learning Method with Second-Order Cone Programming for Large-Scale Problems
Authors: Rameswar Debnath, Masakazu Muramatsu, Haruhisa Takahashi
Venue: Applied Intelligence (2005)

In this paper we propose a new fast learning algorithm for the support vector machine (SVM). The proposed method is based on the technique of second-order cone programming. We reformulate the SVM's quadratic programming problem into the second-order cone programming problem. The proposed method needs to decompose the kernel matrix of SVM's optimization problem, and the decomposed matrix is used in the new optimization problem. Since the kernel matrix is positive semidefinite, the dimension of the decomposed matrix can be reduced by decomposition (factorization) methods. The performance of the proposed method depends on the dimension of the decomposed matrix. Experimental results show that the proposed method is much faster than the quadratic programming solver LOQO if the dimension of the decomposed matrix is small enough compared to that of the kernel matrix. The proposed method is also faster than the method proposed in (S. Fine and K. Scheinberg, 2001) for both low-rank and full-rank kernel matrices. The working set selection is an important issue in the SVM decomposition (chunking) method. We also modify Hsu and Lin's working set selection approach to deal with large working set. The proposed approach leads to faster convergence.