ppxscal/embedding_network huggingface dataset:
Driving large call center simulations using OLAP data cubes
Authors: Pam Laney Markt
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Simulating large call centers can require weeks or months. Additional time is spent on detailed analysis of input data to drive the models. Once a model is complete, the input data can be obsolete, requiring additional analysis and re-validation. This hinders the ability to provide accurate, timely models. This process is greatly improved by the use of OLAP data cubes to provide input data. Most simulation software packages have the functionality to read data from Excel workbooks. Data cubes provide data in a standard Excel pivot table format that can be easily updated to current data. Using OLAP cubes can significantly reduce the time to bring a simulation model to market, by streamlining the access to input data. Cubes also provide a quick, easy method to update data to the most current information. This ultimately provides a simulation analyst with a means to produce accurate, relevant and timely simulation solutions.
Combining Replication with Transaction Processing for Enhanced Reliability in J2EE
Authors: Lin Zuo, Shaohua Liu, Jun Wei
Venue: Proceedings of the 17th International Symposium on Software Reliability Engineering (2006)

The multi-tier architecture of J2EE provides good modularity and scalability by partitioning an application into several tiers, and becomes the mainstream for distributed applications development on Internet/Intranet. Current reliability solutions in this architecture are typically dependent on either replication, which provides at-least-once guarantee, or transaction processing, which guarantees at-most-once semantics. In practice, the endto- end reliability guarantee of exactly-once semantics is necessary, especially for some complex transaction scenarios, such as client transaction or nested transaction. In this paper, we describe a fault-tolerant algorithm that can provide this enhanced reliability support through combining replication and transaction processing. We use passive replication to protect business processing at middle-tier application server. A client stub transparently intercepts client request and automatically resubmits it in the case of failure. In addition, transaction coordinator is passively replicated to prevent the blocking problem of distributed transaction. Also, different application scenarios are discussed to illustrate the effectivity of this algorithm, and a performance study based on our implementation in J2EE application server, OnceAS, shows the overhead of it is acceptable.
A Detective Method for SYN Flood Attacks
Authors: Takuo Nakashima, Shunsuke Oshima
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

DoS(Denial of Service) attacks are easily performed by utilizing the weakness of the network protocol. If should be notable that the firewall host hardly filters the SYN flood attacks, and the spoofed IP address keeps the position of the attacker from being traced. Early detection of this SYN flood attacks as well as the mechanism of escaping from the half-open state on TCP is requierd. In this paper, we present a detective method for SYN flood attacks in early stage. We implemented a prpgram to send the SYN packet and collected the SYN+ACK response packet from the server. Our method firstly built a standard model generated by observations for the activity of the server. Secondly, we detect the slight fluctuations in relation to the packet response rate and the average response delay. Finally, the RST packet is sent to the server on which half-open state on TCP is released.
Semantic video database system with semi-automatic secondary-content generation capability
Authors: Wenli Zhang, Xiaomeng Wu, Shunsuke Kamijo, Masao Sakauchi
Venue: Multimedia Tools and Applications (2006)

A semantic video database system, based on an interactive approach that maps low-level features to high-level concepts, is proposed. A database of ontological semantic object models allows the user to get information about specific semantic objects, such as certain actors or other features of a TV drama. The system searches the database for key frames within the video to detect similarities in detailed or "low-level" features, such as the color, area, and position of a specific part of the frame. Since image recognition techniques are limited in their ability to fully identify and compare images, we propose an additional function in which a coarse model is used to recover a greater number of similar key frames, thus providing more relevant results. From these results, the content provider can select relevant key frames interactively; the matched objects in them are then automatically annotated according to descriptions that are added into the model by content provider. Therefore, more complex content can be generated with greater accuracy by using a combination of application-oriented operations. The system has high potential for use in object-based interactive multimedia applications. We also present an object-based video content generation application called the Drama Characters' Popularity Voting System.
Multipass communication systems for tiled processor architectures
Authors: Nathan Robert Shnidman
Venue:  (2006)

