ppxscal/embedding_network huggingface dataset:
PolyUnpack: Automating the Hidden-Code Extraction of Unpack-Executing Malware
Authors: Paul Royal, Mitch Halpin, David Dagon, Robert Edmonds, Wenke Lee
Venue: Proceedings of the 22nd Annual Computer Security Applications Conference (2006)

Modern malware often hide the malicious portion of their program code by making it appear as data at compile-time and transforming it back into executable code at runtime. This obfuscation technique poses obstacles to researchers who want to understand the malicious behavior of new or unknown malware and to practitioners who want to create models of detection and methods of recovery. In this paper we propose a technique for automating the process of extracting the hidden-code bodies of this class of malware. Our approach is based on the observation that sequences of packed or hidden code in a malware instance can be made self-identifying when its runtime execution is checked against its static code model. In deriving our technique, we formally define the unpack-executing behavior that such malware exhibits and devise an algorithm for identifying and extracting its hidden-code. We also provide details of the implementation and evaluation of our extraction technique; the results from our experiments on several thousand malware binaries show our approach can be used to significantly reduce the time required to analyze such malware, and to improve the performance of malware detection tools.
A Case History of International Space Station Requirement Faul
Authors: Jane Huffman Hayes, Inies C. M. Raphael, Elizabeth Ashlee Holbrook, David M. Pruett
Venue: Proceedings of the 11th IEEE International Conference on Engineering of Complex Computer Systems (2006)

There is never enough time or money to perform Verification and Validation (V&V) or Independent Verification and Validation (IV&V) on all aspects of a software development project, particularily for complex computer systems. We have only high-level knowledge of how the potential existence of specific requirements faults increases project risks, and of how specific V&V techniques (requirements tracing, code analysis, etc.) contribute to improved software reliability and reduced risk. An approach to this problem, fault-based analysis, is proposed and a case history of the National Aeronautics and Space Administration's (NASA) International Space Station (ISS) project is presented to illustrate its use. Specifically, a tailored requirement fault taxonomy was used to perform trend analysis of the historical profiles of three ISS computer software configuration items as well as to build a prototype common cause tree. ISS engineers evaluated the results and extracted lessons learned.
Routing protocols for efficient communication in wireless ad-hoc networks
Authors: Ioannis Chatzigiannakis, Panagiotis Kokkinos, Christos Zaroliagis
Venue: Proceedings of the 3rd ACM international workshop on Performance evaluation of wireless ad hoc, sensor and ubiquitous networks (2006)

In this paper we demonstrate the significant impact of the user mobility rates on the performance on two different approaches for designing routing protocols for ad-hoc mobile networks: (a) the route creation and maintenance approach and (b) the "support" approach, that forces few hosts to move acting as "helpers" for message delivery. We study a set of representative protocols for each approach, i.e. DSR and ZRP for the first approach and RUNNERS for the second. We have implemented the three protocols and performed a large scale and detailed simulation study of their performance. Our findings are: (i) DSR achieves low message delivery rates but manages to deliver messages very fast; (ii) ZRP behaves well in networks of low mobility rate, while its performance drops for networks of highly mobile users; (iii) RUNNERS seem to tolerate well (and in fact benefit from) high mobility rates. Based on our investigation, we design and implement two new protocols that result from the synthesis of the investigated routing approaches. We conducted an extensive, comparative simulation study of their performance. The new protocols behave well both in networks of diverse mobility motion rates, and in some cases they even outperform the original ones by achieving lower message delivery delays
Computing multi-valued physical observables for the high frequency limit of symmetric hyperbolic systems
Authors: Shi Jin, Hailiang Liu, Stanley Osher, Richard Tsai
Venue: Journal of Computational Physics (2005)

We develop a level set method for the computation of multi-valued physical observables (density, velocity, energy, etc.) for the high frequency limit of symmetric hyperbolic systems in any number of space dimensions. We take two approaches to derive the method. The first one starts with a weakly coupled system of an eikonal equation for phase S and a transport equation for density @r:@?"tS+H(x,@?S)=0,(t,x)@?R^+xR^n,@?"t@r+@?"x.(@r@?"pH(x,@?"xS))=0.The main idea is to evolve the density near the n-dimensional bi-characteristic manifold of the eikonal (Hamiltonian-Jacobi) equation, which is identified as the common zeros of n level set functions in phase space (x,k)@?R^2^n. These level set functions are generated from solving the Liouville equation with initial data chosen to embed the phase gradient. Simultaneously, we track a new quantity f=@r(t,x,k)|det(@?"k@f)| by solving again the Liouville equation near the obtained zero level set @f=0 but with initial density as initial data. The multi-valued density and higher moments are thus resolved by integrating f along the bi-characteristic manifold in the phase directions. The second one uses the high frequency limit of symmetric hyperbolic systems derived by the Wigner transform. This gives rise to Liouville equations in the phase space with measure-valued solution in its initial data. Due to the linearity of the Liouville equation we can decompose the density distribution into products of function, each of which solves the Liouville equation with L^~ initial data on any bounded domain. It yields higher order moments such as energy and energy flux. The main advantages of these new approaches, in contrast to the standard kinetic equation approach using the Liouville equation with a Dirac measure initial data, include: (1) the Liouville equations are solved with L^~ initial data, and a singular integral involving the Dirac-@d function is evaluated only in the post-processing step, thus avoiding oscillations and excessive numerical smearing; (2) a local level set method can be utilized to significantly reduce the computation in the phase space. These methods can be used to compute all physical observables for multi-dimensional problems. Our method applies to the wave fields corresponding to simple eigenvalues of the dispersion matrix. One such example is the wave equation, which will be studied numerically in this paper.
An Agent-Based Model of Research Collaboration in Collaborative Tagging for Scientific Publications
Authors: Piyanuch Klaisubun, Takashi Ishikawa
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

