ppxscal/embedding_network huggingface dataset:
Evaluating the usefulness of mobile services based on captured usage data from longitudinal field trials
Authors: Kasper Løvborg Jensen, Lars Bo Larsen
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)

It is widely discussed whether the usefulness of mobile systems and services should be evaluated in the field or in the lab. The aim of this paper is to make a case for conducting longitudinal field trials when evaluating the usefulness of mobile services, and to partly base such evaluations on quantitative usage data automatically captured on the device. A framework for automatic capture and analysis of such data is introduced, and it is shown how it has been used to evaluate a mobile service for diabetes management. Results and experiences based on a three month field trial with a single diabetic user is presented and it is demonstrated how these results can be used to make inferences about the use of the service with regard to functionality and usage patterns.
An Independent Evaluation of Web Timing Attack and its Countermeasure
Authors: Yoshitaka Nagami, Daisuke Miyamoto, Hiroaki Hazeyama, Youki Kadobayashi
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Web timing have attacks become a new threat on the Internet because they enable attackers to reveal users' private information. In this paper, we evaluate the threat of a web timing attack and its countermeasure. Our contribution is to investigate the occurrence conditions of a web timing attack. We also verify the effectiveness of our countermeasure, whose significant feature is fixing the authentication time whereas previous work fixes the response time. For our evaluation, we measure response times of several web applications, and analyze the result with statistical testing. We find that it is difficult to reveal the of username in some types of applications,and we confirm that our countermeasure can thwart web timing attacks.
BRA: a bidirectional routing abstraction for asymmetric mobile ad hoc networks
Authors: Venugopalan Ramasubramanian, Daniel Mossé
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

Wireless links are often asymmetric due to heterogeneity in the transmission power of devices, non-uniform environmental noise, and other signal propagation phenomenons. Unfortunately, routing protocols for mobile ad hoc networks typically work well only in bidirectional networks. This paper first presents a simulation study quantifying the impact of asymmetric links on network connectivity and routing performance. It then presents a framework called BRA that provides a bidirectional abstraction of the asymmetric network to routing protocols. BRA works by maintaining multi-hop reverse routes for unidirectional links and provides three new abilities: improved connectivity by taking advantage of the unidirectional links, reverse route forwarding of control packets to enable off-the-shelf routing protocols, and detection packet loss on unidirectional links. Extensive simulations of AODV layered on BRA show that packet delivery increases substantially (two-fold in some instances) in asymmetric networks compared to regular AODV, which only routes on bidirectional links.
Pupils' attitudes towards school science as they transfer from an ICT-rich primary school to a secondary school with fewer ICT resources: Does ICT matter?
Authors: Gary Beauchamp, John Parkinson
Venue: Education and Information Technologies (2008)

The first part of this study was carried out in a primary school in a rural part of Wales in the United Kingdom. All classrooms were equipped with interactive whiteboards (IWBs) linked to a teacher's computer and six PCs for pupil use. Teaching through ICT was the prevalent culture in the school. Thirty year six pupils [aged 10---11 years] were selected at random from the final year cohort and were interviewed to determine their views about school science and their views about the teaching methods employed. The pupils moved to a medium sized secondary school where the teachers were beginning to develop their ICT skills and the availability of the computers was limited. The group was re-interviewed after 3 months, once they had settled in to their new school, and were again asked their views about school science and the way it was taught. While in the primary school, pupils expected to use ICT in every lesson, they enjoyed the way information was presented and they were interested in finding things out for themselves when given the opportunity. The lack of ICT in the secondary school caused some frustration, but this was mostly with the teaching of ICT, and the group remained predominantly enthusiastic about science. Those who were less keen on science indicated that it was a teacher factor rather than anything to do with the resources being used. In general the pupils particularly enjoyed the practical aspects of science lessons, something that they had not experienced in the primary school, which compensated for the relative lack of ICT in science teaching.
Engaging with computer science through magic shows
Authors: Paul Curzon, Peter W. McOwan
Venue: Proceedings of the 13th annual conference on Innovation and technology in computer science education (2008)

We describe our experiences illustrating core concepts and enthusing children (age 11-17) about computer science through magic shows. We outline links between various tricks and computer science. The format of show we have trialed is to present real magic tricks with an underlying link to computer science. After each trick the audience is challenged to work out how it works. The mechanics are explained followed by the underlying computer science. Feedback with Talented and Gifted children has been exceptional. Informal feedback from younger children of varying ability has also been very positive.
FPGA area reduction by multi-output function based sequential resynthesis
Authors: Yu Hu, Victor Shih, Rupak Majumdar, Lei He
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

