ppxscal/embedding_network huggingface dataset:
Towards a Proactive Fraud Management Framework for Financial Data Streams
Authors: Michael E. Edge, Pedro R. Falcone Sampaio, Mohammed Choudhary
Venue: Proceedings of the Third IEEE International Symposium on Dependable, Autonomic and Secure Computing (2007)

Effective and efficient fraud prevention is a core capability required from financial institutions towards detecting and minimizing losses due to unlawful transactions. With the ubiquitous availability of unmanned customer interaction channels (e.g., internet and mobile banking), the challenge of controlling fraud has increased substantially demanding fraud management frameworks capable of providing fraud analysts with effective mechanisms for defining fraud policies, and system architectures for large scale real-time screening of click stream data, arising from multiple channels at differing time windows. In this paper we describe a fraud management framework encompassing a rule-based Financial Fraud Modelling Language (FFML) for conceptual level modelling and validation of fraud policies and a fraud prevention architecture based on implementing fraud policies using StreamSQL, a novel and emerging standard for processing real-time data streams. A key element of the framework is the attempt to detect fraud proactively, blocking transactions encompassing suspicious click stream patterns. The framework described in this paper is being developed as an integral part of the FSA compliance program within the SpartaPay payment gateway, a multi-channel financial platform for managing micropayments.
Note on a Constrained-Path Problem in Program Testing
Authors: S. Kundu
Venue: IEEE Transactions on Software Engineering (1978)

A solution method is given for finding an optimum constrained path with applications in program testing.
Translation-based co-verification
Authors: F. Xie
Venue: Proceedings of the 2nd ACM/IEEE International Conference on Formal Methods and Models for Co-Design (2005)

We propose a translation-based approach to hardware and software co-verification of embedded systems using model checking. Software and hardware designs of an embedded system are translated into the input formal language of a state-of-the-art model checker to enable co-verification. The formal model of the whole system is constructed through integrating the translations of hardware and software designs via a bridge module. The bridge module preserves the semantics of hardware and software. Co-verification complexity is reduced through (1) leveraging reduction algorithms of the target model checkers, (2) applying reduction algorithms in translation via model transformations, and (3) conducting compositional reasoning across the interfaces of the bridge module. Our approach has been implemented to support co-verification of software designs specified in executable UML and hardware designs specified in Verilog. We have successfully applied this approach to co-verification of networked sensors, an emerging type of embedded systems. The case study has shown that our approach is practical - applicable to embedded systems of real-world scale, and effective - leading to order-of-magnitude reduction on co-verification complexities.
Locking protocols for materialized aggregate join views
Authors: Gang Luo, Jeffrey F. Naughton, Curt J. Ellmann, Michael W. Watzke
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

The maintenance of materialized aggregate join views is a well-studied problem. However, to date the published literature has largely ignored the issue of concurrency control. Clearly immediate materialized view maintenance with transactional consistency, if enforced by generic concurrency control mechanisms, can result in low levels of concurrency and high rates of deadlock. While this problem is superficially amenable to well-known techniques such as fine-granularity locking and special lock modes for updates that are associative and commutative, we show that these previous techniques do not fully solve the problem. We extend previous high concurrency locking techniques to apply to materialized view maintenance, and show how this extension can be implemented even in the presence of indices on the materialized view.
Semisupervised Query Expansion with Minimal Feedback
Authors: Masayuki Okabe, Seiji Yamada
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

Query expansion is an information retrieval technique in which new query terms are selected to improve search performance. Although useful terms can be extracted from documents whose relevance is already known, it is difficult to get enough of such feedback from a user in actual use. We propose a query expansion method that performs well even if a user makes practically minimum effort, that is, chooses only a single relevant document. To improve searches in these conditions, we made two refinements to a well-known query expansion method. One uses transductive learning to obtain pseudo relevant documents, thereby increasing the total number of source documents from which expansion terms can be extracted. The other is a modified parameter estimation method that aggregates the predictions of multiple learning trials to sort candidate terms for expansion by importance. Experimental results show that our method outperforms traditional methods, and is comparable to a state of the art method.
An Intelligent TCM Diagnostic System Based on Intuitionistic Fuzzy Set
Authors: Meihong Wu, Changle Zhou, Kunhui Lin
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

This paper proposes an intelligent Traditional Chinese Medical diagnostic system based on Multi- Agent System. In this system we also introduce an intelligent fuzzy diagnostic model based on intuitionistic fuzzy set theory according to the characteristics of Traditional Chinese Medicine, which realize intelligent diagnosis by modeling medical diagnosis rules via fuzzy relations, finally we propose a new approach for similarity measure between the intuitionistic fuzzy sets of syndromes.
Energy Efficient Coverage with Variable Sensing Radii in Wireless Sensor Networks
Authors: Jiong Wang, Sirisha Medidi
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

