ppxscal/embedding_network huggingface dataset:
A QoS Routing Protocol (CATR) Based on Channel Assignment and Timeslot Reservation
Authors: Chuanhe Huang, Hao Zhou, Yong Cheng, Changming Xie
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

In multihop wireless networks each node is equipped with multiple radio interfaces, and multiple channels are available for communication. One of the major problems in such networks is the capacity reduction due to the interference among multiple simultaneous transmissions. In order to effectively minimize interference, this paper proposes a QoS routing protocol CATR based on channel assignment and timeslot reservation. When routing, CATR selects a path and assigns channels dynamically to each link of the path with the QoS guarantees at the same time.
Analyzing Integrity Tests for Data Caching in Mobile Databases
Authors: Zarina Dzolkhifli, Hamidah Ibrahim, Lilly Suriani Affendey
Venue: Proceedings of the 5th International Conference on Distributed Computing and Internet Technology (2008)

In a mobile environment, due to the various constraints inherited from limitations of wireless communication and mobile devices, checking for integrity constraints to maintain the consistent state of mobile databases is an important issue that needs to be addressed. Hence, in this paper we propose a strategy for caching relevant data items needed during the process of checking integrity constraints of mobile databases. This is achieved by analyzing the relationships among the integrity tests (simplified form of integrity constraints) to be evaluated for a given update operation. Our strategy improves the checking mechanism by not only preventing delays during the process of checking constraints and performing the update but also by minimizing the amount of data items to be cached. Hence, our strategy speeds up the checking process.
Modeling and simulation of a single phase photovoltaic inverter and investigation of switching strategies for harmonic minimization
Authors: St. Kourtesi, L. Ekonomou, A. Nakulas, G. P. Fotis, E. Zoulias
Venue: Proceedings of the 6th conference on Applications of electrical engineering (2007)

The aim of this paper is to build an EMTDC model of a single phase photovoltaic inverter and to investigate switching strategies for harmonic minimisation. For the simulation of this model, the PSCAD/EMTDC software package was used and the waveforms of interest were taken for further examination and discussion on the performance of the model. A low rating, mains connected device was designed and was later used to demonstrate that real and reactive power can flow in the desired direction just by changing the phase shift or the voltage magnitude. The inverter device is intended for domestic use and will allow users to exploit voltage from photovoltaic cells. This a.c. converted voltage will be useful for feeding small house appliances or by employing appropriate techniques, real and reactive power exported from the inverter can reinforce the main power stream in the "Distribution Grid".
Telemeetings: Managing the Temporal Structure
Authors: Constantin Arapis, Dimitris Thanos
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

This paper presents a prototype system for modeling and managing the complete life-time of telemeetings/teleconferences.
Shortest descending paths through given faces
Authors: Mustaq Ahmed, Anna Lubiw
Venue: Computational Geometry: Theory and Applications (2009)

A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to find a shortest descending path from s to t in a polyhedral terrain. We give some properties of such paths. In the case where the face sequence is specified, we show that the shortest descending path is unique, and use convex optimization to give an @e-approximation algorithm that computes the path in O(n^3^.^5log(1@e)) time.
A compiler-hardware approach to software protection for embedded systems
Authors: Olga Gelbart, Eugen Leontie, Bhagirath Narahari, Rahul Simha
Venue: Computers and Electrical Engineering (2009)

Because of their rapid growth in recent years, embedded systems present a new front in vulnerability and an attractive target for attackers. Their pervasive use, including sensors and mobile devices, makes it easier for an adversary to gain physical access to facilitate both attacks and reverse engineering of the system. This paper describes a system - CODESSEAL - for software protection and evaluates its overhead. CODESSEAL aims to protect embedded systems from attackers with enough expertise and resources to capture the device and attempt to manipulate not only software, but also hardware. The protection mechanism involves both a compiler-based software tool that instruments executables and an on-chip FPGA-based hardware component that provides run-time integrity and control flow checking on the executable code. The use of reconfigurable hardware allows CODESSEAL to provide such security services as confidentiality, integrity and program-flow protection in a platform-independent manner without requiring a redesign of the processor. Similarly, the compiler instrumentation hides the security details from software developers. Software and data protection techniques are presented for our system and a performance analysis is provided using cycle accurate simulation. Our experimental results show that protecting instructions and data with a high level of security can be achieved with low performance penalty, in most cases less than 10%.
Restructuring Ontologies through Knowledge Discovery
Authors: Sylvia M. Henshaw, Ala'a El-Masri, Philip A. Sage
Venue: Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services (2008)

