ppxscal/embedding_network huggingface dataset:
Comparison between discrete and continuum modeling of granular spreading
Authors: Anne Mangeney, Lydie Staron, Dmitri Volfson, Lev Tsimring
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

Numerical simulation of the collapse of granular material over an horizontal plane using both continuum and discrete element approach shows that continuum models based on the Long Wave Approximation (LWA) overestimate the driving forces involved during the collapse. This effect increases when the aspect ratio of the granular mass increases. Comparison between discrete and continuum simulations makes it possible to show that the assumption of hydrostatic normal stress is essentially responsible of the limits of the LWA when the aspect ratio increases. The vertical acceleration, neglected in the vertical momentum equation, is shown to play a significant role when the aspect ratio increases. As a result, numerical simulations of real geophysical flows using thin layer models will be significantly improved if a new asymptotic analysis is performed including the effects of the vertical acceleration.
Towards Performance Related Decision Support for Model Driven Engineering of Enterprise SOA Applications
Authors: Mathias Fritzsche, Wasif Gilani, Ivor Spence, T. John Brown, Peter Kilpatrick, Rabih Bashroush
Venue: Proceedings of the 15th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems (2008)

Model Driven Performance Engineering (MDPE) enables early performance feedback in a MDE process, in order to avoid late identification of performance problems which could cause significant additional development costs. In our past work we argued that a synchronization mechanism between development and performance analysis models is required to adequately integrate analysis results into the development process enabling performance related decision support. In this paper we present a solution for this requirement. We present a new multi-view based approach and its implementation enabling systematic performance related decision support. We currently apply our research on the model driven engineering of process orchestrations on top of SAP’s Enterprise Service Oriented Architecture (Enterprise SOA).
Use of Mobile Phones in Language Learning: Developing Effective Instructional Materials
Authors: Murat Saran, Kursat Cagiltay, Golge Seferoglu
Venue: Proceedings of the Fifth IEEE International Conference on Wireless, Mobile, and Ubiquitous Technology in Education (2008)

With its widespread use and its features and functions such as mobility, reachability, localization,and personalization, mobile phone technology offers a great potential in learning environments. With this consideration, our first and foremost aim in this study has been to make use of this profound interest and potential, and contribute to the efforts to enhance existing educational practices, particularly in the developing regions of the world. Therefore, we developed instructional materials to be delivered through mobile phones operated in second generation GSM technology in order to improve English language learners' vocabulary acquisition. The multimedia messages in this study allowed students to see the definitions of words, example sentences, related visual representations, and pronunciations. After students finished reading multimedia messages, interactive short message service (SMS) quizzes for testing their learning were sent. This paper suggests some important points to consider while creating MMS content and a SMS quiz system for educational purposes.
Composition and Generalization of Context Data for Privacy Preservation
Authors: Linda Pareschi, Daniele Riboni, Alessandra Agostini, Claudio Bettini
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

This paper presents preliminary results on anonymization and obfuscation techniques to preserve users' privacy in context-aware service provisioning. The techniques are based on generalizing request parameters as well as the context data provided to the application. Local context semantic aggregation is used to improve the quality of service that can be achieved while preserving privacy. The paper also shows how the software architecture of the CARE middleware can be extended to implement the proposed techniques.
Location of a facility minimizing nuisance to or from a planar network
Authors: Tammy Drezner, Zvi Drezner, Carlton H. Scott
Venue: Computers and Operations Research (2009)

In this paper we investigate the location of a facility anywhere inside a planar network. Two equivalent problems are analyzed. In one problem it is assumed that the links of the network create a nuisance or hazard and the objective is to locate a facility where the total nuisance is minimized. An equivalent problem is locating an obnoxious facility where the total nuisance generated by the facility and inflicted on the links of the network is minimized. Exact and approximate solution methods for its solution are proposed and tested on a set of planar networks with up to 40,000 links yielding good results.
Finite element simulation of polymer behaviour using a three-dimensional, finite deformation constitutive model
Authors: K. Hasanpour, S. Ziaei-Rad
Venue: Computers and Structures (2008)

This paper presents a phenomenological three-dimensional viscoelastic-plastic constitutive model for polymers. The model is based on the assumption that stress can be decomposed into two parts, namely viscoelastic and elastic-plastic. The proposed rate-dependent nonlinear model is then implemented in a finite element program. The validity of the code is assessed by the data from experiments on a specific polymer. The data from three types of tests, namely uniaxial compression, creep, and relaxation, are used to evaluate the validity of the model. Comparisons show that the proposed constitutive model could satisfactorily represent the time-dependent mechanical behaviour of polymers. The model is then used to study the effect of friction in the compression test and the behaviour of polymers under cyclic loading.
Distillation decoupling: a new procedure for two point composition control
Authors: Sanda Mihalache, Vasile Cirtoaje, Marian Popescu, Alina Baiesu
Venue: Proceedings of the 6th WSEAS International Conference on Systems Theory & Scientific Computation (2006)

