ppxscal/embedding_network huggingface dataset:
Miniaturized PMMA ball-valve micropump with cylindrical electromagnetic actuator
Authors: Meng Shen, Christophe Yamahata, Martin A. M. Gijs
Venue: Microelectronic Engineering (2008)

We have fabricated and characterized a reciprocating poly(methylmetacrylate) (PMMA) ball-valve micropump actuated with a miniaturized cylindrical electromagnetic circuit. By finite element calculations, we have optimized the structure of the electromagnet that actuates a rare-earth permanent magnet embedded in a poly(dimethylsiloxane) (PDMS) pumping membrane. Powder blasting and conventional micromachining techniques are used for micropatterning the PMMA layers forming the microfluidic circuit. The self-priming ball-valve micropump exhibits a backpressure up to 35kPa; water is pumped at a flow rate as high as 6.0mL/min for a 2W electromagnetic actuation power at the resonant frequency of 20Hz. The actuation frequency-dependent flow rate is in excellent agreement with a damped oscillator model.
3D-Garden
Authors: Victor I. Lesk, Michael J. E. Sternberg
Venue: Bioinformatics (2008)

Motivation: Reliable structural modelling of protein–protein complexes has widespread application, from drug design to advancing our knowledge of protein interactions and function. This work addresses three important issues in protein–protein docking: implementing backbone flexibility, incorporating prior indications from experiment and bioinformatics, and providing public access via a server. 3D-Garden (Global And Restrained Docking Exploration Nexus), our benchmarked and server-ready flexible docking system, allows sophisticated programming of surface patches by the user via a facet representation of the interactors’ molecular surfaces (generated with the marching cubes algorithm). Flexibility is implemented as a weighted exhaustive conformer search for each clashing pair of molecular branches in a set of 5000 models filtered from around ~340 000 initially. Results: In a non-global assessment, carried out strictly according to the protocols for number of models considered and model quality of the Critical Assessment of Protein Interactions (CAPRI) experiment, over the widely-used Benchmark 2.0 of 84 complexes, 3D-Garden identifies a set of ten models containing an acceptable or better model in 29/45 test cases, including one with large conformational change. In 19/45 cases an acceptable or better model is ranked first or second out of 340 000 candidates. Availability: http://www.sbg.bio.ic.ac.uk/3dgarden (server) Contact: v.lesk@ic.ac.uk Supplementary information: Supplementary data are available at Bioinformatics online.
Postoperative follow up by dynamic light scattering: Detection of inflammatory molecular changes in the cornea, the vitreous and the lens
Authors: Franz Fankhauser,  II
Venue: Technology and Health Care (2007)

Objective: To detect post-op molecular changes and inflammatory processes by dynamic light scattering (DLS) in eye segments. To develop DLS parameters which are appropriate for the control of post-op course after ophthalmologic surgery. Methods, design: Three new DLS devices were tested in different post-op clinical settings such as pseudoexfoliation syndrome (PEX), cataract surgery and retinal surgery. In a second step DLS was used to detect molecular changes in the cornea of 6 patients after photo refractive keratectomy (PRK) and 16 patients after photo astigmatic refractive keratectomy (PARK). Results: In PEX-patients cataract surgery changed the DLS signals of the anterior chamber and the lens in a specific way compared to the pre-op situation. Cataract patients without PEX had more scattering particles post-op and retinal surgery modified the DLS signal of the vitreous. Furthermore it was shown that the length of the corneal scattering vector l correlated with the process of the corneal wound healing after PARK. One and three months after surgery the lengths of the scattering vectors had increased significantly but returned to pre-op values twelve months post-op. Discussion: The post-op transparency of eye segments such as the cornea, the vitreous and the anterior chamber depends primarily on the wound healing mechanisms. DLS seems to be a suitable method to control the corneal recovery after refractive surgery. Conclusions: The length of the scattering vector l correlates well with the wound healing after refractive surgery. However DLS-signals seem to contain information about the molecular composition of tissue too. Therefore further research is needed to refine the interpretation of the DLS signals.
ADENS: Efficient address determination for mobile grids
Authors: Nian-Feng Tzeng, Hongyi Wu, Gui-Liang Feng
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

This article deals with distributed address determination for mobile Grids, realized by ADENS (address determination via neighboring states), where a new mobile host (MH) determines a conflict-free address for itself efficiently according to state information only from neighboring MHs. With low traffic overhead, ADENS achieves higher address space utilization than the best known approach. The optimal design of basic ADENS has been derived analytically for the first time. Enhanced ADENS can be achieved by designating appropriate MHs (instead of permitting all MHs) to respond to address requests of newly arrived MHs, further improving address space utilization markedly while lowering traffic overhead drastically. Our simulation results reveal that enhanced ADENS enables a mobile Grid to operate practically as long as it needs.
Towards the formalization of knowledge representation
Authors: Omar López-Ortega, Joel Suárez-Cansino, Virgilio López-Morales
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

