ppxscal/embedding_network huggingface dataset:
Resource bound analysis for database queries
Authors: James Cheney, Morten Dahl
Venue: Proceedings of the third ACM SIGPLAN workshop on Programming languages and analysis for security (2008)

Many scientific disciplines, such as biology and astronomy, are now collecting large amounts of raw data systematically and storing it centrally in relational databases for shared use by their communities. In many cases such systems accept arbitrary SQL queries submitted using a Web form. Typical database management systems do not provide support for enforcing resource access control policies to guard against expensive or pointless queries submitted accidentally by legitimate users or intentionally by attackers. Instead, such systems typically employ timeouts to halt queries that do not terminate within a reasonable period of time. This approach can limit misuse but cannot prevent it; moreover, it does not provide useful feedback for legitimate users whose queries exceed the time limit. In this paper, we study a language-based technique for bounding the time and space resource usage of database queries. We introduce a cost semantics for a simple core database query language, define a type-based analysis for estimating an upper bound on the asymptotic running time of a query, and prove its soundness. We also discuss a prototype implementation which we have used to analyze typical SQL queries submitted to the SDSS SkyServer astronomical database.
Enhancing experience prototyping by the help of mixed-fidelity prototypes
Authors: Ansar-Ul-Haque Yasar
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)

In this research review I undertook the problem related to the usage of a new concept known as the Mixed- Fidelity Prototype which is a mixture of its predecessors Low- and High- Fidelity Prototypes in Experience Prototyping. Experience Prototyping is a good way to explore, communicate and interact with the designs we develop like experiencing cycling on the ice, although the mood, snow conditions, bicycle type and many other factors really matter and tend to change with time. Experience Prototyping in itself is a very large domain to be explored separately but this research contains the idea to improve the ways we can achieve these factors with a minimal variation. Prototyping has the involvement of both the users and the stake holders so it is really important that correct experiments and the prototypes should get the desired results. With the effective usage of mixed-fidelity prototype in Experience Prototyping a better understanding of the real system can be developed as it gives a feeling of both the Low- and High- Fidelity Prototypes. It can unable an HCI developer to properly identify the requirements either functional or non-functional as identified by the proposed user. This paper has a comparison study between the uses of different prototyping models in Experience prototyping for better understanding of the system under development in detail and reasons for preferring Mixed-Fidelity Prototypes over the others.
Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks
Authors: Nilesh Khude, Anurag Kumar, Aditya Karnik
Venue: IEEE Transactions on Mobile Computing (2008)

We consider a scenario in which a wireless sensor network is formed by randomly deploying $n$ sensors to measure some spatial function over a field, with the objective of computing a function of the measurements and communicating it to an operator station. We restrict ourselves to the class of type-threshold functions (as defined in \cite{wanet.giridhar-kumar03fusion}), of which $\max$, $\min$, and indicator functions are important examples; our discussions are couched in terms of the $\max$ function. We view the problem as one of message passing distributed computation over a geometric random graph. The network is assumed to be synchronous; the sensors synchronously measure values, and then collaborate to compute and deliver the function computed with these values to the operator station. Computation algorithms differ in (i) the communication topology assumed, and (ii) the messages that the nodes need to exchange in order to carry out the computation. The focus of our paper is to establish (in probability) scaling laws for the time and energy complexity of the distributed function computation over random wireless networks, under the assumption of centralised contention-free scheduling of packet transmissions. Firstly, without any constraint on the computation algorithm, we establish scaling laws for the computation time and energy expenditure for one time maximum computation. We show that, for an optimal algorithm, the computation time and energy expenditure scale, respectively, as $\Theta\left(\sqrt{\frac{n}{\log n }}\right)$ and $\Theta(n)$ asymptotically as the number of sensors $n \rightarrow \infty$. Secondly, we analyze the performance of three specific computation algorithms that may be used in specific practical situations, namely, the Tree algorithm, Multi-Hop transmission, and the Ripple algorithm (a type of gossip algorithm), and obtain scaling laws for the computation time and energy expenditure as $n \rightarrow \infty$. In particular we show that the computation time for these algorithms scales as $\Theta \left( \sqrt{n \log n}\right)$, $\Theta (n)$ and $\Theta \left( \sqrt{n \log n}\right)$, respectively; whereas the energy expended scales as $\Theta (n)$, $\Theta \left( n \sqrt{\frac{n}{\log n }} \right)$ and $\Theta \left( n \sqrt{n\log n}\right)$, respectively. Finally, simulation results are provided to show that our analysis indeed captures the correct scaling; the simulations also yield estimates of the constant multipliers in the scaling laws. Our analyses throughout assume a centralized optimal scheduler and hence our results can be viewed as providing bounds for the performance with practical distributed schedulers.
The study materials in e-learning
Authors: Maria do Rosario Alves de Almeida
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