The proposed decoupling procedure is a theoretical-experimental procedure that can be applied as a rule to two input - two output processes without RHP poles. Compared to the current procedures of distillation decoupling, the proposed decoupler is parametric. The decoupler is tested on propylene-propane distillation column, and the simulation results show that the proposed decoupling procedure is a useful tool for composition decoupling. This procedure can also gain recognition in other areas of chemical process control, especially when relative gain array elements are relatively small and larger than one.
Problem formulation and solution for a real-world sports scheduling problem
Authors: Mike B. Wright
Venue: Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science (2005)

This paper describes a problem faced every year by the Devon Cricket League in England. Every league match requires two officiating umpires. There are various preferences relating to the deployment of umpires which fall short of being definite constraints. The requirement was to produce a computer system which would allocate umpires in a satisfactory manner without the need for human interaction, since the users of the system will be unqualified amateurs. This necessitated the construction of a very complex objective function, using imprecise and ill-defined information. The biggest challenge was thus one of problem formulation; the solution technique was relatively straightforward. The system has been put into successful use and it is expected that its use will continue indefinitely.
Bulldozer: A Cribless Rapid Analytical Machine (RAM) Solution to Enigma and its Variations
Authors: Lee A. Gladwin
Venue: Cryptologia (2007)

The breaking of German Naval Enigma ciphers relied heavily on finding cribs. Most of the now well-known bombes and Rapid Analytical Machine(s) were designed to assist with discovering cribs. What if the Germans make changes in their Enigma machine, for which there were few or no cribs? This article looks at a time when this nearly happened and Bulldozer, a machine designed to break keys without cribs.
Increasing Additive Noise Removal in Speech Processing Using Spectral Subtraction
Authors: Cliston Cole, Marc Karam, Heshmat Aglan
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

In this research, we present a technique to increase noise removal from noisy speech signals using Spectral Subtraction. The noise removal algorithm includes storing the noisy speech data into Hanning time-widowed half-overlapped data buffers, computing the corresponding spectrums using the FFT, removing the noise from the noisy speech, and reconstructing the speech back into the time domain using the inverse fast Fourier transform (IFFT). Performance of the algorithm was evaluated by calculating the Speech to Noise ratio (SNR). The improvement technique involved varying the lengths of the Hanning time windows, as well as the degrees of data buffers overlapping. Further improvement was sought by using frame averaging technique, which consists in averaging various data buffers before applying the FFT. Results showed that using one-fourth overlapped data buffers with 128 points Hanning windows and no frames averaging lead to the best performance in removing noise from the noisy speech.
Novel critical-path based low-energy scheduling algorithms for heterogeneous multiprocessor real-time embedded systems
Authors: Yanhong Liu, Bharadwaj Veeravalli, Sivakumar Viswanathan
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

In this paper, we propose novel low-energy static and dynamic scheduling algorithms with low computational complexities, for heterogeneous multiprocessor real-time embedded systems. We consider task graphs with deadlines and precedence relationships to satisfy. We propose a novel scheme, referred to as &#x201C;critical-path information track-and update&#x201D;, based on critical-path analysis to distribute the slack-time over tasks such that energy consumption is minimized, while guaranteeing the precedence and timing constraints. Our dynamic scheduling algorithm applies the static scheduling algorithm during runtime based on the updated average-case execution demands of tasks. Our simulation results show that the proposed static scheduling algorithm consumes only 2% of the computational time with no degradation in energy savings, whereas the dynamic scheduling algorithm delivers up to 25% more energy savings while reducing the computational time overhead by more than 90%, when compared with recent heterogeneous multiprocessor scheduling algorithms.
The optimization problem over a distributive lattice
Authors: Mahbobeh Hosseinyazdi
Venue: Journal of Global Optimization (2008)

In this paper we give a necessary and sufficient condition for existence of minimal solution(s) of the linear system A * X ≥ b where A, b are fixed matrices and X is an unknown matrix over a lattice. Next, an algorithm which finds these minimal solutions over a distributive lattice is given. Finally, we find an optimal solution for the optimization problem min {Z = C * X | A * X ≥ b} where C is the given matrix of coefficients of objective function Z.
Location of trusted email for prevention of credit card fraud in soft-products e-commerce
Authors: Saleh Alfuraih, Richard Snow
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