We propose a new resynthesis algorithm for FPGA area reduction. In contrast to existing resynthesis techniques, which consider only single-output Boolean functions and the combinational portion of a circuit, we consider multi-output functions and retiming, and develop effective algorithms that incorporate recent improvements to SAT-based Boolean matching. Our experimental results show that with the optimal logic depth, the resynthesis considering multi-output functions reduces area by up to 0.4% compared to the one considering single-output functions, and the sequential resynthesis reduces area by up to 10% compared to combinational resynthesis when both consider multi-output functions. Furthermore, our proposed resynthesis algorithm reduces area by up to 16% compared to the best existing academic technology mapper, Berkeley ABC.
Fuzzy chromatic number and fuzzy defining number of certain fuzzy graphs
Authors: M. M. Pourpasha, M. R. Soheilifar
Venue: Proceedings of the 12th WSEAS International Conference on Applied Mathematics (2007)

In this paper we introduce the concepts of fuzzy defining number in some fuzzy graphs. we determine the chromatic number for several classes of fuzzy graphs and obtain bounds for them. We also determine the fuzzy defining number of the classes.
A practical guide to testing the understandability of notations
Authors: Susanne Patig
Venue: Proceedings of the fifth on Asia-Pacific conference on conceptual modelling - Volume 79 (2008)

Model-driven development is the process of creating models of a software system and transforming them into source code. Since the stepwise transformations can be done automatically or by hand, the notations of the models should be both precise and understandable. This is especially important if the software system is developed by a large, international team where the persons who model differ from the ones who implement the source code based on the models' content. Understandability and precision can be experimentally tested. This paper presents a guideline for planning and conducting such experiments. The guideline is derived from a theoretical framework and designed to yield valid and statistically significant results by a simple experimental procedure. Additionally, an open-source tool is provided that supports the suggestions. Guideline and tool have been successfully applied in an industrial context: Experiments revealed that a graphical notation used for model-driven development within SAP AG is as precise as a textual notation, but more difficult to understand.
Digital filter design of IIR filters using real valued genetic algorithm
Authors: Mikael Nilsson, Mattias Dahl, Ingvar Claesson
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

This paper presents a new paradigm for infinite impulse response (IIR) filter design using genetic algorithms (GA). By encode or transform the filter design problem into the z-plane the GA optimization procedure will be simplified. Additionally, given the z-plane encoding new mutation techniques are introduced, with the intention to locate promising regions in the search space. With proper design of the fitness function, the proposed algorithm can be used to evolve both full precision or quantized filter structures.
Annotated XML: queries and provenance
Authors: J. Nathan Foster, Todd J. Green, Val Tannen
Venue: Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2008)

We present a formal framework for capturing the provenance of data appearing in XQuery views of XML. Building on previous work on relations and their (positive) query languages, we decorate unordered XML with annotations from commutative semirings and show that these annotations suffice for a large positive fragment of XQuery applied to this data. In addition to tracking provenance metadata, the framework can be used to represent and process XML with repetitions, incomplete XML, and probabilistic XML, and provides a basis for enforcing access control policies in security applications. Each of these applications builds on our semantics for XQuery, which we present in several steps: we generalize the semantics of the Nested Relational Calculus (NRC) to handle semiring-annotated complex values, we extend it with a recursive type and structural recursion operator for trees, and we define a semantics for XQuery on annotated XML by translation into this calculus.
On 2-factors of a bipartite graph
Authors: Hong Wang
Venue: Journal of Graph Theory (1999)

In this article, we consider the following problem: Given a bipartite graph G and a positive integer k, when does G have a 2-factor with exactly k components? We will prove that if G = (V1, V2, E) is a bipartite graph with |V1| = |V2| = n &ge; 2k + 1 and &delta; (G) &ge; &lceil;n-2&rceil; + 1, then G contains a 2-factor with exactly k components. We conjecture that if G = (V1, V2; E) is a bipartite graph such that |V1| = |V2| = n &ge; 2 and &delta; (G) &ge; &lceil;n-2&rceil; + 1, then, for any bipartite graph H = (U1, U2; F) with |U1| &le; n, |U2| &le; n and &Delta; (H) &le; 2, G contains a subgraph isomorphic to H. &copy; 1999 John Wiley & Sons, Inc. J Graph Theory 31: 101&ndash;106, 1999
Utilization of geographic information systems for pre-processing of data for optimization tasks in waste management
Authors: Kopackova Hana, Komarkova Jitka, Bartonickova Miloslava, Slavikova Martina
Venue: Proceedings of the 4th WSEAS International Conference on Systems Theory and Scientific Computation (2004)