The organizations have a growing interest in adopting e-Learning systems especially in the area of distance training. The development of the e-learning has been very strong which is related with the evolution of Information and Communication Technologies (ICT) that has allowed changing processes focused on distance training/learning with strong flexibility. These new accessible relations are very similar to traditional ones and the communities can share knowledge at any place and in real time. So the aim of this paper is to show the importance of the study materials and the programmatic contents.
Scaling in games and virtual worlds
Authors: Jim Waldo
Venue: Communications of the ACM (2008)

Online games and virtual worlds have familiar scaling requirements, but don't be fooled: Everything you know is wrong.
Minimal radial basis function network based bus protection system using OCT
Authors: Zahra Moravej
Venue: Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation (2005)

This paper presented the Minimal Radial Basis Function Network (MRBFN) approach busbar protection. The Optical Current Transducer (OCT) is used to solve the magnetic saturation so as to improve the reliability of the system. Performance of this model is compared with Feed Forward Back Propagation Neural Network (FFBP). The proposed model is more accurate in prediction with few numbers of hidden neurons. Performance analysis shows its distinguishing advantages over the traditional busbar protection.
Accurate approximation method for prediction of class I MHC affinities for peptides of length 8, 10 and 11 using prediction tools trained on 9mers
Authors: Claus Lundegaard, Ole Lund, Morten Nielsen
Venue: Bioinformatics (2008)

Summary: Several accurate prediction systems have been developed for prediction of class I major histocompatibility complex (MHC):peptide binding. Most of these are trained on binding affinity data of primarily 9mer peptides. Here, we show how prediction methods trained on 9mer data can be used for accurate binding affinity prediction of peptides of length 8, 10 and 11. The method gives the opportunity to predict peptides with a different length than nine for MHC alleles where no such peptides have been measured. As validation, the performance of this approach is compared to predictors trained on peptides of the peptide length in question. In this validation, the approximation method has an accuracy that is comparable to or better than methods trained on a peptide length identical to the predicted peptides. Availablility: The algorithm has been implemented in the web-accessible servers NetMHC-3.0: http://www.cbs.dtu.dk/services/NetMHC-3.0, and NetMHCpan-1.1: http://www.cbs.dtu.dk/services/NetMHCpan-1.1 Contact: lunde@cbs.dtu.dk Supplementary information:Supplementary data are available at Bioinformatics online
On the approximation of the auto solid angle for solving integral equations
Authors: Diana Rubio, María Inés Troparevsky
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

The value of a solid angle appears frequently when solving integral equations in potential theory. The integral that represents it may become an improper one, known as the auto solid angle, and its value must be evaluated carefully. A summary of different approaches to calculate the values of solid angles is included, and a modified method for the calculation on any surface is proposed. Finally, this approach is used to calculate a numerical solution of the Forward Problem (FP) in EEG. In addition, an error bound of the discretization of the problem is stated.
Computation with classical sequents
Authors: Steffen Van bakel, Pierre Lescanne
Venue: Mathematical Structures in Computer Science (2008)

<inline-graphic mime-subtype="gif" xlink="S0960129508006762_inline1"><alt-text>$\X$</alt-text></inline-graphic> is an untyped continuation-style formal language with a typed subset that provides a Curry–Howard isomorphism for a sequent calculus for implicative classical logic. <inline-graphic mime-subtype="gif" xlink="S0960129508006762_inline1"><alt-text>$\X$</alt-text></inline-graphic> can also be viewed as a language for describing nets by composition of basic components connected by wires. These features make <inline-graphic mime-subtype="gif" xlink="S0960129508006762_inline1"><alt-text>${\X}$</alt-text></inline-graphic> an expressive platform on which many different (applicative) programming paradigms can be mapped. In this paper we will present the syntax and reduction rules for <inline-graphic mime-subtype="gif" xlink="S0960129508006762_inline1"><alt-text>$\X$</alt-text></inline-graphic>; in order to demonstrate its expressive power, we will show how elaborate calculi can be embedded, such as the λ-calculus, Bloo and Rose's calculus of explicit substitutions λx, Parigot's λμ and Curien and Herbelin's <inline-graphic mime-subtype="gif" xlink="S0960129508006762_inline2"><alt-text>$\lmmt$</alt-text></inline-graphic>. <inline-graphic mime-subtype="gif" xlink="S0960129508006762_inline1"><alt-text>${\X}$</alt-text></inline-graphic> was first presented in Lengrand (2003), where it was called the λξ-calculus. It can be seen as the pure untyped computational content of the reduction system for the implicative classical sequent calculus of Urban (2000).
Cipher cities: effective user interface design for building a digital social network around location-based gaming
Authors: Debra Polson, Sherwin Huang, Colleen Morgan
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)