Soft-products are intangible products that can be consumed without shipment, such as software, music and calling cards (calling time). The demand for soft-products on the Internet has been increasing for the past few years. At the same time, fraudulent credit card transactions have also increased. Compared to tangible products, fraudulent credit card transactions on soft-products are easier to conduct whilst difficult to recover. Fraudulent transactions are a major problem for e-commerce merchants, customers, and credit card issuers. The Trusted Email mechanism is new way to prevent fraudulent transactions on soft-products. Trusted Email is a custom email solution that can uniquely identify and authenticate the online customer, prevent unauthorized credit card transactions, and effectively resolve e-commerce disputes. In this paper we will study where the Trusted Email server should reside, who should handle it and why. In accordance with the best location of the Trusted Email server, Anonymous credit card transactions will be also studied in this paper and the new term "Selective Anonymity" will be introduced.
An implementation of lie differentiation operator based on linear isomorphisms of tangent bundle
Authors: Ebrahim Pourreza, Farshad Rezvan
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

Lie Differentiation Operator has been implemented as a Mathematica nb file. The implementation is based on the differential of the flow of the vector field as a linear isomorphism. This package is suitable as a computer-aided tool in differential geometry, and as a constructing tool of examples. Some examples of computing with it has been presented.
Reliability assessment of optical p-cycles
Authors: Piotr Chołda, Andrzej Jajszczyk
Venue: IEEE/ACM Transactions on Networking (TON) (2007)

Two recovery techniques suited for the Next Generation Internet are studied: traditional protection rings (BLSRs) and a novel, preconfigured protection cycles (p-cycles) technique. Theoretical formulas describing the reliability function as well as Mean Time to Failure are derived. On the basis of our analysis, we show that p-cycles should not be used in wide-area networks since their reliability performance is outside the desired bounds.
Lotus Notes 7 Advanced End User Quick Reference Guide
Authors: Beezix Inc
Venue:  (2007)

Laminated quick reference guide showing step-by-step instructions and shortcuts for advanced features of Lotus Notes 7. Topics include: Logging on to and off of Sametime Instant Messaging, Changing your status, Chatting with Others, Managing your Contact List, Status Indicators, Saving Chat Transcripts, Allowing others access to your Mail and Calendar, Accessing another user's Mail and Calendar, Sharing Address Book Entries, Importing vCard files, Deleting Past Calendar and To Do Entries, Searching a View Using the Search Bar, Viewing Database Security Level, Viewing the Access Control List, Restricting Execution Access, Adding Custom Buttons to the Toolbar, Closing All Open Tabs, Using the Permanent Pen, Creating a Document or Hotspot Link, Creating a Hotspot URL. Applying, Creating and Modifying Styles, Deleting a Paragraph Style, Adding Headers and Footers, Creating a Section, Setting Section Properties, Expanding and Collapsing a Section, Removing a Section, Creating a Table, Creating an Embedded Table, Naming Tabs or Captions for a Table, Table and Column Width, Table Borders, Setting Cell Borders and Colors, Inserting Graphic Images, Setting Picture Properties. This guide is suitable as a training handout, or simply an easy to use reference guide, for any type of user.
Path planning using Shi and Karl level sets
Authors: Randeep Singh, Nagaraju Bussa
Venue: Proceedings of the 1st international conference on Robot communication and coordination (2007)

Path planning for mobile robots is a well researched problem for over three decades. In this paper, we test and evaluate a new approach based on Shi and Karl Level Sets for mobile robot path planning. The evolution speed of these level sets is the fastest available implementation of level sets till date that prompted us to test the algorithm in the path planning domain. Level Sets have the advantage that they can support multiple robots and multiple goals in a single framework. This approach is similar to the Pixel Level Snakes but much faster and the resulting paths are different for some obstacle courses using these two approaches. To keep experiments simple we consider a holonomic point robot moving amidst stationary obstacles. The visual results presented in this paper are preliminary and tested in simulations only.
Adaptive synchronous vibration controller ASVC for magnetic bearing systems
Authors: Esref Turker, Lijiang Qin, Alan Harvey
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

This paper presents a technique of synchronous vibration minimization for Active Magnetic Bearings AMBs Using feed forward strategy; minimization signals are generated with adaptive Synchronous vibration control algorithm. The output of the adaptive Synchronous Vibration Controller ASVC is injected at the summing junction of the magnetic bearing feedback control loop. The amplitude and phase of the ASVC signal is well adjusted in order to attenuate the synchronous vibration of the rotor displacements or power amplifier currents. The experimental results verify that the proposed approach is significantly minimized the amplitude of synchronous vibration in the magnetic bearing systems.
Autopoietic companions and correctness helpers
Authors: Richard P. Gabriel
Venue: Proceedings of the 2nd international workshop on Ultra-large-scale software-intensive systems (2008)

