ppxscal/embedding_network huggingface dataset:
Aspect-Oriented Model-Driven Development for Mobile Context-Aware Computing
Authors: Andrew Carton, Siobhan Clarke, Aline Senart, Vinny Cahill
Venue: Proceedings of the 1st International Workshop on Software Engineering for Pervasive Computing Applications, Systems, and Environments (2007)

The development of applications for pervasive computing presents a number of challenges to the software engineer. In particular, application adaptation based on context such as environmental factors, device limitations and connectivity, requires the programmer to handle a complex combination of factors that manifest themselves throughout the application. This position paper presents an approach to managing such complexity based on a combination of aspect-oriented development techniques, and modeldriven development.
Adaptively weighted vector-median filters for motion-fields smoothing
Authors: L. Alparone
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

In the field of video coding the issues of backward prediction and standards conversion have focused an increasing attention towards techniques for an effective estimation of the true interframe motion. The problem of restoration of motion vector-fields computed by means of a standard block matching algorithm is addressed. The restoration must be carried out carefully by exploiting both the spatial correlation of the vector-field, and the significance of the obtained vectors as measures of the reliability of the previous estimation step. A novel approach matching both the above requirements is presented. Based on the theory of vector-median filters an adaptive scheme is developed and results are discussed.
Interface translation and implementation filtering
Authors: Mark A. Linton, Douglas Z. Pan
Venue: Proceedings of the 6th conference on USENIX Sixth C++ Technical Conference - Volume 6 (1994)

Separating interface from implementation in C++ requires a set of conventions for defining classes. Using an interface definition language, we can ensure that an interface does not contain any implementation details. To simplify the definition of separate interfaces, the translator that generates C++ class declarations should be flexible and convenient to use. As part of the Fresco user interface system, we have developed an interface translator called Ix. In addition to generating C++ classes and stubs for distributed access, Ix can "filter" implementation code to automate as much of the code as possible. Filtering also gives the programmer more control over where and how the code is generated. We have built an initial implementation of Fresco using Ix, and our experience has been that using Ix has made programming with interfaces easier than using C++ directly.
CppTest: A Prototype Tool for Testing C/C++ Programs
Authors: Chengying Mao, Yansheng Lu
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Software testing is a practical activity combined with theory, technology, tool, and management. Assistant tool for testing plays an important role in software development in practice, and should not be neglected. Taking the popularly used C and C++ programs as the test objects, this paper explores how to implement a semi-automatic tool (named CppTest) with the testing capability in three levels, namely (1) structural testing in method level, (2) state-based class level testing through modeling state transition behaviors using an extended finite state machine (EFSM), and (3) system level black-box testing with some traditional strategies. During the later debugging stage, the prototype system can perform clustering analysis on the failure executions and sample fairly few representative test executions to direct program diagnosis. CppTest mainly possesses the merits as follows: (1) multi-levels' testing support, (2) high automation and visualization, (3) test project management, and (4) favorable scalability. In addition, some future research directions are also explored.
Profiling Computation Jobs in Grid Systems
Authors: Michael Oikonomakos, Kostas Christodoulopoulos, Emmanouel (Manos) Varvarigos
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

The existence of good probabilistic models for the job arrival process and job characteristics is important for the improved understanding of grid systems and the prediction of their performance. In this study, we present a thorough analysis of the job inter-arrival times, the waiting times at the queues, the execution times, and the data sizes exchanged at the kallisto.hellasgrid.gr cluster, which is part of the EGEE Grid infrastructure. By computing the Hurst parameter of the inter-arrival times we find that the job arrival process exhibits self-similarity/long-range dependence. We also propose simple and intuitive models for the job arrival process and the job execution times. The models proposed were validated and were found to be in very good agreement with our empirical measurements.
Nomadic Service Assignment
Authors: Edward Bortnikov, Israel Cidon, Idit Keidar
Venue: IEEE Transactions on Mobile Computing (2007)

We consider the problem of dynamically assigning application sessions of mobile users or user groups to service points. Such assignments must balance the trade-off between two conflicting goals. On the one hand, we would like to connect a user to the closest server in order to reduce network costs and service latencies. On the other hand, we would like to minimize the number of costly session migrations, or handoffs, between service points. We tackle this problem using two approaches. First, we employ algorithmic online optimization to obtain algorithms whose worst-case performance is within a factor of the optimal. Next, we extend them with opportunistic heuristics that achieve near-optimal practical average performance and scalability. We conduct case studies of two settings where such algorithms are required: wireless mesh networks with mobile users and wide-area groupware applications with or without mobility.
Vector processing in scalar processors for signal processing algorithms
Authors: M. T. Brady
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