In this work, we describe an approach for maintaining self-adapting personalized ontologies. We motivate this work with the observation that users are often interested in only small parts of larger domain ontologies; however, we also observe that users are frequently unaware of concepts that may be of interest given their past preferences. As such, we suggest that personalized ontologies should be continuously specialized and generalized to represent only those concepts that have proven to be of value to the user.
Management impact of networks
Authors: Einar Stefferud, David J. Farber, Laurence H. Baker, Joseph D. Naughton, Ronald P. Uhlig, John R. Lanahan, Carl H. Reynolds, Leland H. Williams
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

Technical feasibility of networking is putting pressure on management in education, government and industry to deal with some new but fundamental policy issues. There are a number of important management issues to consider.
Sharing airtime with Shair avoids wasting time and money
Authors: Pan Hui, Richard Mortier, Kuang Xu, Jon Crowcroft, Victor O. K. Li
Venue: Proceedings of the 10th workshop on Mobile Computing Systems and Applications (2009)

Shair is a system allowing contracted mobile phone users to benefit from their unused quota minutes and text messages. Unused minutes and texts are shared via opportunistic local connectivity, allowing other Shair users to use sharers' phones within reach of short range radio such as Bluetooth.
X-Ray Image Edge Detection Based on Wavelet Transform and Lipschitz Exponent
Authors: Guowei Tang, Xiaoqing Zhong, Fangzhou Zhang, Zhenying Jin
Venue: Proceedings of the 2009 Second International Symposium on Intelligent Information Technology and Security Informatics (2009)

The characteristics of X-ray testing image are analyzed and an edge detection algorithm based on the multi-scale and multi-resolution of wavelet transform is proposed. According to the propagation of modulus maximum under different scales and the relationship between wavelet transform and Lipschitz exponent, the local maxima in vertical, horizontal and diagonal directions are detected by quadratic B-spline and Mallat algorithm was used in wavelet decomposition to determine defect edges. The experiment results prove that the algorithm of edge detection works fine the X-ray images.
Emoticonsciousness
Authors: Carl Vogel, Jerom F. Janssen
Venue: Multimodal Signals: Cognitive and Algorithmic Issues: COST Action 2102 and euCognition International School Vietri sul Mare, Italy, April 21-26, 2008 Revised Selected and Invited Papers (2009)

A temporal analysis of emoticon use in Swedish, Italian, German and English asynchronous electronic communication is reported. Emoticons are classified as positive, negative or neutral. Postings to newsgroups over a 66 week period are considered. The aggregate analysis of emoticon use in newsgroups for science and politics tends on the whole to be consistent over the entire time period. Where possible, events that coincide with divergences from trends in language-subject pairs are noted. Political discourse in Italian over the period shows marked use of negative emoticons, and in German and Swedish, positive emoticons.
Three New Approaches to Privacy-preserving Add to Multiply Protocol and its Application
Authors: Youwen Zhu, Liusheng Huang, Wei Yang, Dong Li, Yonglong Luo, Fan Dong
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Privacy-preserving Data Mining aims at securely extracting knowledge from two or more parties' private data. Secure Multi-party Computation is the paramount approach to it. In this paper, we study Privacy-preserving Add and Multiply Exchanging Technology and present three new different approaches to Privacy-preserving Add to Multiply Protocol. After that, we analyze and compare the three different approaches about the communication overheads, the computation efforts and the security. In addition, we extend Privacy-preserving Add to Multiply Protocol to Privacy-preserving Adding to Scalar Product Protocol, which is more secure and more useful in the high security situations of Privacy-preserving Data Mining. Meantime, we present a solution for the new protocol.
Realtime location privacy via mobility prediction: creating confusion at crossroads
Authors: Joseph T. Meyerowitz, Romit Roy Choudhury
Venue: Proceedings of the 10th workshop on Mobile Computing Systems and Applications (2009)

Users face privacy risks when providing personal location data to untrusted location based services (LBSs). Many existing attempts to anonymize users have relied on suppressing information about users' locations. This suppression results in reduced functionality, including degraded spatial accuracy or the loss of realtime location updates. We propose anonymizing a user by camouflaging their current location with various predicted paths. This is akin to increasing the noise floor around the user. We believe this different approach provides many advantages. By allowing the user to keep all desired functionality while still protecting the user's privacy, we enable use of a broader class of LBSs. To demonstrate our proposal, we develop CacheCloak, a system that enables realtime anonymization of continuous location updates without any loss of accuracy. Data from a GIS-based traffic simulation in an urban environment shows that CacheCloak can anonymize users rapidly.
The optimal stopping times of American call options with dividend-paying and placing stocks
Authors: Guangqin Li
Venue: WSEAS Transactions on Mathematics (2008)

