ppxscal/embedding_network huggingface dataset:
A Meta-Model for Enterprise Applications
Authors: Cristina Marinescu, Ioan Jurca
Venue: Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2006)

In the last years, as object-oriented software systems became more and more complex, the need of performing automatically reverse engineering upon these systems has increased significantly. This applies also to enterprise applications, a novel category of software systems. As it is well known, one step toward a research infrastructure accelerating the progress of reverse engineering is the creation of an intermediate representation of software systems. This paper shows why existing intermediate representations of object-oriented software are not suitable for performing reverse engineering upon enterprise applications and proposes an intermediate representation (a model) for enterprise applications which facilitates the process of reverse engineering upon this type of applications. Based on an experimental study conducted on three enterprise applications, we prove the reliability of the introduced approach, discuss its benefits and touch the issues that need to be addressed in the future.
Polymorphic blending attacks
Authors: Prahlad Fogla, Monirul Sharif, Roberto Perdisci, Oleg Kolesnikov, Wenke Lee
Venue: Proceedings of the 15th conference on USENIX Security Symposium - Volume 15 (2006)

A very effective means to evade signature-based intrusion detection systems (IDS) is to employ polymorphic techniques to generate attack instances that do not share a fixed signature. Anomaly-based intrusion detection systems provide good defense because existing polymorphic techniques can make the attack instances look different from each other, but cannot make them look like normal. In this paper we introduce a new class of polymorphic attacks, called polymorphic blending attacks, that can effectively evade byte frequency-based network anomaly IDS by carefully matching the statistics of the mutated attack instances to the normal profiles. The proposed polymorphic blending attacks can be viewed as a subclass of the mimicry attacks. We take a systematic approach to the problem and formally describe the algorithms and steps required to carry out such attacks. We not only show that such attacks are feasible but also analyze the hardness of evasion under different circumstances. We present detailed techniques using PAYL, a byte frequency-based anomaly IDS, as a case study and demonstrate that these attacks are indeed feasible. We also provide some insight into possible countermeasures that can be used as defense.
Enabling Seamless Contextual Collaborations for Mobile Enterprises
Authors: Siddhartha Bose, Subodh Sohi
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

Enterprise workers are increasingly becoming mobile and this is creating scenarios for anytime-anywhere collaboration, using different sets of devices, services and modalities at different times. One of the challenges is to enable seamless contextual collaborations, where people get the best possible collaboration experience at all times. This paper describes a method for generating the most appropriate view of an active collaboration context for a user, in terms of combinations of devices-media-services, using specified constraints. As the user moves from one set of devices to another, these combinations are seamlessly adapted.
Do As I SaY! Programmatic Access Control with Explicit Identities
Authors: Andrew Cirillo, Radha Jagadeesan, Corin Pitcher, James Riely
Venue: Proceedings of the 20th IEEE Computer Security Foundations Symposium (2007)

We address the programmatic realization of the access control model of security in distributed systems. Our aim is to bridge the gap between abstract/declarative policies and their concrete/operational implementations. We present a programming formalism (which extends the asynchronous pi-calculus with explicit principals) and a specification logic (which extends Datalog with primitives from authorization logic). We provide two kinds of static analysis methods to tie implementation to specification. Type checking determines that a program is a sound implementation of policy; i.e., that all granted accesses are safe in the face of arbitrary opponents. Model checking determines a degree of completeness; i.e., that accesses permitted by the policy are actually granted in the implementation.
Hancock: a language for processing very large-scale data
Authors: Dan Bonachea, Kathleen Fisher, Anne Rogers, Frederick Smith
Venue: Proceedings of the 2nd conference on Conference on Domain-Specific Languages - Volume 2 (1999)

A signature is an evolving customer profile computed from call records. AT&T uses signatures to detect fraud and to target marketing. Code to compute signatures can be difficult to write and maintain because of the volume of data. We have designed and implemented Hancock, a C-based domain-specific programming language for describing signatures. Hancock provides data abstraction mechanisms to manage the volume of data and control abstractions to facilitate looping over records. This paper describes the design and implementation of Hancock, discusses early experiences with the language, and describes our design process.
"Analogue Network of Converters": A DFT Technique to Test a Complete Set of ADCs and DACs Embedded in a Complex SiP or SOC
Authors: V. Kerzerho, P. Cauvet, S. Bernard, F. Azais, M. Comte, M. Renovell
Venue: Proceedings of the 12th IEEE European Test Symposium (2007)