Ultra large scale systems and multicore processors are part of the future - how are they related? ULS systems are almost impossible to build. Beyond human comprehension, such systems drive us crazy as many of our most treasured principles and aspirations turn out in them to be but tinfoil. Conventional wisdom tells us that multicore processor chips will save us from the apparent demise of Moore's Law, and going fast will be in again - if only we can figure out how to program parallel systems easily and well. But while we're in the mood to throw out established truths, why not throw out that one too? Instead of using all those cores to run programs fast, why not use them to keep our ultra large scale systems running in good health and correctly?
Evidence Gathering for Remuneration of Shared Connections
Authors: Thomas Walter, Christian Schaefer, Gina Kounga, Makoto Hamatsu
Venue: Proceedings of the Communication Networks and Services Research Conference (2008)

At very popular events like music festivals or soccer games, base stations for mobile devices might be congested and, thus, are not able serving all mobile devices in their coverage. Thus, some mobile devices might be without connectivity to a mobile network operator. Specifically, they may be disconnected from the on-line services they are using regularly. In such a situation we envision that a connected mobile device is sharing its connection into the network with others. In order to make connection sharing attractive, the users offering their connections to others are remunerated thus getting an incentive. The problems arising are (1) the negotiation of a contract between the parties and (2) the gathering of evidences that the contract has been fulfilled. We solve these problems by a protocol that employs an authentication scheme that works without access to an infrastructure, supports contract negotiation between mutually authenticated actors, and that generates evidences so that actors can prove that the agreed contractual obligations have been fulfilled. It is described how the risk of loosing incentives is managed.
Function based hybrid-fuzzy genetic controller for VSI based STATCOM
Authors: M. Stella, P. K. Dash, P. K. Rout
Venue: International Journal of Knowledge-based and Intelligent Engineering Systems (2007)

In this paper a variable structure fuzzy PI-genetic control scheme is proposed for a Voltage Source Inverter based STATCOM in damping the electro-mechanical oscillations of a power system. The function based Takagi-Sugeno-Kang (TSK) fuzzy controller uses two rules and generates the proportional action which, by one-to-two mapping, gives a variable gain PI controller. This single-input, function based fuzzy controller, dispenses the gain dependency of the proportional or integral gains and generates independent controls. To demonstrate the application of the proposed controller, a case study is done with a single and multimachine power system operating with STATCOM. Further, Genetic Algorithm (GA) is used to tune the parameters of the analytical fuzzy PI controller for optimal damping performance. Computer simulation results clearly reveal the superior performance of the proposed controller. A comparison is also made with a two-input fuzzy controller using four rules instead of just two as in the single input case.
Cartesian product of compressible effect algebras
Authors: Hai-Yang Li, Sheng-Gang Li, Min-Hui Zhu
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2008)

In the paper, we prove that $$C(p)=\{a\in E\mid a $$ is compatible with p}, the set of commutant of p, and $$C_p(a)=\{p\in P(E)\mid a=J_p(a)\oplus J_{p'}(a)\}=\{p\in P(E)\mid a\in C(p)\}$$, the projection commutant of a, are all normal sub-effect algebras of a compressible effect algebra E, and $$Q = \{q\mid J_q$$ is a direct retraction on E} is a normal sub-effect algebra of an effect algebra E. Moreover, we answer an open question in Gudder&#x2019;s (Rep Math Phys 54:93&#x2013;114, 2004), Compressible effect algebras, Rep Math Phys, by showing that the cartesian product of an infinite number of E i is a compressible effect algebra if and only if each E i is a compressible effect algebra.
Fast polynomial factorization and modular composition in small characteristic
Authors: Christopher Umans
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

We obtain randomized algorithms for factoring degree n univariate polynomials over F_q that use O(n1.5 + o(1) + n1 + o(1)log q) field operations, when the characteristic is at most no(1). When log q The improvements come from a new algorithm for modular composition of degree n univariate polynomials, which is the asymptotic bottleneck in fast algorithms for factoring polynomials over finite fields. The best previous algorithms for modular composition use O(n(omega + 1)/2) field operations, where omega is the exponent of matrix multiplication (Brent & Kung (1978)), with a slight improvement in the exponent achieved by employing fast rectangular matrix multiplication (Huang & Pan (1997)). We show that modular composition and multipoint evaluation of multivariate polynomials are essentially equivalent in the sense that an algorithm for one achieving exponent α implies an algorithm for the other with exponent α + o(1), and vice versa. We then give a new algorithm that requires O(n1 + o(1)) field operations when the characteristic is at most no(1), which is optimal up to lower order terms. Our algorithms do not rely on fast matrix multiplication, in contrast to all previous subquadratic algorithms for these problems. The main operations are fast univariate polynomial arithmetic, multipoint evaluation, and interpolation, and consequently the algorithms could be feasible in practice.