ppxscal/embedding_network huggingface dataset:
Application of heuristic and hybrid-GASA algorithms to tool-path optimization problem for minimizing airtime during machining
Authors: Cuneyt Oysu, Zafer Bingul
Venue: Engineering Applications of Artificial Intelligence (2009)

In this paper, heuristic algorithms such as simulated annealing (SA), genetic algorithm (GA) and hybrid algorithm (hybrid-GASA) were applied to tool-path optimization problem for minimizing airtime during machining. Many forms of SA rely on random starting points that often give poor solutions. The problem of how to efficiently provide good initial estimates of solution sets automatically is still an ongoing research topic. This paper proposes a hybrid approach in which GA provides a good initial solution for SA runs. These three algorithms were tested on three-axis-cartesian robot during milling of wood materials. Their performances were compared based on minimum path and consequently minimum airtime. In order to make a comparison between these algorithms, two cases among the several milling operations were given here. According to results obtained from these examples, hybrid algorithm gives better results than other heuristic algorithms alone. Due to combined global search feature of GA and local search feature of SA, hybrid approach using GA and SA produces about 1.5% better minimum path solutions than standard GA and 47% better minimum path solutions than standard SA.
Differentiated survivability with improved fairness in IP/MPLS-over-WDM optical networks
Authors: Krishanthmohan Ratnam, Mohan Gurusamy, Luying Zhou
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2009)

This paper addresses the priority-fairness problem inherent in provisioning differentiated survivability services for sub-lambda connections associated with different protection-classes in IP/MPLS-over-WDM networks. The priority-fairness problem arises because, high-priority connections requiring high quality of protection such as lambda level pre-configured lightpath protection are more likely to be rejected when compared to low-priority connections which may not need such a high quality of protection. A challenging task in addressing this problem is that, while improving the acceptance rate of high-priority connections, low-priority connections should not be over-penalized. We propose two solution-approaches to address this problem. In the first approach, a new inter-class backup resource sharing (ICBS) technique and a differentiated routing scheme (DiffRoute) are adopted. The ICBS is investigated in two methods: partial- and full-ICBS (p-ICBS and f-ICBS) methods. The DiffRoute scheme uses different routing criteria for the traffic classes. In the second approach, two rerouting schemes are developed. The rerouting schemes are applied with the DiffRoute and ICBS. The rerouting schemes employ inter-layer backup resource sharing and inter-layer primary-backup multiplexing for the benefit of high-priority connections, thus improving fairness. Our findings are as follows. (1) The application of p-ICBS and DiffRoute yields improved performance for high-priority connections. However, it shows penalized performance for low-priority connections. On the other hand, the collective application of f-ICBS and DiffRoute yields significantly improved performance for high-priority connections with no penalized performance as the performance of low-priority connections is also improved. (2) The rerouting schemes, when applied with the DiffRoute and ICBS methods, further improve the performance of high-priority traffic without significantly affecting the performance of other traffic.
Path-loss model for UHF bands IV and V
Authors: J. M. Zamanillo, C. Pérez-Vega, B. Cobo
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

An empirical propagation model for UHF bands IV and V (450 to 1000 MHz) is presented. The model is a computational form of the data from the UIT-R (formerly CCIR) propagation curves for 50% locations, 50% of time. It is aimed to be used by practicing engineers and allows the estimation of median path loss, received power or electric field strength which is usually sufficient in many practical applications for outdoor communication systems.
Weighted-Clustering Cooperative Spectrum Sensing in Cognitive Radio Context
Authors: Chunmei Qi, Jun Wang, Shaoqian Li
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

In this paper, in order to improve the sensing performance which can be severely degraded when the sensing observations are forwarded to fusion center through fading channels, we apply the clustering method into cooperative spectrum sensing by forming all the secondary users into a few clusters and selecting the most favorable user in each cluster to report sensing results to the data fusion center. This method can exploit the user selection diversity so that the sensing performance can be enhanced. Furthermore, the soft combination EGC and two bit hard combination are introduced to improve the detection performance and reduce transmitting overhead. Compared with conventional sensing scheme, numerical results show that the sensing performance is improved significantly.
Medical data processing in the United States
Authors: Marion J. Ball
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

In the past few years, there has been a sharp rise in the demand for health care services of all types by a larger and increasingly more well-informed public. At the same time, the cost of delivering high quality care is becoming formidable for hospital and patient alike. The introduction of the computer and information management techniques is considered by many informed health professionals and knowledgeable leaders in the medical computer field to be a solution to some of the major health management problems we are confronted with today.
Crossing textual and visual content in different application scenarios
Authors: Julien Ah-Pine, Marco Bressan, Stephane Clinchant, Gabriela Csurka, Yves Hoppenot, Jean-Michel Renders
Venue: Multimedia Tools and Applications (2009)

