ppxscal/embedding_network huggingface dataset:
Multiobjective Landscape Analysis and the Generalized Assignment Problem
Authors: Deon Garrett, Dipankar Dasgupta
Venue: Learning and Intelligent Optimization: Second International Conference, LION 2007 II, Trento, Italy, December 8-12, 2007. Selected Papers (2008)

The importance of tuning a search algorithm for the specific features of the target search space has been known for quite some time. However, when dealing with multiobjective problems, there are several twists on the conventional notions of fitness landscapes. Multiobjective optimization problems provide additional difficulties for those seeking to study the properties of the search space. However, the requirement of finding multiple candidate solutions to the problem also introduces new potentially exploitable structure. This paper provides a somewhat high-level overview of multiobjective search space and fitness landscape analysis and examines the impact of these features on the multiobjective generalized assignment problem.
Cardio-OP: Gallery of Cardiac Surgery
Authors: Wolfgang Klas, Christian Greiner, Reinhard Friedl
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

Next generations of online multimedia training and education applications call for new approaches for the creation, storage, maintenance, commercial marketing, and publishing of multimedia content. The project "Gallery of Cardiac Surgery" (Cardio-OP) aims at the development of an Internet-based database-driven multimedia information system for physicians, medical lecturers, students, and patients in the domain of cardiac surgery. The research project has a volume of about 3.3 Million Euro and constitutes a total effort of about 41 person years. Scientific contributions of Cardio-OP include a new approach towards the organization and online distribution of multimedia content, its creation and authoring, and its maintenance in a multimedia repository. The resulting information system is intended to be applicable to other application domains, such as continuous education and training programs for employees in production processes. The paper presents details on the project background and motivation, overall goals and objectives, and outlines some of the approaches taken and results achieved.
A Method of Multi-Sinks Query in Wireless Sensor Networks
Authors: Qunhua Pan, Ming Xu, Changsheng Jia
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

Distributed wireless sensor networks will play an important role in the future. In wireless sensor networks, observers are interested in spatio-temporal information monitored by sensors. It is crucial to design and employ energy-efficient query processing since nodes are battery-powered, and thus their lifetimes are limited. This paper proposed a query source sharing approach to optimizing query processing in multi-sinks sensor network. Firstly, basic query conception is defined. All region queries can be linearly expressed by basic queries. Secondly, a data transfer routing establish method was designed. Energy dissipation can be reduced by sharing same query data in multi-sinks sensor network. Simulation results shows that energy cost can be 25% reduced.
Filtering in Generalized Signal-Dependent Noise Model Using Covariance Information
Authors: Seiichi Nakamori, María J. GarcÍA-Ligero, Aurora Hermoso-Carazo, Josefa Linares-PÉRez
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In this paper, we propose a recursive filtering algorithm to restore monochromatic images which are corrupted by general dependent additive noise. It is assumed that the equation which describes the image field is not available and a filtering algorithm is obtained using the information provided by the covariance functions of the signal, noise that affects the measurement equation, and the fourth-order moments of the signal. The proposed algorithm is obtained by an innovation approach which provides a simple derivation of the least mean-squared error linear estimators. The estimation of the grey level in each spatial coordinate is made taking into account the information provided by the grey levels located on the row of the pixel to be estimated. The proposed filtering algorithm is applied to restore images which are affected by general signal-dependent additive noise.
A Combined Matrix Ensemble of Low-Density Parity-Check Codes for Correcting a Solid Burst Erasure
Authors: Gou Hosoya, Toshiyasu Matsushima, Shigeichi Hirasawa
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

A new ensemble of low-density parity-check (LDPC) codes for correcting a solid burst erasure is proposed. This ensemble is an instance of a combined matrix ensemble obtained by concatenating some LDPC matrices. We derive a new bound on the critical minimum span ratio of stopping sets for the proposed code ensemble by modifying the bound for ordinary code ensemble. By calculating this bound, we show that the critical minimum span ratio of stopping sets for the proposed code ensemble is better than that of the conventional one with keeping the same critical exponent of stopping ratio for both ensemble. Furthermore from experimental results, we show that the average minimum span of stopping sets for a solid burst erasure of the proposed codes is larger than that of the conventional ones.
Hadwiger's conjecture for proper circular arc graphs
Authors: Naveen Belkale, L. Sunil Chandran
Venue: European Journal of Combinatorics (2009)

