ppxscal/embedding_network huggingface dataset:
NexusScout: an advanced location-based application on a distributed, open mediation platform
Authors: Daniela Nicklas, Matthias Grossmann, Thomas Schwarz
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

This demo shows several advanced use cases of location-based services and demonstrates how these use cases are facilitated by a mediation middleware for spatial information, the Nexus Platform. The scenario shows how a mobile user can access location-based information via so called Virtual Information Towers, register spatial events, send and receive geographical messages or find her friends by displaying other mobile users. The platform facilitates these functions by transparently combining spatial data from a dynamically changing set of data providers, tracking mobile objects and observing registered spatial events.
A practical method for courseware evaluation
Authors: Aldo de Moor
Venue: Proceedings of the 2nd international conference on Pragmatic web (2007)

As more courseware becomes available, choosing the right functionality for a particular e-learning community is becoming more problematic. Systematic methods for evaluating courseware functionality components in their context of use are required. Of many general methods for ICT evaluation it is unclear how to assess their applicability in the context of courseware. We outline a practical method for courseware evaluation. We experiment with the method by evaluating the courseware functionality used in one core e-learning activity: the making of group assignments. One interesting finding is that the usefulness of an application to a large degree depends on the particular activity being supported, much less on the particular functionality used.
The Reliability of a Fault-Tolerant Configuration Having Variable Coverage
Authors: J. J. Stiffler
Venue: IEEE Transactions on Computers (1978)

An expression is derived for the reliability of an r-on-m fault-tolerant configuration (r spares supporting m identical operating units) when both the hazard and the coverage probability are functions of time. In addition, the coverage probability is allowed to be a function of the number of spares that have to be tested before an operational unit is found.
SUDS: An Infrastructure for Creating Bug Detection Tools
Authors: Eric Larson
Venue: Proceedings of the Seventh IEEE International Working Conference on Source Code Analysis and Manipulation (2007)

SUDS is a powerful infrastructure for creating dynamic bug detection tools. It contains phases for both static analysis and dynamic instrumentation allowing users to create tools that take advantage of both paradigms. The results of static analysis phases can be used to improve the quality of dynamic bug detection tools created with SUDS and could be expanded to find defects statically. The instrumentation engine is designed in a manner that allows users to create their own correctness models quickly but is flexible to support construction of a wide range of different tools. The effectiveness of SUDS is demonstrated by showing that it is capable of finding bugs and that performance is improved when static analysis is used to eliminated unnecessary instrumentation.
R70-3 On Stochastic Languages
Authors: C. V. Page
Venue: IEEE Transactions on Computers (1970)

A stochastic language is a set of words accepted by a probabilistic automaton with some cutpoint. The structure of the family of stochastic languages may not parallel the structure of the family of regular languages. Some stochastic languages are context-free languages which are nonregular. The basic questions of when the complement of a stochastic language is a stochastic language, or when the intersection or union of two stochastic languages is stochastic, have not been solved but have been illuminated by Turakainen's work. Turakainen proves that like the context-free languages, the intersection of a stochastic language and a regular language is a stochastic language. He shows as well that the union of a stochastic language and regular language is also a stochastic language. All right derivatives of a stochastic language are stochastic languages. In the same volume as Turakainen's paper, Nasu and Honda have proven what amounts to the fact that the reversal of a stochastic language is a stochastic language. They also show other basic properties.
Virtual Surrounding Face Geocasting with Guaranteed Message Delivery for Ad Hoc and Sensor Networks
Authors: Jie Lian, Kshirasagar Naik, Yunhao Liu, Lei Chen
Venue: Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols (2006)

Geocasting in wireless sensor networks and ad hoc networks is the delivery of a message from a source to all the nodes ina given geographical region. The objectives of a geocasting protocol are two-folds: guaranteed message delivery and low transmissioncost. Most of the existing protocols do not guarantee message delivery, and those that do incur a high transmission costs.In this paper, we introduce the idea of a Virtual Surrounding Face (VSF), and present a geocasting protocol based on VSF.By using mathematical analyses and simulation studies, we show that the proposed protocol guarantees message delivery andhas a significant lower transmission cost than the existing approaches.
Short-term Traffic Flow Prediction Based on Incremental Support Vector Regression
Authors: Haowei Su, Ling Zhang, Shu Yu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

In this paper, a new short-term traffic flow prediction model and method based on incremental support vector regression (ISVR) is proposed, according to the data collected sequentially by the probe vehicle or loop detectors, which can update the prediction function in real time via incremental learning way. As a result, it is fitter for the real engineering application. The ISVR model was tested by using the I-880 database, and the result shows that this model is superior to the back-propagation neural network (BPNN) model.
A New Approach to Forecast Crude Oil Price Based on Fuzzy Neural Network
Authors: Jinlan Liu, Yin Bai, Bin Li
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

