ppxscal/embedding_network huggingface dataset:
A configurable and extensible transport protocol
Authors: Patrick G. Bridges, Gary T. Wong, Matti Hiltunen, Richard D. Schlichting, Matthew J. Barrick
Venue: IEEE/ACM Transactions on Networking (TON) (2007)

The ability to configure transport protocols from collections of smaller software modules allows the characteristics of the protocol to be customized for a specific application or network technology. This paper describes a configurable transport protocol system called CTP in which microprotocols implementing individual attributes of transport can be combined into a composite protocol that realizes the desired overall functionality. In addition to describing the overall architecture of CTP and its microprotocols, this paper also presents experiments on both local area and wide area platforms that illustrate the flexibility of CTP and how its ability to match more closely application needs can result in better application performance. The prototype implementation of CTP has been built using the C version of the Cactus microprotocol composition framework running on Linux.
Developing a mobile reporting system for road maintenance: user research perspective
Authors: Aino Ahtinen, Jukka K. Nurminen, Jonna Häkkilä
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

Mobile telecommunication technology with enhanced connectivity and multimedia features offers new possibilities to develop field tools for mobile workers. In this paper we present a study on developing a mobile tool for road maintenance workers by applying user centric design process, and discuss the challenges of the environment for both the process and the outcome
A (slightly) faster algorithm for klee's measure problem
Authors: Timothy M. Chan
Venue: Proceedings of the twenty-fourth annual symposium on Computational geometry (2008)

Given n axis-parallel boxes in a fixed dimension d ≥ 3, how efficiently can we compute the volume of the union? This standard problem in computational geometry, commonly referred to as Klee's measure problem, can be solved in time O(nd/2 log n) by an algorithm of Overmars and Yap (FOCS 1988). We give the first (albeit small) improvement: our new algorithm runs in time nd/22O(log*n), where log* denotes the iterated logarithm. For the related problem of computing the depth in an arrangement of n boxes, we further improve the time bound to near O(nd/2 logd/2-1 n), ignoring log\log n factors. Other applications and lower-bound possibilities are discussed. The ideas behind the improved algorithms are simple.
A learning theory perspective on running open ended group projects (OEGPs)
Authors: Amie Hauer, Mats Daniels
Venue: Proceedings of the tenth conference on Australasian computing education - Volume 78 (2008)

One of the most important questions for an educator is how best to help students learn, and another is of course what they should learn. We will address both these questions from a learning theory perspective in the context of Open Ended Group Projects (OEGPs). We argue that OEGPs provide a useful tool for instructors to reach towards higher order thinking skills in students. The intent of this paper is to inspire readers to also consider the general learning objectives of an engineering education programme and build on learning theories in setting up a learning environment using an OEGP structure. We argue that OEGPs are a suitable structure to develop knowledge and problem solving skills to deal with real-world problems in the future professional lives of engineering students.
Knowledge transformation from word space to document space
Authors: Tao Li, Chris Ding, Yi Zhang, Bo Shao
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

In most IR clustering problems, we directly cluster the documents, working in the document space, using cosine similarity between documents as the similarity measure. In many real-world applications, however, we usually have knowledge on the word side and wish to transform this knowledge to the document (concept) side. In this paper, we provide a mechanism for this knowledge transformation. To the best of our knowledge, this is the first model for such type of knowledge transformation. This model uses a nonnegative matrix factorization model X = FSGT, where X is the word document semantic matrix, F is the posterior probability of a word belonging to a word cluster and represents knowledge in the word space, G is the posterior probability of a document belonging to a document cluster and represents knowledge in the document space, and S is a scaled matrix factor which provides a condensed view of X. We show how knowledge on words can improve document clustering, i.e, knowledge in the word space is transformed into the document space. We perform extensive experiments to validate our approach.
Multi-task learning for HIV therapy screening
Authors: Steffen Bickel, Jasmina Bogojeska, Thomas Lengauer, Tobias Scheffer
Venue: Proceedings of the 25th international conference on Machine learning (2008)

We address the problem of learning classifiers for a large number of tasks. We derive a solution that produces resampling weights which match the pool of all examples to the target distribution of any given task. Our work is motivated by the problem of predicting the outcome of a therapy attempt for a patient who carries an HIV virus with a set of observed genetic properties. Such predictions need to be made for hundreds of possible combinations of drugs, some of which use similar biochemical mechanisms. Multi-task learning enables us to make predictions even for drug combinations with few or no training examples and substantially improves the overall prediction accuracy.
EMMA: modèle utilisateur pour la plasticité des interfaces homme-machine en mobilité
Authors: Vincent Ganneau, Gaëlle Calvary, Rachel Demumieux
Venue: Proceedings of the 4th French-speaking conference on Mobility and ubiquity computing (2008)