The paper describes an agent-based model of research collaboration in collaborative tagging system in order to develop an effective collaboration support system for scientific research communities. Based on a survey on social software such as collaborative tagging for the purpose of collaboration on the web, at first we analyze requirements for the social software as a collaboration support system for scientific researchers. Next we apply agent-based methodology to develop an agent-based model of research collaboration in collaborative tagging system that satisfies the requirements. Then we validate the model by comparing its functionalities to the existing collaborative tagging systems. Finally we conclude the paper and mention our future work.
Metamodel Matching: Experiments and Comparison
Authors: Denivaldo Lopes, Slimane Hammoudi, Jose de Souza, Alan Bontempo
Venue: Proceedings of the International Conference on Software Engineering Advances (2006)

Recently, Model Driven Engineering (MDE) has been proposed for supporting the development, maintenance and evolution of software systems. Model Driven Architecture (MDA), Software Factories and Eclipse Modeling Framework (EMF) are representative MDE approaches. These MDE approaches have some concepts and techniques in common such as modeling, metamodels and model transformation. However, other concepts and techniques should be envisaged such as metamodel matching. In this paper, we discuss some issues and provide some insights into metamodel matching. For this purpose, we use UML and the C# platform to illustrate our approach and to evaluate our Mapping Tool for MDE (MT4MDE) and Semi-Automatic Matching Tool for MDE (SAMT4MDE). Afterwards, comparisons with other tools are presented.
Extensible programming with first-class cases
Authors: Matthias Blume, Umut A. Acar, Wonseok Chae
Venue: ACM SIGPLAN Notices (2006)

We present language mechanisms for polymorphic, extensible records and their exact dual, polymorphic sums with extensible first-class cases. These features make it possible to easily extend existing code with new cases. In fact, such extensions do not require any changes to code that adheres to a particular programming style. Using that style, individual extensions can be written independently and later be composed to form larger components. These language mechanisms provide a solution to the expression problem.We study the proposed mechanisms in the context of an implicitly typed, purely functional language PolyR. We give a type system for the language and provide rules for a 2-phase transformation: first into an explicitly typed λ-calculus with record polymorphism, and finally to efficient index-passing code. The first phase eliminates sums and cases by taking advantage of the duality with records.We implement a version of PolyR extended with imperative features and pattern matching - we call this language MLPolyR. Programs in MLPolyR require no type annotations - the implementation employs a reconstruction algorithm to infer all types. The compiler generates machine code (currently for PowerPC) and optimizes the representation of sums by eliminating closures generated by the dual construction.
A Graph-based Method to Remove Interferential Curve From Text Image
Authors: Zhiguo Cheng, Yuncai Liu
Venue: Machine Vision and Applications (2006)

A general algorithm for eliminating interferential curve in text image was proposed, which converted images into basic graph and super graph first, and then the interferential curve was treated as principal curve to be detected. In the detection, improved DFS algorithm, shortest path algorithm and orientation offset&#x00a0;algorithm were used. Finally, the detected curve was removed from the original image, leaving only text in the image. Experiments conducted with a variety of text images showed that this algorithm is effective in removing interferential curve from text image.
Cluster Analysis of Time-Series Medical Data Based on the Trajectory Representation and Multiscale Comparison Techniques
Authors: Shoji Hirano, Shusaku Tsumoto
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

This paper presents a cluster analysis method for multi-dimensional time-series data on clinical laboratory examinatios. Our method represents the time series of test results as trajectories in multidimensional space, and compares their structural similarity by using the multiscale comparison technique. It enables us to find the part-to-part correspondences between two trajectories, taking into account the relationships between different tests. The resultant dissimilarity can be further used with clustering algorithms for finding the groups of similar cases. The method was applied to the cluster analysis of Albumin-Platelet data in the chronic hepatitis dataset. The results denonstrated that it could form interesting groups of cases that have high correspondence to the fibrotic stages.
A Selective Flooding Method for Propagating Emergency Messages in Vehicle Safety Communications
Authors: Sukdea Yu, Gihwan Cho
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

