ppxscal/embedding_network huggingface dataset:
Plasma processing for polymeric microfluidics fabrication and surface modification: Effect of super-hydrophobic walls on electroosmotic flow
Authors: N. Vourdas, A. Tserepi, A. G. Boudouvis, E. Gogolides
Venue: Microelectronic Engineering (2008)

We report on the fabrication and electrokinetic characterization of poly-methyl methacrylate (PMMA) microfluidics by deep O"2 plasma etching, utilizing a photosensitive poly-(dimethyl siloxane) (PDMS) as a resist (in situ mask). The mass production amenability, the high throughput without the use of mold, the dry character along with the flexibility to control surface properties towards specific demands are some of the advantages of this method. Intense ion bombardment ensures high etch rates (~1.5@mm/min) and anisotropy. A PMMA lid was thermally bonded to the plasma fabricated microchannel under 1.8kg/cm^2 at 120^oC. Surface roughness and hydrophilization are some unique features induced by plasma processing, affecting the electrokinetic performance of the microfluidic and resulting in relatively high electroosmotic flow (EOF) mobilities of 2.83x10^-^4cm^2/Vs. Teflon-like coating deposition on the engraved part modified the surface into a super-hydrophobic and resulted in even higher EOF mobility (3.89x10^-^4cm^2/Vs), thus proposing an alternative means in microfluidic surface modification and EOF control.
VPN Creation in IP/MPLS Network in Kosova
Authors: Besnik Shatri, Agim Abdullahu, Skënder Rugova, Arianit Maraj
Venue: Proceedings of the Seventh International Conference on Networking (2008)

This paper treats a MPLS VPN implementation in a network, which was initially configured for fulfilling the demands for mainly voice and ADSL services. At the beginning, the architecture of TK (Telecom of Kosova) NGN network with its corresponding elements and functionality is described. Then, based on business customers’ demands, the reconfiguration of MPLS VPN in a full mesh LSP form is presented. The standardized methodology used for creation of new services was of great support for fast provision of those services. This experience has demonstrated all the advantages of a network based MPLS VPN approach in a full mesh LSP network. At the end, the example of the full mesh LSP network topology configuration is presented. Currently, the established network is used to offer VPN services to a bank located in 4 different towns in Kosova, and later for the other customers with the similar demands.
From Hopf to Neimark Sacker bifurcation: a computational algorithm
Authors: Gerald Moore
Venue: International Journal of Computing Science and Mathematics (2008)

We construct an algorithm for approximating the invariant tori created at a Neimark Sacker bifurcation point. It is based on the same philosophy as many algorithms for approximating the periodic orbits created at a Hopf bifurcation point, i.e., a Fourier spectral method. For Neimark Sacker bifurcation, however, we use a simple parametrisation of the tori in order to determine low-order approximations, and then utilise the information contained therein to develop a more general parametrisation suitable for computing higher-order approximations. Different algorithms, applicable to either autonomous or periodically-forced systems of differential equations, are obtained.
Nonlinear Systems Identification via Two Types of Recurrent Fuzzy CMAC
Authors: Floriberto Ortiz Rodriguez, Wen Yu, Marco A. Moreno-Armendariz
Venue: Neural Processing Letters (2008)

Normal fuzzy CMAC neural network performs well for nonlinear systems identification because of its fast learning speed and local generalization capability for approximating nonlinear functions. However, it requires huge memory and the dimension increases exponentially with the number of inputs. It is difficult to model dynamic systems with static fuzzy CMACs. In this paper, we use two types of recurrent techniques for fuzzy CMAC to overcome the above problems. The new CMAC neural networks are named recurrent fuzzy CMAC (RFCMAC) which add feedback connections in the inner layers (local feedback) or the output layer (global feedback). The corresponding learning algorithms have time-varying learning rates, the stabilities of the neural identifications are proven.
Modeling of Sensor Networks Using XRM
Authors: Akim Demaille, Sylvain Peyronnet, Benoît Sigoure
Venue: Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (2006)

Wireless sensor networks are composed of small electronic devices that embed processors, sensors, batteries, memory and communication capabilities. One of the main goals in the design of such systems is the handling of the inherent complexity of the nodes, exarcerbated by the huge number of nodes in the network. For these reasons, it becomes very difficult to model and verify such systems. In this paper, we investigate the main characteristics of sensor nodes, discuss the use of a language derived from Reactive Modules for their modeling, and propose a language (and a tool set) that facilitate the modeling of this kind of system.
A Novel Evaluation Method Basing on Support Vector Machines
Authors: Guang-ming Xian, Bi-qing Zeng
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

