ppxscal/embedding_network huggingface dataset:
Electronic governance and rural communities
Authors: Robert Schware
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

The track record of sustainable e-Government initiatives in rural areas is short, complex and difficult to measure. It has already been 5 years since Richard Heeks's classic paper on e-Government, "Most e-Government-for-Development Projects Fail," came out. The paper claimed that 85% of e-Government projects in developing countries fail; out of which 35% are total failures, 50% are partial failures, and only 15% are successes. Soon thereafter, the World Bank reported in a "Task Managers' ICT Toolkit" that its sectoral based projects with Information and Communication Technology (ICT) components had an "alarmingly high failure rate", with 50% suffering disputes and 80% requiring contract amendments. It would seem that a lot of e-Government/ICT projects aimed at rural areas can waste precious resources that could be devoted to competing development needs. This panel is twofold. First, reasons of lack of sustainable e-Government initiatives in rural communities will be discussed. Second, successful projects presenting examples of good practices will be analyzed in order to summarize lessons to be learned.
Optimal Lot Sizing Policies For Sequential Online Auctions
Authors: Arvind K. Tripathi, Suresh K. Nair, Gilbert G. Karuga
Venue: IEEE Transactions on Knowledge and Data Engineering (2009)

This study proposes methods for determining the optimal lot sizes for sequential auctions that are conducted to sell sizable quantities of an item. These auctions are fairly common in business to consumer (B2C) auctions. In these auctions, the tradeoff for the auctioneer is between the alacrity with which funds are received, and the amount of funds collected by the faster clearing of inventory using larger lot sizes. Observed bids in these auctions impact the auctioneer's decision on lot sizes in future auctions. We first present a goal programming approach for estimating the bid distribution for the bidder population from the observed bids, readily available in these auctions. We then develop models to compute optimal lot sizes for both stationary and non-stationary bid distributions. For stationary bid distribution, we present closed form solutions and structural results. Our findings show that the optimal lot size increases with inventory holding costs and number of bidders. Our model for non-stationary bid distribution captures the inter-auction dynamics such as the number of bidders, their bids, past winning bids, and lot size. We use simulated data to test the robustness of our model.
Testing for the validity of the assumptions in the exponential step-stress accelerated life-testing model
Authors: Bing Xing Wang
Venue: Computational Statistics Data Analysis (2009)

In the application of the exponential step-stress accelerated life-testing model, there are usually three assumptions required: (1) for any stress level, the lifetime distribution of a test unit is exponential; (2) for any stress level, the mean life of a test unit is a log-linear function of stress; (3) a cumulative exposure model holds. This paper explores the validity of assumptions 1 and 3. It is proved that assumption 3 is unnecessary to the exponential step-stress accelerated life-testing model. A test statistic is proposed to test the validity of the assumptions 1. The null distribution of the test statistic is derived. A Monte Carlo simulation is given to study the power of the proposed test procedure. Finally, an example is given to illustrate the proposed test procedure.
Balancing processor shares of scheduling classes through controlled allocation of memory
Authors: K. V. Sastry
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

In a paged, virtual memory computer system used by several different classes of users simultaneously, it is reasonable to expect that each class will demand certain service rates. Service rates for a particular class can be affected by having each class use its share of (a specified percentage) Instruction Processor (IP) time at regular intervals. There are also two other important resources in the system---main memory and the IO system. The service rate of a class is very much dependent upon the availability of (or lack of) these two resources even if a processor is dedicated to a class. On the other hand, a specified IP share can be achieved by using an "unfairly large" portion of main storage for an "unfairly large" population of processes in the READY state. Although it may be favorable to do so for a particular class, it may, in fact, prevent the other classes from achieving their processor shares because of lack of enough storage.
Clustering with case-based reasoning for wireless sensor network
Authors: Yaqiong Wang, Kyung Wook Baek, Kyung Tae Kim, Hee Yong Youn, Hyung Su Lee
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

In wireless sensor network one of the key issues is how to maximize the network lifetime since it consists of sensor nodes of limited energy. Numerous cluster-based routing schemes have been proposed for sensor networks. Here various important factors such as sensing coverage and distribution of live nodes need to be effectively accounted in forming the clusters. In this paper we propose a new scheme which considers the nodes' remaining energy, distance between the nodes, and sensor coverage in clustering the nodes. We also employ the case-based reasoning technique in the clustering process. Compared with the existing cluster-based protocols such as LEACH and Coverage-Preserving protocol through computer simulation, the proposed scheme allows substantially enhanced network lifetime and coverage. Especially, it is more effective when the network has been used for a while and thus some nodes have become inoperable.
A middleware service for mobile ad hoc data sharing, enhancing data availability
Authors: Malika Boulkenafed, Valérie Issarny
Venue: Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware (2003)

