ppxscal/embedding_network huggingface dataset:
Adding Search to Zinc
Authors: Reza Rafeh, Kim Marriott, Maria Garcia Banda, Nicholas Nethercote, Mark Wallace
Venue: Proceedings of the 14th international conference on Principles and Practice of Constraint Programming (2008)

We describe a small, non-intrusive extension to the declarative modelling language Zinc that allows users to define model-specific search. This is achieved by providing a number of generic search patterns that take Zinc user-defined functions as parameters. We show the generality of the approach by using it to implement three very different kinds of search: backtracking search, branch-and-bound search, and local search. Our approach is competitive with hand-coded search strategies.
Estimation of Functional Ranges Using Standard and Inner Interval Arithmetic
Authors: Julius Žilinskas
Venue: Informatica (2006)

New ways to estimate ranges of values of functions from standard and inner interval arithmetic have been proposed. Using the proposed ways ranges of values of mathematical test functions for global optimization and of objective functions for practical global optimization problems have been estimated and compared. Results of the experiments show that it is promising to use proposed balanced interval arithmetic in interval global optimization.
g-Eclipse --- A Contextualised Framework for Grid Users, Grid Resource Providers and Grid Application Developers
Authors: Harald Kornmayer, Mathias Stümpert, Harald Gjermundrød, Paweł Wolniewicz
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

As the future pervasive and ubiquitous computing environment will be composed of resources from local computing, Grid, SOA and Web infrastructures, the complexity of this distributed system will increase significantly. At the same time the end user wants easy and simple access to his computing environment while he receives more responsibilities i.e. for the composition and the management of the system. In order to perform his daily work, the end user needs a general workbench toolset which supports customisation and contextualisation for the user. The g-Eclipse framework offers an eco-system to access Grid infrastructures with support for contextualised user roles. Currently, the g-Eclipse framework includes contextualised perspectives for Grid end users, Grid resource provider and Grid application developers. The abstraction layer of the g-Eclipse system, its integration in the Eclipse framework and the main use cases are presented.
An Efficient Algorithm for 2D Euclidean 2-Center with Outliers
Authors: Pankaj K. Agarwal, Jeff M. Phillips
Venue: Proceedings of the 16th annual European symposium on Algorithms (2008)

For a set P of n points in ¿2, the Euclidean 2-center problem computes a pair of congruent disks of the minimal radius that cover P. We extend this to the (2,k)-center problem where we compute the minimal radius pair of congruent disks to cover n ¿ k points of P. We present a randomized algorithm with O(n k 7 log3 n) expected running time for the (2,k)-center problem. We also study the (p,k)-center problem in ¿2 under the ¿ ¿ -metric. We give solutions for p = 4 in O(k O(1) n logn) time and for p = 5 in O(k O(1) n log5 n) time.
The Directed Minimum Latency Problem
Authors: Viswanath Nagarajan, R. Ravi
Venue: Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques (2008)

We study the directed minimum latency problem: given an n-vertex asymmetric metric (V,d) with a root vertex r ¿ V, find a spanning path originating at r that minimizes the sum of latencies at all vertices (the latency of any vertex v ¿ V is the distance from r to v along the path). This problem has been well-studied on symmetric metrics, and the best known approximation guarantee is 3.59 [3]. For any $\frac{1}{\log n}, we give an n O(1/¿) time algorithm for directed latency that achieves an approximation ratio of $O(\rho\cdot \frac{n^\epsilon}{\epsilon^3})$, where ρ is the integrality gap of an LP relaxation for the asymmetric traveling salesman path problem [13,5]. We prove an upper bound $\rho=O(\sqrt{n})$, which implies (for any fixed ¿> 0) a polynomial time O(n 1/2 + ¿ )-approximation algorithm for directed latency.In the special case of metrics induced by shortest-paths in an unweighted directed graph, we give an O(log2 n) approximation algorithm. As a consequence, we also obtain an O(log2 n) approximation algorithm for minimizing the weighted completion time in no-wait permutation flowshop scheduling. We note that even in unweighted directed graphs, the directed latency problem is at least as hard to approximate as the well-studied asymmetric traveling salesman problem, for which the best known approximation guarantee is O(logn).
On the Discovery of Business Processes Orchestration Patterns
Authors: Nuno Miguel Feixa Rodrigues, Luis Soares Barbosa
Venue: Proceedings of the 2008 IEEE Congress on Services - Part I (2008)