Recently support vector machine (SVM) has become a more and more popular classification tool. We presented our two-phase, efficient, and fair evaluation method for DRMs (digital right management system) basing on SVM. Influence of three difference methods and test set number on evaluation result is discussed. After analysized by binary logistic regression, odds ratio comparison of SVM with multi-phase fuzzy synthesized evaluation and FCM illustrates that SVM is the most excellent in these three approaches. Through detailed experimental evaluations under various data set of samples and approaches, our evaluation method of SVM is illustrated to be scalable and accurate.
Complexity of scheduling with analog network coding
Authors: Olga Goussevskaia, Roger Wattenhofer
Venue: Proceeding of the 1st ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing (2008)

In this paper we analyze the complexity of scheduling wireless links in the physical interference model with analog network coding capability. We study two models with different definitions of network coding. In one model, we assume that a receiver is able to decode several signals simultaneously, provided that these signals differ in strength significantly. In the second model, we assume that routers are able to forward the interfering signal of a pair of nodes that wish to exchange a message, and nodes are able to decode the "collided" message by subtracting their own contribution from the interfered signal. For each network coding definition, we construct an instance of the scheduling problem in the geometric SINR model, in which nodes are distributed in the Euclidean plane. We present NP-completeness proofs for both scenarios.
A Graph-Theoretic Classification of Gene Expression Microarray Data of Cancer
Authors: Saejoon Kim
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

Microarray is a fascinating technology capable of providing high throughput simultaneous measurement of expression levels of thousands of genes which can accurately represent the state of a biological cell or tissue of interest. For this reason, it is used for many applications including identification of various types of disease-related genes [1] [2], classification of biological samples into normal and diseased [3] [4] [5] or two or more subcategories of a given disease [1] [6], pharmacogenomics and clinical studies, and many more.
Recognizing Traffic Jams with Hovering Data Clouds
Authors: Sándor P. Fekete, Christiane Schmidt, Axel Wegener, Stefan Fischer
Venue: Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (2006)

Many complex structures in our modern world exist independent of the individual entities they are composed of, giving them an "organic'' quality. Important examples include traffic phenomena, in particular traffic jams; despite of strong efforts over many years, centralized computing has been unable to deal with the resulting problems in a satisfactory manner. However, with the growing power of sensing devices and wireless communication, participants in traffic are no longer restricted to display passive, particle-like behavior; instead, local data exchange makes it technically feasible to aim for decentralized coordination between cars. One fundamental concept for making use of these possibilities comprises Hovering Data Clouds, which consist of relevant information that is kept by ever-changing carriers; a prototypical scenario arises in a traffic jam, where data is maintained by passing it on to newly arriving cars. In this study, we present algorithmic methods for this concept. This paper is part of project AutoNomos (www.auto-nomos.de),which aims at traffic control in a decentralized manner.
The Value of Continuous Auditing
Authors: Ronald M. Hoffer
Venue: The EDP Audit, Control, and Security Newsletter (2007)

Is there value in Continuous Auditing? This question can arise whenever the Audit professional seeks to introduce a new auditing technique to their firm. A change such as this will quite likely involve some combination of additional support from the Audit department and executive management, more personnel, disruption to the company's audit plan, or increased cost. Companies do not wish to incur the potential pain in changing a properly functioning process, unless there are clear benefits. This article will not only describe the value derived from Continuous Auditing, but also an implementation approach and the stages for introducing Continuous Auditing.
iSCSI Simulation Study of Storage System
Authors: Smita Vishwakarma, Sankalp Bagaria
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

Demands for more storage in the industry has increased beyond that the traditional storage mechanisms can supply and thus, the concept of Storage Area Networks (SANs) has evolved. This has resulted in the design of iSCSI (Internet SCSI) protocols that have SCSI commands and allow data transfer to take place over the network. Fiber channel protocol was the first such protocol that used Gigabit per second links to carry commands over long distances. The iSCSI Protocol maps the SCSI block oriented storage data over TCP/IP and enables storage devices to be accessed over standard Ethernet based TCP/IP networks, With the development of Gigabit Ethernet and the iSCSI protocol, reduction in costs and a uniform network infrastructure can be achieved.Simulation offers a flexible way to study the iSCSI – based storage systems. We wish to study a storage area network, which uses iSCSI Protocol to exchange data between its various nodes. This study will help us in understanding how iSCSI works in a storage area network. We have used ns2 for our simulation work. We have simulated an iSCSI initiator and an iSCSI target, which communicate through iSCSI. iSCSI lies upon TCP Protocol. R/W requests are made by the iSCSI initiator and data exchange takes place depending on these requests. The throughput is calculated and graph is plotted.
Superquadric Segmentation in Range Images via Fusion of Region and Boundary Information
Authors: Dimitrios Katsoulas, Christian Cea Bastidas, Dimitrios Kosmopoulos
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2008)

