ppxscal/embedding_network huggingface dataset:
Distributed Cache System for Large-Scale Networks
Authors: Mikio Kataoka, Kunihiko Toumura, Hideki Okita, Junji Yamamoto, Toshiaki Suzuki
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2006)

Network traffic has been rapidly increasing in proportion along with the spread of broadband access networks. The traffic of the core network is predicted to exceed its transmission capability in the near future. Therefore, we propose a centrally controlled cache system with distributed cache storage in the access network. In this system, a cache control server manages a list of all contents cached by multiple cache servers. It can provide content requested by a user if it is cached in any of the cache servers in the access network. Additionally, it can reduce network traffic between the core network and the access network if the requested contents are cached in the cache server of the access network. We examine issues for the implementation of our system, and describe a prototype system. As a result of evaluation of the system, we have made it clear that our system architecture is suitable for an access network that accommodates one million users.
Market-Based Distributed Task Selection in Multi-agent Swarms
Authors: Prithviraj Dasgupta, Matthew Hoeing
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

We consider the problem of distributed task allocation across swarm units comprising a swarm-based system. We model task allocation as a dynamic pricing problem within a market setup. Experimental results within a simulated environment for a distributed automatic target recognition application show that the market-based task selection mechanism compares favorably with other heuristic-based task selection strategies.
Revealing common ground: augmentation on the edges of interpretive communities
Authors: Rick Borovoy, Fred Martin, Mitchel Resnick
Venue: Proceedings of the 1999 conference on Computer support for collaborative learning (1999)

At the center of an intellectual community, members draw upon their knowledge of shared assumptions to have nuanced discussions about complex ideas. Newcomers to the conversation, who are on the edge of this "interpretive community," do not partake in the common ground necessary to join these discussions and can find themselves in a trapped state. We are designing a new kind of computationally-generated augmentation that jumpstarts the search for meaningful common ground &ntilde; both for people trying to join an established interpretive community, and for people trying to form a new one. This paper discusses the application of this type of augmentation, called the &mu; -cue, to both face-to-face and on-line communities.
An Efficient Communication Scheduling Method for the Processor Mapping Technique Applied Data Redistribution
Authors: Jih-Woei Huang, Chih-Ping Chu
Venue: The Journal of Supercomputing (2006)

Array redistribution is usually required for more efficiently executing a data-parallel program on distributed memory multi-computers. In performing array redistribution using synchronous communication mode, data communications among the processors should be properly arranged to avoid incurring higher data transfer cost. Some efficient communication scheduling methods for the Block-Cyclic redistribution have been proposed. On the other hand, the processor mapping technique can help reduce the data transfer cost of redistribution. To avoid degrading the benefit of data transfer cost reduction, it is needed to construct optimal communication schedules for the redistribution in which the processor mapping technique is applied. In this paper, we present a unified approach to constructing optimal communication schedules for the processor mapping technique applied Block-Cyclic redistribution. The proposed method is founded on the processor mapping technique and can more efficiently construct the required communication schedules than other optimal scheduling methods.
CORBA Replication Support for Fault-Tolerance in a Partitionable Distributed System
Authors: Stefan Beyer, Francesc D. Munoz-Escoi, Pablo Galdamez
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

The Common Object Request Broker Architecture (CORBA) specification originally did not include any support for fault-tolerance. The Fault-Tolerant CORBA standard was added to address this issue. One drawback of the standard is that it does not include fault-tolerance in the case of network partitioning faults. The main contribution of this paper is the design of a fault-tolerance CORBA add-on for partitionable environments. In contrast to other solutions, our modular design separates replication and reconciliation policies from the basic replication mechanisms. This modularity allows the replication and reconciliation strategies to be modified easily.
A Multivariate Adaptive Method for Detecting ARP Anomaly in Local Area Networks
Authors: M. Farahmand, A. Azarfar, A. Jafari, V. Zargari
Venue: Proceedings of the International Conference on Systems and Networks Communication (2006)

Worms use different methods to propagate in networks. One of these methods is by means of broadcasting packets. Broadcasted packets occupy high percentage of network bandwidth, and abnormal broadcast traffic analysis could be a useful method for detecting network problems and infected hosts. In this paper a new method for detecting ARP abnormal traffic in a broadcast domain is introduced. A combination of four different ARP traffic criteria are used to determine network anomaly. Four parameters: Rate, Burstiness, Dark space and Sequential scan were considered. Our method focuses on rate anomaly caused by worms, scans and poorly-configured services. We applied our method to a real network to evaluate system accuracy and noticed that during one month, 92.9 percent of alarms were true positive alarms. This technique not only traces ARP anomaly the same way as scanning worms, but also it detects any host that disturbs the traffic rate in different LAN.
A digital filter for speed noise reduction in drives using an electromagnetic resolver
Authors: Armando Bellini, Stefano Bifaretti
Venue: Mathematics and Computers in Simulation (2006)