COORDINSPECTOR is a Software Tool aiming at extracting the coordination layer of a software system. Such a reverse engineering process provides a clear view of the actually invoked services as well as the logic behind such invocations. The analysis process is based on program slicing techniques and the generation of, System Dependence Graphs and Coordination Dependence Graphs. The tool analyzes Common Intermediate Language (CIL), the native language of the Microsoft .Net Framework, thus making suitable for processing systems developed in any .Net Framework compilable language. COORDINSPECTOR generates graphical representations of the coordination layer together with business process orchestrations specified in WSBPEL 2.0.
Discovering Service Compositions That Feature a Desired Behaviour
Authors: Fabrizio Benigni, Antonio Brogi, Sara Corfini
Venue: Proceedings of the 5th international conference on Service-Oriented Computing (2007)

Web service discovery is one of the key issues in the emerging area of Service-oriented Computing. In this paper, we present a complete composition-oriented, ontology-based methodology for discovering semantic Web services, which exploits functional and behavioural properties contained in OWL-S service advertisements to satisfy functional and behavioural client queries. To this aim, we build on top of the results contained in two recent articles, where we presented (1) a suitable data structure (viz., a dependency hypergraph) to collect functional information of services, and (2) a suitable notion of behavioural equivalence for Web services. We also discuss the architecture and the main implementation choices of the matchmaking system applying such a methodology.
High Capacity Data Hiding in JPEG-Compressed Images
Authors: Hsien-Wen Tseng, Chin-Chen Chang
Venue: Informatica (2004)

The JPEG image is the most popular file format in relation to digital images. However, up to the present time, there seems to have been very few data hiding techniques taking the JPEG image into account. In this paper, we shall propose a novel high capacity data hiding method based on JPEG. The proposed method employs a capacity table to estimate the number of bits that can be hidden in each DCT component so that significant distortions in the stego-image can be avoided. The capacity table is derived from the JPEG default quantization table and the Human Visual System (HVS). Then, the adaptive least-significant bit (LSB) substitution technique is employed to process each quantized DCT coefficient. The proposed data hiding method enables us to control the level of embedding capacity by using a capacity factor. According to our experimental results, our new scheme can achieve an impressively high embedding capacity of around 20% of the compressed image size with little noticeable degradation of image quality.
Static Dipole Polarizability of o-, m- and p-Benzyne isomers: Ab initio, DFT and CCSD calculations
Authors: Humberto Soscún, Carlos Toro-Mendoza, Esker Chacín, Javier Hernández
Venue: Journal of Computational Methods in Sciences and Engineering (2004)

We report a study of the static dipole polarizability (&alpha;) of the o-, m- and p-benzyne isomers in their singlet ground state. Due to the biradical character of benzynes, calculations were performed at ab initio unrestricted Hartree-Fock (UHF) level of theory. The correlation effects were accounted for with second order M&oslash;ller Plesset (MP2) method, Density Functional Theory (DFT) with the BLYP and B3LYP hybrid approaches and the coupled cluster CCSD method with 6-31$+$G(d,p) standard basis set with optimized geometries. C$_2$v symmetry restriction was employed for the geometry of o- and m-benzynes (closed and open conformation) and D$_2$h for p-benzynes (open and closed conformation). Because the high quality of the basis set is a requirement for accurate &alpha; determination, MP2 and DFT calculations were performed with the 6-31+G(d,p), the extended 6-311++G(3d,3p) and the specialized Sadlej basis sets. The CCSD calculations were only carried out with the 6-31+G(d,p) and the Sadlej basis sets. The results indicate that the average &alpha; polarizability values for o- and m-benzynes are lower than the corresponding to the experimental value of benzene, while this property for p-benzyne is slightly higher than the benzene one. The anisotropy &Delta;&alpha; values of benzyne isomers are always higher than the anisotropy of benzene molecule. Finally, was found that the conformations of p-C$_6$H$_4$are the less stable isomers, and are the most polarizables and anisotropic compounds from the benzyne series.
Patterns for service-oriented information exchange requirements
Authors: Ayman Mahfouz, Leonor Barroca, Robin Laney, Bashar Nuseibeh
Venue: Proceedings of the 2006 conference on Pattern languages of programs (2006)