It is now commonplace for a person to use lightweight wireless computing devices, and to make his/her data available to other people's devices using todays various networking capabilities (infrastructure-based WLAN, ad hoc WLAN, GSM, etc.). Middleware platforms initially developed for stationary distributed systems cannot be directly applied in such a mobile environment. They must adapt their functionalities so as to best cope with possible resource constraints (energy, storage) of mobile terminals as well as with the various types of wireless networks that are now available. In this paper, we present a middleware service that allows collaborative data sharing among ad hoc groups that are dynamically formed according to the connectivity achieved by the ad hoc WLAN. Our service enhances, in particular, data availability within mobile ad hoc collaborative groups, and integrates a new adaptive data replication protocol for mobile terminals, combining both optimistic and conservative schemes. Our service has been designed so as to minimize energy consumption and optimize data availability and storage consumption.
MinorFs
Authors: Rob Meijer
Venue: Linux Journal (2009)

A set of user-space filesystems for enhanced discretionary access control.
Cueing retrospective verbal reports in usability testing through eye-movement replay
Authors: Nicola Eger, Linden J. Ball, Robert Stevens, Jon Dodd
Venue: Proceedings of the 21st British CHI Group Annual Conference on HCI 2007: People and Computers XXI: HCI...but not as we know it - Volume 1 (2007)

An experimental validation is presented of a novel method for usability testing that entails the playback of dynamic eye-tracking data to cue the elicitation of retrospective verbal reports. Participants in our study produced: (1) think-aloud reports during an online search task, and (2) retrospective reports during another online search task, with reports being cued by the playback of either the screen capture of events or the participant's own eye-movements. Task-completion times and response rates were recorded for all reporting methods. Fewer participants completed the search task whilst thinking aloud, indicating the reactivity of this technique. Verbal transcripts were coded for instances of usability problems. The eye-cued method identified more usability problems than the think-aloud or screen-cued methods. A significant interaction between search engine type and retrospective cue type suggests that the value of the eye-cue method for eliciting usability problems may be greatest with more complex search environments. Our results demonstrate that when cued appropriately, retrospective reports may be less reactive and more informative than other verbalisation techniques.
Affective Content Detection by Using Timing Features and Fuzzy Clustering
Authors: Min Xu, Suhuai Luo, Jesse S. Jin
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

Emotional factors directly reflect audiences' attention, evaluation and memory. Movie affective content detection attracts more and more research efforts. Most of the existing work focus on developing efficient affective features or implementing feasible pattern recognition algorithms. However, some important issues are ignored. 1) Most of the feature used in affective content detection are traditional visual/audio features. While affective content detection needs those features which are directly related to emotions. 2) affective content is a subjective concept which heavily depends on human perception. It is hard to find a clear boundary for various emotion categories. While most of the existing methods utilize hard pattern recognition algorithm to generate clear boundary for emotion categories. In this paper, we consider the above two issues by two aspects. 1) We employ timing features which are important of films and an important part of films' power to affect viewers' feelings and emotions. Meanwhile, audio features are used together with timing features to detect affective content from multiple modalities. 2) Fuzzy clustering is used in this paper to map affective features to affective content. Fuzzy logic provides a mathematical model to represent vagueness, which is close to human perception. Experimental results shows the proposed method is effective and efficient.
Efficient algorithms for wavelength assignment on trees of rings
Authors: Zhengbing Bian, Qian-Ping Gu, Xiao Zhou
Venue: Discrete Applied Mathematics (2009)

A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths with the same wavelength are edge-disjoint, using the minimum number of wavelengths. The WA problem is NP-hard for a tree of rings network which is well used in practice. In this paper, we give an efficient algorithm which solves the WA problem on a tree of rings with an arbitrary (node) degree using at most 3L wavelengths and achieves an approximation ratio of 2.75 asymptotically, where L is the maximum number of paths on any link in the network. The 3L upper bound is tight since there are instances of the WA problem that require 3L wavelengths even on a tree of rings with degree four. We also give a 3L and 2-approximation (resp. 2.5-approximation) algorithm for the WA problem on a tree of rings with degree at most six (resp. eight). Previous results include: 4L (resp. 3L) wavelengths for trees of rings with arbitrary degrees (resp. degree at most eight), and 2-approximation (resp. 2.5-approximation) algorithm for trees of rings with degree four (resp. six).
Dynamic ham-sandwich cuts in the plane
Authors: Timothy G. Abbott, Michael A. Burr, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, John Hugg, Daniel Kane, Stefan Langerman, Jelani Nelson, Eynat Rafalin, Kathryn Seyboth, Vincent Yeung
Venue: Computational Geometry: Theory and Applications (2009)

