ppxscal/embedding_network huggingface dataset:
Administering windows NT domains using a non-windows NT PDC
Authors: Gerald Carter
Venue: Proceedings of the 2nd conference on Large Installation System Administration of Windows NT - Volume 2 (1999)

The chronicles kept by an explorer as he or she journeys into new territories can be invaluable for those who come later. The writing describe successes and failures, warning and hints to other possible solutions yet unfound. The evolution of a network is not different than the Lewis and Clark expedition of the early 1800's. Each day we learn something new. Either our proposed solution worked or it did not. It was either a dead-end or perhaps simply a detour. In the Fall of 1997 with the release of Samba version 1.9.18alpha1, the College of Engineering at Auburn University began to experiment with the possibility of using a non-Windows NT machine (i.e. Samba running on a Solaris server) as a Primary Domain Controller for Windows NT desktop clients. This journey has continued through the present and is still progressing. This paper will be a post-narrative of that journey. It is our belief that the administrative models and tools developed to support this environment will also be beneficial in other integrated environments, either in parts or as a whole. This journey will be divided into in five topics: (1) relevant details regarding the configuration of the Samba PDC, (2) user account management, (3) remote file and printer access, (4) remote administration of clients and servers, and (5) the remote updates of systems, applications and associated settings. Each section will remain distinct enough so as to allow the reader to implement the varying portions of this paper independently.
SIP-based VoIP traffic behavior profiling and its applications
Authors: Hun Jeong Kang, Zhi-Li Zhang, Supranamaya Ranjan, Antonio Nucci
Venue: Proceedings of the 3rd annual ACM workshop on Mining network data (2007)

With the widespread adoption of SIP-based VoIP, understanding the characteristics of SIP traffic behavior is critical to problem diagnosis and security protection of IP Telephony. In this paper, we propose a general methodology for profiling SIP-based VoIP traffic behavior at multiple levels: SIP server host, server entity and individual user levels. Using SIP traffic traces captured in a production VoIP service, we illustrate the characteristics of SIP-based VoIP traffic behavior in an operational network and demonstrate the effectiveness of our general profiling methodology. In particular, we show how our profiling methodology can help identify performance anomalies through a case study.
Task automata: Schedulability, decidability and undecidability
Authors: Elena Fersman, Pavel Krcal, Paul Pettersson, Wang Yi
Venue: Information and Computation (2007)

We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes that are computation tasks generated (or triggered) by timed events. Compared with classical task models for real time systems, task automata may be used to describe tasks (1) that are generated non-deterministically according to timing constraints in timed automata, (2) that may have interval execution times representing the best case and the worst case execution times, and (3) whose completion times may influence the releases of task instances. We generalize the classical notion of schedulability to task automata. A task automaton is schedulable if there exists a scheduling strategy such that all possible sequences of events generated by the automaton are schedulable in the sense that all associated tasks can be computed within their deadlines. Our first technical result is that the schedulability for a given scheduling strategy can be checked algorithmically for the class of task automata when the best case and the worst case execution times of tasks are equal. The proof is based on a decidable class of suspension automata: timed automata with bounded subtraction in which clocks may be updated by subtractions within a bounded zone. We shall also study the borderline between decidable and undecidable cases. Our second technical result shows that the schedulability checking problem will be undecidable if the following three conditions hold: (1) the execution times of tasks are intervals, (2) the precise finishing time of a task instance may influence new task releases, and (3) a task is allowed to preempt another running task.
Measurement and analysis of spywave in a university environment
Authors: Stefan Saroiu, Steven D. Gribble, Henry M. Levy
Venue: Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1 (2004)

Over the past few years, a relatively new computing phenomenon has gained momentum: the spread of "spyware." Though most people are aware of spyware, the research community has spent little effort to understand its nature, how widespread it is, and the risks it presents. This paper is a first attempt to do so. We first discuss background material on spyware, including the various types of spyware programs, their methods of transmission, and their run-time behavior. By examining four widespread programs (Gator, Cydoor, SaveNow, and eZula), we present a detailed analysis of their behavior, from which we derive signatures that can be used to detect their presence on remote computers through passive network monitoring. Using these signatures, we quantify the spread of these programs among hosts within the University of Washington by analyzing a week-long trace of network activity. This trace was gathered from August 26th to September 1st, 2003. From this trace, we show that: (1) these four programs affect approximately 5.1% of active hosts on campus, (2) many computers that contain spyware have more than one spyware program running on them concurrently, and (3) 69% of organizations within the university contain at least one host running spyware. We conclude by discussing security implications of spyware and specific vulnerabilities we found within versions of two of these spyware programs.
Maintaining K-Anonymity against Incremental Updates
Authors: Jian Pei, Jian Xu, Zhibin Wang, Wei Wang, Ke Wang
Venue: Proceedings of the 19th International Conference on Scientific and Statistical Database Management (2007)