Circular arc graphs are graphs whose vertices can be represented as arcs on a circle such that any two vertices are adjacent if and only if their corresponding arcs intersect. Proper circular arc graphs are graphs which have a circular arc representation where no arc is completely contained in any other arc. Hadwiger's conjecture states that if a graph G has chromatic number k, then a complete graph with k vertices is a minor of G. We prove Hadwiger's conjecture for proper circular arc graphs.
Improving data centric storage with diffuse caching in wireless sensor networks
Authors: Keng-Teck Ma, King-Yip Cheng, King-Shan Lui, Vincent Tam
Venue: Wireless Communications Mobile Computing (2009)

In a sensor network that adopts data-centric storage (DCS), information of the same kind is kept in the same set of nodes. That is, when a sensor detects a certain event, no matter where it is, it sends the information to the designated location. When another node wants the information, it can send a query to that location to retrieve it. Unfortunately, existing protocols based on DCS are prone to the hot-spot problem where some nodes have to handle lots of messages. In this paper, we study how to apply diffuse caching on top of DCS. We diffuse popular information to other nodes so as to share the workloads. Our diffusing mechanism is adaptive that the distribution varies based on the popularity of the event type. We evaluate our protocol using simulations and the results show that our protocol successfully alleviates the hot-spot problem and reduces the message overheads. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Application of support vector machines in scour prediction on grade-control structures
Authors: Arun Goel, Mahesh Pal
Venue: Engineering Applications of Artificial Intelligence (2009)

Research into the problem of predicting the maximum depth of scour on grade-control structures like sluice gates, weirs and check dams, etc., has been mainly of an experimental nature and several investigators have proposed a number of empirical relations for a particular situation. These traditional scour prediction equations, although offer some guidance on the likely magnitude of maximum scour depth, yet applicable to a limited range of the situations. It appears from the literature review that a regression mathematical model for predicting maximum depth of scour under all circumstances is not currently available. This paper explores the potential of support vector machines in modeling the scour from the available laboratory and field data obtained form the earlier published studies. To compare the results, a recently proposed empirical relation and a feed forward back propagation neural network model are also used in the present study. The outcome from the support vector machines-based modeling approach suggests a better performance in comparison to both the empirical relation and back propagation neural network approach with the laboratory data. The results also suggest an encouraging performance by the support vector machines learning technique in comparison to both empirical relation as well as neural network approach in scaling up the results from laboratory to field conditions for the purpose of scour prediction.
α lean TAP: A Declarative Theorem Prover for First-Order Classical Logic
Authors: Joseph P. Near, William E. Byrd, Daniel P. Friedman
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

We present &alpha; lean TA P, a declarative tableau-based theorem prover written as a pure relation. Like lean TA P, on which it is based, &alpha; lean TA P can prove ground theorems in first-order classical logic. Since it is declarative, &alpha; lean TA P generates theorems and accepts non-ground theorems and proofs. The lack of mode restrictions also allows the user to provide guidance in proving complex theorems and to ask the prover to instantiate non-ground parts of theorems. We present a complete implementation of &alpha; lean TA P, beginning with a translation of lean TA P into &alpha;Kanren, an embedding of nominal logic programming in Scheme. We then show how to use a combination of tagging and nominal unification to eliminate the impure operators inherited from lean TA P, resulting in a purely declarative theorem prover.
Making computers safer
Authors: Donn B. Parker
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

As computer technology accelerates in use and application, the supportive functions that make the technology safe to use lags behind. Four of these functional areas are to be addressed by sessions in the conference.
Learning to reach by reinforcement learning using a receptive field based function approximation approach with continuous actions
Authors: Minija Tamosiunaite, Tamim Asfour, Florentin W&#x00f6;rg&#x00f6;tter
Venue: Biological Cybernetics (2009)

Reinforcement learning methods can be used in robotics applications especially for specific target-oriented problems, for example the reward-based recalibration of goal directed actions. To this end still relatively large and continuous state-action spaces need to be efficiently handled. The goal of this paper is, thus, to develop a novel, rather simple method which uses reinforcement learning with function approximation in conjunction with different reward-strategies for solving such problems. For the testing of our method, we use a four degree-of-freedom reaching problem in 3D-space simulated by a two-joint robot arm system with two DOF each. Function approximation is based on 4D, overlapping kernels (receptive fields) and the state-action space contains about 10,000 of these. Different types of reward structures are being compared, for example, reward-on- touching-only against reward-on-approach. Furthermore, forbidden joint configurations are punished. A continuous action space is used. In spite of a rather large number of states and the continuous action space these reward/punishment strategies allow the system to find a good solution usually within about 20 trials. The efficiency of our method demonstrated in this test scenario suggests that it might be possible to use it on a real robot for problems where mixed rewards can be defined in situations where other types of learning might be difficult.
Super-object-oriented programming and simulation
Authors: Eugene Kindler
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

