ppxscal/embedding_network huggingface dataset:
Acceptability of internet voting and CRM principles among the internet savvy
Authors: Alan D. Smith
Venue: International Journal of Business Information Systems (2008)

Many of the more important aspects of internet-voting policies, practices, and procedure file sharing include economic impacts, ethical issues, technical issues, and the legality of web-enabled voting; especially in relation to CRM concepts. A sample of 100 fully employed, professional and semi-professional service management and internet users, representing a college-educated and knowledge-based sample derived from the metropolitan section of Pittsburgh, Pennsylvania, was generated. As evident from the factor-based, Principal-Components Analysis (PCA) hypothesis-testing, the basic tenets of Online Technology, Accessibility, Political Awareness, Registered Voters, and Gender Issues accounted for 69.2% (adjusted 67.5%) of the explained variance in willingness to vote if online and was statistically significance (F = 40.804, P = 0.000). The most important were online technology (i.e., perceiving in a very positive light registering online, confidence in such technology, and actually voting online) and increased accessibility, as measured by having computer and internet access among potential and active voters.
Performance of P2P live video streaming systems on a controlled test-bed
Authors: Sachin Agarwal, Jatinder Pal Singh, Aditya Mavlankar, Pierpaolo Bacchichet, Bernd Girod
Venue: Proceedings of the 4th International Conference on Testbeds and research infrastructures for the development of networks & communities (2008)

We evaluate and compare the performance of three P2P streaming systems that are capable of streaming live video on the Internet by testing them on a carefully controlled, traffic-shaped network test-bed. We first describe the construction of the test-bed based upon Internet measurements between geographically distributed hosts. Then, we present a methodology for evaluating these P2P video streaming systems by performing video quality and network usage analysis from the log information obtained via running these systems on the test-bed. Our methodology to assess P2P live video streaming systems comprises analyzing the objective quality of the received video, waiting time to receive the first data byte, and several network usage measures such as P2P protocol overhead, load on the server due to the inefficiencies of the P2P overlay, and measurements of the number of bytes exchanged between the peers. It is essential that every peer buffers packets for some time before playing out the video in order to ensure good quality. We report the time that the user has to wait before he can see the video playing. These measurements not only gauge the performance of currently available P2P streaming systems but also highlight desired improvements in current P2P video streaming systems.
SIP and 802.21 for Service Mobility and Pro-active Authentication
Authors: Greco Polito Silvana, Henning Schulzrinne
Venue: Proceedings of the Communication Networks and Services Research Conference (2008)

The IEEE 802.21 working group is designing a framework to facilitate handover between heterogeneous networks allowing mobile terminals to get information about nearby networks before performing the handover. The design of a transport protocol for 802.21 signaling is still an open issue and in this paper we propose a solution based on the Session Initiation Protocol (SIP) that is the most used standard signaling protocol for voice over IP services. In this paper we focus on the SIP features that allow service mobility, i.e., allow users to use their services regardless the access network they are using. We propose a signaling model in which the 802.21 framework is used to provide information that allow users to activate the SIP mobility procedures before the handover and the SIP messages used for service mobility are used as carriers of 802.21 signaling, too. This allows to reduce the complexity of the signaling infrastructure that performs both service mobility and discovery of information about nearby networks.
Covering Your Assets in Software Engineering
Authors: Martin Gilje Jaatun, Inger Anne Tøndel
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Many security requirements elicitation techniques implicitly assume that assets are identified on beforehand, but few actually describe how this should be done. In this paper we suggest one specific method that can be used to identify and prioritize assets in any software engineering project.
Detection and Identification of Anomalies in Wireless Mesh Networks Using Principal Component Analysis (PCA)
Authors: Sara Hakami, Zainab Zaidi, Bjorn Landfeldt, Tim Moors
Venue: Proceedings of the The International Symposium on Parallel Architectures, Algorithms, and Networks (2008)

Anomaly detection is becoming a powerful and necessary omponent as wireless networks gain popularity. In this paper, we evaluate the efficacy of PCA based anomaly detection for wireless mesh networks. PCA was originally developed for wired networks. Our experiments show that it is possible to detect different types of anomalies in an interference prone wireless environment. However, the sensitivity of PCA to small changes in flows prompted us to develop an anomaly identification scheme which automatically identifies the flow(s) causing the detected anomaly and their contributions in terms of number of packets. Our results show that the identification scheme is able to differentiate false alarms from real anomalies and pinpoint the culprit(s) in case of a real fault or threat. The experiments were performed over an 8 node mesh testbed deployed in an urban street layout in Sydney, under different realistic traffic scenarios. Our identification scheme facilitates the use of PCA based method for real-time anomaly detection in wireless networks as it can filter the false alarms locally at the monitoring nodes without excessive computational overhead.
AADL Execution Semantics Transformation for Formal Verification
Authors: Thomas Abdoul, Joel Champeau, Philippe Dhaussy, Pierre Yves Pillain, Jean-Charles Roger
Venue: Proceedings of the 13th IEEE International Conference on on Engineering of Complex Computer Systems (2008)

