ppxscal/embedding_network huggingface dataset:
Numerical Study on the Effect of Grouting on Long-Term Settlement of Tunnels in Clay
Authors: Dong-Mei Zhang, Hong-Wei Huang, Jian-Ming Wang
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

The long-term settlements over tunnels can be rather significant, particularly when tunnels are embedded in soft and compressible soils. The influence of grouting on the evolution of long-term surface settlement, as well as ground loss, is simulated by imposing prescribed volumetric strain on the disturbed area around the tunnel due to shield tunneling. The volumetric strain could be detected from the grouting ratio of grouting volume and the volume of the physical gap of shield tunnel. Finally, some conclusions are drawn from the numerical simulations.
A Framework for Context-Aware Home-Health Monitoring
Authors: Alessandra Esposito, Luciano Tarricone, Marco Zappatore, Luca Catarinucci, Riccardo Colella, Angelo Dibari
Venue: Proceedings of the 5th international conference on Ubiquitous Intelligence and Computing (2008)

This paper presents a proposal for a context-aware framework. The framework is organized according to a general purpose architecture, centred around an ontological context representation. The ontology provides the vocabulary upon which software agents interoperate and perform rule-based reasoning, in order to determine the system response to context changes. The system components and their coordinated operations are described by providing a simple example of concrete application in a home-care scenario.
Batch fabrication of micro grippers with integrated actuators
Authors: Bj&#x00f6;rn Hoxhold, Stephanus B&#x00fc;ttgenbach
Venue: Microsystem Technologies (2008)

In this paper we present improvements in the field of batch fabricated micro grippers with shape memory alloy (SMA) actuators or pneumatic drives. In this context we illustrate two methods of structuring SMA foils. Moreover, it is shown how the processed SMA elements can be embedded into monolithic SU-8 grippers. We also describe actuator elements for silicon/SU-8 hybrid micro grippers. Furthermore, we report on the advantages of pneumatic micro grippers and how this alternative actuation principle can be fabricated in batch technology. In this regard, a thermoplastic adhesive electrodepositing process is presented.
Using Punctuation Schemes to Characterize Strategies for Querying over Data Streams
Authors: Peter Tucker, David Maier, Tim Sheard, Paul Stephens
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

Many systems and strategies have been proposed for processing non-terminating data streams. Each approach has advantages and disadvantages, including the kinds of queries that can be executed. We present a framework for characterizing the kinds of queries that can be executed over streams based on a notion of compact sets from topology. We first apply our framework to queries over punctuated data streams. Previous work on punctuations focused primarily on the behavior of individual query operators. We use our framework to determine if an entire query can benefit from punctuations available from stream sources. We then consider other common strategies proposed in the literature for executing queries over streams, and we discuss how our framework can characterize the kinds of queries each strategy can answer.
Review from an Industrial Perspective
Authors: W. Marquardt, M. Nagl
Venue: Collaborative and Distributed Chemical Engineering. From Understanding to Substantial Design Process Support: Results of the IMPROVE Project (2008)

This short section presents some thoughts on the relevance and the impact of the research work in IMPROVE on industrial practice. Though, the research program has been linked to industrial requirements and has seen a continuous review from industrial colleagues to refocus the research objectives and to assure practical relevance of the IMPROVE research approach, only few concrete results have made it yet into industrial practice. However, the problems addressed in IMPROVE have been receiving significant attention in industry, in particular in the recent past. In this sense, IMPROVE has been addressing a timely and forward-looking fundamental research program, which has come too early to be readily absorbed by industry. However, it will be of significant impact on industrial practice in the future in both, the software as well as the chemical and process industries.
Invisible Shape: Subjective Surface
Authors: Jun Fujiki, Taketoshi Ushiama, Kiyoshi Tomimatsu
Venue: Proceedings of the 8th international symposium on Smart Graphics (2007)

While, based on shading, shadowing and outline etc, human beings generally perceive a shape, we explore an new representation for perceiving shape. The Invisible Shape is an interactive media art software which has a concept of a new expression for perceiving 3D shapes. Although our work does not draw a shape and the apparent size of the character does not change by parallel projection, the user may be able to perceive the shape by tracking the walking characters on it. Like subjective contour, we expect that the user perceives the surface of invisible shape by motion of the objects related to the shape.
Experience with SPM in IPv6
Authors: Mingjiang Ye, Jianping Wu, Miao Zhang
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