Product requirements often dictate the use of off-the-shelf processors for very fast signal processing applications. Additionally, restrictions on cost, power, or size/weight may preclude the use of specialized vector processors for implementation of the algorithms. We discuss a new method for performing signed parallel processing in scalar, off-the-shelf processors for integerized signal processing algorithms. Uniform data precision may be used, but is not required for the method. It is shown that the reduction in execution cycles resulting from this implementation is approximately linear in the size of the registers, divided by the precision required.
Metrics for Measuring the Effectiveness of Decompilers and Obfuscators
Authors: Nomair A. Naeem, Michael Batchelder, Laurie Hendren
Venue: Proceedings of the 15th IEEE International Conference on Program Comprehension (2007)

Java developers often use decompilers to aid reverse engineering and obfuscators to prevent it. Decompilers translate low-level class files to Java source and can produce "good" output. Obfuscators transform class files into semantically-equivalent versions that are either: (1) difficult to decompile, or (2) decompilable, but result in "hardto- understand" Java source. We present a set of metrics developed to quantify the effectiveness of decompilers and obfuscators. The metrics include some selective size and counting metrics and an expression complexity metric. We have applied these metrics to evaluate a collection of decompilers and obfuscators. By quantitatively comparing original Java source against decompiled and obfuscated code respectively, we show which decompilers produce "good" code and whether obfuscations result in "hard-to-understand" code.
The Services Paradigm: Who Can You Trust?
Authors: Jeff Voas, Phil Laplante
Venue: IT Professional (2007)

The interconnected services and trust trends merge physical and nonphysical entities into a single viewpoint from which trust must be defined.
Compiler-Directed Code Restructuring for Operating with Compressed Arrays
Authors: T. Yemliha, G. Chen, O. Ozturk, M. Kandemir, V. S. Degalahal
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

Memory system utilization is an important issue for many embedded systems that operate under tight memory limitations. This is a strong motivation for recent research on reducing the number of banks required during execution of a given application. Reducing memory space requirements of an application can bring three potential benefits. First, if we are to design a customized memory system for a given embedded application, reducing its memory requirements can cut the overall cost. Second, if we are to execute our application in a multiprogrammed environment, the saved memory space can be used by other applications, thereby increasing the degree of multiprogramming. Third, it is also possible to reduce the energy consumption in a banked memory system by reducing the amount of memory space occupied by application data and placing the unused banks into low-power operating modes. This paper proposes a novel memory saving strategy for array-dominated embedded applications. The idea is to exploit the value locality in array data (e.g., those from the multi-media domain) by storing arrays in a compressed form to save memory space. Based on the compressed forms of the input arrays, our compilerbased approach automatically determines the compressed forms of the intermediate and output arrays and also automatically restructures the application code so that we can also reduce execution time (by exploiting value locality). Our experimental results show that this scheme is very effective in practice and reduces the memory space requirements of the applications tested by 19% on average. The experimental results also show that the proposed approach reduces the execution cycles of the original codes by 14% on average.
Integrating information technology and programming in a freshmen computer science course
Authors: D. R. Raymond
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

All 1100 first-year students at the US Military Academy at West Point are required to take the course CS105 ("Introduction to Computing"), in which we teach basic information technology (IT) concepts and introduce the cadets to problem solving that forms the foundation of the engineering design methodology. The cadets must leave our course with enough understanding to thrive as students and officers in an increasingly digitized Army, and our goal is to integrate the IT (particularly networking) and programming lessons without sacrificing understanding of problem solving and basic programming constructs. By teaching problem-solving in the IT domain, instead of teaching IT and programming in distinct phases, we hope the synergy will provide a deeper understanding of information infrastructures. We ran a pilot during the Spring term of the academic year 1999-2000 to evaluate our success at achieving synergy between the IT and programming topics. The results from the pilot are very encouraging. Based on subjective evaluations by instructors and term-end exam results, it seems that we've achieved our goal of improving the cadets' understanding of both IT and problem-solving concepts. 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
Solving games
Authors: M. J. H. Heule, L. J. M. Rothkrantz
Venue: Science of Computer Programming (2007)