The paper presents an AADL model transformation. This transformation provides a formal model for model checking activities. This transformation covers three aspects: structure, behaviour description and execution semantics. The necessity to complete AADL metamodel is shown in order to improve system behaviour. Transformation rules take into account these aspects. The Kermeta metamodeling platform is used to implement these rules which are applied to a case study. In conclusion, we suggest that model transformation provides useful support to improve the integration of formal verification in an industrial engineering process.
Explicit criteria for the existence of positive solutions for a scalar differential equation with variable delay in the critical case
Authors: Josef Diblík, Zdenk Svoboda, Zdenk Šmarda
Venue: Computers Mathematics with Applications (2008)

A scalar linear differential equation with time-dependent delay x@?(t)=-a(t)x(t-@t(t)) is considered, where t@?I@?[t"0,~), t"0@?R, a:I->R^+@?(0,~) is a continuous function and @t:I->R^+ is a continuous function such that t-@t(t)>t"0-@t(t"0) if t>t"0. The goal of our investigation is to give sufficient conditions for the existence of positive solutions as t->~ in the critical case in terms of inequalities on a and @t. A generalization of one known final (in a certain sense) result is given for the case of @t being not a constant. Analysing this generalization, we show, e.g., that it differs from the original statement with a constant delay since it does not give the best possible result. This is demonstrated on a suitable example.
No-regret learning in convex games
Authors: Geoffrey J. Gordon, Amy Greenwald, Casey Marks
Venue: Proceedings of the 25th international conference on Machine learning (2008)

Quite a bit is known about minimizing different kinds of regret in experts problems, and how these regret types relate to types of equilibria in the multiagent setting of repeated matrix games. Much less is known about the possible kinds of regret in online convex programming problems (OCPs), or about equilibria in the analogous multiagent setting of repeated convex games. This gap is unfortunate, since convex games are much more expressive than matrix games, and since many important machine learning problems can be expressed as OCPs. In this paper, we work to close this gap: we analyze a spectrum of regret types which lie between external and swap regret, along with their corresponding equilibria, which lie between coarse correlated and correlated equilibrium. We also analyze algorithms for minimizing these regret types. As examples of our framework, we derive algorithms for learning correlated equilibria in polyhedral convex games and extensive-form correlated equilibria in extensive-form games. The former is exponentially more efficient than previous algorithms, and the latter is the first of its type.
Usability evaluation of a commercial pocket PC phone: a pilot study
Authors: Ahmad Rahmati, Lin Zhong
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)

Advanced mobile phones, such as Smartphones and Pocket PC phones, can potentially provide cost-effective ubiquitous IT access. Towards evaluating their potential and discovering their usability problems, we distributed state-of-the-art Pocket PC phones to 10 mobile users and employed a triangulation of research methods to study their usage for two months. Our research methods included qualitative inquiries in the form of focus groups and structured interviews, and quantitative measurements in the form of in-situ logging. Unlike most previous studies that focused on a single design aspect, our study provides a comprehensive picture regarding the holistic usability of advanced mobile phones.
A Data Propagation Using Mobile Terminal in Locally Distributed Ad-Hoc Networks
Authors: Akimitsu Kanzaki, Tetsuya Taniguchi, Takahiro Hara, Shojiro Nishio
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

This paper proposes a data propagation method for improving data availability in ad hoc networks in which nodes are locally distributed. Our method makes use of a special mobile terminal which moves to transfer data items. Moreover, the mobile terminal propagates data items effectively by deciding the moving route considering the length of the route, access requests issued by nodes, and data items held by nodes. Furthermore, we verify the effectiveness of our method by simulation experiments.
Distributed rate allocation for inelastic flows
Authors: Prashanth Hande, Shengyu Zhang, Mung Chiang
Venue: IEEE/ACM Transactions on Networking (TON) (2007)