The measurement of the rotation speed is an important issue in closed-loop industrial drives. The motor speed is often calculated by a derivative operation of the position measure obtained by an electromagnetic resolver. As a consequence, especially at the lowest speeds, the noise overlapped to the measured speed is significant and a suitable filter becomes necessary. The paper presents a solution to such a problem based on the employment of a stationary Kalman filter, suitably inserted in a phase locked loop structure. The implementation in an industrial synchronous motor drive, using a 16-bit fixed point DSP has confirmed the goodness of the proposed solution.
COALA: A Novel Approach for the Extraction of an Alternate Clustering of High Quality and High Dissimilarity
Authors: Eric Bae, James Bailey
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

Cluster analysis has long been a fundamental task in data mining and machine learning. However, traditional clustering methods concentrate on producing a single solution, even though multiple alternative clusterings may exist. It is thus difficult for the user to validate whether the given solution is in fact appropriate, particularly for large and complex datasets. In this paper we explore the critical requirements for systematically finding a new clustering, given that an already known clustering is available and we also propose a novel algorithm, COALA, to discover this new clustering. Our approach is driven by two important factors; dissimilarity and quality. These are especially important for finding a new clustering which is highly informative about the underlying structure of data, but is at the same time distinctively different from the provided clustering. We undertake an experimental analysis and show that our method is able to outperform existing techniques, for both synthetic and real datasets.
Cortical Effects of Shifting Letter Position in Letter Strings of Varying Length
Authors: Piers Cornelissen, Antti Tarkiainen, Päivi Helenius, Riitta Salmelin
Venue: Journal of Cognitive Neuroscience (2003)

Neuroimaging and lesion studies suggest that occipito-temporal brain areas play a necessary role in recognizing a wide variety of objects, be they faces, letters, numbers, or household items. However, many questions remain regarding the details of exactly what kinds of information are processed by the occipito-temporal cortex. Here, we address this question with respect to reading. Ten healthy adult subjects performed a single word reading task. We used whole-head magnetoencephalography to measure the spatio-temporal dynamics of brain responses, and investigated their sensitivity to: (1) lexicality (defined here as the difference between words and consonant strings), (2) word length, and (3) variation in letter position. Analysis revealed that midline occipital activity around 100 msec, consistent with low-level visual feature analysis, was insensitive to lexicality and variation in letter position, but was slightly affected by string length. Bilateral occipito-temporal activations around 150 msec were insensitive to lexicality and reacted to word length only in the timing (and not strength) of activation. However, vertical shifts in letter position revealed a hemispheric imbalance: The right hemisphere activation increased with the shifts, whereas the opposite pattern was evident in the left hemisphere. The results are discussed in the light of Caramazza and Hillis's (1990) model of early reading.
Bottom-Up Extraction and Trust-Based Refinement of Ontology Metadata
Authors: Paolo Ceravolo Ernesto Damiani
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

We present a way of building ontologies that proceeds in a bottom-up fashion, defining concepts as clusters of concrete XML objects. Our rough bottom-up ontologies are based on simple relations like association and inheritance, as well as on value restrictions, and can be used to enrich and update existing upper ontologies. Then, we show how automatically generated assertions based on our bottom-up ontologies can be associated with a flexible degree of trust by nonintrusively collecting user feedback in the form of implicit and explicit votes. Dynamic trust-based views on assertions automatically filter out imprecisions and substantially improve metadata quality in the long run.
Enriching learning contexts to support communities of practice
Authors: Yongwu Miao, Jutta Maria Fleschutz, Peter Zentel
Venue: Proceedings of the 1999 conference on Computer support for collaborative learning (1999)

The theory of situated learning emphasizes the importance of authentic learning contexts and the central role of social interaction. In the light of this theory and based on our previous experience, we propose an approach for the development of context-based virtual learning environments. These are virtual worlds, which the learners themselves can create and modify. They therefore provide a customized learning context in which all learning processes and communications between learners can be situated. The characteristics of our approach are: the use of perceptual metaphors, the flexible combination of these metaphors within the learning environment, and the support for awareness of the context and the social interaction within it. Collaborative hypermedia technology is used to construct and to represent places and information in the environment and then to navigate within it. The prototype system provides rich and flexible learning contexts and supports various forms of social interaction for communities of practice.
Studying the Characteristics of a "Good" GUI Test Suite
Authors: Qing Xie, Atif M. Memon
Venue: Proceedings of the 17th International Symposium on Software Reliability Engineering (2006)