K-anonymity is a simple yet practical mechanismto protect privacy against attacks of re-identifying individuals by joining multiple public data sources. All existing methods achieving k-anonymity assume implicitly that the data objects to be anonymized are given once and fixed. However, in many applications, the real world data sources are dynamic. In this paper, we investigate the problem of maintaining k-anonymity against incremental updates, and propose a simple yet effective solution. We analyze how inferences from multiple releases may temper the k-anonymity of data, and propose the monotonic incremental anonymization property. The general idea is to progressively and consistently reduce the generalization granularity as incremental updates arrive. Our new approach guarantees the k-anonymity on each release, and also on the inferred table using multiple releases. At the same time, our new approach utilizes the more and more accumulated data to reduce the information loss.
Constrained planar remeshing for architecture
Authors: Barbara Cutler, Emily Whiting
Venue: Proceedings of Graphics Interface 2007 (2007)

Material limitations and fabrication costs generally run at odds with the creativity of architectural design, producing a wealth of challenging computational geometry problems. We have developed an algorithm for solving an important class of fabrication constraints: those associated with planar construction materials such as glass or plywood. Starting with a complex curved input shape, defined as a NURBS or subdivision surface, we use an iterative clustering method to remesh the surface into planar panels following a cost function that is adjusted by the designer. We solved several challenging connectivity issues to ensure that the topology of the resulting mesh matches that of the input surface. The algorithm described in this paper has been implemented and developed in conjunction with an architectural design seminar. How the participants incorporated this tool into their design process was considered. Their important feedback led to key algorithmic and implementation insights as well as many exciting ideas for future exploration. This prototype tool has potential to impact not only architectural design, but also the engineering for general fabrication problems.
Examining the Impacts of Institutional Framework on E-Government Infrastructures: A Study of Hong Kong Experiences
Authors: Chun Yu, Paul Jen-Hwa Hu
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Since the Hong Kong SAR Government promulgated the first Digital 21 IT Strategy in November 1998, multiple major initiatives had been launched to establish the underlying infrastructure for facilitating future development of E-Government in Hong Kong. For increasing effectiveness and efficiency, the Government of Hong Kong SAR adopted different institutional frameworks and management modes to implement and operate each E-Government initiative. This paper studied two closely related and complementary major E-Government infrastructure initiatives in Hong Kong - Public Key Infrastructure (PKI) and Electronic Services Delivery (ESD) - and examined the lessons learned from these cases. The cases were then put under the scrutiny of the four stage model proposed by Layne and Lee and the managed portfolio approach in E-Government sourcing examined by Scholl. Key implications for future EGovernment projects were also discussed to consolidate the experience and generalize the findings to advance the planning and management of EGovernment infrastructure in the future.
Genetic fusion: application to multi-components image segmentation
Authors: C. Rosenberger
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

In this communication, we propose a new approach which enables to fusion either the results of several segmentation methods of a same image or the different results in the case of a multi-components image. The developed method is based on a genetic algorithm approach which allows to combine segmentation results by taking into account their quality through an evaluation criterion. This criterion provides to quantify a segmentation result without any a priori knowledge such as the ground truth. This approach is applied to segment multi-components images by combining the segmentation results of each component. We show the efficiency of the method through some experimental results on several images.
Analog and Hybrid Computation Approaches for Static Power Flow
Authors: Aaron St. Leger, Chika O. Nwankpa
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Analog and hybrid computation methods are areas of continued interest, particularly in specific applications where traditional digital computation techniques cannot achieve the desired performance. One such example and the focus of this paper is steady state power flow analysis of AC power systems. Traditional iterative methods, such as Newton- Raphson, are time and computationally intensive. Significant speed and performance increases can be achieved through pure analog or hybrid (analog and digital) computation approaches. This paper presents a static mathematical model of an AC power system and methods of implementation for both an analog and a hybrid computation scheme. Increased computational performance is achieved through elimination of matrix inversion and iteration by utilizing the inherent parallelism of analog computation. PSpice simulation results verify the power system models and insight is provided on implementation for large scale systems.
Automaton-based Confidentiality Monitoring of Concurrent Programs
Authors: Gurvan Le Guernic
Venue: Proceedings of the 20th IEEE Computer Security Foundations Symposium (2007)