This paper deals with multimedia information access. We propose two new approaches for hybrid text-image information processing that can be straightforwardly generalized to the more general multimodal scenario. Both approaches fall in the trans-media pseudo-relevance feedback category. Our first method proposes using a mixture model of the aggregate components, considering them as a single relevance concept. In our second approach, we define trans-media similarities as an aggregation of monomodal similarities between the elements of the aggregate and the new multimodal object. We also introduce the monomodal similarity measures for text and images that serve as basic components for both proposed trans-media similarities. We show how one can frame a large variety of problem in order to address them with the proposed techniques: image annotation or captioning, text illustration and multimedia retrieval and clustering. Finally, we present how these methods can be integrated in two applications: a travel blog assistant system and a tool for browsing the Wikipedia taking into account the multimedia nature of its content.
Minimizing makespan in a flow shop with two batch-processing machines using simulated annealing
Authors: Praveen Kumar Manjeshwar, Purushothaman Damodaran, Krishnaswami Srihari
Venue: Robotics and Computer-Integrated Manufacturing (2009)

This paper aims at minimizing the makespan of two batch-processing machines in a flow shop. The processing times and the sizes of the jobs are known and non-identical. The machines can process a batch as long as its capacity is not exceeded. The processing time of a batch is the longest processing time among all the jobs in that batch. The problem under study is NP-hard for makespan objective. Consequently, a heuristic based on Johnson's algorithm and a simulated annealing (SA) algorithm is proposed. Random instances were generated to verify the effectiveness of the proposed approaches. The results obtained from SA were compared with the proposed heuristic and a commercial solver. The SA outperformed both the heuristic and the commercial solver. On larger problem instances, the heuristic outperformed the commercial solver.
Minimum Cost Broadcast Routing with Forbidden Set for Ad-Hoc Networks
Authors: Chia-Hung Yen, Hwang-Cheng Wang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

In many wireless applications, it is necessary for one device in an ad-hoc network to send data to all the other devices. In this paper, broadcast routing algorithms that aim to minimize the cost of the routing path are proposed. A new cost model is formulated by taking into account the remaining battery energy and battery discharge profile at each node. A minimum cost broadcast routing scheme based on spanning tree algorithm is presented. A second routing protocol is obtained by incorporating the notion of forbidden set. The difference between these and other approaches is highlighted by showing the broadcast trees constructed by each method. Performance is then investigated using several meaningful metrics. The results indicate that the proposed schemes can produce more robust broadcast routes.
A Vector Assignment Approach for the Graph Coloring Problem
Authors: Takao Ono, Mutsunori Yagiura, Tomio Hirata
Venue: Learning and Intelligent Optimization: Second International Conference, LION 2007 II, Trento, Italy, December 8-12, 2007. Selected Papers (2008)

We consider the relationship between the graph coloring problem (GCP) and the vector assignment problem (VAP). Given an undirected graph, VAP asks to assign a vector to each vertex so as to maximize the minimum angle between the vectors corresponding to adjacent vertices. We show that any solution to the VAP in the 2-dimensional space, which we call the 2-dimensional VAP (2VAP), gives a feasible coloring, and that such transformation can be computed efficiently. We also show that any optimal solution to 2VAP gives an optimal coloring for GCP. Based on this fact, we propose a heuristic algorithm for GCP, whose search space is the set of solutions for 2VAP. The algorithm is quite simple and can be considered as a variant of the threshold accepting. The experiments show that our algorithm works well for graphs with relatively low degree.
APLG-An APL based system for interactive computer graphics
Authors: W. K. Giloi, J. Encarnacao
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

Computer Graphics (CG) is in its essence interactive. The customary "batch processing" languages such as, for example, FORTRAN, ALGOL, PL/I, ..., are not primarily designed for interactive use. One of the main reasons for that is their relatively early binding time. Another handicap, particularly for CG, is a certain inadequacy of their control structure for the kind of dialog characterizing CG. Thus, the usual programming packages for CG based on one of the above mentioned high-level languages have to be augmented by devices which allow the system to lend control to the user, together with a simple command language which enables the user to execute temporarily control over the system. The commands are given to a command language processor which works interpretatively, initiating, for instance, respective subroutine calls.
The future of the AP CS program
Authors: Paul T. Tymann, Laurie White
Venue: ACM SIGCSE Bulletin (2009)

