ppxscal/embedding_network huggingface dataset:
An R-Minimum Strategy for Finite Element Modeling of Non-linear Deformation Behaviours of Rate-Dependent Materials
Authors: H. L. Xing, J. Zhang
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

An R-minimum strategy, which was proposed and successfully applied to analyse the non-linear finite deformation behaviours of elasto-plastic materials (e.g. [1] [2]), is extended and applied here to simulate the deformation behaviours of the rate-dependent materials. It involves no iterations, thus belongs to the static-explicit algorithm and avoids the convergence problem resulting from nonlinearities. The R-minimum strategy based adaptive control scheme of the time step size is proposed and applied to the analysis of both time-dependent and -independent viscous materials and verified through the comparison with the others to demonstrate the stability, efficiency and usefulness of this algorithm.
Statistical Prediction for the Pricing of Bond Using Random Number Generation
Authors: Kisoeb Park, Moonseong Kim, Seki Kim
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

In this paper, we propose a dynamic prediction algorithm to predict the interest rate for the bond price using real data set. Our algorithm is based on term structure model of the interest rate, which takes place in financial modelling, such as the standard Wiener process. We use cumulative distribution function (CDF) of real data for the interest rate measurement. The CDF is obtained by the natural cubic spline (CS) method, which is the frequently used numerical methods for interpolation. Most useful when the CDF F(x) has an inverse F ¿ 1(x) which is easy to compute. We use the random number generation to calculate the pricing of bond. In empirical computer simulation, we show that the lower values of precision in the proposed prediction algorithm corresponds to sharper estimates. It is very reasonable on prediction.
Service Composition for GIS
Authors: Sai Ma, Minruo Li, Weichang Du
Venue: Proceedings of the 2008 IEEE Congress on Services - Part I (2008)

A Geographical Information System (GIS) is a system that captures, analyzes, and manages any spatially referenced data. One common problem in the GIS community is how to generate and publish customized web maps. The existing solutions either deal with spatial data directly which does not allow for applying the customized features, or require and rely on advanced and specialized programming skills. We believe that applying Service Oriented Architecture (SOA) to GIS can improve the interoperability of different GISs and can combine different GISs to provide customized web maps using a web service orchestration language. In this paper, we present a novel solution that applies SOA and Business Process Execution Language (BPEL) to orchestrate web map services into a customized web map. The process of requesting a map layer from a map service provider is an invocation of the remote GIS map service. The process of generating a customized web map becomes a process of combining different GIS map services into a BEPL process. This makes it possible to generate the business logic in BPEL first and then execute it to obtain a new map. Ideally, once the process is generated in BPEL, it can be plugged into any GIS system. This new solution generates a single new map after all layers are combined together, while the existing Asynchronous JavaScript and XML (AJAX) based solution gives a stack of map layers and the layers cannot be saved as one map. We have implemented a framework for the map creator to combine map layers published by different map service providers into a single new map, save the map composition process logic, and publish the new map as a service. Also, the framework provides map brokers more control of and easier interaction with the map composition process.
A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization
Authors: James B. Orlin
Venue: Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization (2007)

We consider the problem of minimizing a submodular function f defined on a set V with n elements. We give a combinatorial algorithm that runs in O(n 5 EO + n 6) time, where EO is the time to evaluate f(S) for some S ¿ V. This improves the previous best strongly polynomial running time by more than a factor of n.
DIN: An Ad-Hoc Algorithm to Estimate Distances in Wireless Sensor Networks
Authors: Freddy López Villafuerte, Jochen Schiller
Venue: Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks (2008)

A current challenge in wireless sensor networks is the positioning of sensor nodes for indoor environments without dedicated hardware. Especially in this domain, many applications rely on spatial information to relate collected data to the location of its origin. First of all, an estimation of the distance between two nodes is necessary to determine their positions. So far, the majority of approaches have explored physical properties of signals such as the strength of a received signal or its arrival time. However, this has been problematic since either the complexity on the software or on the hardware side is not adequate for embedded systems, or the approaches lack the required accuracy. In this paper we present the DIN algorithm (Distance by Intersection of Neighborhoods) to determine the distance between two nodes in an Ad-hoc manner, relying solely on the investigation of local node densities. To evaluate the accuracy of this algorithm, we conducted extensive simulations and experimented with different testbed setups using real sensor nodes. We were able to assure competitive values for the measured error.
Energy Cost Optimization by Adequate Transmission Rate Dividing in Wireless Communication System
Authors: Reu-Ching Chen, Chen-Sung Chang
Venue: Informatica (2008)