In this paper, complex mixed signal circuits such as SiP or SOC including several ADCs and DACs are considered. A new DFT technique is proposed allowing the test of this complete set of embedded ADCs and DACs in a fully digital way such that only a simple low cost tester can be used. Moreover, this technique called "Analogue Network of Converters" (ANC) requires an extremely simple additional circuitry and interconnect.
Free-Form Sketching of Self-Occluding Objects
Authors: Frederic Cordier, Hyewon Seo
Venue: IEEE Computer Graphics and Applications (2007)

When 3D objects occlude each other or self-occlude, their drawings typically consist of a set of contours that might partially overlap or self-overlap. The authors' method infers the hidden parts of contours and creates a smooth 3D shape matching those contours by solving a set of optimization problems.
Accessibility and Mobile Learning Standardization
Authors: Fernando Mikic, Luis Anido, Enrique Valero, Juan Picos
Venue: Proceedings of the Second International Conference on Systems (2007)

Every web user should have access to the information and experiences available online. Accessibility means that people with disabilities can navigate and interact with the web. We address accessibility for mobile learning and its implications as far as Learning Technology (LT) standards is concerned. We consider accessibility not only as the needs and preferences of those users with a disability, but also as the needs and preferences of all users, regardless of the situation or circumstances. This paper reviews the main LT specifications and standards in relation with their suitability for mobile learning. In addition, a new contribution to this LT standardization process is proposed: the inclusion of a Device Profile in some of these specifications.
Fixed point algorithm for bit rate optimal equalization in multicarrier systems
Authors: M. Milisavljevic
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

We present a fixed point algorithm for bit rate optimal time domain equalization in multicarrier systems. The algorithm outperforms standard MMSE equalizers in capacity measure. Moreover, it adaptively estimates the optimal signal delay which was an exhaustive search problem in MMSE equalizers. We discuss the convergence properties and demonstrate the performance of the algorithm on a twisted pair copper wire loop with additive non-white noise.
A maximum likelihood CDMA receiver using the EM algorithm and the discrete wavelet transform
Authors: I. Sharfer
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

A maximum likelihood (ML) method for joint estimation of amplitude, phase, time delay, and data demodulation in a single-user direct sequence spread spectrum communication system is developed. The likelihood function is analytically intractable, so a recursive estimation algorithm is considered. The expectation maximization (EM) algorithm has been used in similar problems, however, in this case it is not computationally efficient. A variant of the EM algorithm, called space alternating generalized EM (SAGE), has been derived. We apply the SAGE algorithm to the sequence estimation problem in a way which results in simple sequential updates of all the estimated parameters. An important feature of the proposed algorithm is the use of a discrete wavelet decomposition of the received signal as a sufficient statistic. The consequence is that all the information is still available to the receiver, while the complicated estimation problem is considerably simplified. Computer simulations of a single user system were performed. It is shown that the algorithm has a fast convergence, and essentially achieves optimal performance.
Entertaining Situated Messaging at Home
Authors: Mark Perry, Dorothy Rachovides
Venue: Computer Supported Cooperative Work (2007)

Leisure and entertainment-based computing has been traditionally associated with interactive entertainment media and game playing, yet the forms of engagement offered by these technologies only support a small part of how we act when we are at leisure. In this paper, we move away from the paradigm of leisure technology as computer-based entertainment consumption, and towards a broader view of leisure computing. This perspective is more in line with our everyday experience of leisure as an embodied, everyday accomplishment in which people artfully employ the everyday resources in the world around them in carrying out their daily lives outside of work. We develop this extended notion of leisure using data from a field study of domestic communication focusing on asynchronous and situated messaging to explore some of these issues, and develop these findings towards design implications for leisure technologies. Central to our discussion on the normal, everyday and occasioned conduct of leisure lie the notions of playfulness and creativity, the interweaving of the worlds of work and leisure, and in the creation of embodied displays of affect, all of which may be seen manifested in the use of messaging artefacts. This view of technology in support of leisure-in-the-broad is strongly divergent from traditional entertainment computing models in its coupling of the mechanics of the organisation of everyday life to the ways that we make entertainment for ourselves. This recognition allows us to draw specific implications for domestic situated messaging technologies, but also more generally for technology design by tying activities that we tend to regard as purely functional to other multifaceted and leisure-related purposes.
Channel and noise adaptation via HMM mixture mean transform and stochastic matching
Authors: J. J. Godfrey
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