Multipass communication systems utilize multiple sets of parallel baseband receiver functions to balance communication data rates and available computation capabilities. This is achieved by spatially pipelining baseband functions across parallel resources to perform multiple processing passes on the same set of received values, thus allowing the system to simultaneously convey multiple sequences of data using a single wireless link. The use of multiple passes mitigates the effects of data rate on receiver processing bottlenecks, making the use of general-purpose processing elements for high data rate communication functions viable. The flexibility of general-purpose processing, in turn, allows the receiver composition to trade-off resource usage and required processing rate. For instance, a communication system could be distributed across 2 passes using 2&times; the overall area, but reducing the data rate for each pass and the resultant overall required processing rate, and hence clock speed, by 1/2. Lowering the clock speed can also be leveraged to reduce power through voltage scaling and/or the use of higher Vt devices. The characteristics of general-purpose parallel processors for communications processing are explored, as well as the applicability of specific parallel designs to communications processing. In particular, an in depth look is taken of the Raw processor's tiled architecture as a general-purpose parallel processor particularly well suited to portable communications processing. An example of a multipass system, based on the 802.11a baseband, implemented on the Raw processor along with the accompanying hardware implementation is presented as both a proof-of-concept, as well as a means to explore some of the advantages and trade-offs of such a system. A bit-error rate study is presented which shows this multipass system to be within a small fraction of 1dB of the performance of an equivalent data rate single pass system, thus demonstrating the viability of the multipass algorithm. In addition, the capability of tiled processors to maximize processing capabilities at the system block level, as well as the system architectural level, is shown. Parallel implementations of two processing intensive functions: the FFT and the Viterbi decoder are shown. A parallelized assembly language FFT utilizing 16 tiles is shown to have a 1,000&times; improvement, and a parallelized 48-tile assembly language Viterbi decoder is shown to have a 10,000&times; improvement over corresponding serial C implementations. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
High Speed and Reliable Anti-Spam Filter
Authors: Jalel Rejeb, Thuy T. Le, Narinder Anand
Venue: Proceedings of the International Conference on Software Engineering Advances (2006)

Unsolicited Commercial Email, also known as spam, has grown exponentially in the past few years and it is the biggest problem facing email applications. In this paper, we present a new anti-spam filtering technique based on Bayesian approach, where the training phase of the filter is enhanced by having the filter parse the header, the subject, and the body of the email message separately and independently. The filter also provides an auto generated, that we call it "Virtual Blacklist", which is used to speed up and improve the filtering capabilities. Moreover,, in the proposed filter, the frequency of the token is considered in terms of the size of the message. The filter is implemented at the application layer using Java for flexibility, speed and platform independency, then applied to various available corpuses and its performance is compared to the commonly used filters. Experimental results show that the proposed filter can achieve over 98.7% filtering accuracy at speed more than 10 times faster than existing filters.
Permuted weighted area estimators
Authors: James M. Calvin, Marvin K. Nakayama
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Calvin and Nakayama previously introduced permuting as a way of improving existing standardized time series methods. The basic idea is to split a simulated sample path into non-overlapping segments, permute the segments to construct a new sample path, and apply a standardized time series scaling function to the new path. Averaging over all permuted paths yields the permuted estimator. This paper discusses applying permutations to the weighted area estimator of Goldsman and Schruben. Empirical results seem to indicate that compared to not permuting, permuting can reduce the length and variability of the resulting confidence interval half widths but with additional computational overhead and some degradation in coverage; however, the decrease in coverage is not as bad as with batching.
Lightweight Ontology-Based Service Discovery in Mobile Environments
Authors: Devis Bianchini, Valeria De Antonellis, Michele Melchiori, Denise Salvi
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

The current ever-growing evolution of mobile technologies suggests the possibility of accessing services, in an itinerant and ubiquitous way, through many kinds of mobile devices (laptops, palmtops, cellular phones and so on). On the other hand, the highly dynamic and context-dependent requirements of services in distributed environments motivate and recommend the use of ontology-based techniques and tools to automatically locate services that fulfill a given user request. Our aim in this work is to propose a lightweight ontology-based approach to allow the service discovery on mobile terminals, taking into account limited user interactions supported by this kind of devices. In the proposed approach, the user can specify the requested service in terms of expected capabilities. A semantic-enriched framework to describe services and an ontology-based discovery approach where such framework is exploited are applied to find services fulfilling the user needs, combining together different kinds of comparison strategies that provide a flexible and efficient matchmaking between service descriptions.
Opening and keynote 1
Authors: Y. Patt
Venue: Proceedings of the 2004 IEEE International Symposium on Performance Analysis of Systems and Software (2004)

The following topics are dealt with: performance analysis of systems and software; benchmarking and workload characterization; simulation; architecture and performance evaluation; memory and caches; Java; and power estimation and reduction.
Specification and dynamic introduction of 3rd party, service-specific adaptation policies for mobile applications
Authors: Nikos Houssos, Nancy Alonistioti, Lazaros Merakos
Venue: Mobile Networks and Applications (2005)