The lack of source IP address checking makes it easy for the attackers to spoof the source address. Spoofing Prevention Method (SPM), as a prospective candidate to be deployed in the Internet, is a newly proposed scheme to solve this problem. However, there is no work on SPM prototype system. In this paper, we present our experience in achieving a prototype system for SPM. In addition to realizing the basic idea of SPM described in the original paper, we make the following three contributions: First, the detail design is made for the whole SPM system architecture and detail mechanisms. Second, several important issues for SPM system are addressed, e.g., how to carry the key required by SPM, the MTU problem, etc. Third, a prototype system is made and some experiments are done with this prototype system.
Intuitionistic fuzzy concept for navigation of mobile agents in unknown environment
Authors: Zlatogor Minchev, Dimitar Dimitrov
Venue: Proceedings of the 9th WSEAS International Conference on Fuzzy Systems (2008)

Navigation in unknown environments is a hot topic for virtual and real mobile agents' (robots) application in exploration of hazardous places on the Earth or other planets investigation in the space where the utilization of GPS systems or high-resolution geographical maps is not available. The paper will give a concept for uncertainty treating in an unknown environment, which implements the Intuitionistic Fuzzy Sets (IFS) concept into a multi-agent system of mobile agents (robots). We will show an idea of how to create a map of an unknown environment, evaluated in terms of IFS, which is used for path-planning of mobile agents and uncertainty copying that produce an assumption of safe path existing, obtained via the algorithm A* applied over a virtual grid-world. Additionally, an option for possible correction of the map uncertainty in case of A* path-plan failure with the help of the operator Fα,β, defined over IFS will be discussed.
Implicitly-threaded parallelism in Manticore
Authors: Matthew Fluet, Mike Rainey, John Reppy, Adam Shaw
Venue: ACM SIGPLAN Notices (2008)

The increasing availability of commodity multicore processors is making parallel computing available to the masses. Traditional parallel languages are largely intended for large-scale scientific computing and tend not to be well-suited to programming the applications one typically finds on a desktop system. Thus we need new parallel-language designs that address a broader spectrum of applications. In this paper, we present Manticore, a language for building parallel applications on commodity multicore hardware including a diverse collection of parallel constructs for different granularities of work. We focus on the implicitly-threaded parallel constructs in our high-level functional language. We concentrate on those elements that distinguish our design from related ones, namely, a novel parallel binding form, a nondeterministic parallel case form, and exceptions in the presence of data parallelism. These features differentiate the present work from related work on functional data parallel language designs, which has focused largely on parallel problems with regular structure and the compiler transformations --- most notably, flattening --- that make such designs feasible. We describe our implementation strategies and present some detailed examples utilizing various mechanisms of our language.
Pattern-Based Model-to-Model Transformation
Authors: Juan Lara, Esther Guerra
Venue: Proceedings of the 4th international conference on Graph Transformations (2008)

We present a new, high-level approach for the specification of model-to-model transformations based on declarative patterns. These are (atomic or composite) constraints on triple graphs declaring the allowed or forbidden relationships between source and target models. In this way, a transformation is defined by specifying a set of triple graph constraints that should be satisfied by the result of the transformation.The description of the transformation is then compiled into lower-level operational mechanisms to perform forward or backward transformations, as well as to establish mappings between two existent models. In this paper we study one of such mechanisms based on the generation of operational triple graph grammar rules. Moreover, we exploit deduction techniques at the specification level in order to generate more specialized constraints (preserving the specification semantics) reflecting pattern dependencies, from which additional rules can be derived.
Towards the Automatic Learning of Reflex Modulation for Mobile Robot Navigation
Authors: C. Galindo, J. A. Fernández-Madrigal, J. González
Venue: Proceedings of the 2nd international work-conference on Nature Inspired Problem-Solving Methods in Knowledge Engineering: Interplay Between Natural and Artificial Computation, Part II (2007)

Reflexes are meant to provide animals with automatic responses for a better adaptation to their niches. In particular, humans have the capability to voluntarily modify these responses in certain situations to attain specific goals. The ability of using past experiences to tune automatic responses (reflexes) has contributed to a better adaptation to our environments and thus, the question arises of applying this to machines. In the robotic arena, imitating animal reflexes has been largely explored through fixed stimuli-behavior schemas included in reactive or hybrid architectures. In this paper we consider the less explored direction of permitting a mobile robot to modify its reflexes according to its experience, i.e. ignoring the reflex of stopping when approaching an obstacle if the robot goal is close. We explore reinforcement learning as a mechanism to automatically learn when and how modulate reflexes over the robot operational life. Advantages of our mechanism are illustrated in simulations.
A Collaborative Information System Architecture for Process-Based Crisis Management
Authors: Omar Tahir, Eric Andonoff, Chihab Hanachi, Christophe Sibertin-Blanc, Frédérick Benaben, Vincent Chapurlat, Thomas Lambolais
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