We design efficient data structures for dynamically maintaining a ham-sandwich cut of two point sets in the plane subject to insertions and deletions of points in either set. A ham-sandwich cut is a line that simultaneously bisects the cardinality of both point sets. For general point sets, our first data structure supports each operation in O(n^1^/^3^+^@e) amortized time and O(n^4^/^3^+^@e) space. Our second data structure performs faster when each point set decomposes into a small number k of subsets in convex position: it supports insertions and deletions in O(logn) time and ham-sandwich queries in O(klog^4n) time. In addition, if each point set has convex peeling depth k, then we can maintain the decomposition automatically using O(klogn) time per insertion and deletion. Alternatively, we can view each convex point set as a convex polygon, and we show how to find a ham-sandwich cut that bisects the total areas or total perimeters of these polygons in O(klog^4n) time plus the O((kb)polylog(kb)) time required to approximate the root of a polynomial of degree O(k) up to b bits of precision. We also show how to maintain a partition of the plane by two lines into four regions each containing a quarter of the total point count, area, or perimeter in polylogarithmic time.
Dynamic Trust Management
Authors: Matt Blaze, Sampath Kannan, Insup Lee, Oleg Sokolsky, Jonathan M. Smith, Angelos D. Keromytis, Wenke Lee
Venue: Computer (2009)

Trust management forms the basis for communicating policy among system elements and demands credential checking for access to all virtual private service resources—along with careful evaluation of credentials against specified policies—before a party can be trusted.
Experiences in COBOL compiler validation
Authors: George N. Baird, Margaret M. Cook
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

The Federal COBOL Compiler Testing Service (FCCTS) is an activity of the Software Development Division of the Department of the Navy, Automatic Data Processing Equipment Selection Office (ADPESO). Since July 1, 1972, all COBOL compilers brought into the Federal Government have to be identified as implementing one of the levels of the Federal COBOL Standard. The National Bureau of Standards, which has the responsibility for the development and maintenance of Federal ADP Standards, has delegated to the Department of Defense, and thereby to ADPESO, the responsibility for the operation of a Government-wide COBOL Compiler Testing Service. This responsibility is discharged by the FCCTS through the implementation and maintenance of the COBOL Compiler Validation System, a comprehensive set of routines used to test COBOL compilers for compliance with the Federal COBOL Standard as prescribed in Federal Information Processing Standards Publication 21 (FIPS PUB 21), published by the National Bureau of Standards.
Finding and Applying Loop Transformations for Generating Optimized FPGA Implementations
Authors: Harald Devos, Kristof Beyls, Mark Christiaens, Jan Campenhout, Erik H. D'Hollander, Dirk Stroobandt
Venue: Transactions on High-Performance Embedded Architectures and Compilers I (2007)

When implementing multimedia applications, solutions in dedicated hardware are chosen only when the required performance or energy-efficiency cannot be met with a software solution. The performance of a hardware design critically depends upon having high levels of parallelism and data locality. Often a long sequence of high-level transformations is needed to sufficiently increase the locality and parallelism. The effect of the transformations is known only after translating the high-level code into a specific design at the circuit level. When the constraints are not met, hardware designers need to redo the high-level loop transformations, and repeat all subsequent translation steps, which leads to long design times.We propose a method to reduce design time through the synergistic combination of techniques (a) to quickly pinpoint the loop transformations that increase locality; (b) to refactor loops in a polyhedral model and check whether a sequence of refactorings is legal; (c) to generate efficient structural VHDL from the optimized refactored algorithm.The implementation of these techniques in a tool suite results in a far shorter design time of hours instead of days or weeks. A 2D-inverse discrete wavelet transform was taken as a case study. The results outperform those of a commercial C-to-VHDL compiler, and compare favorably with existing published approaches.
Effect of quantum dot shape on dynamical dephasing suppression in exciton qubits under applied electric field
Authors: Thomas E. Hodgson, Lorenza Viola, Irene D'Amico
Venue: Microelectronics Journal (2009)

We investigate the efficiency of periodic dynamical decoupling of an exciton qubit confined in a self-assembled quantum dot in the presence of an applied electric field. The shape of the quantum dot is found to have a large effect on the excitonic dephasing. It is shown that dynamical suppression of dephasing, through a simple series of equally spaced bit flips, is most efficient for quantum dots that are close to spherical. In addition, compared to the no field case, the presence of an electric field increases the efficiency of the decoupling technique as the quantum dot becomes more oblate. Our calculations show that dephasing can be significantly suppressed in GaAs/AlAs quantum dots suitable for quantum information processing.
Guest Editors' Introduction: The Status of IEEE Std 1500
Authors: Erik Jan Marinissen, Yervant Zorian
Venue: IEEE Design Test (2009)

The increased use of embedded predesigned reusable cores necessitates a core-based test strategy. The goal of IEEE Std 1500-2005 is to simplify reuse and facilitate interoperability for testing core-based system chips, especially if they contain cores from different sources. This special issue updates readers on the status of the usage and adoption of this standard.
Optimization of grasping forces in handling of brittle objects
Authors: B. Barkat, S. Zeghloul, J. P. Gazeau
Venue: Robotics and Autonomous Systems (2009)