Adapting User Interfaces (UI) while in mobility remains challenging as contexts of use identification and changes can obviously not be finely envisioned at design time. However, user's tasks, habits and preferences may be context dependent. As a result, there is a need for managing context-aware adaptation at runtime. This paper describes EMMA (Embedded Manager for Mobile Adaptation), a running system that gathers data in mobility, learns key contexts of use, and provides the end-user with relevant adaptation. The process is based on a bayesian user model embedded on a Smartphone running under Windows Mobile operating system. It is placed under the end-user's control through a dedicated UI, called meta-UI. Besides this end-user's partner role, EMMA can serve as a designer's partner tool for identifying the key contexts of use in the wild.
Effective numerical viscosity in spectral multidomain penalty method-based simulations of localized turbulence
Authors: P. J. Diamessis, Y. C. Lin, J. A. Domaradzki
Venue: Journal of Computational Physics (2008)

The numerical dissipation operating in a specific spectral multidomain method model developed for the simulation of incompressible high Reynolds number turbulence in doubly periodic domains is investigated. The method employs Fourier discretization in the horizontal directions and the discretization in the vertical direction is based on a Legendre collocation scheme local to each subdomain. Both spatial discretizations are characterized by either no or near-negligible artificial dissipation. In high Reynolds number simulations, which are inherently under-resolved, stability of the numerical scheme is ensured through spectral filtering in all three directions and the implementation of a penalty scheme in the vertical direction. The dissipative effects of these stabilizers are quantified in terms of the numerical viscosity, using a generalization of the method previously employed to analyze numerical codes for the simulation of homogeneous, isotropic turbulence in triply periodic domains. Data from simulations of the turbulent wake of a towed sphere are examined at two different Reynolds numbers varying by a factor of twenty. The effects of the stabilizers are found to be significant, i.e. comparable, and sometimes larger, than the effects of the physical (molecular) viscosity. Away from subdomain interfaces, the stabilizers have an expected dissipative character extending over a range of scales determined by timestep and the degree of under-resolution, i.e. Reynolds number. At the interfaces, the stabilizers tend to exhibit a strong anti-dissipative character. Such behavior is attributed to the inherently discontinuous formulation of the penalty scheme, which suppresses catastrophic Gibbs oscillations by enforcing C"0 and C"1 continuity only weakly at the interfaces.
Discrete time output feedback sliding mode control for nonlinear MIMO system: a stepper motor case
Authors: B. Bandyopadhyay, V. K. Thakar
Venue: International Journal of Systems Science (2008)

This article, presents discrete sliding mode control algorithm using multirate output feedback for control of stepper motor. The algorithm developed by the authors uses past output samples and past control inputs. When all the states of the system are neither physical variable nor available for measurement, multirate output feedback can be used. The stepper motor is known to be a differentially flat system. The dynamics of the stepper motor are highly nonlinear, hence feedback linearization based on endogenous feedback has been used. The linear model is obtained and multirate output feedback-based discrete sliding mode control has been designed. The discrete sliding mode control with multirate output feedback has been applied for regulator as well as tracking case for the motor. The proposed algorithm uses only two outputs. It is essentially shown that first output needs to be sampled only once and second output must be sampled at least thrice in every τ sampling interval in order to achieve acceptable performance. The system parameter variation has been considered and the results obtained are found to be satisfactory. Thus, it has been shown that discrete sliding mode control algorithm using multirate output feed back can be extended to a class of nonlinear MIMO system.
Analysis of crosscutting features in software product lines
Authors: José M. Conejero, Juan Hernández
Venue: Proceedings of the 13th international workshop on Early Aspects (2008)

Software Product Lines has emerged as a new technology to develop software product families related to a particular domain. The software products developed by this methodology are based on the combination of a set of common and variable assets. However, in order to combine these assets to build different products, coupling between common and variable parts must be highly reduced. In that sense, crosscutting features make evolution and adaptability of software difficult. In this paper we propose a framework to identify crosscutting features at early stages in order to use aspect-oriented techniques to modularize them and reduce their dependencies. This framework is based on a crosscutting pattern and uses traceability matrices to perform the analysis of crosscutting. Finally, applicability of the framework is shown by identifying crosscutting features in the Arcade Game Maker product line.
The influence of package-induced stresses on moulded Hall sensors
Authors: Sebastian Fischer, Harald Beyer, Ralf Janke, J&#x00fc;rgen Wilde
Venue: Microsystem Technologies (2005)