The progress in computer simulation tends to simulate complex systems governed by "internal models", i.e. sophisticated activities of computing technique in real time flow. Independently of that, computer simulation needs the object-oriented programming and the agent-based paradigm for constructing "external models" of complex systems that are being designed. Thus the progress tends to use models with other models nested, and knowledge systems with other knowledge systems nested. The paper is oriented to survey the findings, needs, obstacles, solutions and existing applications, namely by means of so called super-object-oriented programming.
Ghost in the Shell: promo series
Authors: Junji Munekata, Synichi Yamamoto
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

While the setting of "Ghost in the Shell" is an imaginary city created with Tokyo in mind, this TV commercial depicts the real Tokyo. Version 1 begins with a view of the area in front of the Diet Building, a national symbol of Japan. In the busy city, this area seems to be a quiet place, but the place has some sort of tension with mobile police officers always standing by. Tachikoma, an armed police-car-like character with artificial intelligence suddenly appears and announces this animated TV series. On the contrary, Version 2 shows some characteristic icons such as the Tokyo Metropolitan Government Tower, the streets of Shibuya, the city's expressways, etc.
Using agent technology to move from intention-based to effect-based models
Authors: Andreas Tolk, Robert J. Bowen, Patrick T. Hester
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Following current modeling paradigms, most processes are captured in the form of modeling a desired intent, often using success probabilities. In addition, only special roles that entities are intended to play are modeled. For effect-based modeling, the unintended but nonetheless resulting effects are as important as the intended effects, and they are therefore modeled. Also, uninspected actions based on alternative roles are important. Using agents to not only represent influencers and targets but also the processes, it becomes possible to capture all effects and move from "what I intended to accomplish" to "what I really accomplished," including side and secondary effects. The agent architecture and a prototype for this effect-based model are presented in this paper.
A rapid application development framework for rule-based named-entity extraction
Authors: Ashish Sureka, Pranav Prabhakar Mirajkar, Kishore Indukuri Varma
Venue: Proceedings of the 2nd Bangalore Annual Compute Conference (2009)

Named Entity Recognition and Classification (NERC) consist of identifying and labeling specific pieces of information like proper names from free-form textual data. There are primarily three approaches to named-entity extraction: hand-crafted rule based, machine-learning based and hybrid. Rule-based approaches consist of defining heuristics in the form of regular expressions or linguistic pattern and making use of dictionaries and lexicons for extracting named-entities. Rule-based approaches have proven to be quite successful but one of their limitations is that it requires a domain expert to manually define and encode the rules. The process of hand-engineering rules is a time consuming and tedious process. It also requires a domain expert, cannot be easily ported to other domains and languages and becomes hard to maintain. Machine learning based approaches tries to overcome these limitations by automatically learning rules or inducing a model rather than defining the rules by a human expert. In this work, we present our research on overcoming the limitations of rule-based approach by building a rapid application development framework that can expedite the process of rule-building and making it easy to maintain and apply it to other domains. We describe a framework that can enable a business user to easily define and maintain rules and lexicons.
Polynomial reduction of time-space scheduling to time scheduling
Authors: J. Studenovský
Venue: Discrete Applied Mathematics (2009)

We study the University Course Timetabling Problem (UCTP). In particular we deal with the following question: is it possible to decompose UCTP into two problems, namely, (i) a time scheduling, and (ii) a space scheduling. We have arguments that it is not possible. Therefore we study UCTP with the assumption that each room belongs to exactly one type of room. A type of room is a set of rooms, which have similar properties. We prove that in this case UCTP is polynomially reducible to time scheduling. Hence we solve UCTP with the following method: at first we solve time scheduling and subsequently we solve space scheduling with a polynomial O(n^3) algorithm. In this way we obtain a radical (exponential) speed-up of algorithms for UCTP. The method was applied at P.J. Safarik University.
Enhancing label space usage for Ethernet VLAN-label switching
Authors: Luis F. Caro, Dimitri Papadimitriou, Jose L. Marzo
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2009)