This paper deals with the optimization of grasping brittle objects with a multi-fingered robot hand under general constraints such as finger deformability and object positioning tolerances. First, a general formulation describing hyperstatic grasping is presented. Then an optimization criterion based on the minimization of squeezing forces and torques is introduced. And finally results of numerical simulation for grasping with a special three-fingered gripper are presented.
Dealing with Active and Stateful Services in the Service-Oriented Architecture
Authors: Haldor Samset, Rolv Bræk
Venue: Service-Oriented Computing - ICSOC 2007 Workshops: ICSOC 2007, International Workshops, Vienna, Austria, September 17, 2007, Revised Selected Papers (2009)

Services in SOA are typically considered to be of passive nature, providing functionality that solely execute upon invocation. Additionally, stateless services are commonly advocated as a modeling principle of todays SOA style.This paper argues that services could be of an active nature, and that services often involve sessions with stateful behavior. We suggest an approach for modeling active and stateful services, using UML 2 Collaborations and state machines. This forms a behavioral contract, and separates the modeling of service logic from the service implementation, allowing for validating the asserted service behavior using a model checker.
Three things every CS educator should know about their students' future careers in software development
Authors: Andrew Begel
Venue: Journal of Computing Sciences in Colleges (2009)

Computer science education is fundamentally about transitioning students from novices to experts. As students learn new hard and soft skills, and master them, they grow more confident in their abilities and interactions with others. We are pleased to see them become big fish in a small pond. But, when college graduates enter the software engineering workforce, just how well do they fare? In this talk, I'll show you three surprising challenges that we saw newly graduated Computer Science students overcome as they began careers in software development at Microsoft. With the adoption of some innovative pedagogical approaches in Computer Science education already being taught in universities around the world, I think we can ease the transition and better prepare students for positions in the software industry.
Design of a Low-power Voltage Reference Based on Subthreshold MOSFETs
Authors: Guang-jun Xie, Chang-xuan Zhang, Yuan-yuan Zhou
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

A low-power MOSFET-only voltage reference circuit is proposed which compensates for the temperature dependence of a proportional-to-absolute-temperature (PTAT) voltage generated by a pair of MOS devices working in thesubthreshold region with a gate-to-source voltage of an MOS transistor operating in the same region. The voltage reference circuit, designed for a standard 0.6&micro;m CMOS process, has been used in a low dropout voltage regulator (LDO). Thecircuit features good temperature stability i.e. 37.4ppm/&deg;C over the range from -40&deg;C to 120&deg;, the supply voltage is 1.4V-5.5V and the quiescent current is 4&micro;A.
An Analytical Study of Reliable and Energy-Efficient Data Collection in Sparse Sensor Networks with Mobile Relays
Authors: Giuseppe Anastasi, Marco Conti, Mario Francesco
Venue: Proceedings of the 6th European Conference on Wireless Sensor Networks (2009)

Sparse wireless sensor networks (WSNs) are emerging as an effective solution for a wide range of applications, especially for environmental monitoring. In this context, special mobile elements --- i.e. mobile relays (MRs) --- can be used to get data sampled by sensor nodes. In this paper we present an analytical evaluation of the data collection performance in sparse WSNs with MRs. Our main contribution is the definition of a flexible model which can derive the total energy consumption for each message correctly transferred by sensors to the MR. The results show that a low duty cycle is convenient and allows a significant amount of correctly received messages, especially when the MR moves with a low speed. When the MR moves fast, depending on its mobility pattern, a low duty cycle may not always be the most energy efficient option.
Virtual Reality-Based Scenarios for Visuo-motor Conflicts Studies: Preliminary Results
Authors: L. Demougeot, N. Mollet, A. Sciutti, R. Chellali, T. Pozzo
Venue: Proceedings of the 2009 Second International Conferences on Advances in Computer-Human Interactions (2009)

This preliminary study looks into how visual information affects motion planning in a gravitational environment. Recently, it has been shown that goal-directed tasks, e.g. simple pointing actions, are performed using a combination of a priori knowledge and closed-loop information, coming from proprioceptive-vestibular and visual feedback. In particular it has been observed that visual information is used by the central nervous system to reorganize motor planning when visuo-motor conflicts occur.The aim of our work is to investigate deeper the contribution of the visual channel in motor planning by means of virtual reality tools. Indeed, virtual reality technology is used here to modify the nature of visual input, leading to test several scenarios from minimalist and impoverished scenes to fully immersive and realistic environments. In fact we want to understand how the richness of the visual information is relevant in influencing our motor planning. We describe here our experimental setup and protocols. Moreover we present some preliminary results and we discuss the ongoing developments.