The development, delivery and management of mobile services are the subject of many research activities in both the academia and industry. The ultimate goal of these efforts is a dynamic environment that enables the delivery of situation-aware, personalised multimedia services over heterogeneous, ubiquitous infrastructures, commonly termed as systems beyond 3rd generation (3G). Reconfigurability and adaptability are key aspects of the mobile systems beyond 3G. Reconfigurable mobile systems and networks introduce additional requirements and complexity in service adaptation. Moreover, it is widely recognised that services will be increasingly developed by independent third parties, besides mobile operators and equipment vendors. The present contribution complements previous work by the authors, related to mediating service provision platforms and advanced adaptability and profile management frameworks. It introduces mechanisms and middleware that undertake the service adaptation overhead, imposed by the complexity of reconfigurable mobile networks, from application developers and third party service providers. In particular, it enables the introduction of third party policies for adaptation decision. Finally, it facilitates the adaptable application development and service deployment independently from the underlying dynamically reconfigurable communication environment.
Offshore Agile Maintenance
Authors: Naresh Jain
Venue: Proceedings of the conference on AGILE 2006 (2006)

Maintaining a business critical application in production having serious performance and scalability issues can be quite a challenging task in itself. Having a new development team sitting on the other side of the globe can easily complicate things further. This experience report describes the challenges faced in this environment, lessons learned, and how we won the client's trust and delivered business value as quickly and consistently as possible.
NewsCATS: A News Categorization and Trading System
Authors: Marc-Andre Mittermayer, Gerhard F. Knolmayer
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

NewsCATS is an Automated Text Categorization (ATC) prototype using a hand-made thesaurus to forecast intraday stock price trends from information contained in press releases. Due to a unique labeling approach and by carefully selecting the appropriate training data News- CATS achieves a performance which is clearly superior to other ATC prototypes used for stock price trend forecasting. In this paper we describe the architecture, training, and testing of NewsCATS as well as the results of an extensive robustness analysis.
Comparing PROMODEL and SDESA in modeling construction operations
Authors: Ming Lu, Lap-Chi Wong
Venue: Proceedings of the 37th conference on Winter simulation (2005)

The research presented applies the PROMODEL alongside a simplified discrete-event simulation approach (SDESA) and its software platform resulting from in-house construction research for modeling typical construction operations. The characteristics and modeling needs for construction and manufacturing systems are compared in general. A simple earth-moving operation and a real site operation integrating concreting and waste handling practices serve as case studies to illustrate the features, advantages, and limitations of PROMODEL and SDESA. It is found that SDESA can adequately, precisely depict the construction operations with much less learning and modeling efforts compared with PROMODEL. Particular comparisons between the two methodologies are made on (1) resource transit times, (2) activity priorities, (3) resource utilization rates, and (4) basic model structures (i.e. production-line vs. vehicle-loop).
Expansion of Convolutional Compactors over Galois Field
Authors: Masayuki Arai, Satoshi Fukumoto, Kazuhiko Iwasaki
Venue: Proceedings of the 15th Asian Test Symposium (2006)

Convolutional compactors offer a promising technique of compacting test responses. In this study we expand the architecture of convolutional compactor onto a Galois field in order to improve compaction ratio as well as reduce X-masking probability, namely, the probability that an error is masked by unknown values. While each scan chain is independently connected by EOR gates in the conventional arrangement, the proposed scheme treats q signals as an element over GF(2q), and the connections are configured on the same field. We show the arrangement of the proposed compactors and the equivalent expression over GF(2). We then evaluate the effectiveness of the proposed expansion in terms of Xmasking probability by simulations with uniform distribution of X-values, as well as reduction of hardware overheads. Furthermore, we evaluate a multi-weight arrangement of the proposed compactors for non-uniform X distributions.
Detecting Link Spam Using Temporal Information
Authors: Guoyang Shen, Bin Gao, Tie-Yan Liu, Guang Feng, Shiji Song, Hang Li
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

How to effectively protect against spam on search ranking results is an important issue for contemporary web search engines. This paper addresses the problem of combating one major type of web spam: 'link spam.' Most of the previous work on anti link spam managed to make use of one snapshot of web data to detect spam, and thus it did not take advantage of the fact that link spam tends to result in drastic changes of links in a short time period. To overcome the shortcoming, this paper proposes using temporal information on links in detection of link spam, as well as other information. Specifically, it defines temporal features such as In-link Growth Rate (IGR) and In-link Death Rate (IDR) in a spam classification model (i.e., SVM). Experimental results on web domain graph data show that link spam can be successfully detected with the proposed method.
Access control in a core calculus of dependency
Authors: Martín Abadi
Venue: ACM SIGPLAN Notices (2006)