An intelligent vehicle safety system can be constructed by exchanging emergency-related information between any unrelated vehicles, such as urgency stop, traffic accident, and obstacles. In the most of vehicle safety communication applications, an emergency message is propagated in the form of broadcasting. However, it causes a lot of problems in terms of efficiency due to the multi-hop propagation and radio collision problems. This paper presents a selective message forwarding method by assigning a defer time based on the number of the common neighbors. With benefit of this method, only selected vehicles perform a re-broadcasting the received emergency event among the vehicles included in the same wireless coverage. Moreover, the proposed scheme improves the efficiency of message transmission with the selective assignment of priority for forwarding message. To analyze its performance, it has been evaluated by network simulator.
The demographics, motivations, and derived experiences of users of massively multi-user online graphical environments
Authors: Nick Yee
Venue: Presence: Teleoperators and Virtual Environments (2006)

Online survey data were collected from 30,000 users of Massively Multi-User On-line Role-Playing Games (MMORPGs) over a three year period to explore users' demographics, motivations, and derived experiences. Not only do MMORPGs appeal to a broad age range (Mage = 26.57, range = 11-68), but the appeal is strong (on average 22 hours of usage per week) across users of all ages (r = -.04). An exploratory factor analysis revealed a five factor model of user motivations-- Achievement, Relationship, Immersion, Escapism, and Manipulation--illustrating the multifaceted appeal of these online environments. Male players were significantly more likely to be driven by the Achievement and Manipulation factors, while female players were significantly more likely to be driven by the Relationship factor. Also, the data indicated that users derived meaningful relationships and salient emotional experiences, as well as real-life leadership skills from these virtual environments. MMORPGs are not simply a pastime for teenagers, but a valuable research venue and platform where millions of users interact and collaborate using real-time 3D avatars on a daily basis.
Designing Resistant Circuits against Malicious Faults Injection Using Asynchronous Logic
Authors: Yannick Monnet Marc Renaudin Regis Leveugle
Venue: IEEE Transactions on Computers (2006)

This paper presents hardening techniques against fault attacks and the practical evaluation of their efficiency. The circuit technology investigated to improve the resistance against fault attacks is asynchronous logic. Specific properties of asynchronous circuits make them inherently resistant against a large class of faults. An analysis of their behavior in the presence of faults shows that they are an interesting alternative to design robust systems. A behavior diagnosis enables us to propose hardening techniques that improve fault tolerance and resistance. They are applied at design time and aim at exploiting quasi-delay insensitive (QDI) circuit properties to significantly harden the architecture with a very low area overhead and a reasonable performance penalty. To validate these techniques, a hardened DES crypto-processor is presented. The countermeasures are evaluated using laser beam fault injection.
An Efficient Clustering Algorithm for Small Text Documents
Authors: Yubao Liu, Jiarong Cai, Jian Yin, Zhilan Huang
Venue: Proceedings of the Seventh International Conference on Web-Age Information Management Workshops (2006)

Clustering text documents into different category groups is an important problem. The size of desired clusters is an important requirement for a clustering solution. In this paper, we present an efficient clustering algorithm called RTC based on the spherical k-means algorithm for small text documents. In RTC, we present a new initial centers choice method based on the density and farthest distance strategies. Based on the first variations adjustment of Ping-Pong algorithm, we also present a new partition adjustment method, which is guided by the set of border objects of clusters. We test the algorithm performance based on the Chinese natural language platform. The experimental results show that RTC outperforms the spherical k-means and bisecting k-means in clustering accuracy and Ping-Pong both in clustering accuracy and clustering time. Especially, in the clustering time aspect, RTC sometimes is 5 times faster than Ping- Pong.
Multi-robot Path Planning Based on Cooperative Co-evolution and Adaptive CGA
Authors: Dongyong Yang, Jinyin Chen, Naofumi Matsumoto, Yuzo Yamane
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

Multi-robot path planning is a challenge for mobile robots in AI. Multi-objective optimized algorithm based on cooperative co-evolution and CGA is brought up in this paper. Shortest path length, minimum time cost, smoothest and limited speed, obstacle-collide free and robot-collide free are the objectives and constraints to optimize. Linear combination of them is designed as evaluation function for CGA with self-adaptive crossover and mutation rate, combined with chaos disturbs. Finally 2D dynamic simulation has proved the efficiency of the algorithm.
Robust and Scalable Coordination of Potential-Field Driven Agents
Authors: Steven de Jong, Karl Tuyls, Ida Sprinkhuizen-Kuyper
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