A common assumption behind most of the recent research on network rate allocation is that traffic flows are elastic, which means that their utility functions are concave and continuous and that there is no hard limit on the rate allocated to each flow. These critical assumptions lead to the tractability of the analytic models for rate allocation based on network utility maximization, but also limit the applicability of the resulting rate allocation protocols. This paper focuses on inelastic flows and removes these restrictive and often invalid assumptions. First, we consider nonconcave utility functions, which turn utility maximization into difficult, nonconvex optimization problems. We present conditions under which the standard price-based distributed algorithm can still converge to the globally optimal rate allocation despite nonconcavity of utility functions. In particular, continuity of price-based rate allocation at all the optimal prices is a sufficient condition for global convergence of rate allocation by the standard algorithm, and continuity at at least one optimal price is a necessary condition. We then show how to provision link capacity to guarantee convergence of the standard distributed algorithm. Second, we model real-time flow utilities as discontinuous functions. We show how link capacity can be provisioned to allow admission of all real-time flows, then propose a price-based admission control heuristics when such link capacity provisioning is impossible, and finally develop an optimal distributed algorithm to allocate rates between elastic and real-time flows.
Design of secure hardware for ATM networks
Authors: Junaid Majeed
Venue: Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics (2005)

Broadband networks based on the asynchronous transfer mode (ATM) are emerging rapidly. Both the technological component in terms of ATM infrastructure, as well as the area of applications requiring Quality of Services (QoS) by the means of bandwidth or delay constraints is covered by a variety of projects and products. However, given the increasing interest in applications such as governmental communication, transmission of medical information, or commercial applications, the necessity of providing secure means of delivering sensitive contents is apparent. In this paper, we focus on security services in ATM network. Data security plays an increasingly important role in today's information technology. Potential data rates in the gigabit ranges such as offered by ATM networks, put many constraints on the design of a secure, but usable, network. In addition, the cell structure of ATM makes bulk data encryption as well as public key security services challenging tasks. This paper deals with agility of cryptographic algorithms that is the capability of an encryption device to change its algorithm. This feature appears to be very desirable for high speed networks because it facilitates design flexibility and future protocol additions and changes. We propose the use of reconfigurable hardware since they appear to be naturally suited for the task. The use of reconfigurable in cryptographic applications to our knowledge has not been systematically analyzed before and appears to be a highly interesting area within high speed network security.
Towards a computational theory of statistical tests
Authors: M. Blum
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

The authors initiate a computational theory of statistical tests. Loosely speaking, an algorithm is a statistical test if it rejects a 'negligible' fraction of strings. A statistical test is universal for a class of algorithms if it rejects all (but finitely many) of the strings rejected by each algorithm in the class. They consider the existence and efficiency of universal statistical tests for various classes of statistical tests. They also consider the relation between ensembles passing statistical tests of particular complexity and ensembles which are indistinguishable from uniform by algorithms of the same complexity. Some results refer to relatively simple statistical tests (e.g. those implemented by counter machines).
Towards the integration of sysml and problem frames
Authors: Pietro Colombo, Vieri del Bianco, Luigi Lavazza
Venue: Proceedings of the 3rd international workshop on Applications and advances of problem frames (2008)

Today, analysts are offered a wide set of conceptual tools for requirements enginering, including modelling languages, like UML and SysML, and methodological approaches, like Problem Frames. However, these conceptual tools, which address different needs and activities, are generally not integrated, thus making it difficult to effectively use more than one of them at a time. This paper addresses the integration of Problem Frames and SysML, by presenting how a set of well known problem frames can be represented by means of SysML. The idea is that problem frames can benefit from SysML as a powerful notation, while SysML users get a sound methodological approach, which is absent from the current proposal of SysML. The integration opens the way to a full model centric requirement analysis approach. Models favour the transition from the requirements to the design phase, hence the resulting model can be conveniently used as a starting point for design.
Process-Variation Statistical Modeling for VLSI Timing Analysis
Authors: Jui-Hsiang Liu, Jun-Kuei Zeng, Ai-Syuan Hong, Lumdo Chen, Charlie Chung Ping Chen
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

SSTA requires accurate statistical distribution models of non-Gaussian random variables of process parameters andtiming variables. Traditional quadratic Gaussian model has been shown to have some serious limitations. In particular, it limits the range of skewness that can be modeled and it can not model the kurtosis. In this paper, we presented complex-coefficient quadratic Gaussian polynomial model and higher order Gaussian polynomial model to resolve these difficulties. Experimental results show how our methods and new algorithms expose some enhancements in both accuracy and versatility.
Decomposing a simple polygon into pseudo-triangles and convex polygons
Authors: Stefan Gerdjikov, Alexander Wolff
Venue: Computational Geometry: Theory and Applications (2008)