American options can be exercised at any time during their lifetime. This paper addresses the optimal stopping time of several kinds of American call options.
Evolution of readiness indicators
Authors: Devendra Potnis, Theresa A. Pardo
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

The United Nations (UN) established "e-Government Readiness Index" (eGRI) and "e-Participation Index" (ePI) as indicators to gauge capacity and willingness of Member States for evaluating their e-Government initiatives. UN claims eGRI to be a true global ranking programmatic tool. It measures relative indices of UN's Member States with respect to each other for the particular year as well as their own positions with respect to the past years, thereby portraying evolving patterns of Member States' e-Government performance. Over a period of time, feedback from ongoing process of e-Readiness evaluation and a number of resources accumulating UN's knowledge base about e-Government have helped to shift the focus of these surveys from measuring "investments made in deployment of information and communication technologies (ICT)" to "the degree of connectedness in terms of back office information integration for efficient ways of offering e-Governance." Assumptions made while designing issue-based UN Surveys pose a series of limitations in terms of interpreting the results. However, eGRI can be definitely used effectively by Member States for human development through technologies in respective parts of the world. UN's advocacy for building a skilled human capital for a future knowledge-based society is one of the valuable offerings made by these Surveys. Socio-economic uplifting of citizens through ICT and the principle of "inclusion for all" offer a strong guiding framework for Member States to craft related policies, design large scale ICT-led projects and deployment of ICT in the future. Since all the imperatives, rankings, views and suggestions expressed by UN through these Surveys are highly "context" dependent, failure to understand this core principle could take governments off the fundamental path of "inclusion for all." Devising a risk-to-reward index, trust index and citizen satisfaction index are some of the possible ways to better inform e-Readiness Index in the future.
The THISL Spoken Document Retrieval Project
Authors: Steve Renals
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

THISL is an ESPRIT Long Term Research Project focused on the automatic indexing and retrieval of broadcast television and radio programmes. In particular it is concerned with the production of a demonstrator news-on-demand system to navigate an archive of BBC news broadcasts. Prototype systems based on both British and North American broadcast news have been constructed. The North American system has been successfully evaluated within the framework of the TREC-6 and TREC-7 spoken document retrieval tracks, and the system based on BBC TV and radio news archives will be evaluated by BBC R&D.
Optimization of spinning process using hybrid approach involving ANN, GA and linear programming
Authors: L. S. Admuthe, S. D. Apte
Venue: Proceedings of the 2nd Bangalore Annual Compute Conference (2009)

The spinning process is one of the important production processes in the textile industry. Yarn is created using Cotton Fibre on a rotor or ring spinning machine. The quality of resulting yarn is very important in determining their application possibilities. An important aspect of production process is selection of raw material, quality of resulting yarn and cost. The yarn should have Optimal Product Characteristics with minimum cost. The proposed paper aims to study profitability and predictability by developing computational model. ANN is used for prediction of yarn properties from fibre properties. These fibre properties are optimized using Genetic Algorithm(GA). GA also considers available stock into account. Linear Programming is used to decide proportionality of fibres in cotton bled and cost optimization. The result shows that the accuracy of proposed integrated approach is higher than Industrial Standards
A simple distributed systems approach to manufacturing information systems
Authors: Leland R. Kneppelt
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

The number of application packages for the production and inventory control function has steadily increased over the past ten years. The successful installations have been limited in number but the documented resultant savings are major. These results combined with the ever present need to increase productivity and offer better customer service have furnished much of the impetus to automate effective manufacturing control techniques.
Virtual math objects with pedagogical, mathematical, and cognitive fidelity
Authors: Beth Bos
Venue: Computers in Human Behavior (2009)

The examination of mathematical and cognitive fidelity for math related websites has been studied by Web designers; yet teachers, and especially pre-service teachers, as users of technology in the classroom, also need to be familiar with pedagogical, mathematical, and cognitive fidelity. What is pedagogical, mathematical, and cognitive fidelity; and, what makes a math website high in pedagogical, mathematical, and cognitive fidelity are discussed in this article. Evidence is shown that technology high in pedagogical, mathematical, and cognitive fidelity, when used in the classroom, improves student academic achievement.
Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game
Authors: Davide Bilò, Luciano Gualà, Guido Proietti, Peter Widmayer
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