tially distributed autonomous devices using sensors to coopera- tively monitor physical or environmental conditions. Generally, sensor nodes are resource-constraint in terms of size, power and bandwidth, therefore energy-efficient design becomes one of the fundamental goals in WSN. To provide reliable service in surveillance as well as energy efficiency, significant attention has recently been devoted to dynamic coverage algorithms based on sensors which are capable of adjusting its transmission and sensing range. In this paper, we propose two local sensing radii optimization schemes based on one-hop approximation of Delaunay Triangulation to minimize the energy consumption and extend the lifetime of networks. Furthermore, we prove that our approximation of Delaunay Triangulation guarantees complete coverage and generates the same radii assignment as traditional Delaunay Triangulation. Our ns-2 based simulation shows performance improvements in many aspects such as coverage ratio, sensing energy consumption, node failure rate, and lifetime of networks. Key words: Wireless Sensor Networks, coverage, Delaunay Tri- angulation
Video surveillance patrol robot system in 3G, Internet and sensor networks
Authors: Fung Po Tso, Lizhuo Zhang, Weijia Jia
Venue: Proceedings of the 5th international conference on Embedded networked sensor systems (2007)

We propose to demo a ubiquitous surveillance patrol robot system which can patrol in a candidate site to perform events detection where a wireless sensor network may be deployed. We have enabled the 3G phone controlled patrol robot (over 3G circuit switched network) with integrated access to the WiFi/Internet. Internet is used to provide sensor query, to send control signal to the robot and to request the real time audiovisual data from the robot. The robot can receive the movement instructions from and pull the real-time multimedia data stream to a remote user via WiFi laptop or 3G terminal. We also implemented a gateway which is a key component for the platform in responsible for the interconnection and heterogeneous communication of the networks.
Grid query optimizer to improve query processing in grids
Authors: Shuo Liu, Hassan A. Karimi
Venue: Future Generation Computer Systems (2008)

The emergence of computational grids, as global computing infrastructures, calls for development of new and advanced database techniques. While there exist algorithms and tools that facilitate database operations in grids, currently query optimization techniques are scant. In this paper, a query optimization technique, Grid Query Optimizer (GQO), that improves overall response time for grid-based query processing is presented. GQO features a resource selection strategy and a generic parallelism processing algorithm to balance optimization cost and query execution. GQO is tested using a simulated grid environment and compared with two other optimization techniques. Experiment results show that GQO provides better-than-average performance and is especially suitable for queries with large search spaces.
Optimization and Simulation of a MO Problem Solved by GAs and PSO
Authors: Xiujuan Lei, Zhongke Shi, Laijun Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

This paper solves an economic multi-objective optimization problem through two improved intelligent optimization methods, one is multi-objective genetic algorithms named RNPGA (Random Niche Pareto Genetic Algorithms), and the other is improved PSO (Particle Swarm Optimization) with linear inertia weight reduction, which the constraints is in a specified region. Moreover we calculate the model through programming and give the simulation results. Computing results show the validity and advancing of the methods and the PSO algorithm is more quickly to solve the actual problem.
Large-scale byzantine fault tolerance: safe but not always live
Authors: Rodrigo Rodrigues, Petr Kouznetsov, Bobby Bhattacharjee
Venue: Proceedings of the 3rd workshop on on Hot Topics in System Dependability (2007)

The overall correctness of large-scale systems composed of many groups of replicas executing BFT protocols scales poorly with the number of groups. This is because the probability of at least one group being compromised (more than 1/3 faulty replicas) increases rapidly as the number of groups increases. In this paper we address this problem with a simple modification to Castro and Liskov's BFT replication that allows for arbitrary choice of n (number of replicas) and f (failure threshold). The price to pay is a more restrictive liveness requirement, and we present the design of a large-scale BFT replicated system that obviates this problem.
Toward a Logical Architecture for Situation Dependent Information Services with Surrounding Awareness
Authors: Xiaojun Ding, Junichi Iijima
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

