ppxscal/embedding_network huggingface dataset:
Proceedings of the 2005 ACM workshop on Rapid malcode
Venue: Workshop On Rapid Malcode (2005)

It is my pleasure to welcome you to the 3rd ACM Workshop on Rapid Malcode (WORM). This year's workshop builds on the success of the previous two workshops, establishing WORM as the premier forum for exchanging ideas on the problem of self-propagating programs. The continuing threat of worms and the numerous related incidents in the past year have maintained the topic area as one of paramount importance to users and organizations. The increasing exploitation of worm-compromised hosts for criminal purposes has introduced a new urgency in our search for ways to solve, or at least manage, the problem.This year we received 36 submissions from Asia, Canada, Europe, Africa, and the United States, making WORM a truly international workshop. The program committee accepted 9 papers that cover a variety of topics, based on quality, novelty and clarity. In addition, the program committee invited three distinguished speakers: Brian Hernacki of Symantec ("Emerging Threats"), Vern Paxson of ICSI ("An Analysis of the Witty Outbreak: Exploiting Underlying Structure for Detailed Reconstructions of an Internet-scale Event"), and Stefan Savage ("Scalable Internet Threat Monitoring"). In putting together the program, our goal was to stimulate discussion and encourage further work, both in directly enhancing our defense capabilities and in anticipating future directions of worm evolution.
Earliness/Tardiness Flow-Shop Scheduling under Uncertainty
Authors: Sufen Li, Yunlong Zhu, Xiaoying Li
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

For unconventional scheduling problems, both job sequence and starting time of every operation must be optimized, which increases the difficulties of solving this kind of problem. In this paper, we advanced a jointed algorithm for solving flow-shop earliness/tardinessproblem based on genetic algorithm and heuristic algorithm. Hierarchy scheduling paradigm was introduced. First, the genetic algorithm is used to determine preferably scheduling sequence. Second, a kind of new heuristic algorithm was put forward to adjust the starting times for the present schedule. Where, the heuristic algorithm determined what time and how long every idle time should be. The object of this paper is to minimize the total earliness and tardiness penalties of all the jobs. The numerical results obtained prove the correctness and efficiencies of the jointed algorithm.
An Initial Study of a Lightweight Process for Change Identification and Regression Test Selection When Source Code Is Not Available
Authors: Jiang Zheng, Brian Robinson, Laurie Williams, Karen Smiley
Venue: Proceedings of the 16th IEEE International Symposium on Software Reliability Engineering (2005)

Various regression test selection techniques have been developed and have shown to improve testing cost effectiveness via improving efficiency. The majority of these test selection techniques rely on access to source code for change identification. However, when new releases of COTS components are made available for integration and testing, source code is often not available to guide in regression test selection. In this paper we describe a lightweight Integrated - Black-box Approach for Component Change Identification (IBACCI) process for selection of regression tests for user/glue code that uses COTS components. I-BACCI is applicable when component licensing agreements do not preclude binary code analysis. A case study of the process was conducted on an ABB product that uses a medium-scale internal ABB software component. Six releases of the component were examined to evaluate the efficacy of the proposed process. The result of the case study indicates that this process can reduce the required regression tests by 40% on average.
Semantically enhanced and efficient location services for preserving mobile consumer's privacy
Authors: Mahmoud Youssef Mohamed
Venue:  (2005)

In Mobile Commerce applications, such as location-based advertising, merchants use consumers' information to send them personalized advertisements. These applications provide convenience to consumers and competitive advantages to merchants. However, the improper use of consumers' information presents a serious threat to their privacy. The problem environment for this research is the context of a Location Service (LS) that maintains the two types of information used for personalization: consumer profiles and location information. First, we provide support for the choice of the LS to maintain this information and for the rationale for the consumer to entrust it with their information. Then, we address three problems in that environment: (1) How to build a system for enforcing mobile consumers' privacy preferences that supports granular representation and spatio-temporal constraints; (2) How to extend that system to support semantically enhanced preferences; and (3) How to improve the efficiency of data management at the LS. We propose a solution for the first problem that includes an access control model for moving objects and consumer profiles and a mechanism that enforces spatio-temporal policies. The mechanism includes a new variation of the trie structure referred to as the Adaptive Search Multiway trie (ASM-trie): Our evaluation study shows that the ASM-trie has a positive impact on the efficiency of the enforcement mechanism. We then extend that work by employing a semantic representation and reasoning. We consider the domain of promotions as an illustrative example. We show how to model consumer preferences and merchant promotions in an ontology using a Semantic Web language and how to enforce these preferences by matching them with merchant queries using reasoning techniques. In addressing the third problem, we present a unified indexing scheme that improves query performance by partitioning consumer information into clusters and mapping each cluster to a moving objects tree that represents the location information of the consumers in that cluster. The indexing scheme answers queries using a new classification approach with selectable accuracy.
Performance Benefits of Avoiding Head-of-Line Blocking in SCTP
Authors: Karl-Johan Grinnem Grinnem, Torbjorn Andersson, Anna Brunstrom
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