In this paper we explore what is required of a User Interface (UI) design in order to encourage participation around playing and creating Location-Based Games (LBGs). To base our research in practice, we present Cipher Cities, a web-based system developed by a team at the Australasian CRC for Interaction Design (ACID). Through the design of this system, we investigate the how UI design can provide tools for complex content creation to complement and encourage the use of mobile phones for designing, distributing, and playing LBGs. Furthermore we discuss how UI design can support socialisation around LBGs through functional interface components such as groups, user profiles, and player/creator status listings. Finally we discuss how the Cipher Cities may further permeate peoples' everyday-lives through complementary components that allow active community participation via mobile phones.
A Channel Quality and QoS Aware Bandwidth Allocation Algorithm for IEEE 802.16 Base Stations
Authors: Yuan-Cheng Lai, Yen-Hung Chen
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

In an IEEE 802.16 network, mobile stations locating different places will encounter various interferences during transmission, leading that their communication channels experience different packet loss conditions and adopt suitable modulations. Thus, an excellent bandwidth allocation algorithm should not only satisfy various Quality of Services (QoS) required by heterogeneous traffic, but also consider the channel quality to maximize bandwidth utilization. In this paper, a bandwidth allocation algorithm with channel quality awareness and QoS guarantee, called CQQ, is proposed. Besides satisfying each connection's QoS requirement, CQQ raises the throughput by dynamically adjusting the Downlink/Uplink (DL/UL) bandwidth to match current DL/UL traffic and allocating more bandwidth to the connections having better channel quality. Simulation results demonstrate that CQQ provides lower delay violation ratio and higher goodput, comparing with the previous algorithms.
Tool support for new test criteria on embedded systems: Justitia
Authors: Yuhoon Ki, Jooyoung Seo, Byungju Choi, Kwanghyun La
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

In this paper, we introduce a testing tool to support new test criteria in interface testing technique. Justitia is an automated testing tool for embedded software that assists an integration testing on software phase during embedded software testing cycle. Justitia has been successfully applied to device driver testing cooperated with Samsung Co.
Association Rule Analysis of Spatial Data Mining Based on Matlab-A Case of Ancheng Township in China
Authors: Xinqi Zheng, Lu Zhao
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

Though there are many methods for spatial data miningit is also a desirable problem that how to carry out this operation fast. Matlab is called full-purpose calculation paper. And it has certain advantage in carrying out data mining because of its powerful matrix calculation function. According to the association rule method of data mining, spatial data of land use and slope was processed and extracted on Geographic Information System(GIS) at first, and data mining was performed by the program, which was wrote in M-language of Matlab. The study area was Ancheng township in Shandong province of China. The confidence and the support between different land use types and slope levels were mined, and the association rules were set up. Through the empirical study, it has been proved that this study method is feasible and the conclusion can provide instruction for local land use planning.
A Novel Optimized Caching Technique for Mobile Gnutella Based Network to Support Large-Scale Collaborative Virtual Environment
Authors: Azzedine Boukerche, Anis Zarrad, Regina Borges Araujo
Venue: Proceedings of the 41st Annual Simulation Symposium (anss-41 2008) (2008)

Collaborative virtual environments (CVEs) such as massive multi-user 3D games and military training environments can place strict requirements on network when participating users are sharing the 3D virtual environment through mobile devices in an ad-hoc network. This paper presents an optimization mechanism for Gnutella network to better meet the mobility and the network requirements of collaborative virtual environments (CVEs). With the rapidly increasing use of mobile personal devices, we are facing new challenges and opportunities for making efficient Mobile Collaborative Virtual Environments (MCVEs) applications based on Gnutella network. The proposed work comprises an enhancement of the Gnutella network through an efficient overlay formation protocol, and a novel caching optimization technique implemented in specific nodes selected through a Gnutella Ultrapeer System (GUS) mechanism. The resulting approach should overcome several problems including flooding and the limited capacity of mobile devices. In order to evaluate our designed protocols, we run the system over several ad-hoc routing protocols, simulation results shows that each ad-hoc routing protocol performs well only under specific simulation scenarios.
Profile-cast: behavior-aware mobile networking
Authors: Wei-jen Hsu, Debojyoti Dutta, Ahmed Helmy
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2008)