Service-Oriented Computing (SOC) is an emerging computing paradigm that supports loosely-coupled inter-enterprise interactions. SOC interactions are predominantly specified in a procedural manner that defines message sequences intermixing implementation with business requirements. In this paper we present a set of patterns concerning requirements of information exchange between participants engaging in service-oriented interactions. The patterns aim at explicating and elaborating the business requirements driving the interaction and separating them from implementation concerns.
Software process simulation over the past decade: trends discovery from a systematic review
Authors: He Zhang, Barbara Kitchenham, Dietmar Pfahl
Venue: Proceedings of the Second ACM-IEEE international symposium on Empirical software engineering and measurement (2008)

Software Process Simulation (SPS) research has increased since 1998 when the first ProSim Workshop was held. This paper aims to reveal how SPS has evolved during the past 10 years based on the preliminary results from the systematic literature review of SPS publications from 1998 to 2007. Trends over the period showed that interest in continuous modelling was decreasing and interest in micro-processes was increasing. Hybrid models were based primarily on system dynamics and discrete event simulation and were all implemented by vertical integration.
Using an Emotional Intelligent Agent to Reduce Resistance to Change
Authors: Ilusca Lima Menezes, Claude Frasson
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

Organizations need to change for developing and surviving in the marketplace, but changes bring uncertainty and not only produce feelings of apprehension, anxiety and stress, but also create resistance among employees. Resistance can delay and increase the costs of a change process. So, it is essential to present organizational changes in a manner that reduce the potential for resistance. In this paper, we propose an intelligent agent able to reduce employee's resistance to change by presenting the best corrective emotional strategy according to his personality in order to temper his negative emotion.
A Novel Railway Signal Control System Based on the Internet Technology and an Assurance Technology
Authors: Takashi Kunifuji, Tadao Miura, Gen Kogure, Hiroyuki Sugahara, Masayuki Matsumoto
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

We have developed a novel railway signal control system that works as a distributed system. It consists of a central control unit (called LC) and terminal devices (called FC) that are distributed at the railroad wayside and operate signal devices. The Internet technologies and optical LAN technologies have been used as communication methods between the LC and the FCs. The FC is a distributed terminal device that has its own processor and placed at the railroad wayside to control the field signal devices. The LC is a centralized computer device that has software arranged by the function of the field devices. An optical network system and multiple communication paths between the LC and the FCs realize robust transmissions. Moreover, the assure performance of controls and transmissions have been investigated, and the autonomous distributed signal control system is also discussed as the next steps of the system.
Comparison of Adaptive Approaches for Differential Evolution
Authors: Karin Zielinski, Xinwei Wang, Rainer Laur
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

The evaluation of optimization algorithms and especially the analysis of adaptive variants is often complicated because several features are modified concurrently. For Differential Evolution these features may be adaptation of parameters, adjustment of the strategy and addition of local search or other special operators. Thus, it is difficult to analyze which of these procedures is actually responsible for changes in the performance. Therefore, in this work several adaptive algorithms are studied in-depth by monitoring performance changes for individual components of these algorithms to examine their effectiveness. The results show among others that the performance can be significantly improved by employing strategy control.
Human Brain Anatomical Connectivity Analysis Using Sequential Sampling and Resampling
Authors: Bo Zheng, Jagath C. Rajapakse
Venue: Proceedings of the 2nd IAPR international workshop on Pattern Recognition in Bioinformatics (2007)