The widespread deployment of graphical-user interfaces (GUIs) has increased the overall complexity of testing. A GUI test designer needs to perform the daunting task of adequately testing the GUI, which typically has very large input interaction spaces, while considering tradeoffs between GUI test suite characteristics such as the number of test cases (each modeled as a sequence of events), their lengths, and the event composition of each test case. There are no published empirical studies on GUI testing that a GUI test designer may reference to make decisions about these characteristics. Consequently, in practice, very few GUI testers know how to design their test suites. This paper takes the first step towards assisting in GUI test design by presenting an empirical study that evaluates the effect of these characteristics on testing cost and fault detection effectiveness. The results show that two factors significantly effect the fault-detection effectiveness of a test suite: (1) the diversity of states in which an event executes and (2) the event coverage of the suite. Test designers need to improve the diversity of states in which each event executes by developing a large number of short test cases to detect the majority of .shallow. faults, which are artifacts of modern GUI design. Additional resources should be used to develop a small number of long test cases to detect a small number of .deep. faults.
CB3: An Adaptive Error Function for Backpropagation Training
Authors: Michael Rimer, Tony Martinez
Venue: Neural Processing Letters (2006)

Effective backpropagation training of multi-layer perceptrons depends on the incorporation of an appropriate error or objective function. Classification-Based (CB) error functions are heuristic approaches that attempt to guide the network directly to correct pattern classification rather than using common error minimization heuristics, such as Sum-Squared Error (SSE) and Cross-Entropy (CE), which do not explicitly minimize classification error. This work presents CB3, a novel CB approach that learns the error function to be used while training. This is accomplished by learning pattern confidence margins during training, which are used to dynamically set output target values for each training pattern. On 11 applications, CB3 significantly outperforms previous CB error functions, and also reduces average test error over conventional error metrics using 0---1 targets without weight decay by 1.8%, and by 1.3% over metrics with weight decay. The CB3 also exhibits lower model variance and tighter mean confidence interval.
A Detection Technique for Degraded Face Images
Authors: Shinji Hayashi, Osamu Hasegawa
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

This paper describes a face detection technique that enables detection of extremely small faces such as 6 × 6 pixel. This is the first approach to detect very low-resolution faces in the field of face detection. First, we use a conventional AdaBoost-based face detector to show that the face detection rate falls to 39% from 88% as face resolution decreases from 24 × 24 pixels to 6 × 6 pixels. Second, we propose a new face detection method comprising four techniques. It improves the face detection rate from 39% to 73% for 6 × 6 pixel faces of the MIT+CMU frontal face test set. Finally, we applied our method to real world data. By merging results of some frames and judging using a threshold, we show that our method is effective for processing real world data.
An Algorithm for a Constraint Optimization Problem in Mobile Ad-hoc Networks
Authors: Abdellah Idrissi, Chu Min Li, Jean Frederic Myoupo
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

A mobile ad-hoc network is considered as a dynamic autonomous system composed of mobile devices interconnected by links without wire, without the use of a fixed infrastructure and without centralized administration. The absence of a centralized infrastructure forces each device to work in a peer to peer distributed environment, and to act as a router to relay communications, or to generate its own data. The management of the network thus is strongly distributed on all elements of the network. In this paper, we present a modelling of the Mobile Ad-hoc NETwork (MANET) problem in form of a Constraint Satisfaction/ Optimization Problem called CSPADhoc. Then, to minimize the consumption of batteries for devices, we describe an approach based on an adaptation of the A star algorithm to the MANET problem called (MANET-Astar). Finally, we present some experimental results using our approach.
Capacity for JPEG2000-to-JPEG2000 images watermarking
Authors: P. H. W. Wong, G. Y. M. Yeung, Oscar C. Au
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

A data capacity estimation method is proposed for image watermarking. The data capacity is maximum number of bits that can be embedded in an image such that the image has no perceptual loss. It is assumed that the input is a JPEG2000 image file and after watermark embedding, the image is JPEG2000-compressed using the same quantization factors. This is called JPEG2000-to-JPEG2000 (J2K2J2K) watermarking. A human visual systems (HVS) model is used to estimate the just noticeable difference (JND) of each discrete wavelet transform (DWT) coefficients.
HOTTest: A model-based test design technique for enhanced testing of domain-specific applications
Authors: Avik Sinha, Carol Smidts
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (2006)