Waste production increased in last years so dramatically so their treatment has become a serious problem. Solid waste management tries to solve this problem using different kinds of models and optimization techniques. Nevertheless the main problem lays in the field of inaccurate source data that leads to wrong conclusions. This paper will show that orthophoto maps and geographic information systems (GIS) can be used in certain situations for pre-processing of spatial data which can be then used for optimization tasks.
Applying HTA method to the design of context-aware indoor navigation for the visually-impaired
Authors: Hua Wu, Alan Marshall, Wai Yu, Yun-Maw Cheng
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)

This paper discusses an Indoor Navigation Model proposed for visually impaired people. The model aims at tailoring Context-aware Indoor Navigation (CAIN) applications to the users' tasks, intentions, and situations. To achieve this, the model is novelly designed to follow the guidelines of Hierarchical Task Analysis (HTA). Usability implications and requirements for the design of this indoor navigation model are discussed. The integration of HTA method makes the design of CAIN model focus on the higher level system design issues. The results (user, user-application, and application tasks) of HTA are used to design interfaces and algorithms. A framework of command interfaces for executing interaction between application tasks and user tasks in this model is reported in this paper.
Characterization of New Static Independent-Gate-Biased FinFET Latches and Flip-Flops under Process Variations
Authors: Sherif A. Tawfik, Volkan Kursun
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

Brute-force sequential circuits with reduced clock load and simpler circuitry are widely used in the state-of-the-art integrated circuits. In this paper, new brute-force independent-gate FinFET sequential circuits are evaluated for power consumption, speed, and noise immunity characteristics at different process corners under parameter fluctuations in a 32nm FinFET technology. With the independent-gate FinFET latches and flip-flops, the total active mode power consumption, the clock power, and the average leakage power are reduced by up to 47%, 32%, and 37%, respectively, while maintaining similar speed and data stability as compared to the circuits with tied-gate FinFETs across different process corners. Furthermore, the area is reduced by 20% with the new sequential circuits due to the smaller transistors as compared to the circuits with tied-gate FinFETs.
Data representations for mobile devices
Authors: Henry Larkin
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

Data sharing and synchronisation involving mobile devices has been a significant challenge to research. The methods for tracking changes and conflicts often require the involvement of a server or desktop PC with the available storage or processing power to do so, reducing the flexibility and potential of mobile device applications. This paper presents storage mechanisms for storing data on a mobile device which allow data to be related and connected and yet easily synchronised within logical structures. This data can then be synchronised with other hosts with ease. This research bases data on serialisation to allow more logical linking of PIM data among mobile data applications.
Distributed agent architecture for packet filtering & monitoring in networked computers
Authors: Ghulam Ali, Ahmed Rafiq, Zubair A. Shaikh
Venue: Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science (2005)

Paradoxically, every thing that makes computer networks so useful and popular, their ability to enable communication between an ever-increasing numbers of people on a global scale, is also the thing that renders them vulnerable to abuse. For a software to succeed in today's ever-increasing market, it not only has to function correctly but it also has to be fast, secure, fault tolerant, distributed, easy-to-use, and much more. Customers require new solutions to secure networks that face increasing security threats, as well as to address evolving network environments and new business requirements. Mobile agents are an effective choice for many applications due to several reasons, including improvements in latency and bandwidth of client-server applications, reducing network load and vulnerabilities assessment. [1]. This paper describes the approach of distributed agent architecture for monitoring, intrusion detection and response in networked computers.
Some triply-logarithmic parallel algorithms
Authors: O. Berkman, J. Jaja, S. Krishnamurthy, R. Thurimella, U. Vishkin
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

It is established that several natural problems have triply logarithmic, or even faster, optimal parallel algorithms. These problems include: merging two sorted lists, where the values are drawn from a large, but restricted, domain on a CREW PRAM; finding all prefix minima, where the values are drawn from a restricted domain; and top-bottom global routing around a rectangle, a well-investigated problem in VLSI routing for which only highly involved serial algorithms were known.
G-pre-invex functions in mathematical programming
Authors: Tadeusz Antczak
Venue: Journal of Computational and Applied Mathematics (2008)