Noninterference is typically used as a baseline security policy to formalize confidentiality of secret information manipulated by a program. In contrast to static checking of noninterference, this paper considers dynamic, automaton-based, monitoring of information flow for a single execution of a concurrent program. The monitoring mechanism is based on a combination of dynamic and static analyses. During program execution, abstractions of program events are sent to the automaton, which uses the abstractions to track information flows and to control the execution by forbidding or editing dangerous actions. All monitored executions are proved to be noninterfering (soundness) and executions of programs that are well-typed in a security type system similar to the one of Smith and Volpano [23] are proved to be unaltered by the monitor (partial transparency).
Platform-scalable Task Partition and Multilevel Buffering in Multi-processor Plessey Corner Detector
Authors: Guan Yu, Gauthier Lafruit, Peter Schelkens
Venue: Proceedings of the Seventh International Conference on Application of Concurrency to System Design (2007)

The Plessey corner detector is a key technological component in scene analysis, stereo matching, and object tracking. Due to its high computation complexity, earlier fast implementations mainly focused on hardware implementations. This paper explores the viability of a multi-processor software implementation. A scalable task partitioning for efficiently mapping the Plessey algorithm on a multi-processor platform is proposed. The task partition ensures platform scalability, low inter-processor communication overhead and a well-balanced workload in each task. In addition, a multilevel buffering scheme is presented, minimizing the external memory accesses in each task to one image pixel read per calculated corner response value. The effectiveness of the proposed task partition and buffering scheme has been verified on (i) a cycle accurate simulator with shared memory and (ii) a multiple-TI-C64 DSP board using a message passing paradigm. The proposed solution combines good platform scalability with an additional 30% speedup gain over straightforward parallelization schemes.
Algebraic structures for fuzzy numbers from categorial point of view
Authors: Alexandru Mihai Bica
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2007)

Using a classic algebraic construction additive and multiplicative structures (as commutative monoids) for fuzzy numbers are obtained. Moreover, we realize here an isomorphism between these structures.
Locality-Aware and Churn-Resilient Load-Balancing Algorithms in Structured Peer-to-Peer Networks
Authors: Haiying Shen, Cheng-Zhong Xu
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

Structured peer-to-peer overlay networks, like distributed hash tables (DHTs), map data items to the network based on a consistent hashing function. Such mapping for data distribution has an inherent load balance problem. Data redistribution algorithms based on randomized matching of heavily loaded nodes with light ones can deal with the dynamics of DHTs. However, they are unable to consider the proximity of the nodes simultaneously. There are other methods that rely on auxiliary networks to facilitate locality-aware load redistribution. Due to the cost of network construction and maintenance, the locality-aware algorithms can hardly work for DHTs with churn. This paper presents a locality-aware randomized load-balancing algorithm to deal with both the proximity and network churn at the same time. We introduce a factor of randomness in the probing of lightly loaded nodes in a range of proximity. We further improve the efficiency by allowing the probing of multiple candidates (d-way) at a time. Simulation results show the superiority of the locality-aware two-way randomized algorithm in comparison with other random or locality-aware algorithms. In DHTs with churn, it performs no worse than the best churn-resilient algorithm. It takes advantage of node capacity heterogeneity and achieves good load balance effectively even in a skewed distribution of items.
Visualising error surfaces for adaptive filters and other purposes
Authors: M. Fisher
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

Modern neural and adaptive systems often have complicated error performance surfaces with many local extrema. Visualising and understanding these surfaces is critical to effective tuning of these systems but almost all visualisation methods are confined to two dimensions. Here we show how to use a morphological scale-space transform to convert these multi-dimensional complex error surfaces into two-dimensional trees where the leaf nodes are local minima and other nodes represent decision points such as saddle points and points of inflection.
Wavelet-based non-parametric HMM's: theory and applications
Authors: L. Couvreur
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

In this paper, we propose a new algorithm for non-parametric estimation of hidden Markov models (HMM). The algorithm is based on a "wavelet-shrinkage" density estimator for the state-conditional probability density functions of the HMM's. It operates in an iterative fashion, similar to the EM re-estimation formulae used for maximum likelihood estimation of parametric HMM. We apply the resulting algorithm to simple examples and show its convergence. The performance of the proposed method is also compared to classical non-parametric HMM estimation based on quantization of observations ("histograms") and discrete HMM. The algorithm is finally applied to a voice activity detection (VAD) task and its performance is compared to that of the histogram and Gaussian HMM methods.
Memory-Efficient Decoding of Variable Length Codes for Monotonic Sources
Authors: Yuriy A. Reznik
Venue: Proceedings of the 2007 Data Compression Conference (2007)