The objective of this special session is to provide an opportunity for computer science educators, at both the college and high school level, to provide input to the AP CS Development Committee as it refines the curriculum for the A course in light of the elimination of the AB exam. The input and active participation of educators attending this special session will help the members AP CS Development Committee to define a course and exam that continues to meet the high standards for teaching and learning required in the comparable college course.
REAct: resource-efficient accountability for nodemisbehavior in ad hoc networks based on random audits
Authors: William Kozma, Loukas Lazos
Venue: Proceedings of the second ACM conference on Wireless network security (2009)

Wireless ad hoc networks rely on multi-hop routes to transport data from source to destination. The routing function is implemented in a collaborative manner, with each node responsible for relaying traffic to the destination. However, an increasingly sophisticated pool of users with easy access to commercial wireless devices, combined with the poor physical and software security of the devices, can lead to node misconfiguration or misbehavior. A misbehaving node may refuse to forward packets in order to conserve its energy (selfishness), or simply degrade network performance (maliciousness). In this paper, we investigate the problem of uniquely identifying the set of misbehaving nodes who refuse to forward packets. We propose a novel misbehavior identification scheme called REAct that provides resource-efficient accountability for node misbehavior. REAct identifies misbehaving nodes based on a series of random audits triggered upon a performance drop. We show that a source-destination pair using REAct can identify any number of independently misbehaving nodes based on behavioral proofs provided by nodes. Proofs are constructed using Bloom filters which are storage-efficient membership structures, thus significantly reducing the communication overhead for misbehavior detection.
Acquiring Rules for Rules: Neuro-Dynamical Systems Account for Meta-Cognition
Authors: Michail Maniadakis, Jun Tani
Venue: Adaptive Behavior - Animals, Animats, Software Agents, Robots, Adaptive Systems (2009)

Both animals and humans use meta-rules in their daily life, in order to adapt their behavioral strategies to changing environmental situations. Typically, the term meta-rule encompasses those rules that are applied to rules themselves. In cognitive science, conventional approaches for designing meta-rules follow human hardwired architectures. In contrast to previous approaches, this study employs evolutionary processes to explore neuronal mechanisms accounting for meta-level rule switching. In particular, we performed a series of experiments with a simulated robot that has to learn to switch between different behavioral rules in order to accomplish given tasks. Continuous time recurrent neural networks (CTRNN) controllers with either a fully connected or a bottleneck architecture were examined. The results showed that different rules are represented by separate self-organized attractors, while rule switching is enabled by the transitions among attractors. Furthermore, the results showed that neural network division into a lower sensorimotor level and a higher cognitive level enhances the performance of the robot in the given tasks. Additionally, meta-cognitive rule processing is significantly supported by the embodiment of the controller and the lower level sensorimotor properties of environmental interaction.
Performance comparison of middleware architectures for generating dynamic web content
Authors: Emmanuel Cecchet, Anupam Chanda, Sameh Elnikety, Julie Marguerite, Willy Zwaenepoel
Venue: Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware (2003)

On-line services are making increasing use of dynamically generated Web content. Serving dynamic content is more complex than serving static content. Besides a Web server, it typically involves a server-side application and a database to generate and store the dynamic content. A number of standard mechanisms have evolved to generate dynamic content. We evaluate three specific mechanisms in common use: PHP, Java servlets, and Enterprise Java Beans (EJB). These mechanisms represent three different architectures for generating dynamic content. PHP scripts are tied to the Web server and require writing explicit database queries. Java servlets execute in a different process from the Web server, allowing them to be located on a separate machine for better load balancing. The database queries are written explicitly, as in PHP, but in certain circumstances the Java synchronization primitives can be used to perform locking, reducing database lock contention and the amount of communication between servlets and the database. Enterprise Java Beans (EJB) provide several services and facilities. In particular, many of the database queries can be generated automatically. We measure the performance of these three architectures using two application benchmarks: an online bookstore and an auction site. These benchmarks represent common applications for dynamic content and stress different parts of a dynamic content Web server. The auction site stresses the server front-end, while the online bookstore stresses the server back-end. For all measurements, we use widely available open-source software (the Apache Web server, Tomcat servlet engine, JOnAS EJB server, and MySQL relational database). While Java servlets are less efficient than PHP, their ability to execute on a different machine from the Web server and their ability to perform synchronization leads to better performance when the front-end is the bottleneck or when there is database lock contention. EJB facilities and services come at the cost of lower performance than both PHP and Java servlets.
Reading beside the lines: Using indentation to rank revisions by complexity
Authors: Abram Hindle, Michael W. Godfrey, Richard C. Holt
Venue: Science of Computer Programming (2009)