Mitigating the effects of Head-of-Line Blocking (HoLB) was one of the major reasons the IETF SIGTRAN working group developed SCTP, a new transport protocol for PSTN signaling traffic, in the first place. However, studies of the impact of HoLB blocking on TCP and SCTP have given ambiguous results as to whether HoLB has, in fact, any significantly deteriorating effect on transmission delay. To this end, we have carried out a detailed experimental study on the quantitative effects of HoLB. Our study suggests that althoughHoLB could indeed incur a substantial delay penalty on a small fraction of the messages in an SCTP session, it has only a marginal impact on the average end-to-end transmission delay. We only observed improvements in the range of 0% to 18% in average message transmission delay of using unordered delivery as compared to ordered delivery. Furthermore, there was a large variability in between different test runs, which often made the impact of HoLB statistically insignificant.
The Emergence of Racial Segregation in an Agent-Based Model of Residential Location: The Role of Competing Preferences
Authors: Kan Chen, Elena G. Irwin, Ciriyam Jayaprakash, Keith Warren
Venue: Computational Mathematical Organization Theory (2005)

Models of segregation dynamics have examined how individual preferences over neighborhood racial composition determine macroscopic patterns of segregation. Many fewer models have considered the role of household preferences over other location attributes, which may compete with preferences over racial composition. We hypothesize that household preferences over location characteristics other than racial composition affect segregation dynamics in nonlinear ways and that, for a critical range of parameter values, these competing preferences can qualitatively affect segregation outcomes. To test this hypothesis, we develop a dynamic agent-based model that examines macro-level patterns of segregation as the result of interdependent household location choices. The model incorporates household preferences over multiple neighborhood features, some of which are endogenous to residential location patterns, and allows for income heterogeneity across races and among households of the same race. Preliminary findings indicate that patterns of segregation can emerge even when individuals are wholly indifferent to neighborhood racial composition, due to competing preferences over neighborhood density. Further, the model shows a strong tendency to concentrate affluent families in a small number of suburbs, potentially mimicking recent empirical findings on favored quarters in metropolitan areas.
Checking the Satisfiability of Formulas Represented in Disjunctive Normal Form in the Language L. I
Authors: S. L. Kryvyj, A. N. Chebotarev
Venue: Cybernetics and Systems Analysis (2005)

An original technique is proposed for checking the satisfiability of formulae represented in the logical language L in the form of a set of conjuncts. Satisfiability checking is performed by means of analysis and transformation of some relations defined over the set of conjuncts.
An approach to relate business and application services using ISDL
Authors: Dick Quartel, Remco Dijkman, Marten van Sinderen
Venue: Proceedings of the Ninth IEEE International EDOC Enterprise Computing Conference (2005)

This paper presents a service-oriented design approach that allows one to relate services modelled at different levels of granularity during a design process, such as business and application services. To relate these service models we claim that a ¿concept gap¿ and an ¿abstraction gap¿ need to be bridged. The concept gap represents the difference between the conceptual models used to construct service models by different stakeholders involved in the design process. The abstraction gap represents the difference in abstraction level at which service models are defined. Two techniques are presented that bridge these gaps. Both techniques are based on the Interaction System Design Language (ISDL). The paper illustrates the use of both techniques through an example.
Exponentially Many Hadamard Designs
Authors: Eric Merchant
Venue: Designs, Codes and Cryptography (2006)

If there is a Hadamard design of order n, then there are at least 28n¿16¿9log n non-isomorphic Hadamard designs of order 2n.
Quantum-Behaved Particle Swarm Optimization with Mutation Operator
Authors: Jing Liu, Wenbo Xu, Jun Sun
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

The mutation mechanism is introduced into Quantum-behaved Particle Swarm Optimization to increase its global search ability and escape from local minima. Based on the characteristic of QPSO algorithm, the variable of gbest and mbest is mutated with Cauchy distribution respectively. The experimental results on test functions show that QPSO with gbest and mbest mutation both performs better than PSO and QPSO without mutation.
Emergency health care system models
Authors: Dean Uyeno, Ilan Vertinsky
Venue: ACM SIGSIM Simulation Digest (1979)