The output signals of moulded Hall sensors show changes in offset and sensitivity when the devices are affected by changing temperatures. This behaviour is a result of the differences in the thermal expansion behaviour of the package materials and is also affected by their time-dependent, viscous material properties. The stresses affected to the sensor&#x2019;s sensitive layer will become effective via the piezo-Hall-effect as well as via piezo-resistivity which both change the sensitivity and the offset of the sensor&#x2019;s output voltage. For modelling the stress in the sensitive area correctly it is indispensable to consider the visco-elastic and the visco-plastic behaviour of the materials constituting the package. Especially for very accurate sensors or components operating in harsh environments these effects must be regarded. In this work we investigate the thermo-mechanical stresses, which are induced in the sensitive layer of a moulded Hall sensor during the assembly process, the investigations were based mainly on finite-elements-simulations.
Distributed key management for dynamic groups in MANETs
Authors: Anindo Mukherjee, Anurag Gupta, Dharma P. Agrawal
Venue: Pervasive and Mobile Computing (2008)

Most existing solutions to group security in Mobile Ad Hoc Networks (MANETs) rely on a multicast Core Based Tree (CBT) for key distribution. Such solutions, although suitable for systems with low mobility and static characteristics, are unsuitable for dynamic and sparse groups with changing neighborhoods. In this paper, we propose an entirely decentralized key generation mechanism, employing a central trusted entity only during initialization. Using our approach, keys can be established between group members with absolutely no prior communication. The solution relies on threshold cryptography and introduces a novel concept of Node-Group-Key (NGK) mapping. We have provided an extensive analytical model for the computations involved and communication costs and have also provided a lie detection mechanism. Simulation results show appreciable performance improvement and enhanced robustness.
Analysis of Security Requirements for Cryptographic Voting Protocols (Extended Abstract)
Authors: Orhan Cetinkaya
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Electronic voting refers to the use of computers or computerized voting equipment to cast ballots in an election and it is not an easy task due to the need of achieving electronic voting security requirements. The cryptographic voting protocols use advanced cryptography to make electronic voting secure and applicable.In this paper, formal definitions of security requirements for cryptographic voting protocols (privacy, eligibility, uniqueness, fairness, uncoercibility, receipt-freeness, accuracy, and individual verifiability) are provided, and elaborate checklists for each requirement are presented. The voting problem is clearly defined in terms of security requirements. The voting problem arises from the trade-off between receipt-freeness and individual verifiability. This paper suggests the Predefined Fake Vote (PreFote) scheme as an applicable solution to overcome the voting problem. The PreFote scheme is not a voting protocol; however, it is a building block that can be used by any voting protocol.
Broad-market return persistence and momentum profits
Authors: Ying-Foon Chow, Ming Liu, Xinting Fan
Venue: Mathematics and Computers in Simulation (2008)

Momentum profits are shown to be driven by the broad-market persistence of returns between the formation period and the holding period, which is measured as the slope coefficient of the regression of the cross-section returns in the holding period on the cross-section returns in the formation period. Broad-market persistence offers an understanding on momentum profits from a market-wide perspective that goes beyond the stock-specific continuation of extreme winners and losers as proposed in Jegadeesh and Titman [N. Jegadeesh, S. Titman, Returns to buying winners and selling losers: implication for stock market efficiency, Journal of Finance 48 (1993) 65-91] and Grundy and Martin [B.D. Grundy, S.J. Martin, Understanding the nature of risks and the sources of rewards to momentum investing, Review of Financial Studies 14 (2001) 29-78]. The proposed framework provides an alternative explanation to the inability of widely accepted asset pricing models in explaining momentum profits.
Using difficulty of prediction to decrease computation: fast sort, priority queue and convex hull on entropy bounded inputs
Authors: S. Chen, J. H. Reif
Venue: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science (1993)

Studies have indicated that sorting comprises about 20% of all computing on mainframes. Perhaps the largest use of sorting in computing (particularly business computing) is the sort required for large database operations (e.g. required by joint operations). In these applications the keys are many words long. Since our sorting algorithm hashes the key (rather than compare entire keys as in comparison sorts such as quicksort), our algorithm is even more advantageous in the case of large key lengths; in that case the cutoff is much lower. In case that the compression ratio is high, which can be determined after building the dictionary, we just adopt the previous sorting algorithm, e.g. quick sort. The same techniques can be extended to other problems (e.g. computational geometry problems) to decrease computation by learning the distribution of the inputs.
Soft computing techniques for web services brokering
Authors: Roy Ladner, Frederick Petry, Kalyan Moy Gupta, Elizabeth Warner, Philip Moore, David W. Aha
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2008)