Let a communication network be modelled by a directed graph G&thinsp;=&thinsp;(V,E) of n nodes and m edges. We consider a one-round two-player network pricing game, the Stackelberg Shortest Paths Tree (StackSPT) game. This is played on G, by assuming that edges in E are partitioned into two sets: a set E F of edges with a fixed positive real weight, and a set E P of edges that should be priced by one of the two players (the leader). Given a distinguished node r&thinsp;&isin;&thinsp;V, the StackSPT game is then as follows: the leader prices the edges in E P in such a way that he will maximize his revenue, knowing that the other player (the follower) will build a shortest paths tree of G rooted at r, say S(r), by running a publicly available algorithm. Quite naturally, for each edge selected in the solution, the leader&rsquo;s revenue is assumed to be equal to the loaded price of an edge, namely the product of the edge price times the number of paths from r in S(r) that use it. First, we show that the problem of maximizing the leader&rsquo;s revenue is NP-hard as soon as |E P |&thinsp;=&thinsp;&Theta;(n). Then, in search of an effective method for solving the problem when the size of E P is constant, we focus on the basic case in which |E P |&thinsp;=&thinsp;2, and we provide an efficient O(n 2 logn) time algorithm. Afterwards, we generalize the approach to the case |E P |&thinsp;=&thinsp;k, and we show that it can be solved in polynomial time whenever k&thinsp;=&thinsp;O(1).
Differences in eDemocracy parties' eParticipation systems
Authors: Ovid Pacific Boyd
Venue: Information Polity (2008)

eDemocracy political parties are an emerging and radically new form of political party that enables citizen participation in the policy-making process using ICTs. This paper compares the eParticipation systems of four of the first eDemocracy parties (Senator On-Line, Knivsta.Now, Aktiv Demokrati and Demoex) using an eParticipation ontology that describes eParticipation systems according to 1) stages of policy-making, 2) levels of engagement, 3) stakeholders, 4) participation areas, 5) eParticipation tools and 6) emerging technologies. By applying this ontology a great diversity among eDemocracy parties' eParticipation systems was discovered. Two overall categories, proxy politician systems and deliberative community systems, are created to label the current variety of systems. However, even within these overall labels there are substantial differences and several subtypes of proxy politician eParticipation systems are suggested: individualistic systems, citizen-review systems and delegated-leaders systems. Additionally, a multi-channel system may be a variety of the deliberative community eParticipation system.
SpaceTag: An Overlaid Virtual System and its Applications
Authors: Hiroyuki Tarumi, Ken Morishita, Megumi Nakao, Yahiko Kambayashi
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

SpaceTag is an object system on which each object called SpaceTag can be accessed only from limited locations and limited time period. Its applications include entertainment systems, advertisement services, bulletin board systems, and personal communication systems. For one-way communication, they are broadcasted from the server; for two-way communication, users can cut and paste SpaceTags between their portable PCs and the real space. The SpaceTag system is a location-aware information system, as well as it is like an augmented reality system because it attaches information to the real space. However, we categorize it as an overlaid virtual system, because it has no direct link to real objects. It can be realized as a public service without causing drastic change of this society, and without much cost.
User experimentation: an evaluation of velocity control techniques in immersive virtual environments
Authors: Dong Hyun Jeong, Chang G. Song, Remco Chang, Larry Hodges
Venue: Virtual Reality (2009)

While many of the existing velocity control techniques are well designed, the techniques are often application-specific, making it difficult to compare their effectiveness. In this paper, we evaluate five known velocity control techniques using the same experimental settings. We compare the techniques based on the assumption that a good travel technique should be easy to learn and easy to use, should cause the user to have few collisions with the VE, should allow the user to complete tasks faster, and should promote better recollection of the environment afterwards. In our experiments, we ask twenty users to use each velocity control technique to navigate through virtual corridors while performing information-gathering tasks. In all cases, the users use pointing to indicate the direction of travel. We then measure the users&#x2019; ability to recollect the information they see in the VE, as well as how much time they spend in the VE and how often they collide with the virtual walls. After each test, we use questionnaires to evaluate the ease of learning and ease of use of the velocity control technique, and the users&#x2019; sense of presence in the environment. Each of the travel techniques is then evaluated based on the users&#x2019; performances in the VE and the results of their questionnaires.
VirtualQueue: A Technique for Packet Voice Stream Reconstruction
Authors: Norival Figueira, Joseph Pasquale
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

Statistical multiplexing in packet-switched networks creates problems for packetized voice streams by introducing variable delays on delivered packets. The resulting jitter needs to be filtered so that received voice packets can be reconstructed as a continuous stream at the receiver. One common approach to reconstruction is to play back the received voice data after a delay offset from the departure time at the source of the packet stream. While the added delay helps filter jitter, one cannot introduce too much delay, otherwise, interactiveness suffers. This paper presents a new technique to find the necessary delay offset (or play-back delay) to recreate the original voice data stream. This technique gives the user control over the fraction of packets that should arrive in time to be played back so that the added play-back delay can be effectively minimized.