In this paper, we introduce a nature-inspired multiagent system for the task domain of resource distribution in large storage facilities. The system is based on potential fields and swarm intelligence, in which straightforward path planning is integrated. We show both experimentally and theoretically that the system is adaptive, robust and scalable. Moreover, we show that the planning component helps to overcome common pitfalls for nature-inspired systems in the task assignment domain. We end this paper with a discussion of an additional requirement for multi-agent systems interacting with humans: functionality. More precisely, we argue that such systems must behave in a fair way to be functional. We illustrate how fairness can be measured and illustrate that our system behaves in a moderately fair manner.
Scalable and QoS-Aware Dynamic Slot Assignment and Piconet Partitioning to Enhance the Performance of Bluetooth Ad Hoc Networks
Authors: Carlos Cordeiro, Sachin Abhyankar Dharma P. Agrawal
Venue: IEEE Transactions on Mobile Computing (2006)

Bluetooth is a radio technology for Wireless Personal Area Networks in the 2.4 GHz ISM frequency band and allows short-range devices to be connected in the form of ad hoc networks. The Bluetooth medium access control protocol is based on a strict master/slave concept wherein any communication between slave devices has to go through the master. While this model is simple, the use of such a nonoptimal packet forwarding scheme incurs much longer delays between any two slave-devices as double the bandwidth is used by the master. In addition, if two or more devices want to communicate as a group, this can only be achieved by either multiple unicast transmissions or a piconet-wide broadcast from the master. To handle these issues efficiently, we propose a novel combination of Dynamic Slot Assignment (DSA) and piconet partitioning. With DSA, the piconet master dynamically assigns slots to slaves so as to allow them to communicate directly with each other without any intervention from the master. Our proposed communication architecture provides for enhanced Quality of Service (QoS), better admission control, and multidevice conversation, which make a multicast-like communication feasible within the piconet. To widen the scope of DSA, we propose a QoS-aware Enhanced DSA (EDSA) version where dynamic piconet partitioning and scatternet support are exploited by grouping devices into piconets as per their connection endpoints, enabling it to be employed over a scatternet. We have performed extensive simulations and observe that these schemes drastically enhance Bluetooth performance in terms of the delay and the throughput, while significantly reducing the network power consumption.
Fuzzy Sets Defined on a Hierarchical Domain
Authors: Rallou Thomopoulos, Patrice Buche, Ollivier Haemmerle
Venue: IEEE Transactions on Knowledge and Data Engineering (2006)

This paper presents a new type of fuzzy sets, called "Hierarchical Fuzzy Sets,” that apply when the considered domain of values is not "flat,” but contains values that are more specific than others according to the "kind of” relation. We study the properties of such fuzzy sets, that can be defined in a short way on a part of the hierarchy, or exhaustively (by their "closure”) on the whole hierarchy. We show that hierarchical fuzzy sets form equivalence classes in regard to their closures and that each class has a particular representative called "minimal fuzzy set.” We propose a use of this minimal fuzzy set for query enlargement purposes and, thus, present a methodology for hierarchical fuzzy set generalization. We finally present an experimental evaluation of the theoretical results described in the paper, in a practical application.
Processing encrypted signals: a new frontier for multimedia security
Authors: Mauro Barni
Venue: Proceedings of the 8th workshop on Multimedia and security (2006)

Most of technological solutions proposed so far to cope with the issues of multimedia security rely on the use of cryptography. Early works in this direction simply tried to apply some cryptographic primitives, to build a secure layer on top of the signal processing modules, able to protect them from leakage of critical information. Examples of such an approach include the encryption of content before its transmission or storage (like encrypted digital TV channels), or wrapping multimedia objects into an encrypted system with an application (the reader) allowing to use the multimedia work only in a controlled manner so that the content cannot be accessed without the proper application.All these solutions are based on the concept that the owner of the owner of the content and the user trust each other and that the encryption layer is used only to protect the data against third parties not authorized to access the data. In many cases, though, the owner of the content may not trust the users, or those actors that are required to manipulate in some way the content. It is clear that the availability of signal processing algorithms that work directly on the encrypted signals would be an invaluable help to circumvent the above problems in for application scenarios where "valuable" signals must be produced, processed or exchanged in digital format. Whereas the development of tools capable of processing an encrypted signal may seem a formidable task, some recent, still scattered, studies, spanning from digital watermarking, through secure compression, and access to encrypted databases, have shown that the application of signal processing in the encrypted domain is indeed feasible.In addition to highlighting the benefits offered by the availability of signal processing tools capable of operating directly on encrypted data, it is the aim of this talk to revise the approaches proposed so far, pointing out the pros and cons of each of them, and to highlight directions for future research. A few case studies will be considered to better highlight the underlying concepts.