To enhance and improve the interoperability of meteorological Web Services, we are currently developing an Integrated Web Services Brokering System (IWB). IWB uses a case-based classifier to automatically discover Web Services. In this paper, we explore the use of rough set techniques for selecting features prior to classification. We demonstrate the effectiveness of this feature technique by comparing it with a leading non-rough set (Information Gain) feature selection technique.
Calculation of load carrying capacity on a redundant manipulator
Authors: Yaser Maddahi
Venue: Proceedings of the 2nd WSEAS International Conference on Circuits, Systems, Signal and Telecommunications (2008)

This paper presents a computational technique for determining the maximum allowable load of wheeled mobile manipulators for a desired trajectory. Full load motion of mobile manipulators while carrying a load is an important consideration in their application and motion planning. The number of factors limits the maximum allowable loads, which can be achieved by a mobile manipulator during a given trajectory. Dynamic properties of mobile base and mounted manipulator, their actuator limitations and additional constraints applied to resolve the redundancy are probably the most important factors. To resolve extra degrees of freedom introduced by the base mobility, we proposed additional constraint functions directly in the task space of mobile manipulator. Finally, a numerical example involving a two-link planar manipulator mounted on a differentially driven mobile base, application of the method to determine maximum allowable load is verified. The simulation results clearly demonstrate that the value of maximum allowable load on a given trajectory directly depends on the additional constraint functions which apply to resolve the motion redundancy.
Word-Based Statistical Compressors as Natural Language Compression Boosters
Authors: Antonio Fariña, Gonzalo Navarro, José R. Paramá
Venue: Proceedings of the Data Compression Conference (2008)

Semistatic word-based byte-oriented compression codes are known to be attractive alternatives to compress natural language texts. With compression ratios around 30%, they allow direct pattern searching on the compressed text up to 8 times faster than on its uncompressed version. In this paper we reveal that these compressors have even more benefits. We show that most of the state-of-the-art compressors such as the block-wise bzip2, those from the Ziv-Lempel family, and the predictive ppm-based ones, can benefit from compressing not the original text, but its compressed representation obtained by a word-based byte-oriented statistical compressor. In particular, our experimental results show that using Dense-Code-based compression as a preprocessing step to classical compressors like bzip2, gzip, or ppmdi, yields several important benefits. For example, the ppm family is known for achieving the best compression ratios. With a Dense coding preprocessing, ppmdi achieves even better compression ratios (the best we know of on natural language) and much faster compression/decompression than ppmdi alone. Text indexing also profits from our preprocessing step. A compressed self-index achieves much better space and time performance when preceded by a semistatic word-based compression step. We show, for example, that the AF-FMindex coupled with Tagged Huffman coding is an attractive alternative index for natural language texts.
Hybrid algorithms for adaptive array systems
Authors: D. Papadimitriou, I. O. Vardiambasis
Venue: Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics (2005)

In recent years, mobile communications have caused an explosive growth to the number of wireless users. This growth has triggered an enormous demand not only for capacity but also for better coverage and quality of services with priority on interference cancellation. This need lead scientists in using adaptive array antennas. The aim of this paper is to study the adaptive beamforming approaches as part of smart antenna technology. This work's focus is on the investigation of various adaptive algorithms and their ability to automatically respond to an unknown interference environment by steering nulls and reducing side lobe levels in the direction of interference, while keeping desired signal beam characteristics. The investigation covers three well known algorithms [Sample Matrix Inversion (SMI), Least Mean Squares (LMS), Normalized Least Mean Squares (N-LMS)], along with the combination of SMI and LMS and the combination of SMI and NLMS, which are proposed here.
Pre-programming analysis tutors help students learn basic programming concepts
Authors: Wei Jin
Venue: Proceedings of the 39th SIGCSE technical symposium on Computer science education (2008)

In this paper, we describe a scaffolding technique - pre-programming-analysis guided programming (PAGP) - developed to help students grasp basic programming concepts. Two different ways to implement the PAGP process in a classroom were developed and then compared: one for students to fill out an analysis form, and the other for students to interact with online cognitive tutors. Our results show that the PAGP process helps students learn better and faster, especially with the assistance of the online tutors.
Empirical Bernstein stopping
Authors: Volodymyr Mnih, Csaba Szepesvári, Jean-Yves Audibert
Venue: Proceedings of the 25th international conference on Machine learning (2008)

Sampling is a popular way of scaling up machine learning algorithms to large datasets. The question often is how many samples are needed. Adaptive stopping algorithms monitor the performance in an online fashion and they can stop early, saving valuable resources. We consider problems where probabilistic guarantees are desired and demonstrate how recently-introduced empirical Bernstein bounds can be used to design stopping rules that are efficient. We provide upper bounds on the sample complexity of the new rules, as well as empirical results on model selection and boosting in the filtering setting.
Ubiquitous video
Authors: Logan Kugler
Venue: Communications of the ACM (2008)

Scalable and distributed video coding offers the promise of two-way, real-time video.