Energy cost is the main constraint in modern wireless communication system. A powerful scheme due to optimal energy cost is provided for a single node server in this paper. In wireless communications, the total energy for transmitting packets can be reduced by proper regulating the service rate due to different packet sizes. In our study, a generic method applying the Lagrange Multiplier methods for optimizations is proposed. We show the energy cost is a convex function and it is easy to achieve the optimization. Our contribution focused on minimizing the total energy cost induced by the transmission energy in a single server with multi-queues. The methodology presented in this paper can effectively save the energy cost due to energy consumption in wireless communication systems.
Quality Competitiveness Index (QCI) Model Based on Experts' Rules and ANN
Authors: Cai Feng, Jiang Jiadong
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

To further research on methods of evaluating quality competitiveness of an enterprise, a novel quality competitiveness index (QCI) model based on experts' rules and Artificial Neural Network (ANN) is proposed. Existing QCI model based on experts' rules is first introduced, and its shortages are analyzed. ANN is then employed to construct the novel QCI model, and basic principles and construction approaches of the novel model are discussed in particular. A simulation example indicates that, the novel model can fit the nonlinear mapping between QCI and observed variables of quality competitiveness, and has stronger characteristics of error tolerance.
An XML-based collaborative framework for ASIC eDesign
Authors: Amir Hekmatpour, Azadeh Salehi, James Coulter
Venue: Journal of Computational Methods in Sciences and Engineering (2006)

Efficient management of the large number of expertise and services required for design and verification of complex integrated circuits demands a collaborative design environment. Such an environment should be able to accommodate distributed design teams and design services, as well as heterogeneous design tools and data models. This paper describes a web-based framework for collaborative design of complex integrated circuits such as Application Specific Integrated Circuits (ASIC) and System-on-a-chip (SoC). The XML-based framework provides a collaborative environment for secure exchange and OnDemand conversion of heterogeneous design data and delivery of design services. It enables sharing of design data among various design tools and applications by utilizing a central data XML schema. The framework enables transport of integrated design data, design services and EDA tools across a unified XML protocol. The virtual central database provides managed access, control, collaboration, and sharing of expertise and design services across LAN, Intranet, or Internet. Secure design data and silicon IP interchange are supported across distributed design centers. Outsourced resources and internal expertise are integrated via IBM Customer Connect or industry standard HTTP tunnel protocols. A web-based silicon IP portal for OnDemand IP design specification, qualification and data exchange is developed based on the system architecture described in this paper.
Scenario-Based Analysis of Industrial Work Processes
Authors: M. Theißen, R. Hai, J. Morbach, R. Schneider, W. Marquardt
Venue: Collaborative and Distributed Chemical Engineering. From Understanding to Substantial Design Process Support: Results of the IMPROVE Project (2008)

In this section, the modeling procedure for design processes introduced in Subsect. 2.4.2 is discussed from a more application-oriented point of view. The Workflow Modeling System WOMS, which has been developed for the easy modeling of complex industrial design processes, is described. Many case studies have been performed during the elaboration and validation of the modeling methodology and the tool, several of them in different industrial settings. In this contribution, some case studies are described in more detail. Two of them address different types of design processes. A third case study, demonstrating the generalizability of our results, deals with the work processes during the operation of a chemical plant.
Improving the Performances of Asynchronous Algorithms by Combining the Nogood Processors with the Nogood Learning Techniques
Authors: Ionel Muscalagiu, Vladimir Cretu
Venue: Informatica (2006)

The asynchronous techniques that exist within the programming with distributed constraints are characterized by the occurrence of the nogood values during the search for the solution. The nogood type messages are sent among the agents with the purpose of realizing an intelligent backtrack and of ensuring the algorithm's completion. In this article we analyzed the way in which a technique of obtaining efficient nogood values could combine with a technique of storing these values. In other words we try combining the resolvent-based learning technique introduced by Yokoo with the nogood processor technique in the case of asynchrounous weak-commitment search algorithm (AWCS). These techniques refer to the possibility of obtaining efficient nogoods, respectively to the way the nogood values are stored and the later use of information given by the nogoods in the process of selecting a new value for the variables associated to agents. Starting from this analysis we proposed certain modifications for the two known techniques. We analyzed the situations in which the nogoods are distributed to more nogood processors handed by certain agents. We proposed a solution of distributing the nogood processors to the agents regarding the agents' order, with the purpose of reducing the storing and searching costs. We also analyzed the benefits the combining of nogood processor technique with the resolved-based learning technique could bring to the enhancement of the performance of AWCS technique. Finally, we analyzed the behavior of the techniques obtained in the case of messages filtering.
Approximate min--max theorems for Steiner rooted-orientations of graphs and hypergraphs
Authors: Tamás Király, Lap Chi Lau
Venue: Journal of Combinatorial Theory Series B (2008)