A new oil price forecasting model based on fuzzy neural network, which combings RBF neural network, Markov chain based semiparametric model and wavelet analysis is proposed in this paper. The high degree of prediction accuracy confirms the performance of the model in accurate forecasts, reinforcement learning properties and mapping capabilities.
Parallel Cache Model Based on Grid Memory
Authors: Qingkui Chen, Lichun Na
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

For supporting the concurrent access for the hot segments of large files during the peak access phase in Internet, a parallel cache model based on the grid memory (PCMGM) was proposed in this paper. By using of the free memories of the idle computers in dynamic network environment (DNE) composed of multi-clusters, the grid memory was constructed. Through the division technique for large files, basing the ability of idle computer, and adopting the multiagent, we discussed the load balance allotting approach for grid memory. The PCMGM access process is described. The experiment results show that PCMGM resolves effectively the problems of peak access for hot segments and it can improve the use rate of resources in DNE. It can be applied for grid computing and VOD for hot segment.
A practical method to analyze workflow logic models: Research Articles
Authors: Yu Huang, Hanpin Wang, Wen Zhao, Chunxiang Xu
Venue: Concurrency and Computation: Practice Experience (2008)

The analysis of workflow is crucial to the correctness of workflow applications. This paper introduces a simple and practical method for analyzing workflow logic models. Firstly, some definitions of the models and some properties, such as throughness, no-redundant-transition and boundedness, are presented. Then, we propose an approach based on synchronized reachability graphs (SRGs) to verify these properties. The SRG uses the characteristics of synchronizers in workflow logic models and mitigates the state explosion by constructing synchronized occurrence sequences rather than interleaving occurrence sequences. This paper also proposes some refined and feasible reduction rules which can preserve vital properties of workflow logic models. Using these two techniques, the SRG-based verification method can achieve higher efficiency. Furthermore, this research also develops a verification tool based on the method, presents the analysis results of some practical cases and compares our method with others. Copyright &copy; 2007 John Wiley & Sons, Ltd.
An Approach for Text Categorization in Digital Library
Authors: Tao Wang, Bipin C. Desai
Venue: Proceedings of the 11th International Database Engineering and Applications Symposium (2007)

Text categorization is a very effective way to organize enormous number of documents in Digital Libraries. Accurate classification of documents is able to not only enhance document search precision, but also facilitate browsing-by-topic functionality. It is, nonetheless, difficult to obtain a satisfactory categorization accuracy compared to the corresponding results given by professional catalogers. This is due largely to the complexity of the pre-defined large-scaled category hierarchies that makes it difficult for learning algorithms to distinguish among categories. This paper describes a top-down document classification approach which takes advantage of the hierarchical structure, more specifically, in two ways: identifying the number of independent local classifiers and guiding top-down classification procedure. We finally evaluate it within the CINDI Digital Library applying ACM Classification System as targeted hierarchy. Experimental results show the promise of this approach.
Be successful, take a hostage or "outsourcing the outsourcing Manager"
Authors: Horst Pichler
Venue: Proceedings of the International Conference on Global Software Engineering (2007)

Working on a project where the work is distributed across the globe need not be a dreadful experience. It is possible to set up a distributed team so that the regular team members are not affected by the issues pertaining to the aspects of the global setup. This paper sheds some light on the problems discovered , analyzes what often goes wrong and suggests one of many possible solutions. Take the "full service" approach; outsource the management of the outsourced project. Using an example of a project done between the USA West Coast and Slovakia ,advantages of the proposed solution are evident.
Comparison of customer balking and reneging behavior to queueing theory predictions: An experimental study
Authors: Amit I. Pazgal, Sonja Radas
Venue: Computers and Operations Research (2008)

In this paper, we study customer decision-making while in a queuing situation. Customers can either join a queue or balk and return at a later time. Customers who join can renege and also return later. Our objective is to determine whether people seem to follow the benchmarks provided by queuing theory or whether psychological costs and perceptions of time invalidate these benchmarks. We use a computerized experiment where participants face explicit financial rewards and penalties for their decisions in a between subjects, fully crossed design with two experimental factors-clock data, and information about expected waiting time, each at two levels, presence and absence. Evaluated against the queuing theory benchmark, decision-making is quite good. Reneging is very rare, as queuing theory requires. Most participants follow a consistent rule for balking. They balk at every line longer than some critical value, as prescribed by queueing theory. But, even when corrected for heterogeneity in time perception, this critical value is greater than the one that minimizes expected waiting time. The large critical value may be due to risk-aversion or participants overestimating the switching cost. The results are supported by a second experiment using different parameters. Information improved decisions for most participants by increasing the precision of waiting time estimates. In addition, information helps participants who underestimate waiting time to correctly leave the line and those who over-estimate to stay. Providing clock time had almost no impact on decision-making.
A Systematically Designed Binary Array Processor
Authors: A. P. Reeves
Venue: IEEE Transactions on Computers (1980)