Many models of emergency health care systems have been created, aided by the openness of the system to inspection, and the ready availability of data and research assistants. Simulation has been particularly popular due to the complex nature of models and I/0, the interest in the tails of response time distributions, and the probabilistic nature of performance criteria.In Vancouver, Canada, a number of simulation models have been created and results have been implemented. Current interest lies in multi-level ambulance models due to the relative scarcity of paramedic ambulances. Research in emergency health care systems is likely to continue
The Structural Complexity of Software: An Experimental Test
Authors: David P. Darcy Chris F. Kemerer, Sandra A. Slaughter James E. Tomayko
Venue: IEEE Transactions on Software Engineering (2005)

This research examines the structural complexity of software and, specifically, the potential interaction of the two dominant dimensions of structural complexity, coupling and cohesion. Analysis based on an information processing view of developer cognition results in a theoretically driven model with cohesion as a moderator for a main effect of coupling on effort. An empirical test of the model was devised in a software maintenance context utilizing both procedural and object-oriented tasks, with professional software engineers as participants. The results support the model in that there was a significant interaction effect between coupling and cohesion on effort, even though there was no main effect for either coupling or cohesion. The implication of this result is that, when designing, implementing, and maintaining software to control complexity, both coupling and cohesion should be considered jointly, instead of independently. By providing guidance on structuring software for software professionals and researchers, these results enable software to continue as the solution of choice for a wider range of richer, more complex problems.
Support Vector Machines in Handwritten Digits Classification
Authors: Urszula Markowska-Kaczmar, Pawel Kubacki
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

In the paper our approach to classify handwritten digits by using Support Vector Machines is described. Because of the unsatisfying, long time of training of SVM we propose to apply k-nearest neighbours algorithm with Manhattan distance to obtain reduced size of training set having a hope that this hybrid method does not make the significantly worse results of recognition. The aim of presented further experiments was to verify this assumption.
Dynamic DiffServ Configuration Using COPS-PR
Authors: A. Beller, E. Jamhour, M. C. Penna
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

This paper presents a framework for managing dynamic Service Level Specification (SLS) in Differentiated Services (DiffServ) networks. Although several works propose high-level SLS description which include time period conditions or service schedule, very few of them discuss about the mechanisms for configuring devices dynamically. Our framework is based on the IETF standards concerning DiffServ policy-based management. The PCIMe and QPIM models are extended for specifying the SLS. And the device configuration is represented in terms of a DiffServ PIB which is distributed among the managed devices using the COPS-PR protocol. The presented framework explores the COPS-PR facilities to define three possible strategies for updating the PIB information in the managed devices. This work describes, compares and discusses the performance of those strategies. In our evaluation scenario, the configuration of edge routers must be updated according to the PolicyTimePeriodConditions defined in the high-level policies. However, the discussed strategies are generic and support dynamic configuration triggered by any event.
Global Stability of a Discrete Population Dynamics Model with Two Delays
Authors: R. M. Nigmatulin
Venue: Automation and Remote Control (2005)

A population dynamics model $$x_n = \frac{{\alpha x_{n - m} }}{{1 + x_{n - m} + \beta x_{n - k} }}$$ with two delays k and m and coefficients ¿ > 1 and β ¿ 0 is studied. A sufficient condition, which is also necessary for certain delays, for the global asymptotic stability of the stationary solution $$x_n = \frac{{\alpha - 1}}{{\beta + 1}}$$ is formulated.
DIG-COLA: Directed Graph Layout through Constrained Energy Minimization
Authors: Tim Dwyer, Yehuda Koren
Venue: Proceedings of the Proceedings of the 2005 IEEE Symposium on Information Visualization (2005)

We describe a new method for visualization of directed graphs. The method combines constraint programming techniques with a high performance force-directed placement (FDP) algorithm so that the directed nature of the graph is highlighted while useful properties of FDP -such as emphasis of symmetries and preservation of proximity relations - are retained. Our algorithm automatically identi- fies those parts of the digraph that contain hierarchical information and draws them accordingly. Additionally, those parts that do not contain hierarchy are drawn at the same quality expected from a non-hierarchical, undirected layout algorithm. An interesting application of our algorithm is directional multidimensional scaling (DMDS). DMDS deals with low-dimensional embedding of multivariate data where we want to emphasize the overall flow in the data (e.g. chronological progress) along one of the axes.
A Peer-to-peer Architecture forWorkflow in Virtual Enterpris
Authors: John Noll
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