Diffusion Tensor MR Imaging (DTI) provides non-invasive approach to track white matter (WM) trajectories within human brain in vivo, and thereby facilitates studies of anatomical connectivity between sub-cortical and cortical regions. This paper presents a probabilistic fiber tracking framework, which aims to address the two problems in earlier approaches: first, it does not adopt fractional anisotropy (FA) as the stopping criteria so that the exploration of cortico-cortical connectivity is feasible; secondly, fiber tracking process is regularized so that trajectory with low curvature means high belief of connection between two voxels.
Magnetorheological Brake for Haptic Rendering
Authors: Richard Demersseman, Moustapha Hafez, Betty Lemaire-Semail, Stéphane Clénet
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

This paper addresses the design and characterization of a single-disk magnetorheological fluid brake developed for haptic rendering. An analytical method was used for dimensioning. Brake is tested under constant current and velocity inputs. We observe that torque has a low dependence on velocity and that it has a hysteretic evolution with current as a result of magnetization properties of steel used for parts.
Modeling dynamic scenarios for local sensor-based motion planning
Authors: Luis Montesano, Javier Minguez, Luis Montano
Venue: Autonomous Robots (2008)

This paper addresses the modeling of the static and dynamic parts of the scenario and how to use this information with a sensor-based motion planning system. The contribution in the modeling aspect is a formulation of the detection and tracking of mobile objects and the mapping of the static structure in such a way that the nature (static/dynamic) of the observations is included in the estimation process. The algorithm provides a set of filters tracking the moving objects and a local map of the static structure constructed on line. In addition, this paper discusses how this modeling module is integrated in a real sensor-based motion planning system taking advantage selectively of the dynamic and static information. The experimental results confirm that the complete navigation system is able to move a vehicle in unknown and dynamic scenarios. Furthermore, the system overcomes many of the limitations of previous systems associated to the ability to distinguish the nature of the parts of the scenario.
An Instrumentation-Based Approach to Controller Model Validation
Authors: Rance Cleaveland, Scott A. Smolka, Steven T. Sims
Venue: Model-Driven Development of Reliable Automotive Services: Second Automotive Software Workshop, ASWSD 2006, San Diego, CA, USA, March 15-17, 2006, Revised Selected Papers (2006)

This paper discusses the concept of Instrumentation-Based Validation (IBV): the use of model instrumentation and coverage-based testing to validate models of embedded control software. IBV proceeds as follows. An engineer first formalizes requirements as assertions, or small models, which may be thought of as monitors that observe the behavior of the controller model as it executes. The engineer then instruments the model with these assertions and develops test suites with the aim of highlighting where assertion violations occur. To make our discussion of IBV more concrete, we also consider its implementation within the Reactis tool suite for the automated testing and validation of controller models given in ® /Stateflow®.
Information Theory Inspired Weighted Immune Classification Algorithm
Authors: Maciej Morkowski, Robert Nowicki
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

This article presents an example of a handwritten numbers classifier based on the immune system. We study mutual relations between the system operation parameters, as well as new mechanisms introduced in order to make the system work faster. To achieve the goal the weights inspired by the information theory have been inserted to the immune system.
A Vision for Cyberinfrastructure for Coastal Forecasting and Change Analysis
Authors: Gagan Agrawal, Hakan Ferhatosmanoglu, Xutong Niu, Keith Bedford, Ron Li
Venue: GeoSensor Networks: Second International Conference, GSN 2006, Boston, MA, USA, October 1-3, 2006, Revised Selected and Invited Papers (2008)