In the present paper, we introduce the concept of G-pre-invex functions with respect to @h defined on an invex set with respect to @h. These function unify the concepts of nondifferentiable convexity, pre-invexity and r-pre-invexity. Furthermore, relationships of G-pre-invex functions to various introduced earlier pre-invexity concepts are also discussed. Some (geometric) properties of this class of functions are also derived. Finally, optimality results are established for optimization problems under appropriate G-pre-invexity conditions.
Mixed projection methods for systems of variational inequalities
Authors: Lu-Chuan Zeng, Jen-Chih Yao
Venue: Journal of Global Optimization (2008)

Let H be a real Hilbert space. Let $$F:D(F) \subseteq H \to H, K : D(K) \subseteq H \to H$$ be bounded and continuous mappings where D(F) and D(K) are closed convex subsets of H. We introduce and consider the following system of variational inequalities: find [u *,v *]¿D(F) × D(K) such that $$\left\{\begin{array}{lll}&\langle Fu^* - v^*, x - u^*\rangle \geq 0,\quad x \in D(F),\\ &\langle Kv^* + u^*, y - v^*\rangle \geq 0,\quad y \in D(K)\end{array}\right.$$ This system of variational inequalities is closely related to a pseudomonotone variational inequality. The well-known projection method is extended to develop a mixed projection method for solving this system of variational inequalities. No invertibility assumption is imposed on F and K. The operators K and F also need not be defined on compact subsets of H.
Streaming Dyadic Boolean Operations
Authors: Walter Dosch, Annette Stümpel, Tõnu Tamme
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

We investigate the specification and implementation of iterator components for dyadic Boolean operations in the setting of stream functions and state transition machines.We explicate the approach for the Boolean conjunction and study iterator components repeating this operation. The strict conjunction, the left-strict conjunction, the right-strict conjunction and the parallel conjunction differ in their reaction how they process FALSE-elements from one input channel while waiting for input on the other input channel. We systematically transform the input/output behaviour into state-based implementations using a common history abstraction function.Beyond the particular application, we present general methods for the systematic design of iterator components in distributed systems with asynchronous communication.
Prediction of disordered regions in proteins based on the meta approach
Authors: Takashi Ishida, Kengo Kinoshita
Venue: Bioinformatics (2008)

Motivation: Intrinsically disordered regions in proteins have no unique stable structures without their partner molecules, thus these regions sometimes prevent high-quality structure determination. Furthermore, proteins with disordered regions are often involved in important biological processes, and the disordered regions are considered to play important roles in molecular interactions. Therefore, identifying disordered regions is important to obtain high-resolution structural information and to understand the functional aspects of these proteins. Results: We developed a new prediction method for disordered regions in proteins based on the meta approach and implemented a web-server for this prediction method named ‘metaPrDOS’. The method predicts the disorder tendency of each residue using support vector machines from the prediction results of the seven independent predictors. Evaluation of the meta approach was performed using the CASP7 prediction targets to avoid an overestimation due to the inclusion of proteins used in the training set of some component predictors. As a result, the meta approach achieved higher prediction accuracy than all methods participating in CASP7. Availability: http://prdos.hgc.jp/meta/ Contact: t-ishida@hgc.jp
Interoperability in Collaborative Networks: Independent and industry-specific initiatives - The case of the footwear industry
Authors: Claudia-Melania Chituc, César Toscano, Americo Azevedo
Venue: Computers in Industry (2008)

The development of information and communication technologies and turbulent market conditions have forced enterprises to adapt their way of undertaking business, from traditional practices to e-business. In this context, achieving seamless interoperability among heterogeneous organizations becomes a critical issue. This article has two main objectives:(1)to present a review of the most relevant approaches aiming at achieving seamless interoperability in a collaborative networked environment. In this sense, major interoperability issues (e.g., interoperability requirements, technologies) are discussed, and the most significant independent (e.g., ebXML) and industry-specific initiatives (e.g., RosettaNet, papiNet, TexWeave) are analyzed; (2)to introduce a recently developed two-layered operational infrastructure aiming at attaining seamless interoperability in the footwear industry (the up-stream segment), based on the requirements identified for this sector in a recent industry survey conducted at European level. Other relevant initiatives targeting this sector are also analyzed, emphasizing the innovative aspects and advantages of this approach.
Design and Implementation of an IPv6 Source Address Validation Device
Authors: Guang Yao, Jun Bi
Venue: Proceedings of the Fourth International Conference on Networking and Services (2008)

The lack of source address validation on the Internet makes attack with IP spoofing a serious problem. Many methods have been proposed to solve this problem, and among them, SPM and ARBIF are effective and feasible ones. We have implemented an IPv6 source address validation device with these two methods embedded, and this device is an open framework for other source address validation mechanisms.