In computer-based crisis management, participating actors have to put in common their information systems (IS). One of the main issues they have to face is to interoperate and coordinate these ISs in order to ease their collaborations and take the right decisions at the right moment. For that, they have to set up a Collaborative Information System (CIS) for orchestrating a Collaborative Process (CP) whose activities are performed by the participating ISs. The aim of this paper is to define the functional requirements of such a CIS and then to propose a conceptual architecture meeting these requirements. This architecture supports a perception-decision-action iteration for crisis reduction. Indeed, it provides means to capture information about the impacted real world, to support the definition and the adaptation of the CP managing the crisis reduction, and to coordinate and assign to each participant the actions to be undertaken. These actions modify the real world and lead to perform a new iteration until the crisis resolution.
Analytical Simulation of B-Spline Surfaces Deformation
Authors: Manuel González-Hidalgo, Antoni Jaume Capó, Arnau Mir, Gabriel Nicolau-Bestard
Venue: Proceedings of the 5th international conference on Articulated Motion and Deformable Objects (2008)

In this paper an analytic solution of an evolution model is proposed in order to deform B-splines parametric surfaces. The deformation model is based on an associated energy functional to one surface and its variational formulation is introduced. After some simplifications including assumptions regarding the mass and damping matrices and taking into account the properties of B-splines when are used as finite elements, a second order differential equations is obtained which can be solved analytically. The spatial discretization where these finite elements are defined and computed appears as a reduced number of control points and is deformed instead of all the surface points, obtaining an efficient and fast method in order to simulate surface deformations.
Introducing an explicit 2D matrix free Galerkin finite volume method for analyzing structural dynamics on unstructured mesh of linear triangular elements
Authors: Saeed-Reza Sabbagh-Yazdi, Mehdi Esmaeili
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

In this paper, a novel matrix free Finite Volume Method based on Galerkin assumptions is introduced for solution of weak form of Cauchy equilibrium equations on unstructured mesh of linear triangular elements. The developed shape function free Galerkin Finite Volume structural solver explicitly computes displacements in Cartezian coordinate directions for the two dimensional solid mechanic problems with arbitrary geometry under either static or dynamic loads. The accuracy of the introduced algorithm is demonstrated by comparison of computed results of two cantilever beams under static concentrated and uniformly distributed loads with analytical solution. The performance of the solver is presented in terms of convergence behavior of the method. In order to present the applicability of the introduced method to solve dynamic problems, the computed displacements of a storage tank frame structure under oscillating hydrostatic load is compared with the reported data in the literature.
EF-Greedy: A Novel Garbage Collection Policy for Flash Memory Based Embedded Systems
Authors: Ohhoon Kwon, Jaewoo Lee, Kern Koh
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

Flash memory is becoming increasingly important for embedded systems because it has many attractive features such as small size, fast access speeds, shock resistance, and light weight. Although flash memory has attractive features, it should perform garbage collection, which includes erase operations. The erase operations are very slow, and usually decrease the performance of the system. Besides, the number of the erase operations allowed to each block is also limited. To minimize the garbage collection time and evenly wear out, our proposed garbage collection policy focuses on minimizing the garbage collection time and wear-leveling. Trace-driven simulations show that the proposed policy performs better than existing garbage collection policies in terms of the garbage collection time and the endurance of flash memory. Specifically, we have shown that the performance improvement of our proposed policy against the greedy policy in terms of the endurance of flash memory is as much as 90.6%.
Solving some combinatorial problems embedded in trees
Authors: David Eppstein
Venue:  (2008)

Solving Some Combinatorial Problems Embedded in Trees, by Josiah Carlson, for a Doctor of Philosophy in Algorithms and Data Structures Theory), for the University of California at Irvine, at the Donald Bren School of Information and Computer Science, 2007, under the advisement of Dr. David Eppstein, solves a set of combinatorial problems embedded in trees, each of which optimizes a different combinatorial objective function under varying structural constraints. We carefully apply standard algorithm techniques like divide and conquer, dynamic programming, recurrence equations, and case analysis as tools to solve these problems, expanding upon what is known about combinatorial tree optimizations.
Approximating Minimum-Power k-Connectivity
Authors: Zeev Nutov
Venue: Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks (2008)