This paper gives an overview of a recently initiated cyberinfrastructure project at The Ohio State University. This project proposes to develop and evaluate a cyberinfrastructure component for environmental applications. This will include developments in middleware, model integration, analysis, and mining techniques, and the use of a service model for supporting two closely related applications. These applications will be real-time coastal nowcasting and forecasting, and long-term coastal erosion analysis and prediction.
Rich Data Representation: Sophisticated Visual Techniques for Ease and Clarity
Authors: W. Bradford Paley
Venue: Proceedings of the 5th international conference on Diagrammatic Representation and Inference (2008)

Within the fields of Interaction Design and especially Information Visualization diagram-like constructions are used fairly often. I will leave it up to this community to define the exact characteristics that make a diagram, but expect that definition to include visual representations of abstract data entities and relationships; I also expect that clarity and ease of interpretation are among the goals for which many diagrams are created.I have devoted my efforts toward making clear, comfortable representations of abstract data with a concentration on supporting very constrained domains of practice. As a result I believe I have found (and developed) techniques for both structuring and rendering certain kinds of abstract data, and that such techniques are sadly underutilized.
Optimal Language Learning
Authors: John Case, Samuel E. Moelius,  Iii
Venue: Proceedings of the 19th international conference on Algorithmic Learning Theory (2008)

Gold's original paper on inductive inference introduced a notion of an optimal learner. Intuitively, a learner identifies a class of objects optimally iff there is no other learner that: requires as little of each presentation of each object in the class in order to identify that object, and, for some presentation of some object in the class, requires less of that presentation in order to identify that object. Wiehagen considered this notion in the context of function learning, and characterized an optimal function learner as one that is class-preserving, consistent, and (in a very strong sense) non-U-shaped, with respect to the class of functions learned.Herein, Gold's notion is considered in the context of language learning. Intuitively, a language learner identifies a class of languages optimally iff there is no other learner that: requires as little of each text for each language in the class in order to identify that language, and, for some text for some language in the class, requires less of that text in order to identify that language.Many interesting results concerning optimal language learners are presented. First, it is shown that a characterization analogous to Wiehagen's does not hold in this setting. Specifically, optimality is not sufficient to guarantee Wiehagen's conditions; though, those conditions are sufficient to guarantee optimality. Second, it is shown that the failure of this analog is not due to a restriction on algorithmic learning power imposed by non-U-shapedness (in the strong form employed by Wiehagen). That is, non-U-shapedness, even in this strong form, does not restrict algorithmic learning power. Finally, for an arbitrary optimal learner F of a class of languages $\mathcal {L}$, it is shown that F optimally identifies a subclass $\mathcal {K}$ of $\mathcal {L}$ iff F is class-preserving with respect to $\mathcal {K}$.
Run-Time Adaptation of Non-functional Properties of Composite Web Services Using Aspect-Oriented Programming
Authors: N. C. Narendra, Karthikeyan Ponnalagu, Jayatheerthan Krishnamurthy, R. Ramkumar
Venue: Proceedings of the 5th international conference on Service-Oriented Computing (2007)

Existing web service composition and adaptation mechanisms are limited only to the scope of web service choreography in terms of web service selection/invocation vis-à-vis pre-specified Service Level Agreement constraints. Such a scope hardly leaves ground for a participating service in a choreographed flow to re-adjust itself in terms of changed non functional expectations and most often these services are discarded and new services discovered to get inducted into the flow. In this paper, we extend this idea by focusing on run-time adaptation of non-functional features of a composite Web service by modifying the non-functional features of its component Web services. We use aspect-oriented programming (AOP) technology for specifying and relating non-functional properties of the Web services as aspects at both levels of component and composite. This is done via a specification language for representing non-functional properties, and a formally specifiable relation function between the aspects of the component Web services and those of the composite Web service. From the end users' viewpoint, such upfront aspect-oriented modeling of non-functional properties enables on-demand composite Web service adaptation with minimal disruption in quality of service. We demonstrate the applicability and merits of our approach via an implementation of a simple yet real-life example.