A class of binary array processors (BAP) have evolved over the past 20 years primarily intended for image-processing applications. The advent of large-scale integrated-circuit technology makes the construction of these processors feasible. In this paper three basic instruction types that characterize a BAP are defined and the systematic design of a processor called BASE is described in detail. Two forms of BASE are discussed, a fully parallel version and an add-on unit for a conventional computer. The systematic design has enabled an assembly language with a simple, APL-like syntax to be developed. Several program examples to illustrate features of the processor are given.
A Design Procedure for Fault-Locatable Switching Circuits
Authors: S. M. Reddy
Venue: IEEE Transactions on Computers (1972)

A technique to design fault-locatable combinational switching circuits is given. The networks resulting from the application of the proposed technique have at most three levels of gates.
Eight-bit semiflash A/D converter
Authors: D. P. Dimitrov, T. K. Vasileva
Venue: VLSI Design (2007)

An 8-bit semiflash ADC is reported that uses a single array of 15 comparators for both the coarse and the fine conversion. Conversion is implemented in two steps. First, an estimate is made of the 4 most significant bits, which are then memorized in the output latch. Next, the remaining 4 bits are evaluated by the same array of comparators. The auto-zeroed comparators also perform the function of a sample-and-hold circuit. In the proposed 8-bit semiflash ADC, there are no sample-and-hold circuit, no DAC, no subtraction circuit, and no residue amplifier. As a result, a moderate conversion speed has been combined with a drastically reduced power consumption. The ADC was fabricated in a standard 0.6 µm double-poly, double-metal CMOS process. Experimental results show monotonic conversion with very low integral and differential nonlinearities. These features, combined with the ultra-low power consumption, make the proposed circuit very suitable for low-power mixed-signal applications.
Implementation and Evaluation of a High Speed License Plate Recognition System on an FPGA
Authors: Takamasa Kanamori, Hideharu Amano, Masatoshi Arai, Daisuke Konno, Tomomichi Nanba, Yoshiaki Ajioka
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

In order to address some problems on increasing traffic accidents, many researchers have paid attention to active safety techniques using sophisticated image processing like license number recognition. However, it is enough for warning a driver against danger of collision to measure distance to a licence plate of a preceeding car. This paper proposes a high speed FPGAoff-loading engine for detecting the licence plate. A complicated algorithm is written in Handel-C, and parallel processing is explicitly utilized in every level of implementation; an input image is segmented into 16 areas, and each area is processed in parallel by a multiple calculation unit executing pipeline processing and a distributed memory module. A prototype circuit implemented on a general purpose FPGA board achieved 4.16 imes performance as software execution on a Pentium-III desktop PC. The highest performance in literature; 100 frames per second; can be achieved even though extra computation time on an embedded processor and communication time with it are considered.
Algebras with parametrized iterativity
Authors: Jií Adámek, Stefan Milius, Jií Velebil
Venue: Theoretical Computer Science (2007)

Iterative algebras, as studied by Nelson and Tiuryn, are generalized to algebras whose iterativity is parametrized in the sense that only some variables can be used for iteration. For example, in the case of one binary operation, the free iterative algebra is the algebra of all rational binary trees; if only the left-hand variable is allowed to be iterated, then the free iterative algebra is the algebra of all right-well-founded rational binary trees. In order to express such parametrized iterativity, we work with parametrized endofunctors of Set, i.e. finitary endofunctors H:SetxSet->Set, and introduce the concept of iterativity for algebras for the endofunctor X@?H(X,X). We then describe free iterative H-algebras.
AS-based accountability as a cost-effective DDoS defense
Authors: Daniel R. Simon, Sharad Agarwal, David A. Maltz
Venue: Proceedings of the first conference on First Workshop on Hot Topics in Understanding Botnets (2007)

Defenses against botnet-based distributed denial-of-service (DDoS) attacks must demonstrate that in addition to being technically feasible, they are also economically viable, particularly when compared with the two most widely deployed defenses--simple massive overprovisioning of resources to absorb and handle DDoS traffic, and "scrubbing" of incoming traffic by the victim's ISP. We argue that the key to cost-effective handling of DDoS attacks on a network such as the Internet is accountability, meaning that the sources of all traffic can be accurately and reliably identified, and receivers can effectively block traffic to them from any source. We propose a simple approach to directly providing accountability within a group of ASes. It combines strict ingress filtering on all edge traffic with an AS-based infrastructure that allows hosts to request that traffic to them from specific other hosts be blocked at the source. We also propose using the previously proposed "evil bit" in IP headers to allow a group of ASes that implement accountability to collectively reduce the impact of DDoS attacks originating outside their portion of the Internet. Finally, we present evidence for the economic competitiveness of our approach, compared with the current default approaches of massive overprovisioning and ISP scrubbing.
A "Survivor"-like designer reality show?
Authors: Luke Kowalski
Venue: interactions (2007)