The Minimum-Power k -Connected Subgraph (MP k CS) problem seeks a power (range) assignment to the nodes of a given wireless network such that the resulting communication (sub)network is k-connected and the total power is minimum. We give a new very simple approximation algorithm for this problem that significantly improves the previously best known approximation ratios. Specifically, the approximation ratios of our algorithm are: 3 (improving (3 + 2/3)) for k = 2, 4 (improving (5 + 2/3)) for k = 3, k + 3 for k ¿ {4,5} and k + 5 for k ¿ {6,7} (improving k + 2¿(k + 1)/2¿), 3(k ¿ 1) (improving 3k) for any constant k. Our results are based on a (k + 1)-approximation algorithm (improving the ratio k + 4) for the problem of finding a Min-Power k -Inconnected Subgraph, which is of independent interest.
Generative Kernels for Gene Function Prediction Through Probabilistic Tree Models of Evolution
Authors: Luca Nicotra, Alessio Micheli, Antonina Starita
Venue: Proceedings of the 7th international workshop on Fuzzy Logic and Applications: Applications of Fuzzy Sets Theory (2007)

In this paper we extend kernel functions defined on generative models to embed phylogenetic information into a discriminative learning approach. We describe three generative tree kernels, a Fisher kernel, a sufficient statistics kernel and a probability product kernel, whose key features are the adaptivity to the input domain and the ability to deal with structured data. In particular, kernel adaptivity is obtained through the estimation of a tree structured model of evolution starting from the phylogenetic profiles encoding the presence or absence of specific proteins in a set of fully sequenced genomes. We report preliminary results obtained by these kernels in the prediction of the functional class of the proteins of S. Cervisae, together with comparisons to a standard vector based kernel and to a non-adaptive tree kernel function.
Testing Erlang data types with quviq quickcheck
Authors: Thomas Arts, Laura M. Castro, John Hughes
Venue: Proceedings of the 7th ACM SIGPLAN workshop on ERLANG (2008)

When creating software, data types are the basic bricks. Most of the time a programmer will use data types defined in library modules, therefore being tested by many users over many years. But sometimes, the appropriate data type is unavailable in the libraries and has to be constructed from scratch. In this way, new basic bricks are created, and potentially used in many products in the future. It pays off to test such data types thoroughly. This paper presents a structured methodology to follow when testing data types using Quviq QuickCheck, a tool for random testing against specifications. The validation process will be explained carefully, from the convenience of defining a model for the datatype to be tested, to a strategy for better shrinking of failing test cases, and including the benefits of working with symbolic representations. The leading example in this paper is a data type implemented for a risk management information system, a commercial product developed in Erlang, that has been used on a daily basis for several years.
Making an International Certificate Accessible
Authors: Denise Leahy, Dudley Dolan
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

Digital Literacy is necessary for all in today's information society. Is it possible to measure this? And is it possible to include accessibility in that measurement? The European Computer Driving Licence (ECDL) is accepted as a measure of digital literacy with over seven million participants worldwide. ECDL is running in over 146 countries. This paper examines the work to make this international certificate accessible while maintaining the quality of the standard. Two specific projects are examined: one an international collaboration and the other a project undertaken with a community of people with visual impairments in remote locations in Ireland.
Mining Queries
Authors: Ricardo Baeza-Yates
Venue: Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases (2007)

User queries in search engines and Websites give valuable information on the interests of people. In addition, clicks after queries relate those interests to actual content. Even queries without clicks or answers imply important missing synonyms or content. In this talk we show several examples on how to use this information to improve the performance of search engines, to recommend better queries, to improve the information scent of the content of a Website and ultimately to capture knowledge, as Web queries are the largest wisdom of crowds in Internet. 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
SOM-Based Continuous Category Learning for Age Classification by Facial Images
Authors: Koichi Ikuta, Hiroshi Kage, Kazuhiko Sumi, Ken-Ichi Tanaka, Kazuo Kyuma
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

In machine learning for person identification from facial images, feature sets are assigned into discrete categories. The age classification task, however, cannot be solved in the same way because the age-related face features go through gradual, or rather continuous, changes over the ages. From the machine learning viewpoint, age groups in terms of face images do not have clear borders, and it can be said that they can form 'continuous category'. Therefore we think that we should add the continuousness of face features to the learning process for enhancing the performance of age estimation. In this paper, we propose a model of age classification using one dimensional Self-Organizing Map, which can train the classifiers without preparing complete age information and reinforce the classifier's performance. We show the effectiveness of our model and compare the performance to that of using discrete category machine learning. In conclusions, we clarify our future directions.