The high potential of Superquadrics as modeling elements for image segmentation tasks has been pointed out since years in the computer vision community. In this work we employ superquadrics as modeling elements for multiple object segmentation in range images. Segmentation is executed in two stages. Firstly, a hypothesis about the values of the segmentation parameters is generated. Secondly, the hypothesis is refined locally. In both stages, object boundary and region information are considered. Boundary information is derived via model-based edge detection in the input range image. Hypothesis generation uses boundary information to isolate image regions which can be accurately described by superquadrics. Within hypothesis refinement, a game-theoretic framework is used to fuse the two information sources by associating an objective function to each information source. Iterative optimization of the two objective functions in succession, outputs a precise description of all image objects. We demonstrate experimentally that this approach substantially improves the most established method in superquadric segmentation, in terms of accuracy and computational efficiency. We demonstrate the applicability of our segmentation framework in real world applications by constructing a novel robotic system for automatic unloading of jumbled box-like objects from platforms.
The Shuffle-Exchange Mesh Topology for 3D NoCs
Authors: Akbar Sharifi, Reza Sabbaghi-Nadooshan, Hamid Sarbazi-Azad
Venue: Proceedings of the The International Symposium on Parallel Architectures, Algorithms, and Networks (2008)

Nowadays networks-on-chip are emerging as a hot topic in IC designs with high integration. In addition to popular mesh and torus topologies, other structures can also be considered especially in 3D VLSI design. The shuffle-exchange topology is one of the popular interconnection architectures for multiprocessors due to its scalability and self-routing capability. By vertically stacking two or more silicon wafers, connected with a high-density and high-speed interconnect, it is now possible to combine multiple active device layers within a single IC. In this paper we propose an efficient three dimensional layout for a novel 2D mesh structure based on the shuffle-exchange topology. Simulation results show that by using the third dimension, performance and latency can be improved compared to the 2D VLSI implementation.
Upper and lower bounds for routing schemes in dynamic networks
Authors: Y. Afek
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

An algorithm and two lower bounds are presented for the problem of constructing and maintaining routing schemes in dynamic networks. The algorithm distributively assigns addresses to nodes and constructs routing tables in a dynamically growing tree. The resulting scheme routes data messages over the shortest path between any source and destination, assigns addresses of O(log/sup 2/n) bits to each node, and uses in its routing table O(log/sup 3/n) bits of memory per incident link, where n is the final number of nodes in the tree. The amortized communication cost of the algorithm is O(log n) messages per node. Also given are two lower bounds on the tradeoff between the quality of routing schemes (i.e. their stretch factor) and their amortized communication cost in general dynamic networks.
Stability under perturbations of some condition numbers in optimization
Authors: Tullio Zolezzi
Venue: Mathematical Programming: Series A and B (2008)

The behavior of condition numbers for free optimization problems under perturbations is considered in the infinite-dimensional setting. Semicontinuity properties via distance to ill-conditioning are obtained. Convergence theorems of the condition numbers are proved under variational convergence of the perturbed problems and suitable behavior of the gradients of the corresponding functionals. The particular case of convex quadratic forms is presented.
Dynamic Simulation of Indoor Rowing Exercise for Paraplegics
Authors: Zakaria Hussain, M. O. Tokhi, S. Gharooni
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

This paper presents the development of an FES-assisted indoor rowing exercise model designed for persons with spinal cord injury (SCI). A modified indoor rowing machine and humanoid are modelled using the Visual Nastran dynamic simulation software. The humanoid model is designed based on anthropometric data. The knee and elbow trajectories are obtained for both normal rowing sequence and rowing sequence with voluntary upper body effort. The model developed is evaluated via the torque required at the knee joint and elbow joint throughout the rowing cycle. The model required an adequate amount of torque in order to produce a smooth rowing manoeuvre. The performance of the model developed indicates that the model can be used for future development of FES-assisted indoor rowing exercise.
Customization change impact analysis for erp professionals via program slicing
Authors: Nurit Dor, Tal Lev-Ami, Shay Litvak, Mooly Sagiv, Dror Weiss
Venue: Proceedings of the 2008 international symposium on Software testing and analysis (2008)