Workflow technology seeks to support or automate the performance of organizational processes. When the organization is a virtual enterprise, the conventional client-server workflow architecture is not suitable: virtual enterprises lack centralized resources and administration to support server installations. Further, virtual enterprise participants can be highly autonomous and heterogeneous. A workflow system to support virtual enterprises must account for autonomy and heterogeneity, as well as wide geographic distribution. This paper proposes a peer-to-peer architecture for deploying workflow in virtual enterprises engaged in knowledge-intensive activities. It views a virtual enterprise as a loosely coupled organization of autonomous, distributed actors supported by individual workflow nodes that enact local processes to guide the actor, and share events to coordinate activities with other members of the organization.
The Denial-of-Service Dance
Authors: Philip L. Campbell
Venue: IEEE Security and Privacy (2005)

By understanding the types of attacks available to an adversary, we can develop more effective defenses against them. A taxonomy of denial-of-service attacks based on a dance-hall metaphor is a step toward gaining such an understanding.
WiMAX to the world?
Authors: Teri Robinson
Venue: netWorker (2005)

Widespread, wireless broadband heralds a new era of unlimited accessibility
Development of Architecture and Software Technologies in High-Performance Low-Power SoC Design
Authors: Chih-Wen Hsueh, Tien-Fu Chen, Rong-Guey Chang, Shi-Wu Lo
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

For the success of an SoC design, a design platform and some key design technologies are needed. For this purpose, a research project in "Technology Development Program for Academia" was granted recently in Taiwan to develop the following technologies toward a high-performance low-power SoC design platform. First, a soft intellectual property (soft IP) and related RTOS, compiler, and integrated design environment (IDE) software of an Advanced Taiwan VLIW DSP Processor Core, which can be used as the Star IP of an SoC design platform, will be developed. Second, low-power and low-voltage digital and mixed-signal circuit design technologies will be developed based on the advanced MTCMOS process. Third, some key multimedia and communication soft or hard IPs will be developed. The developed advanced key technologies can be used as the technology driver to facilitate the design of SoC-based products, and they will also help to enhance the design capability of the Taiwan SoC industry. In this paper, we introduce the research project and focus on architecture and software technologies developing in one of the sub-items.
A Katona-type proof of an Erdős-Ko-Rado-type theorem
Authors: Ehud Friedgut
Venue: Journal of Combinatorial Theory Series A (2005)

Let p ≤ 1/2 and let µp be the product measure on {0, 1}n, where µp(x) = pΣxi(1 - p)n-Σxi. Let A ⊂ {0, 1}n be an intersecting family, i.e. for every x, y ∈ A there exists 1 ≤ i ≤ n such that xi = Yi = 1. Then µp(A) ≤ p. Our proof uses a probabilistic trick first applied by Katona to prove the Erdös-Ko-Rado theorem.
Design Mapping, and Simulations of a 3G WCDMA/FDD Basestation Using Network on Chip
Authors: Daniel Wiklund, Dake Liu
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

This paper presents a case study of a single-chip 3G WCDMA/FDD basestation implementation based on a circuit-switched network on chip. As the amount of transistors on a chip continues to increase, so does the possibility to integrate more functionality onto every chip. By combining general-purpose and application-specific hardware, it is possible to integrate the complete baseband part of a 3G basestation on a single chip. Such a single-chip basestation has been modeled from a communication perspective without full implementations of the processing elements. The system has been scheduled and implemented as a traffic model for a network on chip simulator. Simulation results show perfect adherence to the schedule already at a network clock frequency of 75 MHz. The overall network usage is relatively low except for the area closest to the radio interfaces. This will allow for other messages, e.g. control related, to be transported over the network during the gaps in the communication schedule.
A Novel Approach to Recover Writing Order From Single Stroke Offline Handwritten Images
Authors: Yu Qiao, Mikihiko Nishiara, Makato Yasuhara
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

Problem of recovering the writing order from single-stroked handwritten image can be seen as finding the smoothest Euler path in its graph representation. In this paper, a novel approach is proposed to solve the recovery problem within the framework of the Edge Contiguous Relation (ECR). Firstly, we make local analyses to obtain the possible ECRs at each of the nodes; secondly a global trace is executed to find all of the candidate Euler paths and the smoothest one is selected as a final result. Based on two simple assumptions, we prove a series of theorems to obtain possible ECRs at even node. Double-traced lines are identified by using the weighted matching of general graph. Experiments on the scanned images and offline images converted from the online data of Unipen database have shown that our method achieved 95.2% correct recovery rate.