Ethernet is positioning itself as an aggregation technology for carrier transport networks; however, as it was designed for local area networks, native bridged Ethernet does not fulfill all carrier requirements. Ethernet VLAN-label switching (ELS) has been designed to make Ethernet fulfill carrier requirements. ELS allows the creation of label switched data paths using a 12-bit label encoded in the VLAN TAG control information field. As previous label switching technologies use more bits to encode the label, they do not suffer from the label sparsity issues that ELS might. This paper studies the label sparsity issues resulting from the reduced ELS VLAN-label space. For this purpose the applicability of existing techniques for enhancing label space is studied and evaluated in the online routing scenario. Novel routing schemes are also proposed for taking advantage of the available techniques in order to further enhance the ELS VLAN-label space.
Gravity sphere: gestural audio-tactile interface for mobile music exploration
Authors: Jaakko Keränen, Janne Bergman, Jarmo Kauko
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Current solutions for managing music in mobile contexts are inconvenient as they require considerable effort and visual attention. We describe a novel system for exploring music and generating playlists in mobile contexts, and present findings from our formative usability evaluations. The system provides audio-tactile feedback and is controlled by manipulating a device's orientation. The system plays songs associated with the current orientation. A spatial gesture or other command is then used to lock the orientation into a playlist. We evaluated two iterations of a prototype of the system and found that users were successful in exploring music and generating playlists with the system. We found that certain orientations are more common than others. Also, manipulating the prototype felt more natural while walking than sitting. Personalization of the music mapping was requested by users and seen as beneficial for usability.
Experimental Analysis of Scheduling Algorithms for Aggregated Links
Authors: Wojciech Jawor, Marek Chrobak, Mart Molle
Venue: Approximation and Online Algorithms: 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers (2009)

We consider networks with aggregated links, that is networks in which physical link segments between two interconnected devices are grouped into a single logical link. Network devices supporting such aggregated links must implement a distribution algorithm responsible for choosing the transmission link for any given packet. Traditionally, in order to maintain packet ordering within conversations, all distribution algorithms transmitted packets from a given conversation on a single link. This approach is attractive for its simplicity, but in some conditions it tends to under-utilize the capacity of the link. On the other hand, due to variations in packet lengths, sending packets from the same conversation simultaneously along different physical links requires careful scheduling to ensure that the packets arrive in the correct order.Recently, Jawor et al. [6] formulated this packet scheduling problem as an online optimization problem and proposed an algorithm called Block. The focus of the work in [6] was purely theoretical --- to achieve an optimal competitive ratio. In this paper we study this problem in an experimental setting. To this end, we develop a refined version of Algorithm Block, and we show, through experimental analysis, that it indeed significantly reduces the maximum amount of time packets spent in buffers before transmission, compared to the standard methods based on hashing.
Autonomic hierarchical reconfiguration for wireless access networks
Authors: Konstantinos Samdanis, Vasilis Friderikos, A. Hamid Aghvami
Venue: Journal of Network and Computer Applications (2009)

A novel autonomic area reconfiguration mechanism is proposed to manage the hierarchical arrangement of routing protocols in wireless access networks. The reconfiguration mechanism monitors the traffic and mobility patterns to identify symptoms, which indicate a poor existing area partition. A re-partition algorithm is invoked on demand with the objective to revise the border between neighboring areas in order to achieve more efficient resource management. A centralized implementation is proposed and evaluated by comparison with the equivalent one without the autonomic area reconfiguration capability. Simulations illustrate that the autonomic area reconfiguration mitigate both routing and mobility overhead as well as dropping and blocking rates, suggesting better network performance with rapid response to traffic alternations.
Managing knowledge sharing: Emergent and engineering approaches
Authors: Bart van den Hooff, Marleen Huysman
Venue: Information and Management (2009)

We wished to determine how the process of knowledge sharing could be managed, seeing that it is a knowledge management dilemma. If knowledge sharing is crucial to an organization's interests, but is inherently emergent in nature, how can the organization still manage the process? In order to answer this question, a distinction was made between two approaches towards managing knowledge sharing: an emergent approach, focusing on the social dynamics between organizational members and the nature of their daily tasks, and an engineering approach, focusing on management interventions to facilitate knowledge transfer. While the first is central to today's thinking about knowledge, we used a field study in six organizations to show that both approaches have value in explaining knowledge sharing. Instruments that are part of the engineering approach create conditions for variables in the emergent approach, which in turn also exert a direct influence on knowledge sharing.
On Computer Simulation Models of RSW Process
Authors: Haining Zheng, Yongbing Li
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

Due to its high complicacy and transitoriness and closeness, resistance spot welding (RSW), which is widely employed as a major sheet metal joining technology in automotive industry, has attracted specific attentions for computer simulations since last century. In this paper, four major RSW numerical models, namely thermal model, electro-thermal model, electro-thermo-mechanical model and electro-thermal model with fluid flow field, are introduced and investigated thoroughly. Especially, a newly available multi-physics coupling model is discussed and compared with previous models. Suggestions for future research directions are also proposed at the end.