In this paper we consider the problem of decomposing a simple polygon into subpolygons that exclusively use vertices of the given polygon. We allow two types of subpolygons: pseudo-triangles and convex polygons. We call the resulting decomposition PT-convex. We are interested in minimum decompositions, i.e., in decomposing the input polygon into the least number of subpolygons. Allowing subpolygons of one of two types has the potential to reduce the complexity of the resulting decomposition considerably. The problem of decomposing a simple polygon into the least number of convex polygons has been considered. We extend a dynamic-programming algorithm of Keil and Snoeyink for that problem to the case that both convex polygons and pseudo-triangles are allowed. Our algorithm determines such a decomposition in O(n^3) time and space, where n is the number of the vertices of the polygon.
Utilisation analysis and comparison for multimedia wireless networks
Authors: Yuhong Zhang, Ezzatollah Salari
Venue: International Journal of Ad Hoc and Ubiquitous Computing (2008)

In this paper, we consider a homogeneous wireless multimedia system with both priority and non-priority calls. The resources of the system are either as the nominal channels assigned evenly to each of the coved cells or reserved in the control centre exclusively for priority calls. Different classes of calls may request different bandwidths for a satisfactory connection. We investigate how the utilisation depends on the channel allocation schemes and whether a buffer space affects the performance of the system in terms of the utilisation of the system. Our observation is expected to provide technical guidance for the design of channel allocation of multimedia wireless systems.
A method for web service description by using problem frames approach
Authors: Guangjun Cai, Zhi Jin, Zhijing Feng
Venue: Proceedings of the 3rd international workshop on Applications and advances of problem frames (2008)

This paper proposes a method for web service description by using problem frame approach. Different from existing methods, this method uses problem diagram to describe the capability of available web service and use it to identify precise requirements. Domain ontology has been developed as a sharable background for the description of both the provided services and the service requests, so that the service discovery can be conducted automatically. A case study shows that this approach is highly promising.
Co-arrays in the next Fortran Standard
Authors: John Reid, Robert W. Numrich
Venue: Scientific Programming (2007)

The WG5 committee, at its meeting in Delft, May 2005, decided to include co-arrays in the next Fortran Standard. A Fortran program containing co-arrays is interpreted as if it were replicated a fixed number of times and all copies were executed asynchronously. Each copy has its own set of data objects and is called an image. The array syntax of Fortran is extended with additional trailing subscripts in square brackets to give a clear and straightforward representation of access to data on other images. References without square brackets are to local data, so code that can run independently is uncluttered. Any occurrence of square brackets is a warning about communication between images. The additional syntax requires support in the compiler, but it has been designed to be easy to implement and to give the compiler scope both to apply its optimizations within each image and to optimize the communication between images. The extension includes execution control statements for synchronizing images and intrinsic procedures to return the number of images, to return the index of the current image, and to perform collective operations. The paper does not attempt to describe the full details of the feature as it now appears in the draft of the new standard. Instead, we describe a subset and demonstrate the use of this subset with examples.
Hierarchically Organized Layout for Visualization of Biochemical Pathway
Authors: Jyh-Jong Tsay, Bo-Liang Wu, Yu-Sen Jeng
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

In this paper, we present a layout algorithm for hierarchically organized pathways that combines and improves well-known forced-directed layout approach and hierarchical layout approach, and can handle complex pathways composed of cycles and hierarchies. Experiment shows that our approach can clearly render the global component structure of complex pathways as well as the local structure in each component.
A MAC Layer Multicasting Approach for WiMAX Access Networks
Authors: Kyu Seol Lee, Sang Won Rhee, Hee Yong Youn
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

The demand on high speed internet access has been rapidly growing due to various multimedia applications requiring high speed data transmission. WiMAX based on IEEE 802.16 standard is one of the most effective technologies among the existing solutions. With the current multicasting technique, the base station receives duplicated multicast IP datagrams via GRE Tunnel, which significantly degrades the network performance. In this paper we propose a new L2 layer multicasting approach which can avoid the duplicated packet problem by utilizing the message exchanged between the base station and subscriber station. Computer simulation with NS-2 reveals that the proposed approach allows much higher throughput and lower packet delay compared to the existing approach.
Empirical Analysis for Influences Imposed on Human Resource Management Performance by Cultural Differences within Strategic Alliance of Multinational Corporations
Authors: Junhua Wang, Guoxin Liu
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

Empirical research shows that differences in systematic culture, operation idea, operation mode, and values within strategic alliance of multinational corporations have promoted human resource management performance actively in different degrees. So strategic alliance of multinational corporations should strengthen their trans-cultural operation advantages and promote human resource management performance by improving cultural difference management mode, setting up common operation idea and culture, and opening up expedite bi-directional communication channel, etc.