In this paper it is presented a formal methodology based on topology theory to represent knowledge. This framework is used to describe the creation of a semantic network, which is then represented by means of First-Order Logic. By a series of functions applied to a natural basis, issued from the application domain, a family of sets are synthesized with their sub-spaces correlated. Therefore the resultant subspaces and their relations form a network of elementary and complex concepts. Complete correspondence among the sub-spaces, the IDEF1x model of the semantic network and the First-Order Logic is obtained by employing this framework. The process planning application domain is used to illustrate the creation of the resultant knowledge base.
A comprehensive integer programming model with special forms for optimal provision of multiple manufactures
Authors: Said A. Hassan, Seraj Y. Abed
Venue: Proceedings of the 12th WSEAS International Conference on Applied Mathematics (2007)

In a previous paper written by the same authors, the provision of manufactured components of only one type was presented, the provision can be done using three different methods, production, importing/storing, and subcontracting. The problem is to determine how many components should be provided using different method in order to accomplish the required demand and to minimize the total cost of provision. A mathematical model for such a problem was formulated and used to obtain the optimal solution. In another paper for the same authors, a more generalized problem with multiple manufactured components was considered. The objective function is to minimize the total fixed and variable costs of provision of all needed types of components. A special (If-Then) form for the objective function is generated due to the addition of the fixed cost elements. Another special form for the objective function is generated due to the stepped unit prices. The main problem constraints are: The provision of the total demand, maximum available time for production, the limited area for storing, and the constraints corresponding to the subcontracting stepping prices conditions. The if-then conditions were transformed into conditional relations with the addition of auxiliary 0-1 variables. In the previous papers, the interior design of the provision systems was determined, and it was taken as structure constraints. In this paper a comprehensive model is designed in order to take care of the optimal interior design of the provision systems in addition to all the previously mentioned system constraints. The design includes the determination of the optimal number of different machines for the production facilities, and the optimal area for the import/storing facilities.
On the decomposition map for symmetric groups
Authors: Karin Erdmann
Venue: Journal of Algebraic Combinatorics: An International Journal (2008)

Let R d be the ¿-module generated by the irreducible characters of the symmetric group ${\mathcal{S}}_{d}$ . We determine bases for the kernel of the decomposition map. It is known that R d ¿ ¿ F is isomorphic to the radical quotient of the Solomon descent algebra when F is a field of characteristic zero. We show that when F has prime characteristic and I br d is the kernel of the decomposition map for prime p then R d /I br d ¿ ¿ F is isomorphic to the radical quotient of the p-modular Solomon descent algebra.
Multiple Care-of Addresses Registration and Capacity-Aware Preference on Multi-Rate Wireless Links
Authors: Jen-Yi Pan, Jing-Luen Lin, Kai-Fung Pan
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Users demand not only seamless continuation but also high throughput of Internet access as they hop across different administrative domains and heterogeneous networks during an ongoing session. By extending the multiple care-of addresses registration based on Mobile IPv6, the proposed mechanism may provide seamless access with soft handoff notion as well as high throughput with automatically selecting the best link among multiple interfaces when the wireless channel continuously changes. Moreover, our mechanism can fit for any access technologies because only layer three modification and techniques (like Packet Pair) are required. The simulation result shows the proposed scheme outperforms the conventional Mobile IPv6 in both seamless continuation and throughput. This study also provides a further insight on the issues of multiple interfaces and heterogeneous networks, which can promote the technology of next generation wireless network.
Sparse multiscale gaussian process regression
Authors: Christian Walder, Kwang In Kim, Bernhard Schölkopf
Venue: Proceedings of the 25th international conference on Machine learning (2008)

Most existing sparse Gaussian process (g.p.) models seek computational advantages by basing their computations on a set of m basis functions that are the covariance function of the g.p. with one of its two inputs fixed. We generalise this for the case of Gaussian covariance function, by basing our computations on m Gaussian basis functions with arbitrary diagonal covariance matrices (or length scales). For a fixed number of basis functions and any given criteria, this additional flexibility permits approximations no worse and typically better than was previously possible. We perform gradient based optimisation of the marginal likelihood, which costs O(m2n) time where n is the number of data points, and compare the method to various other sparse g.p. methods. Although we focus on g.p. regression, the central idea is applicable to all kernel based algorithms, and we also provide some results for the support vector machine (s.v.m.) and kernel ridge regression (k.r.r.). Our approach outperforms the other methods, particularly for the case of very few basis functions, i. e. a very high sparsity ratio.
RTQG: Real-Time Quorum-based Gossip Protocol for Unreliable Networks
Authors: Bo Zhang, Kai Han, Binoy Ravindran, E. D. Jensen
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