We introduce an alternative concept to determine the solvability of two-player games with perfect information. This concept - based on games currently solved - claims that the applicable solving procedures have a significant influence on the solvability of games. This contrasts with current views that suggest that solvability is related to state-space and game-tree complexity. Twenty articles on this topic are discussed, including those that describe the currently obtained solutions. Results include a description of the available solving procedures as well as an overview of essential techniques from the past. Besides well-known classic games, the solvability of popular and recent games zertz, dvonn, and yinsh are analyzed. We conclude that our proposed concept could determine the solvability of games more accurately. Based on our concept, we expect that new solving techniques are required to obtain solutions for unsolved games.
Adaptive decorrelation filtering for separation of co-channel speech signals from m>2 sources
Authors: Kuan-Chieh Yen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

The ADF algorithm for separating two signal sources by Weinstein, Feder, and Oppenheim (1993) is generalized for separation of co-channel speech signals from more than two sources. The system configuration, its accompanied ADF algorithm, and the choice of adaptation gain are derived. The applicability and limitation of the derived algorithm are also discussed. Experiments were conducted for separation of three speech sources with the acoustic paths measured from an office environment, and the algorithm was shown to improve the average target-to-interference ratio for the three sources by approximately 15 dB.
Multi-aspect target identification with wave-based matching pursuits and continuous hidden Markov models
Authors: P. Runkle
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

A wave-based matching-pursuits algorithm is used to parse multi-aspect time-domain backscattering data into its underlying wavefront-resonance constituents, or features. Consequently, the N multi-aspect waveforms under test are mapped into N feature vectors, y/sub n/. Target identification is effected by fusing these N vectors in a maximum-likelihood sense, which we show, under reasonable assumptions, can be implemented via a hidden Markov model (HMM). The algorithm performance is assessed by considering measured acoustic scattering data from five similar submerged elastic targets.
Panel Topic: Education and Interdisciplinary Issues in Digital Forensics, Computer Science and Judicial Process
Authors: Michael Losavio
Venue: Proceedings of the Second International Workshop on Systematic Approaches to Digital Forensic Engineering (2007)

This panel will review issues associated with the development of an interdisciplinary educational program on digital forensics practice, computer science and judicial process.
Open information pools
Authors: Johan Pouwelse
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (2000)

On the WWW it is not possible to supplement existing web pages of other people with new information or a link to that information, because the WWW does not have a standard method for write access. With write access, information can be added in the right context, which eases searching. We therefore define Open Information Pools: a collection of WWW based databases with public write access. By using databases we add structure to the information. Each database deals with a specific topic. We developed an architecture to support Open Information Pools. Important elements in the architecture are the rating and moderation tools. With these tools the user group is able to maintain and update the database and also to prevent errors and abuse. We conducted measurements on operational rating and moderation tools to show the validity of our idea. The study of Slashdot.org's rating and moderation tools shows that insightful information is recognised after only 37 minutes. We implemented a prototype of a true Open Information Pool containing music information. This database contains biographies, audio CD descriptions, audio CD cover pictures, lyrics of the songs with timing information, and MIDI files. We developed several tools to create, insert and search this database.
Using a co-operative co-evolutionary genetic algorithm to solve optimal control problems in a hysteresis system
Authors: Kittipong Boonlong, Nachol Chaiyaratana, Suwat Kuntanapreeda
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

This paper presents the use of a co-operative co-evolutionary genetic algorithm (CCGA) for solving optimal control problems in a hysteresis system. The hysteresis system is a hybrid control system which can be described by a continuous multivalued state-space representation that can switch between two possible discrete modes. The problems investigated cover the optimal control of the hysteresis system with fixed and free final state/time requirements. With the use of the Pontryagin maximum principle, the optimal control problems can be formulated as optimisation problems. In this case, the decision variables consist of the value of control signal when a switch between discrete modes occurs while the objective value is calculated from an energy cost function. The simulation results indicate that the use of the CCGA is proven to be highly efficient in terms of the minimal energy cost obtained in comparison to the results given by the searches using a standard genetic algorithm and a dynamic programming technique. This helps to confirm that the CCGA can handle complex optimal control problems by exploiting a co-evolutionary effect in an efficient manner.
Balanced allocations: the weighted case
Authors: Kunal Talwar, Udi Wieder
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