Given an undirected hypergraph and a subset of vertices S@?V with a specified root vertex r@?S, the Steiner Rooted-Orientation problem is to find an orientation of all the hyperedges so that in the resulting directed hypergraph the ''connectivity'' from the root r to the vertices in S is maximized. This is motivated by a multicasting problem in undirected networks as well as a generalization of some classical problems in graph theory. The main results of this paper are the following approximate min-max relations:*Given an undirected hypergraph H, if S is 2k-hyperedge-connected in H, then H has a Steiner rooted k-hyperarc-connected orientation. *Given an undirected graph G, if S is 2k-element-connected in G, then G has a Steiner rooted k-element-connected orientation. Both results are tight in terms of the connectivity bounds. These also give polynomial time constant factor approximation algorithms for both problems. The proofs are based on submodular techniques, and a graph decomposition technique used in the Steiner Tree Packing problem. Some complementary hardness results are presented at the end.
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: doctoral mentoring program
Venue: International Conference on Autonomous Agents (2008)

AAMAS doctoral mentoring program provides an opportunity for PhD students in advanced stages of their research to interact closely with established researchers in their fields, to receive feedback on their work and to get advice on managing their careers. Specifically, the goals of the program are: &bull; To match each student with an establish researcher in the community (who will act as a mentor). The mentor will interact closely with the student, will provide feedback on research, help form new contacts, etc. &bull; To allow students an opportunity to present their work to a friendly audience of other students as well as mentors. &bull; To provide students with contacts and professional networking opportunities. The doctoral mentoring program consists of opportunities for interactions between mentors and their mentorees prior to the conference, as well as a one day doctoral symposium, which was held one day prior to the workshops. AAMAS 2008 received 16 applications for the doctoral mentoring program. The applications consist of an extended-abstract, a personal research statement, a CV, and recommendation letter from the advisors. Each application was reviewed by two doctoral mentoring chairs. 12 mentorees were accepted, and each was assigned a mentor. Several innovations were added to this year's doctoral mentoring program and the symposium. In order to make the symposium more active, mentorees were not only presenters of their theses, but also were assigned as members of the panel for other mentorees. This way, all mentorees become part of the discussion, and not only present. Moreover, we invited all the scholarship students to the symposium so that they could hear about the work of their peers and meet other graduate students. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Computer Assisted Transcription of Text Images and Multimodal Interaction
Authors: Alejandro H. Toselli, Verónica Romero, Enrique Vidal
Venue: Proceedings of the 5th international workshop on Machine Learning for Multimodal Interaction (2008)

Current automatic handwriting text image recognition systems are far from being perfect and, in general, human intervention is required to check and correct the results of such systems. This is both inefficient and uncomfortable to the user. As an alternative to this post-editing process, a multimodal interactive approach is proposed, where user feedback is provided by means of touch-screen pen strokes and/or more traditional keyboard and mouse operation. Experiments suggest that, using this approach, significant amounts of user effort can be saved with respect to the conventional, non-interactive, post-editing process.
Bounding &chi; in terms of &omega; and &Delta; for quasi-line graphs
Authors: Andrew D. King, Bruce A. Reed
Venue: Journal of Graph Theory (2008)

A quasi-line graph is a graph in which the neighborhood of any vertex can be covered by two cliques; every line graph is a quasi-line graph. Reed conjectured that for any graph G, $\chi({{G}}) \leq\left \lceil {{{1}}\over {{2}}}(\Delta({{G}})+{{1}}+\omega({{G}}))\right\rceil$ [Reed, J Graph Theory 27 (1998), 177&ndash;212]. We prove that the conjecture holds if G is a quasi-line graph, extending a result of King et al. who proved the conjecture for line graphs [Eur J Comb 28 (2007), 2182&ndash;2187], and improving the bound of $\chi{{(}}{{G}}{{)}} \leq {3\over 2} \omega({{G}})$ given by Chudnovsky and Ovetsky [J Graph Theory 54 (2007), 41&ndash;50]. &copy; 2008 Wiley Periodicals, Inc. J Graph Theory 59: 215&ndash;228, 2008
Provenance, Trust, and Sharing in Peer-to-Peer Case-Based Web Search
Authors: Peter Briggs, Barry Smyth
Venue: Proceedings of the 9th European conference on Advances in Case-Based Reasoning (2008)