The Dependency Core Calculus (DCC) is an extension of the computational lambda calculus that was designed in order to capture the notion of dependency that arises in information-flow control, partial evaluation, and other programming-language settings. We show that, unexpectedly, DCC can also be used as a calculus for access control in distributed systems. Initiating the study of DCC from this perspective, we explore some of its appealing properties.
Interactive debugging with GHCi
Authors: David Himmelstrup
Venue: Proceedings of the 2006 ACM SIGPLAN workshop on Haskell (2006)

With my presentation I intend to demonstrate an implementation of breakpoint combinators in GHCi. These combinators are designed to aid the debugging process of Haskell programs by halting the execution and letting the user observe variables of their choice. In contrast to the existing tools (such as Hat, Hood, Buddha and Debug. Trace), which in effect allow something similar, the combinators I will be demonstrating give the user the ability to observe the properties, not just the stringification, of variables. The combinators are a more low-level approach to the problem of debugging and do not provide as advanced features as Hat or Buddha. However, no sophisticated debugging system for Haskell has been really widely adopted by the Haskell community, primarily because they lack support for a variety of commonly used Glasgow Haskell extensions. The breakpoint combinators, on the other hand, are integrated in GHCi and work out-of-the-box with all Glasgow Haskell programs.
A Web-Based Database Management System Supporting Parallel Data Mining Service on PC Clusters
Authors: Tyng-Yeu Liang, Siou-Ying Wang, Liang-I Chang
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 2 (2006)

In this study, we develop a database management system which provides users with on-line web services to build and manage their databases and perform parallel data mining on Internet. We exploit two different programming toolkits, i.e., MPI and DSM to parallelize association rules on PC clusters in order to minimize response time. In addition, we have evaluated the performance of these two programming toolkits on parallelization of data association mining. Our experimental results show that both of MPI and DSM are effective for parallel data association mining while MPI provides a 30~45% performance improvement than DSM.
Issues in parallel execution of non-monotonic reasoning systems
Authors: Marcello Balduccini, Enrico Pontelli, Omar Elkhatib, Hung Le
Venue: Parallel Computing (2005)

We explore the major issues involved in the automatic exploitation of parallelism from the execution models of logic-based non-monotonic reasoning systems. We describe orthogonal techniques to parallelize the computation of models of non-monotonic logic theories, and demonstrate the effectiveness of the proposed techniques in prototypical implementation.
A Grid-Enabled Architecture for Geospatial Data Sharing
Authors: Yanfeng Shu, Jack Fan Zhang, Xiaofang Zhou
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

This paper explores combining OGC and Grid technologies for geospatial data sharing. OGC and Grid technologies have different focuses: OGC technologies focus more on interface specifications and encodings for the access to geospatial data sources, while Grid technologies focus more on the collaboration and sharing of resources. By combining both, we hope to leverage each other's strengths. In the paper, we first introduce our Grid-enabled architecture which is based on both OGC and Grid technologies, then we discuss how Grid-enabled OGC web services can be integrated with non-Grid-enabled ones, and finally, we report our initial implementation of a case study.
Inattentional Amnesia to Words in a High Attentional Load Task
Authors: María Ruz, Michael S. Worden, Pío Tudela, Bruce D. Mccandliss
Venue: Journal of Cognitive Neuroscience (2005)

We investigated the dependence of visual word processes on attention by examining event-related potential (ERP) responses as subjects viewed words while their attention was engaged by a concurrent highly demanding task. We used a paradigm from a previous functional magnetic resonance imaging (fMRI) experiment [Rees, G., Russel, C., Frith, C. D., & Driver, J. Inattentional blindness vs. inattentional amnesia for fixated but ignored words. Science, 286, 2504&ndash;2506, 1999] in which participants attended either to drawings or to overlapping letters (words or nonwords) presented at a fast rate. Although previous fMRI results supported the notion that word processing was obliterated by attention withdrawal, the current electrophysiological results demonstrated that visual words are processed even under conditions in which attentional resources are engaged in a different task that does not involve reading. In two experiments, ERPs for attended words versus nonwords differed in the left frontal, left posterior, and medial scalp locations. However, in contrast to the previous fMRI results, ERPs responded differentially to ignored words and consonant strings in several regions. These results suggest that fMRI and ERPs may have differential sensitivity to some forms of neural activation. Moreover, they provide evidence to restore the notion that the brain analyzes words even when attention is tied to another dimension.