We investigate balls-and-bins processes where m weighted balls areplaced into n bins using the "power of two choices" paradigm,whereby a ball is inserted into the less loaded of two randomly chosen bins. The case where each of the m balls has unit weight had been studied extensively. In a seminal paper Azar et.al. showed that when m=n the most loaded bin has Θ(log log n) balls with high probability. Surprisingly, thegap in load between the heaviest bin and the average bin does not increase with m and was shown by Berenbrink etal tobe Θ(log log n) with high probability for arbitrarily large m. We generalize this result to the weighted case where balls have weights drawn from an arbitrary weight distribution. We show that aslong as the weight distribution has finite second moment andsatisfies a mild technical condition, the gap between the weight of the heaviest bin and the weight of the average bin is independent ofthe number balls thrown. This is especially striking whenconsidering heavy tailed distributions such as Power-Law andLog-Normal distributions. In these cases, as more balls are thrown,heavier and heavier weights are encountered. Nevertheless with high probability, the imbalance in the load distribution does notincrease. Furthermore, if the fourth moment of the weight distribution is finite, the expected value of the gap is shown to beindependent of the number of balls.
Computation and Application of Absolute Dominators in Industrial Designs
Authors: Rene Krenz-Baath, Andreas Glowatz, Juergen Schloeffel
Venue: Proceedings of the 12th IEEE European Test Symposium (2007)

Despite the recent advances in ATPG technology computing test patterns for state-of-the-art industrial designs can demand an enormous amount of computation time. Numerous structural techniques were presented to reduce the search space and hence the runtime of state-of-the-art ATPG tools. Absolute dominators introduced by Kirkland and Mercer proved to be useful for finding mandatory observation nodes in a combinational circuit. A mandatory observation node denotes a gate which must be visited in order to propagate a fault to at least one primary output. Unfortunately their algorithm to compute absolute dominators does not scale well on large industrial designs. In this paper we propose a new algorithm to find absolute dominators in circuit graphs. The experimental results show a significant performance improvement with respect to runtime and memory consumption. The achieved speedup of three orders of magnitude on several designs enables the computation of absolute dominators in large industrial circuits in less than a second.
Supporting Compliant and Secure User Handling - A Structured Approach for In-House Identity Management
Authors: Ludwig Fuchs, Gunther Pernul
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

The catchword "compliance" dominates the actual debate about Identity Management and information security like few before. Companies need to comply with a variety of internal and external standards and regulations like the US SOX act. Identity Management is seen as a main provider of compliance in modern companies. However, its organisational aspects are underestimated in many projects, lacking a comprehensive approach to introduce in-house Identity Management. This work is based on the experiences gained from industry projects using Identity Management functionalities to strengthen security and to reach a high level of compliance. We develop a structured process-oriented methodology for introducing an Identity Management Infrastructure for organisations using drivers from IT security management to evaluate, rank, and implement subprojects. The methodology consists of an iterative process which enables even large and unstructured organisations to reach a suitable and profitable level of Identity Management by emphasising on organisational aspects rather than taking a merely technical approach.
Accurate Real-time Identification of IP Prefix Hijacking
Authors: Xin Hu, Z. Morley Mao
Venue: Proceedings of the 2007 IEEE Symposium on Security and Privacy (2007)

We present novel and practical techniques to accurately detect IP prefix hijacking attacks in real time to facilitate mitigation. Attacks may hijack victim's address space to disrupt network services or perpetrate malicious activities such as spamming and DoS attacks without disclosing identity. We propose novel ways to significantly improve the detection accuracy by combining analysis of passively collected BGP routing updates with data plane ingerprints of suspicious prefixes. The key insight is to use data plane information in the form of edge network ingerprinting to disambiguate suspect IP hijacking incidences based on routing anomaly detection. Conflicts in data plane ingerprints provide much more definitive evidence of successful IP pre- fix hijacking. Utilizing multiple real-time BGP feeds, we demonstrate the ability of our system to distinguish between legitimate routing changes and actual attacks. Strong correlation with addresses that originate spam emails from a spam honeypot confirms the accuracy of our techniques.