We consider scheduling real-time tasks in the presence of message loss and Byzantine node failures in unreliable networks. We present scheduling algorithms called RTQG and RTQG-B. The algorithms use quorum-based gossip communication strategies for dynamically and dependably discovering eligible nodes. Compared with its predecessors, our protocol exhibits better performance. RTQG utilizes quorum systems to limit the range of each gossip round. Using the intersection property of quorum systems, RTQG has advantages in message propagation and robustness to Byzantine node failures. Our simulation studies verify our analytical results.
Security services provision for telematic services at the knowledge and information society
Authors: José-F Martínez, Vicente Hernández, Miguel-A Valero, Ana Gómez, Emilia Pérez, Iván Pau, Hugo Álvarez, Laura Vadillo
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

The Knowledge and Information Society development has promoted the evolution of telematic services, such as those for e-government and e-health, which aim to offer feasible solutions to social and citizens problems that will strengthen the democracy, foster citizens equal opportunities and ease their participation in the processes of the public administration and the help to the needy. Though the different telematic services are internally constituted for similar or even identical subservices, the interoperability is not possible among them and components sharing either. In order to encourage the development of the above mentioned type of services, the present article proposes an architecture that contributes to the interoperability and sharing of subservices. This architecture derives from the study of two scenarios, one of e-health and other one of e-goverment, with similar needs of security for the user' or elements authentication and the operations authorization.
Discourses on age: confronting disputed concepts by means of dialogue
Authors: Johan Berglund
Venue: AI Society (2008)

The article explores approaches to discourses concerning age, with different agendas and national contexts. The Dialogue Seminar Method is introduced, as a means of facilitating reflection and access to tacit knowledge. Democratic dialogue requires orchestration, and enables horizontal communication and collective reflection.
The Ever Expanding Ecosystem for Embedded Computing
Venue: Queue (2008)

Mike Vizard from ACM Queue talks with Oracle's Mike Olson about the changing architecture of network-enabled applications. Olson explains the thinking behind the company's new focus on embedded database and middleware technology. He explores the technical, business and economic forces shaping this fast-growing market. Tune in to learn how Oracle plans to serve customers way outside the enterprise. 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
Synthesis of FSMs on the basis of reusable hardware templates
Authors: Valery Sklyarov, Iouliia Skliarova, Bruno Pimentel
Venue: Proceedings of the 6th WSEAS International Conference on Systems Theory & Scientific Computation (2006)

This paper suggests a reusable hardware template (HT) for finite state machines (FSM) and a method for the synthesis of FSMs based on such a template. The HT is a circuit with a predefined structure that has already been implemented in hardware (for example, in FPGA). By reprogramming its RAM-blocks we can implement a different functionality of the FSM. The proposed method permits the translation of a given FSM specification (that takes into account the parameters of a particular HT) into bitstreams for reloading the RAM-blocks. Run-time modifications are also permitted with the aid of dual-port memory. Note that the resulting FSM circuits are very fast and any state transition is performed within one clock cycle. The designed C++ program provides synthesis, verification and modeling of FSMs. The synthesized circuits were implemented and tested in Xilinx FPGAs. The synthesis methods considered permit various target requirements to be satisfied, such as minimizing the complexity of the circuit and the possibility for changes in the circuit functionality.
The concept of derivatives using abstract algebra (abstract only)
Authors: Matthew Prince
Venue: ACM Communications in Computer Algebra (2008)

The purpose of this poster is to present the concept and proof of several rules of derivative using terminology and tools in abstract algebra. Four main tasks are fulfilled: prove that the differential operator D is a linear transformation, the product rule, and the degree of the derivative is one less than the degree of the original polynomial, and some corollaries and propositions. Some of the problems can be solved by using the limit definition introduced in calculus courses. The motivation for proof is presented in a format of showing the facts about polynomials and their derivatives using nothing but algebraic concepts and proof technique.
Constructive spectral approaches for the Helmholtz decomposition of a vector field
Authors: E. Ahusborde, M. Azaïez, M. O. Deville, R. Gruber, E. H. Mund
Venue: Applied Numerical Mathematics (2008)