In recent years, the rapid growth of m-commerce is being driven by various emerging mobile applications and services. Among them, mobile information service is considered to be one of important applications. User's situation is a key factor in the design of adaptive mobile information services. Personalized and user's situation dependent information services have been focused as one of value-added services. But little attention has been given to the point on implementing situation dependent information services based on a formal logical approach. In this research, the concepts of our logical architecture, which adopt logical reasoning capabilities of the situation calculus, enable users to receive situation dependent information services. Moreover, because a user's situation can never exist in isolation from his/her surrounding world, one important purpose of this research is to relate evolution of surrounding circumstances to the architecture, and to model a situation dependent information service system with surrounding awareness.
An automatic approach to construct domain-specific web portals
Authors: Ismail Sengor Altingovde, Rifat Ozcan, Suleyman Cetintas, Hakan Yilmaz, Özgür Ulusoy
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

We describe the architecture of an automatic domain-specific Web portal construction system. The system has three major components: i) a focused crawler that collects the domain-specific pages on the Web, ii) an information extraction engine that extracts useful fields from these Web pages, and iii) a query engine that allows both typical keyword based queries on the pages and advanced queries on the extracted data fields. We present a prototype system that works for the course homepages domain on the Web. A user study with the prototype system shows that our approach produces high quality results and achieves better precision figures than the typical keyword based search.
A Qualitative Justification for a Measure of Program Clarity
Authors: R. D. Gordon
Venue: IEEE Transactions on Software Engineering (1979)

Several measures of program clarity have been proposed which attempt to assess the clauity of a program as a function of easily measured properties of the code. Such measures include the number of variables or statements, or the density of GO TO's.
Business Process Integration by Using General Rule Markup Language
Authors: Milan Milanovic, Nima Kaviani, Dragan Gasevic, Adrian Giurca, Gerd Wagner, Vladan Devedzic, and Marek Hatala
Venue: Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference (2007)

A business process usually includes multiple busi- ness partners that use systems with their business log- ics represented in different rule (or policy) languages. The integration of business processes is a major goal followed by business enterprises and involves the in- terchange of business rules and policies between part- ners. However, the variety of business rules employed by the partners presents a significant burden to the integration of collaborating business systems. In this paper, we propose a solution that enables translating rules and policies defined in different rule languages into a single general rule language (REWERSE I1 Rule Markup Language - R2ML) and processing them in a uniform manner. This provides a unified view of different partners' business rules in an integration process, while permitting the partners to continue to leverage their own business rules without changing their technologies. We show how the concepts of the KAoS policy language can be transformed to R2ML and then from R2ML to the other rule (or policy) lan- guages.
Using Mobile Agents to Detect and Recover from Node Compromise in Path-based DoS Attacks in Wireless Sensor Networks
Authors: Bai Li, Lynn Batten
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Wireless sensor networks represent a new generation of real-time embedded systems with significantly different communication constraints from the traditional networked systems. With their development, a new attack called a pathbased DoS (PDoS) attack has appeared. In a PDoS attack, an adversary, either inside or outside the network, overwhelms sensor nodes by flooding a multi-hop end-toend communication path with either replayed packets or injected spurious packets. Detection and recovery from PDoS attacks have not been given much attention in the literature. In this article, we propose a solution using mobile agents which can detect PDoS attacks easily and efficiently and recover the compromised nodes.
Assessing RJSCs In High-Level Language Support
Authors: David Patterson, Richard Piepho
Venue: IEEE Micro (1982)

A reduced instruction set computer, RISC I, was compared to five traditional machines. It provided the highest performance with the smallest penalty for using high-level language.
False Deadlock Detection in Distributed Systems
Authors: G. T. Wuu
Venue: IEEE Transactions on Software Engineering (1985)

Detecting a nonexistent deadlock in distributed systems has been referred to as false deadlock detection. This correspondence shows that false deadlock wi1l never occur in a system of two-phase locking transactions. We also describe an algorithm to avoid false deadlock detection when transactions are not two-phase locking.
Computer Society Technical Committees
Venue: Computer (1971)