Commercial-designer success criteria, an enterprise perspective.
Throughput optimization for video streaming proxy servers based on video staging
Authors: W. K. Cheuk, Daniel P. Lun
Venue: Multimedia Tools and Applications (2007)

A video streaming proxy server needs to handle hundreds of simultaneous connections between media servers and clients. Inside, every video arrived at the server and delivered from it follows a specific arrival and delivery schedule. While arrival schedules compete for incoming network bandwidth, delivery schedules compete for outgoing network bandwidth. As a result, a proxy server has to provide sufficient buffer and disk cache for storage, together with memory space, disk space and disk bandwidth. In order to optimize the throughput, a proxy server has to govern the usage of these resources. In this paper, we first analyze the property of a traditional smoothing algorithm and a video staging algorithm. Then we develop, based on the smoothing algorithm, a video staging algorithm for video streaming proxy servers. This algorithm allows us to devise an arrival schedule based on the delivery schedule. Under this arrival and delivery schedule pair, we can achieve a better resource utilization rate gracefully between different parameter sets. It is also interesting to note that the usage of the resources such as network bandwidth, disk bandwidth and memory space becomes interchangeable. It provides the basis for inter-resource scheduling to further improve the throughput of a video streaming proxy server system.
Involving the user through library 2.0
Authors: Kevin Curran, Michelle Murray, David Stephen Norrby, Martin Christian
Venue: The New Review of Information Networking (2006)

Libraries, as we know them today, can be defined by the term Library 1.0. This defines the way resources are kept on shelves or at a computer behind a login. These resources can be taken from a shelf, checked out by the library staff, taken home for a certain length of time and absorbed, and then returned to the library for someone else to avail of. Library 1.0 is a one-directional service that takes people to the information they require. Library 2.0 - or L2 as it is now more commonly addressed as - aims to take the information to the people by bringing the fibrary service to the Internet and getting the users more involved by encouraging feedback participation. This paper presents an overview of Library 2.0 and introduces web 2.0 concepts.
Acculturated blended learning: localizing a blended learning course for Russian trainees
Authors: Judith B. Strother, Zohra Fazal, Michael Gurevich
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

When designing any kind of online learning curriculum to be delivered internationally, many issues must be considered. One is the cultural pedagogical framework of the national group of trainees. In the case study reported in this paper, the training organization uses a blended learning model to deliver Aviation English training to groups of pilots who speak English as a second language. The online portion of the training is standardized for international delivery, but the classroom sessions are to be localized for each country where the training will be delivered. This paper presents the Acculturated Blended Learning Model, in which trainees are adapted to a new learning environment and to a culturally different pedagogical model within the onsite portion of a blended learning course. In this case study, the onsite classes are in Russia, where a sciento-technocratic (teacher-centered) paradigm is traditional. The model includes five guidelines to help the training organization prepare its trainers and their trainees to transition from the traditional pedagogical paradigm to a student-centered activity-based paradigm that is more successful for language learning. This Acculturated Blended Learning Model is pedagogically adaptable to other cultures and should help to create a more positive and successful learning situation wherever it is delivered.
Who Owns What Sofware Produces?
Authors: M. C. Gemignani
Venue: IEEE Software (1985)

When programs rather than humans create products, the issues of product ownership create thorny legal problems which the law has yet to address.
Optimal quadrature and cubature formulas for computing Fourier transform of finite functions of one class. Case of strong oscillation
Authors: V. K. Zadiraka, S. S. Mel'Nikova, L. V. Luts
Venue: Cybernetics and Systems Analysis (2007)

The paper deals with quadrature and cubature formulas, optimal and nearly optimal in accuracy, used to evaluate integrals of quickly oscillating functions in a class of bounded functions with piecewise continuous first derivatives bounded by a constant in one-and multidimensional cases. Optimal estimates for the numerical integration error and upper bounds are obtained for these integrals in case of strong oscillation of subintegral functions.
Concurrency Control and Consistency of Multiple Copies of Data in Distributed Ingres
Authors: M. Stonebraker
Venue: IEEE Transactions on Software Engineering (1979)

This paper contains algorithms for ensuring the consistency of a distributed relational data base subject to multiple, concurrent updates. Also included are mechanisms to correctly update multiple copies of objects and to continue operation when less than all machines in the network are operational. Together with [4] and [12], this paper constitutes the significant portions of the design for a distributed data base version of INGRES.