We present a non-linear model transformation for adapting Gaussian mixture HMMs using both static and dynamic MFCC observation vectors to additive noise and constant system tilt. This transformation depends upon a few compensation coefficients which can be estimated from channel distorted speech via maximum-likelihood stochastic matching. Experimental results validate the effectiveness of the adaptation. We also provide an adaptation strategy which can result in improved performance at reduced computational cost compared with a straightforward implementation of stochastic matching.
A multi-delay whitening approach to blind identification and equalization of MIMO channels
Authors: B. Huang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

Blind channel estimation and blind equalization of MIMO (multiple-input multiple-output) communications channels is considered using primarily the second-order statistics of the data. The basis of the approach is the design of multiple zero-forcing equalizers that whiten the noise-free data at multiple delays. In the past such an approach has been considered using just one zero-forcing equalizer at zero-delay. The sources are recovered up to a unitary mixing matrix and are further 'unmixed' using higher-order statistics of the data. An illustrative simulation example is provided.
Digital Forensics--State of the Science and Foundational Research Activity
Authors: Rayford Vaughn, David Dampier
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Within the fields of computer science and software engineering greater attention is being given today to the broad topic of information assurance. This minitrack focuses on an emerging subspecialty within information assurance that is largely driven by software technology -- that of Digital Forensics. Digital forensics involves the use of software, computer science, software engineering, and criminal justice procedures to explore and or investigate digital media with the objective of finding evidence to support a criminal or administrative case. It involves the preservation, identification, extraction, and documentation of computer or network evidence. This minitrack includes papers in two important general areas - digital forensics pedagogy at the university level and current research efforts in improving digital forensics tools and techniques.
Information security standards for e-businesses
Authors: M. M. Sattid
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

The process of buying, selling or interacting with customers via Internet, Tele-sale, Smart card or other computer network is referred to as electronics commerce. Whereas online trade has been touting its flexibility, convenience and cost savings, the newest entrant is wireless e-commerce. This form of business offers many attractions; including 24 hours seven days' open shop-business, vastly reduced fixed cost, and increased profitability, Amazon.com is an example of a successful venture, in e-business. Internet service providers (ISP/ASP) have a significant influence on the feasibility, security and cost competitiveness of an e-business venture. In the ISP model of services, multiple users and their databases are normally offered on a single hardware, platform sharing the same IP address and domain name. Clients will require a mechanism, which allows them to update their Web contents and databases frequently even many times daily without intervention of local system administrator (ISP admin). The paper overviews few steps to enable corporate clients to update their Web content more securely.
A new look at discriminative training for hidden Markov models
Authors: Xiaodong He, Li Deng
Venue: Pattern Recognition Letters (2007)

Discriminative training for hidden Markov models (HMMs) has been a central theme in speech recognition research for many years. One most popular technique is minimum classification error (MCE) training, with the objective function closely related to the empirical error rate and with the optimization method based traditionally on gradient descent. In this paper, we provide a new look at the MCE technique in two ways. First, we develop a non-trivial framework in which the MCE objective function is re-formulated as a rational function for multiple sentence-level training tokens. Second, using this novel re-formulation, we develop a new optimization method for discriminatively estimating HMM parameters based on growth transformation or extended Baum-Welch algorithm. Technical details are given for the use of lattices as a rich representation of competing candidates for the MCE training.
The Complexity of Combinatorial Optimization Problems on $d$-Dimensional Boxes
Authors: Miroslav Chlebi´k, Janka Chlebi´kova´
Venue: SIAM Journal on Discrete Mathematics (2007)

The MAXIMUM INDEPENDENT SET problem in $d$-box graphs, i.e., in intersection graphs of axis-parallel rectangles in $\mathbb{R}^d$, is known to be NP-hard for any fixed $d\geq 2$. A challenging open problem is that of how closely the solution can be approximated by a polynomial time algorithm. For the restricted case of $d$-boxes with bounded aspect ratio a PTAS exists [T. Erlebach, K. Jansen, and E. Seidel, SIAM J. Comput., 34 (2005), pp. 1302-1323]. In the general case no polynomial time algorithm with approximation ratio $o(\log^{d-1} n)$ for a set of $n$ $d$-boxes is known. In this paper we prove APX-hardness of the MAXIMUM INDEPENDENT SET problem in $d$-box graphs for any fixed $d\geq 3$. We give an explicit lower bound $\frac{245}{244}$ on efficient approximability for this problem unless $\PP=\text{\rm NP}$. Additionally, we provide a generic method how to prove APX-hardness for other graph optimization problems in $d$-box graphs for any fixed $d\geq 3$.
TERA: topic-based event routing for peer-to-peer architectures
Authors: Roberto Baldoni, Roberto Beraldi, Vivien Quema, Leonardo Querzoni, Sara Tucci-Piergiovanni
Venue: Proceedings of the 2007 inaugural international conference on Distributed event-based systems (2007)