Consider a variable-length code (possibly a Huffman code for some source).
Efficient bytecode verification and compilation in a virtual machine
Authors: Michael Franz
Venue:  (2006)

Applications written in modern dynamic languages such as Java or NET are shipped in the form of high-level intermediate bytecode. A virtual machine (VM) is used on the target machine to verify and execute the code. Many VMs use just-in-time compilation to speed-up the execution of critical code areas for which interpretation alone is not efficient enough. In this dissertation, we explore existing verification and dynamic compilation techniques. These traditional approaches do not work well in resource-constrained environments such as PDAs and cell phones. We propose alternative verification and compilation techniques that were specifically designed for efficient runtime code generation. Our prototype virtual machine can generate code 350 times faster than existing desktop VMs, and is 30 times more memory efficient, yet achieves execution performance that is much higher than that of existing embedded VMs and closer to the performance of heavyweight desktop systems.
Implementing fast javaTM monitors with relaxed-locks
Authors: David Dice
Venue: Proceedings of the 2001 Symposium on JavaTM Virtual Machine Research and Technology Symposium - Volume 1 (2001)

The JavaTM Programming Language permits synchronization operations (lock, unlock, wait, notify) on any object. Synchronization is very common in applications and is endemic in the library code upon which applications depend. It is therefore critical that a monitor implementation be both space-efficient and time-efficient. We present a locking protocol, the Relaxed-Lock, that satisfies those requirements. The Relaxed-Lock is reasonably compact, using only one machine word in the object header. It is fast, requiring in the uncontested case only one atomic compare-and-swap to lock a monitor and no atomic instructions to release a monitor. The Relaxed-Lock protocol is unique in that it admits a benign data race in the monitor unlock path (hence its name) but detects and recovers from the race and thus maintains correct mutual exclusion. We also introduce speculative deflation, a mechanism for releasing a monitor when it is no longer needed.
Problems updating FreeBSD's card system from ISA to PCI
Authors: M. Warner Losh
Venue: Proceedings of the BSD Conference 2002 on BSD Conference (2002)

FreeBSD's 16-bit PC Card implementation has used the ISA legacy interface. PCI support was added by making PCI-CardBus and PCI-PCMCIA bridges behave in ISA compatibility mode. While this technique worked in laptops, it made support of add-in PCI cards with CardBus or PCMCIA bridges impossible. PCI-PC Card bridges are unlike traditional devices because they can have connections to multiple busses, offering both ISA and PCI interrupt routing for them and any devices connected to them. Expanding support to add-in PCI cards with 16-bit PC Cards connected exposed weaknesses in the PC Card implementation of FreeBSD as well as other parts of the system. Vendor BIOS quality, variance in hardware implementation details from standard and weaknesses in the FreeBSD development model made incorporation of these improvements into FreeBSD 4.4-RELEASE difficult. Lessons learned will be incorporated into the 32-bit CardBus support forthcoming in FreeBSD 5.0.
Gender and leadership: men and women's stories
Authors: B. A. Karanian
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

Summary form only given. Looks at gender and leadership using conceptual frameworks from the psychology of women, workplace role and concepts of leadership. There are two modes of thinking-connection and separation-that can be identified and reliably coded in individual's stories of an authority figure. The link between gender, authority figure and leadership is explored through the connected-vs.-separate lens. Men and women are telling stories about a different kind of boss, a new model of authority, and an evolving theory of leadership that is not gender-specific. 52 subjects responded to two instruments: a picture stimulus and a leadership inventory (the Lipman-Blumen-Leavitt Achieving Styles Inventory). Both instruments were utilized to form a story about the boss. Respondents generated stories to a picture with either a male or a female as an authority stimulus. Stories were coded for three imagery areas: connection, separation and hostility. Data was analyzed according to a modified version of the coding scheme developed by Lyons (1983). There were four major findings. (1) Gender was an influence in how leadership is defined. (2) Connected leading was central in the evolving leadership picture of the boss. (3) Separate leading was a male image, mainly applied to the male boss. (4) More hostile boss stories were written by men than by women. The research suggests that gender influences the construction of authority through connected and separate images. Leadership seen in this perspective is a struggle to include connection, along with separation, as an integral and neglected aspect of the ways subordinates understand authority. 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