The role of the Technical Committees is to strengthen the Society and the membership at large by promoting technical excellence in a specific area, In addition to the smaller work-shops where workers in a particular discipline exchange information and discuss problems of mutual concern, the Technical Committees serve the overall interests of the Society by sponsoring many seminars, symposia, sessions at the Society's conferences and other conferences (eg. at the IEEE International Conference, WESCON); they also sponsor technical sessions in conjunction with the Spring and Fall Joint Computer Conferences. The TCs prepare papers for special issues of the Transactions, and contribute articles to COMPUTER magazine. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Towards Finding Efficient Tools for Measuring the Tail Index and Intensity of Long-range Dependent Network Traffic
Authors: Karim Mohammed Rezaul, Vic Grout
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Many researchers have discussed the effects of heavy-tailedness in network traffic patterns and shown that Internet traffic flows exhibit characteristics of self-similarity that can be explained by the heavy-tailedness of the various distributions involved. Self-similarity and heavy-tailedness are of great importance for network capacity planning purposes in which researchers are interested in developing analytical methods for analysing traffic characteristics. Designers of computing and telecommunication systems are increasingly interested in employing heavy-tailed distributions to generate workloads for use in simulation - although simulations employing such workloads may show unusual characteristics. Congested Internet situations, where TCP/IP buffers start to fill, show long-range dependent (LRD) self-similar chaotic behaviour. Such chaotic behaviour has been found to be present in Internet traffic by many researchers. In this context, the 'Hurst exponent', H, is used as a measure of the degree of long-range dependence. Having a reliable estimator can yield a good insight into traffic behaviour and may eventually lead to improved traffic engineering. In this paper, we describe some of the most useful mechanisms for estimating the tail index of Internet traffic, particularly for distributions having the power law observed in different contexts, and also the performance of the estimators for measuring the intensity of LRD traffic in terms of their accuracy and reliability.
Building Quality and Productivity into a Large Software System
Authors: E. M. Prell
Venue: IEEE Software (1984)

The key to developing larger and more complex software systems is to improve the way we manage people and information.
Implementation of Ternary Circuits with-Binary Integrated Circuits
Authors: D. Etiemble
Venue: IEEE Transactions on Computers (1977)

A general method for implementing ternary circuits with binary integrated circuits is described. The conditions are given for a particular technology to be able to implement ternary circuits. For TTL, COSMOS, and ECL technologies, the necessary circuits are developed. Formulas are provided to obtain the minimum circuit according to the particular function required. Simplification rules corresponding to each technology are given. Some examples illustrate the method. Some dynamical characteristics are shown. Extensions of these results to other technologies and to n-valued circuits are possible.
A Partitioning Algorithm with Application in Pattern Classification and the Optimization of Decision Trees
Authors: W. S. Meisel
Venue: IEEE Transactions on Computers (1973)

The efficient partitioning of a finite-dimensional space by a decision tree, each node of which corresponds to a comparison involving a single variable, is a problem occurring in pattern classification, piecewise-constant approximation, and in the efficient programming of decision trees. A two-stage algorithm is proposed. The first stage obtains a sufficient partition suboptimally, either by methods suggested in the paper or developed elsewhere; the second stage optimizes the results of the first stage through a dynamic programming approach. In pattern classification, the resulting decision rule yields the minimum average number of calculations to reach a decision. In approximation, arbitrary accuracy for a finite number of unique samples is possible. In programming decision trees, the expected number of computations to reach a decision is minimized.
Data Base Machines with Large Content-Addressable Blocks and Structural Information Processors
Authors: D. S. Kerr
Venue: Computer (1979)

The advent of very large data bases is prompting DBMS designers to take advantage of past advances in specailized processor and memory hardware technologies.
User-Centric Resource Allocation Hierarchy in Grid Computing
Authors: Shaofeng Liu
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

With the joint effort of the research community and industry companies, Grid computing has the potential to become a ubiquitous service that is accessible by everyone. Consequently, the policies to manage the allocation of limited computing resources to users become very important. End users will pay for the computation service they get, and choose from more than one Grid Service Provider (GSP) based on their experiences with these GSPs; GSPs want to allocate the resources in a user-centric way to attract and retain users. During the resource allocation procedure, there are three most basic questions: .Where should one find the proper resources for users' jobs?., .When multiple jobs are waiting, which one should be scheduled first?., and .Given the hardware characteristics, how should jobs be further scheduled to maximize the utilization of hardware? . These questions lead to a natural hierarchical resource allocation scheme, which involves three levels: (1) Find the proper resources for the proper jobs, (2) prioritize and schedule jobs to execute in a reasonable order, and (3) coordinate jobs to execute on the hardware efficiently. This paper reviews and classifies related work, and suggests future research directions.
Extended K-d Tree Database Organization: A Dynamic Multiattribute Clustering Method
Authors: Jo-Mei Chang
Venue: IEEE Transactions on Software Engineering (1981)

The problem of performing multiple attribute clustering in a dynamic database is studied. The extended K-d tree method is presented. In an extended K-d tree organization, the basic k-d tree structure after modification is used as the structure of the directory which organizes the data records in the secondary storage. The discriminator value of each level of the directory determines the partitioning direction of the corresponding attribute subspace. When the record insertion causes the data page to overload, the attribute space will be further partitioned along the direction specified by the corresponding discriminator.