In this paper we propose a new communication paradigm called profile-casting where destination nodes are identified by their (inferred) properties, not by node IDs. As an example case study, we use the mobility profile to show a design of profile-casting protocol based on the similarity in user mobility processes. The similarity-based protocol has good potential in both overhead reduction and delivery ratio improvement compared with simple message delivery protocols, such as flooding or random transmission. It is also flexible to operate at various points of the overhead-performance tradeoff.
Modeling sorites reasoning with adaptive fuzzy logic
Authors: Stephan van der Waart van Gulik, Peter Verdée
Venue: Fuzzy Sets and Systems (2008)

We present and discuss a new solution for reasoning with sorites series and their related paradoxes. We argue that a suitable logic for sorites series should be able to apply specific classical logic rules like modus ponens until and unless it becomes apparent that these applications generate unacceptable results. When the latter happens, the logic should be able to retract those applications of classical logic rules that are problematic. The formal core of our solution consists of several adaptive logics based on a Lukasiewicz fuzzy logic extended with the Baaz'@D-operator and a non-singleton interval of designated values. The natural dynamics characteristic of adaptive logics allows these logics to perform necessary retractions in an intuitive and elegant manner.
Dynamic stability and commands response study method
Authors: Marius Marmureanu, Tudor Cherechs, Adrian Rotariu, Zecheru Teodora
Venue: Proceedings of the 12th WSEAS International Conference on Applied Mathematics (2007)

In this paper, the dynamic stability and the commands response study, in Lyapunov sense, is made by solving the non-homogeneous linear system (with constant coefficients) of the induced deviations equations, which are obtained through the linearized equations of motion. Even if, in the all most cases, the non-homogeneous linear system represents an evident idealization, this model is not catalogued like an inadequate model. But, its validity is no more considerate indisputable or absolute. The analyses' results for a partially guided missile represent a good argument in this respect.
O2C: occasional two-cycle operations for dynamic thermal management in high performance in-order microprocessors
Authors: Swaroop Ghosh, Jung-Hwan Choi, Patrick Ndai, Kaushik Roy
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

In this paper, we propose O2C, a novel non-speculative adaptive thermal management technique that reduces the temperature during die-overheating using supply voltage scaling, while maintaining the rated clock frequency. This is accomplished by (a) scaling down the supply voltage, (b) isolating and predicting the set of critical paths, (c) ensuring (by design) that they are activated rarely, and (d) getting around occasional delay failures (at reduced voltage during die-overheating) in these paths by two-cycle operations (assuming all standard operations are single-cycle). Two-cycle operation is achieved by stalling the pipeline for extra clock cycles whenever the set of critical paths are activated. The rare two-cycle operation results in a small decrease in IPC (instructions per cycle). Since called O2C maintains the rated clock frequency and does not require pipeline stalling during supply voltage ramp-up/ramp-down, it achieves high throughput in a thermally constrained environment. We applied called O2C to the integer execution units of an in-order superscalar pipeline. Standard full-chip Dynamic Voltage-Frequency Scaling (DVFS) is very effective in bringing down the temperature, however; it is associated with large throughput loss due to pipeline stalling and slow operating frequency during thermal management. We integrated "O2C with standard DVFS" (called O2Cα) to demonstrate that it can act as a "first step" before full-scale thermal management is required. Our simulations indeed reveal that called O2Cα policy can avoid the requirement of full-scale DVFS during execution of programs.
Cluster-Specific Information Loss Measures in Data Privacy: A Review
Authors: Vicenc Torra, Susana Ladra
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Data protection mechanisms need to find a trade-off between information loss and disclosure risk. To this end, information loss and disclosure risk measures have been developed. Due to the fact that when data is published it is usual to ignore which kind of analyses a user will pursue with the data, generic information loss measures are used to analyse the impact of the perturbation method onto the data. Such generic information loss measures are defined in terms of a few general-enough statistics. Nevertheless, a more fine-grained analysis is needed for particular data uses. In this paper we provide the reader with a review of a few results on cluster-specific information loss measures. More specifically, we consider the case of using fuzzy clustering to the perturbated data.
Conditional workflow management: A survey and analysis
Authors: Emir M. Bahsi, Emrah Ceyhan, Tevfik Kosar
Venue: Scientific Programming (2007)

Workflows form the essential part of the process execution both in a single machine and in distributed environments. Although providing conditional structures is not mandatory for a workflow management system, support for conditional workflows is very important in terms of error handling, flexibility and robustness. Several of the existing workflow management systems already support conditional structures via use of different constructs. In this paper, we study the most widely used workflow management systems and their support for conditional structures such as if, switch, and while. We compare implementation of common conditional structures using each of these workflow management systems via case studies, and discuss capabilities of each system.