Despite the success of modern Web search engines, challenges remain when it comes to providing people with access to the right information at the right time. In this paper, we describe how a novel combination of case-based reasoning, Web search, and peer-to-peer networking can be used to develop a platform for personalized Web search. This novel approach benefits from better result quality and improved robustness against search spam, while offering an increased level of privacy to the individual user.
On Metric Clustering to Minimize the Sum of Radii
Authors: Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. Pirwani, Kasturi Varadarajan
Venue: Proceedings of the 11th Scandinavian workshop on Algorithm Theory (2008)

Given an n-point metric (P,d) and an integer k > 0, we consider the problem of covering P by k balls so as to minimize the sum of the radii of the balls. We present a randomized algorithm that runs in n O(logn ·logΔ) time and returns with high probability the optimal solution. Here, Δ is the ratio between the maximum and minimum interpoint distances in the metric space. We also show that the problem is NP-hard, even in metrics induced by weighted planar graphs and in metrics of constant doubling dimension.
Bone Segmentation and Fracture Detection in Ultrasound Using 3D Local Phase Features
Authors: Ilker Hacihaliloglu, Rafeef Abugharbieh, Antony Hodgson, Robert Rohling
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

3D ultrasound (US) is increasingly considered as a viable alternative imaging modality in computer-assisted orthopaedic surgery (CAOS) applications. Automatic bone segmentation from US images, however, remains a challenge due to speckle noise and various other artifacts inherent to US. In this paper, we present intensity invariant three dimensional (3D) local image phase features, obtained using 3D Log-Gabor filter banks, for extracting ridge-like features similar to those that occur at soft tissue/bone interfaces. Our contributions include the novel extension of 2D phase symmetry features to 3D and their use in automatic extraction of bone surfaces and fractured fragments in 3D US. We validate our technique using phantom, in vitro, and in vivo experiments. Qualitative and quantitative results demonstrate remarkably clear segmentations results of bone surfaces with a localization accuracy of better than 0.62mm and mean errors in estimating fracture displacements below 0.65mm, which will likely be of strong clinical utility.
Ordering relation of fuzzy implications
Authors: Anestis G. Hatzimichailidis, Basil K. Papadopoulos
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2008)

In this paper we introduce a specific method, which is based on generalized modus ponens and generalized modus tollens, for introducing an ordering relation on the set of fuzzy implications. The existence of an ordering relation between fuzzy implications helps us to order fuzzy implications in a more powerful and/or more functional classes. We believe that, apart from the theoretical interest, this method appears to have interesting applications.
Aesop's Fables: a technology-based delivery
Authors: Nikleia Eteokleous, Despo Ktoridou, Dolapsakis Demetris
Venue: International Journal of Technology Enhanced Learning (2008)

Many worldwide efforts have been made recently in restructuring teacher education programs. This paper provides an example of how senior pre-service early childhood teachers incorporated computer technology in fairy tale curriculum. It presents the creation and delivery of animated Aesop's Fables, and the preparation of activities that are based on the Fables. A case study design was employed and through in-depth interviews with pre-service early childhood teachers; it summarises the barriers encountered in integrating computers, the educational benefits and gains of computer technology integration, and the importance of computer technology integration as a regular feature in an early childhood classroom.
Kinematics analysis of a Novel 2-DOF parallel fully decoupled spherical mechanism
Authors: Yunxia Qu, Weimin Li, Anping Xu, Shuncheng Fan
Venue: Proceedings of the 8th WSEAS International Conference on Robotics, Control and Manufacturing Technology (2008)

This paper describes a novel 2-DOF parallel spherical mechanism, which is composed of two legs and fully decoupled. The equations of direct and inverse displacements, velocity and acceleration for the mechanism are derived. The displacement curves, velocity curves and acceleration curves of the moving platform are drawn for two different typical situations. This study will pave a way for the application of this kind of mechanism.
Customizing grgen.net for model transformation
Authors: Tom Gelhausen, Bugra Derre, Rubino Geiß
Venue: Proceedings of the third international workshop on Graph and model transformations (2008)

We discuss a method for customizing general-purpose graph rewriting systems for the task of model transformation. The portable approach is as simple as effective: It offers full static UML compliance including all diagram types for typed graph rewriting systems providing textual interfaces. We exemplify our approach by means of our implementation.