Model-based testing is an effective black-box test generation technique for applications. Existing model-based testing techniques, however, fail to capture implicit domain-specific properties, as they overtly rely on software artifacts such as design documents, requirement specifications, etc., for completeness of the test model. This article presents a technique, HOTTest, which uses a strongly typed domain-specific language to model the system under test. This allows extraction of type-related system invariants, which can be related to various domain-specific properties of the application. Thus, using HOTTest, it is possible to automatically extract and embed domain-specific requirements into the test models. In this article we describe HOTTest, its principles and methodology, and how it is possible to relate domain-specific properties to specific type constraints. HOTTest is described using the example of HaskellDB, which is a Haskell-based embedded domain-specific language for relational databases. We present an example application of the technique and compare the results to some other commonly used Model-based test automation techniques like ASML-based testing, UML-based testing, and EFSM-based testing.
Reverse Compilation for Speculative Parallel Threading
Authors: Xiaoqi Yang, Qilong Zheng, Guoliang Chen, Zhen Yao
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

Multi-core processors can easily provide benefits for multithreaded workloads, but many applications written for uniprocessors cannot automatically benefit from chip multiprocessors (CMP) designs. This paper presents a reverse compilation framework, which translates existing binary code without source code to the Static Single Assignment (SSA) form, and then the internal SSA form is applied by the compilation phase to generate the Speculative Parallel Threading (SPT) code. A profiler is applied to optimize the code dynamically during execution. The evaluation results show that these existing binary codes without source codes execute on CMP with performance improved, due to taking advantage of the speculative parallel threading support provided by the processor.
An architecture for distributed simulation games
Authors: Stijn-Pieter A. van Houten, Peter H. M. Jacobs
Venue: Proceedings of the 36th conference on Winter simulation (2004)

In this paper we present an architecture for internet-mediated simulation games. The challenge was to use today's state of the art technologies to provide a simulated environment for decision making for which the users are trained. Current technologies provide a means to construct a more realistic environment and to embed algorithms for operational decision making. The services, which span the architecture, consist of an embedded simulator, communication using messages, scenario design and control, content management, human and simulated players, and game administration. We implemented a supply chain simulation game as a proof of concept. It consisted of a server-side simulation and communication core combined with objects representing the players. Human players and the game administrator used user interfaces to connect to the server via the Internet. Further research will focus on scenario management and algorithms for simulated decision making.
Randomized Quasi-Monte Carlo: a tool for improving the efficiency of simulations in finance
Authors: Christiane Lemieux
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Quasi-Monte Carlo (QMC) methods have been used in a variety of problems in finance over the last few years, where they often provide more accurate estimators than the Monte Carlo (MC) method. These results have led many researchers to try to find reasons for the success of QMC methods in finance. A general explanation is that financial problems often have a structure that interacts in a constructive way with the point set used by the QMC method, thus resulting in estimators with reduced error. This positive interaction can be amplified by various fine-tuning techniques, which we review in the first part of this paper. Leaving aside these techniques, we then choose a few randomized QMC methods and test their "robustness" by comparing their performance against MC on different financial problems. Our results suggest that the chosen methods are efficient in a broad sense for financial simulations.
Documenting design decision rationale to improve individual and team design decision making: an experimental evaluation
Authors: Davide Falessi, Giovanni Cantone, Martin Becker
Venue: Proceedings of the 2006 ACM/IEEE international symposium on Empirical software engineering (2006)

Individual and team decision-making have crucial influence on the level of success of every software project. Even though several studies were already conducted, which concerned design decision rationale documentation approaches, a few of them focused on performances and evaluated them in laboratory. This paper proposes a technique to document design decision rationale, and evaluates experimentally the impact such a technique has on effectiveness and efficiency of individual/team decision-making in presence of requirement changes. The study was conducted as a controlled experiment. Fifty post-graduate Master students performed in the role of experiment subjects. Documented design decisions regarding the Ambient Intelligence paradigm constituted the experiment objects. Main results of the experiment show that, for both individual and team-based decision-making, effectiveness significantly improves, while efficiency remains unaltered, when decision-makers are allowed to use, rather not use, the proposed design rationale documentation technique.
Open Source Web Software for Windows Users
Authors: Andreas Veglis
Venue: IEEE Distributed Systems Online (2006)

A review of Using Open Source Web Software with Windows by Eric Hunley.