Maintainers often face the daunting task of wading through a collection of both new and old revisions, trying to ferret out those that warrant detailed inspection. Perhaps the most obvious way to rank revisions is by lines of code (LOC); this technique has the advantage of being both simple and fast. However, most revisions are quite small, and so we would like a way of distinguishing between simple and complex changes of equal size. Classical complexity metrics, such as Halstead's and McCabe's, could be used but they are hard to apply to code fragments of different programming languages. We propose a language-independent approach to ranking revisions based on the indentation of their code fragments. We use the statistical moments of indentation as a lightweight and revision/diff friendly metric to proxy classical complexity metrics. We found that ranking revisions by the variance and summation of indentation was very similar to ranking revisions by traditional complexity measures since these measures correlate with both Halstead and McCabe complexity; this was evaluated against the CVS histories of 278 active and popular SourceForge projects. Thus, we conclude that measuring indentation alone can serve as a cheap and accurate proxy for computing the code complexity of revisions.
A methodology for input data management in discrete event simulation projects
Authors: Anders Skoogh, Björn Johansson
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Discrete event simulation (DES) projects rely heavily on high input data quality. Therefore, the input data management process is very important and, thus, consumes an extensive amount of time. To secure quality and increase rapidity in DES projects, there are well structured methodologies to follow, but a detailed guideline for how to perform the crucial process of handling input data, is missing. This paper presents such a structured methodology, including description of 13 activities and their internal connections. Having this kind of methodology available, our hypothesis is that the structured way to work increases rapidity for input data management and, consequently, also for entire DES projects. The improvement is expected to be larger in companies with low or medium experience in DES.
Crafting an environment for collaborative reasoning
Authors: Susanne C. Hupfer, Steven I. Ross, Jamie C. Rasmussen, James E. Christensen, Stephen E. Levy, Daniel M. Gruen, John F. Patterson
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2009)

We motivate the need for new environments for collaborative reasoning and describe the foundations of our approach, namely collaboration, semantics, and adaptability. We describe the CRAFT collaborative reasoning interface and infrastructure that we are developing to explore this approach.
Five Weeks in the Robot House - Exploratory Human-Robot Interaction Trials in a Domestic Setting
Authors: Kheng Lee Koay, Dag Sverre Syrdal, Michael L. Walters, Kerstin Dautenhahn
Venue: Proceedings of the 2009 Second International Conferences on Advances in Computer-Human Interactions (2009)

This paper presents five exploratory trials investigating scenarios likely to occur when a personal robot shares a home with a person. The scenarios are: a human and robot working on a collaborative task, a human and robot sharing a physical space in a domestic setting, a robot recording and revealing personal information, a robot interrupting a human in order to serve them, and finally, a robot seeking assistance from a human through various combinations of physical and verbal cues. Findings indicate that participants attribute more blame and less credit to a robot than compared to themselves when working together on a collaborative task. Safety is a main concern when determining participants' comfort when sharing living space with their robot. Findings suggest that the robot should keep its interruption of the user's activities to a minimum. Participants were happy for the robot to store information which is essential for the robot to improve its functionality. However, their main concerns were related to the storing of sensitive information and security measures to safeguard such information.
Information extraction challenges in managing unstructured data
Authors: AnHai Doan, Jeffrey F. Naughton, Raghu Ramakrishnan, Akanksha Baid, Xiaoyong Chai, Fei Chen, Ting Chen, Eric Chu, Pedro DeRose, Byron Gao, Chaitanya Gokhale, Jiansheng Huang, Warren Shen, Ba-Quy Vuong
Venue: ACM SIGMOD Record (2009)

Over the past few years, we have been trying to build an end-to-end system at Wisconsin to manage unstructured data, using extraction, integration, and user interaction. This paper describes the key information extraction (IE) challenges that we have run into, and sketches our solutions. We discuss in particular developing a declarative IE language, optimizing for this language, generating IE provenance, incorporating user feedback into the IE process, developing a novel wiki-based user interface for feedback, best-effort IE, pushing IE into RDBMSs, and more. Our work suggests that IE in managing unstructured data can open up many interesting research challenges, and that these challenges can greatly benefit from the wealth of work on managing structured data that has been carried out by the database community.