We describe a new tool that automatically identifies impact of customization changes, i.e., how changes affect software behavior. As opposed to existing static analysis tools that aim at aiding programmers or improve performance, our tool is designed for end-users without prior knowledge in programming. We utilize state-of-the-art static analysis algorithms for the programs within an Enterprise Resource Planning system (ERP). Key challenges in analyzing real world ERP programs are their significant size and the interdependency between programs. In particular, we describe and compare three customization change impact analyses for real-world programs, and a balancing algorithm built upon the three independent analyses. This paper presents PanayaImpactAnalysis (PanayaIA), a web on-demand tool, providing ERP professionals a clear view of the impact of a customization change on the system. In addition we report empirical results of PanayaIA when used by end-users on an ERP system of tens of millions LOCs.
Temporal change in canopy reflectance at visible wavelength as a biophysical indicator of jute (Corchorus capsularis L.) growth
Authors: B. Raychaudhuri, S. Bhattacharyya
Venue: International Journal of Remote Sensing (2007)

Changes in the reflectance and transmittance of jute canopy at different visible wavelengths of solar radiation are measured at different growth stages throughout the period of half crop cycle. The reflectance is found to gradually decrease and attain a steady value with canopy growth up to about one-third of the crop cycle. As an independent study, vegetation growth parameters such as canopy height, leaf length, leaf area are simultaneously measured. It is concluded that although these parameters have individual properties, the whole canopy ultimately occupies a constant fraction of the air volume over the soil. As a combined effect of the above parameters, the transmittance through the leaf-air composite becomes saturated. A suitable mathematical explanation is given for the above. It is affirmed from these two independent sets of experiments that the vegetation growth is truly echoed in the temporal change in visible wavelength reflectance, the remotely sensible parameter. Thus the present work proposes a methodology for remotely observing the growth of vegetation and it is justified with jute, an important cash crop in eastern India.
Emotions in ODR
Authors: Marta Poblet, Pompeu Casanovas
Venue: International Review of Law, Computers and Technology (2007)

For years, the emotions of individuals involved in the areas of negotiation and conflict resolution have been widely researched. Standard methods of negotiation have dealt with the individuals' arousal and expression of a vast array of emotional states. If we consider ODR as a communicative process involving a group of individuals engaged in an interactive decision-making task, we will need to admit that emotions are an essential component in any online disputing process. This paper proposes a review of recent literature on emotions and ODR to discuss controversial issues such as the capacity of ODR techniques to deal with emotions and the advantages and disadvantages of computer-mediated communication versus face-to-face communication in terms of expressions of emotions.
Structural Model of Real-Time Databases: An Illustration
Authors: Nizar Idoudi, Claude Duvallet, Bruno Sadeg, Rafik Bouaziz, Faiez Gargouri
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

A real-time database is a database in which both the data and the operations upon the data may have timing constraints. The design of this kind of database requires the introduction of new concepts to modelize both data structures and the dynamic behavior of the database. In this paper, we propose an UML2.O profile, entitled UML-RTDB, allowing the design of structural model for a real-time database. One of the main advantages of UML-RTDB is its capacity to take into account real-time database properties through specialized concepts in rigourous, easy and expressive manner
Numerical analysis of 3D boundary inverse conductivity problems for anisotropic media
Authors: Igor Brilla
Venue: Proceedings of the 7th WSEAS International Conference on Applied Mathematics (2005)

We deal with numerical analysis of inverse conductivity problems for anisoptropic media when measured data are given only on the boundary of the domain. For numerical analysis of such problems we apply discret methods. In this paper we elaborate iterative procedure to the numerical solution of anisotropic boundary inverse conductivity problems and we derive conditions for measured input states which secure determinablenees of the numerical solution. The paper also contains numerical experiments.
Apple tasting and nearly one-sided learning
Authors: D. P. Helmbold
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

In the standard on-line model the learning algorithm tries to minimize the total number of mistakes made in a series of trials. On each trial the learner sees an instance, either accepts or rejects that instance, and then is told the appropriate response. The authors define a natural variant of this model ('apple tasting') where the learner gets feedback only when the instance is accepted. They use two transformations to relate the apple tasting model to an enhanced standard model where false acceptances are counted separately from false rejections. They present a strategy for trading between false acceptances and false rejections in the standard model. From one perspective this strategy is exactly optimal, including constants. They apply the results to obtain a good general purpose apple tasting algorithm as well as nearly optimal apple tasting algorithms for a variety of standard classes, such as conjunctions and disjunctions of n boolean variables. They also present and analyze a simpler transformation useful when the instances are drawn at random rather than selected by an adversary.