This paper presents spectral approaches on staggered grids to extract the solenoidal (i.e. divergence free) and non-solenoidal (i.e. curl free or, gradient of a scalar field) components of a given vector field. Basically, the vector field is described using a polynomial expansion (P"N^0@?P"N"-"1)x(P"N"-"1@?P"N^0) on a GLL/GL-GL/GLL mesh, and the scalar field is computed using a polynomial expansion P"N"-"1@?P"N"-"1 on the GL/GL grid. These approaches use the same spectral element and consist in a projection either onto the kernel of the -grad(div) operator, or onto its range. Two variational formulations are presented and studied to approximate the divergence free and the curl free parts of the spectrum. Each one is well adapted to ensure the expected constraints. The approaches are detailed and illustrated by several numerical examples.
Incentive-Based Technology Start-Up Program for Undergraduate Students
Authors: Joshua James Pauli
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

This paper summarizes the partnership between Dakota State University (DSU) and the Lake Area Improvement Corporation (LAIC) that supports the Center for TechnoEntrepreneurism at Dakota State University (CT@DSU). Special attention is paid to the operational details of the CT@DSU involving: interacting and servicing student venture ideas, establishing a realistic timeline, developing a CT@DSU Board of Advisors comprised of DSU faculty and community business leaders, expanding partnerships with external entities to provide specialty assistance to student ventures, providing student entrepreneurs with the appropriate amount of training related to starting a technology venture, partnering with area technology entrepreneurs for lessons learned and best practices, and creating and executing a realistic milestone-driven approach to student venture incentives and capital injection. This paper provides a 90 day review of the formation of the CT@DSU, milestones reached, and future work yet to be undertaken.
Lie group integrators with non-autonomous frozen vector fields
Authors: Borislav V. Minchev
Venue: International Journal of Computational Science and Engineering (2007)

Lie group methods for non-autonomous semi-discretised in space, partial differential equations are considered. The use of time-dependent frozen vector fields and their corresponding algebra actions on a manifold is introduced. A new integration scheme, for the numerical solution of semi-linear problems, based on the so-called 'comutator-free Lie group methods', with algebra action arising from the proposed new framework is derived. The scheme is then compared with some existing methods in several numerical experiments.
SAGE and coding theory (abstract only)
Authors: David Joyner, Robert Miller
Venue: ACM Communications in Computer Algebra (2008)

This is a very brief survey of recent work in SAGE on implementing algorithms to compute with linear block codes. http://www.sagemath.org. SAGE is a mathematical software package similar to the "big M's" (Maple, Mathematica, Magma, and Matlab) but free and open source. Download information and manuals are available at http://www.sagemath.org/. Included in SAGE is the group theory package GAP and GUAVA, GAP's coding theory package. All of GUAVA's functions can be accessed within SAGE.
Architecting as decision making with patterns and primitives
Authors: Uwe Zdun, Paris Avgeriou, Carsten Hentrich, Schahram Dustdar
Venue: Proceedings of the 3rd international workshop on Sharing and reusing architectural knowledge (2008)

The application of patterns is used as a foundation for many central design decisions in software architecture, but because of the informal nature of patterns, these design decisions are usually not precisely documented in the models. In our earlier work, we had proposed pattern primitives as a solution to precisely model the patterns in the corresponding architectural views. Building upon that approach, this paper introduces a pattern-based architecting process that aims at inexpensively documenting design decisions in the architectural views alongside the natural flow of design. The decisions that are made explicit, concern the selection of patterns, their variants and the corresponding primitives, as well as the resolution of inconsistencies between the architectural views. The approach is demonstrated in the domain of process-driven SOA for two architectural views: Component-and-Connector and Process Flow.
RDF Repository of Experts Based on Context Oriented Automatic Annotation Framework
Authors: Muna Hatem, Daniel Neagu, Haider Ramadan
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

Semantic Web applications use domain Ontology together with Web pages annotated with machine-understandable metadata related to the Ontology. Current Semantic Web applications often rely on the participation of individuals to annotate their documents or create a special page to describe the information and semantics needed. The annotation process has limited the success of such systems. We, at Sultan Qaboos University (SQU), are working on developing a Semantic web application of the researchers working at the university or collaborating with researchers who are working at the university. The Web pages processed contain both English and Arabic texts. In implementing this work, we do not involve researchers in the annotation process; we introduce and use an automatic annotation framework to create the metadata required. The framework produces a Jena model of researchers’ information and the annotated versions of the processed web pages. This work will be used as an initial semantic-based model that will eventually include implementing all the other applications at SQU, especially the e-learning system currently on WebCT.