The completely decoupled interaction model offered by the publish/subscribe communication paradigm perfectly suits the interoperability needs of todays large-scale, dynamic, peer-to-peer applications. The unmanaged environments, where these applications are expected to work, pose a series of problems (potentially wide number of partipants, low-reliability of nodes, absence of a centralized authority, etc.) that severely limit the scalability of existing approaches which were originally thought for supporting distributed applications built on the top of static and managed environments. In this paper we propose an architecture for implementing the topic-based publish/subscribe paradigm in large scale peer-to-peer systems. The architecture is based on clustering peers subscribed to the same topic. The major novelty of this architecture lies in the mechanism employed to bring events from the publisher to the cluster (namely outer-cluster routing). The evaluation shows that this mechanism for outer-cluster routing has a probability to bring events to the destination cluster very close to 1 while keeping small the involved number of out-of-cluster peers. Finally, the overall architecture is shown to be scalable along several fundamental dimensions like number of participants, subscriptions, and to exhibit a fair load distribution (load distribution closely follows the distribution of subscriptions on nodes).
Understanding as We Roam
Authors: Declan O'Sullivan, Vincent Wade, David Lewis
Venue: IEEE Internet Computing (2007)

Increasingly, the problem for roaming users isn't discovering local Web services or local context information or even getting theirapplications to interoperate with them at a syntactic level, but rather achieving interoperation at a semantic level. Developers arebeginning to use Semantic Web technologies such as ontologies to expose the semantics of context models and Web services. However, different ontologies arise due to natural human diversity in modeling domains. It's therefore important to develop mappingsbetween ontologies. This article describes a practical ontology-mapping process specified in the Unified Modeling Language, as well asits deployment.
Novel approaches to end-to-end packet reordering measurement
Authors: Xiapu Luo, Rocky K. C. Chang
Venue: Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement (2005)

By providing the best-effort service, the Internet Protocol (IP) does not maintain the same order of packets sent out by a host. Therefore, due to the route change, parallelism inside a switch, and load-balancing schemes, IP packets can be received in an order different from the original one. Such packet reordering events could cause serious performance degradation in TCP and UDP applications. As a result, a number of measurement methods have recently been proposed to enable any Internet host to detect packet reordering from itself to another host. However, these methods have encountered a number of practical difficulties, such as rate-limiting and filtering imposed on ICMP and TCP SYN packets. Moreover, some of the methods cannot detect packet reordering in all scenarios. In this paper we present three new methods for end-to-end packet reordering measurement. Since these methods are based on the TCP data channel, the probing and response messages will not be affected by any intermediaries on an Internet path. We have validated and tested the methods in 20 most common systems and implemented them in a tool called POINTER. We also present measurement results obtained from 200 websites in the Internet.
SVC-Based Multivariate Control Charts for Automatic Anomaly Detection in Computer Networks
Authors: Zhisheng Zhang, Xuejun Zhu, Jionghua Jin
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

The design of multivariate control charts for automatic anomaly detection in computer networks is a challenging research issue due to the complexity of the data structure of the network operational data. In general, the design of statistical multivariate control charts is limited to a Gaussian distribution assumption or a pre-known probability distribution model, which is hardly applicable to the computer operation data. The paper is motivated by this timely need to develop SVC (support vector clustering) based multivariate control charts, which do not require the data to have a pre-known probability distribution model. The proposed method is validated through the simulations by comparing with the popularly used statistical T^2 multivariate control charts. The effectiveness of the method is also demonstrated through automatic anomaly detection of typical computer intrusions.
Understanding students' problem-solving performance in the context of programming-in-the-small: an ethnographic field study
Authors: T. N. Arvanitis
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

An ethnographic approach was applied to identify problem solving skills used in software design. The individual and groups of students were observed resolving software design problems. This was in the context of programming-in-the-small. A heuristic analysis was generated from these observations and the students' laboratory books. The analysis identified only 35% of the students formally created designs using abstraction and decomposition methods. 85% of the students completed their software design problems with no recourse to any conceptual design. These latter students could not formally verify their software. A further problem was recognized where 65% of the students were unable to differentiate between syntactic and semantic errors. The paper concludes with the importance of these findings fir the design of programming and software engineering curricula.