ppxscal/embedding_network huggingface dataset:
autoMAC: A Tool for Automating Network Moves, Adds, and Changes
Authors: Christopher J. Tengi, James M. Roberts, Joseph R. Crouthamel, Chris M. Miller, Christopher M. Sanchez
Venue: Proceedings of the 18th USENIX conference on System administration (2004)

It is often difficult and time-consuming to manage computer 'moves, adds, and changes' that take place in a switched, subnetted environment. It is even more difficult when the accepted network policy requires that a computer be configured and always connected to the network on a specific Virtual LAN (VLAN) based on its usage. An on-going problem is to keep all of the network host information up-to- date, and to ensure that hosts always land on the correct subnet when they are plugged into switch ports. Utilizing some freely-available tools, as well as some home-grown software, we have built a system that automates a number of the tasks associated with moves, adds, and changes.
Virtual surgery using a deformable organ model created by the sphere-filled method
Authors: Shigeyuki Suzuki, Naoki Suzuki, Asaki Hattori, Akihiko Uchiyama
Venue: Systems and Computers in Japan (2004)

We are developing a virtual surgery system to conduct realistic surgical procedures in a virtual world; its purpose is to master and practice surgical techniques and to improve planning for operations. In this study, we present a deformable organ model created using the sphere-filled method. Further, we equipped this model with senses of touch and force by connecting it to a force feedback device. The result was that the sphere-filled model allowed our system to perform various physical manipulations, including blood vessel deformation. In addition, by applying tactile sensations in virtual space our system provided the user-surgeon with a realistic simulation. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(13): 1&ndash;9, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10689
Variable neighborhood search for the maximum clique
Authors: Pierre Hansen, Nenad Mladenović, Dragan Urošević
Venue: Discrete Applied Mathematics (2004)

Maximum clique is one of the most studied NP-hard optimization problem on graphs because of its simplicity and its numerous applications. A basic variable neighborhood search heuristic for maximum clique that combines greedy with the simplicial vertex test in its descent step is proposed and tested on standard test problems from the literature. Despite its simplicity, the proposed heuristic outperforms most of the well-known approximate solution methods. Moreover, it gives solution of equal quality to those of the state-of-the-art heuristic of Battiti and Protasi in half the time.
Maran Illustrated Office 2003
Authors: Ruth Maran
Venue:  (2005)

Coverage includes- Features a unique two-page spread, over 700 full-color screen shots, illustrations, and useful tips that appeal to and engage visual learners and simplify the learning process. Provides extensive coverage of the latest version of Microsoft Office, Office 2003, including sections on Word, Excel, PowerPoint, Publisher, and Outlook, along with additional Getting Started with Office and Internet sections. Uses simple, easy-to-understand, and concise text and covers over 140 essential topics, making it a great reference for all skill levels. Written using "Visual Grammar™," a proven method that combines instructions with full-color screen shots to provide the best synergistic learning experience available. All examples contained in the book are available for download at www.maran.com.
Testing of Resistive Opens in CMOS Latches and Flip-Flops
Authors: Victor H. Champac, Antonio Zenteno, Jose L. Garcia
Venue: Proceedings of the 10th IEEE European Symposium on Test (2005)

Open defects in CMOS memory elements are investigated. The analysis has been carried-out in a class of symmetrical CMOS flip-flop. Main focus is given to high resistive opens in gates. These defects depend on initial conditions prior to the application of the test vectors. Test conditions influencing the detectability of opens in scan path chains are also analyzed. Some sequences of 1ýs and 0ýs may fail for detecting opens in gates. Conditions for the input sequences for scan path chains are stated. The dependence of the detectability of opens on the duty cycle is also investigated. Experimental results showing the dependence of the behavior of open gates with the initial conditions are shown.
Patterns in words and languages
Authors: G. Castiglione, A. Restivo, S. Salemi
Venue: Discrete Applied Mathematics (2004)

A word p, over the alphabet of variables E, is a pattern of a word w over A if there exists a non-erasing morphism h from E* to A* such that h(p)=w. If we take E=A, given two words u, v ∈ A*, we write u ≤ v if u is a pattern of v. The restriction of ≤ to aA*, where A is the binary alphabet {a, b}, is a partial order relation. We introduce, given a word v, the set P(v) of all words u such that u ≤ v. P(v), with the relation ≤, is a poset and it is called the pattern poset of v. The first part of the paper is devoted to investigate the relationships between the structure of the poset P(v) and the combinatorial properties of the word v. In the last section, for a given language L, we consider the language P(L) of all patterns of words in L. The main result of this section shows that, if L is a regular language, then P(L) is a regular language too.
Effects of culture on control mechanisms in offshore outsourced IT projects
Authors: Ravi Narayanaswamy, Raymond M. Henry
Venue: Proceedings of the 2005 ACM SIGMIS CPR conference on Computer personnel research (2005)

In spite of the increasing trend of offshore outsourcing in the IT industry, there has been little attention given to control strategies for managing offshore IT development. This paper offers an analysis of the relationship between national culture and control mechanisms, which is particularly important in the offshore systems development context. Control is defined as an attempt made by an organization to ensure that individuals act according to an agreed upon strategy to achieve desired objectives. This paper uses four modes of control that have been previously applied to information systems development - formal (outcome, behavior) and informal (clan, self) - in the offshore context. The dimensions of national culture studied are based on Hofstede's work and include individualism (vs. collectivism), uncertainty avoidance, and power distance. The objective of this research is to address the effect of national cultural differences on control mechanisms. Propositions regarding the relationship between cultural dimensions and modes of control used in offshore-outsourced ISD project are presented. This work draws from three distinct research streams - control, outsourcing, and culture. This work proposes portfolios of control that contain a mix of control mechanisms which should be implemented depending on the cultural settings involved.
ARC based superpaging
Authors: Yair Wiseman
Venue: ACM SIGOPS Operating Systems Review (2005)

This paper explores the use of the ARC algorithm for swapping policy in superpaging systems. The different page sizes can affect the algorithm and as a result the algorithm will not be as effective as the original one for traditional paging systems. We suggest to modify the threshold of the ARC algorithm, so it will give more weight to the frequently accessed pages and less weight to the recent pages.
Using CSP to verify sequential consistency
Authors: Gavin Lowe, Jim Davies
Venue: Distributed Computing (1999)

This paper shows how the theory of Communicating Sequential Processes (CSP) can be used to establish that a protocol guarantees sequential consistency. The protocol in question is an accepted design based upon lazy caching; it is an ideal example for the comparison of different formal description techniques.
VisionMark: A media linking method creating synergy of information transmission media and the Internet
Authors: Kento Miyaoku, Hiroki Shigeyoshi, Akihito Akutsu, Yoshinobu Tonomura
Venue: Systems and Computers in Japan (2004)

&ldquo;VisionMark&rdquo; is a media linking method for accessing Web content related to information transmission media such as broadcasts or publications. It displays objects called &ldquo;VisionMarks&rdquo; that indicate Web content linked to the information transmission medium being viewed by the user. Users can use VisionMarks to refer to the linked Web content, and can store or send VisionMarks to other users. This allows users to easily make the best use of Web-content-linked information transmission media. We show how to implement an Internet application linking information transmission media with Web content by using VisionMarks. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(6): 20&ndash;30, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10606
Forensic Analysis of File System Intrusions Using Improved Backtracking
Authors: Sriranjani Sitaraman, S. Venkatesan
Venue: Proceedings of the Third IEEE International Workshop on Information Assurance (2005)

Intrusion detection systems alert the system administrators of intrusions but, in most cases, do not provide details about which system events are relevant to the intrusion and how the system events are related. We consider intrusions of file systems. Existing tools, like BackTracker, help the system administrator backtrack from the detection point, which is a file with suspicious contents, to possible entry points of the intrusion by providing a graph containing dependency information between the various files and processes that could be related to the detection point. We improve such backtracking techniques by logging certain additional parameters of the file system during normal operations (real-time) and examining the logged information during the analysis phase. In addition, we use data flow analysis within the processes related to the intrusion to prune unwanted paths from the dependency graph. This results in significant reduction in search space, search time, and false positives. We also analyze the effort required in terms of storage space and search time.
Secure Distributed Computing on a Java Card" Grid
Authors: Serge Chaumette, Pascal Grange, Achraf Karray, Damien Sauveron, Pierre Vigneras
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 5 - Volume 06 (2005)

More and more pieces of hardware are being connected to the Internet every day. Technologies such as Bluetooth or Wi-Fi make this evolution even faster. To make these equipments cooperate and communicate with each other several paradigms such as mobile codes, mobile agents and remote procedure calls are particularly well adapted. These paradigms enable to execute a code that is either coming from somewhere over the network, or that is local but managed remotely. Security is then one of the main concerns that has to be dealt with. We believe that smart cards, and more precisely Java Cards can help to cope with this challenge. This is a position paper where we present the first results obtained on a Java Card based platform that we have set up for experimentation purpose. These experiments raise many questions we are currently working on.
Why I Want a Gradient Camera
Authors: Jack Tumblin, Amit Agrawal, Ramesh Raskar
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

We propose a camera that measures static gradients instead of static intensities. Quantizing sensed intensity differences between adjacent pixel values permits an ordinary A/D converter to measure detailed high contrast (HDR) scenes. We measure alternating ýcliquesý of sensors (small groups) that locally determine their own best exposure, and reconstruct the image using a Poisson solver. This intrinsically differential design suppresses common-mode noise, hides and smoothes quantization, and can correct for its own saturated sensors. Simulations demonstrate these capabilities in side-by-side comparisons.
The Effect of Retransmitted Packet Size Preservation Property on TCP Goodput over Links with Bernoulli Bit-Errors
Authors: Takashi Ikegawa, Yukio Takahashi
Venue: Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (2005)

In this paper, we investigate the effect of the retransmitted packet size preservation (RPSP) property on TCP performance over links with Bernoulli bit-errors, where RPSP-means that the sizes of all packets transferred over datalinks (referred to as transferred packets) with the same sequence-number at retransmissions are equal to the size of a packet generated from a message at the original transmission (namely, generated packet). To achieve this, we present a Markov model for size-sequences of the generated and transferred packets, in which the TCP message-segmentation and error-recovery functions with RPSP are taken into account, respectively. Furthermore, we derive the round-trip time and the transferred packet corruption probability, which are the main parameters of TCP performance. Applying them to the conventional TCP-Reno send-rate formula, we discuss the effect of RPSP on TCP-Reno goodput. The key findings from the numerical results include that RPSP cannot be negligible for networks that suffer from a high bit-error rate (e.g., 1 × 10^-4, which is the mean bit-error rate of a wireless link in an industrial environment), when the message-segmentation occurrence probability is relatively small.
For geometric inference from images, what kind of statistical model is necessary?
Authors: Kenichi Kanatani
Venue: Systems and Computers in Japan (2004)

In order to promote mutual understanding with researchers in other fields including statistics, this paper investigates the meaning of statistical methods for geometric inference based on image feature points. We trace back the origin of feature uncertainty to image processing operations and discuss the meaning of geometric fitting, geometric model selection, the geometric AIC, and the geometric MDL. Then, we discuss the implications of asymptotic analysis in reference to nuisance parameters, the Neyman-Scott problem, and semiparametric models and point out that application of statistical methods requires careful considerations about the peculiar nature of geometric inference. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(6): 1&ndash;9, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10635
The grammatical function analysis between Korean adnoun clause and noun phrase by using support vector machines
Authors: Songwook Lee, Tae-Yeoub Jang, Jungyun Seo
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 1 (2002)

This study aims to improve the performance of identifying grammatical functions between an adnoun clause and a noun phrase in Korean. The key task is to determine the relation between the two constituents in terms of such functional categories as subject, object, adverbial, and appositive. The problem is mainly caused by the fact that functional morphemes, which are considered to be crucial for identifying the relation, are frequently omitted in the noun phrases. To tackle this problem, we propose to employ the Support Vector Machines(SVM) in determining the grammatical functions. Through an experiment with a tagged corpus for training SVMs, the proposed model is found to be useful.
Fair operation of multi-server and multi-queue systems
Authors: David Raz, Benjamin Avi-Itzhak, Hanoch Levy
Venue: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2005)

This work aims at studying the fairness of multi-queue and multi-server queueing systems. We deal with the issues of queue-multiplicity, queue joining policy and queue jockeying and use a quantitative measure (RAQFM) to evaluate them. Our results yield the relative fairness of the mechanisms as a function of the system configuration and parameters. Practitioners can use these results to quantitatively account for system fairness and to weigh efficiency aspects versus fairness aspects in designing and controlling their queueing systems. In particular, we quantitatively demonstrate that: 1) Joining the shortest queue increases fairness, 2) A single "combined" queue system is more fair than "separate" (multi) queue system and 3) Jockeying from the head of a queue is more fair than jockeying from its tail.
Productivity Change, Technical Progress, and Relative Efficiency Change in the Public Accounting Industry
Authors: Rajiv D. Banker, Hsihui Chang, Ram Natarajan
Venue: Management Science (2005)

We present evidence on components of productivity change in the public accounting industry toward the end of the 20th century. Using revenue and human resource data from 64 of the 100 largest public accounting firms in the United States for the 1995-1999 period, we analyze productivity change, technical progress, and relative efficiency change over time. The average public accounting firm experienced a productivity growth of 9.5% between 1995 and 1999. We find support for the hypothesis that technical progress rather than an improvement in relative efficiency was the reason for this productivity growth. Firms that were early movers into management advisory services (MAS) and those that emphasized growth in MAS over growth in the traditional audit and tax services enjoyed significantly higher productivity growth than their peers. These firms also contributed significantly more to the industry's technical progress.
Improvements of oxide-chemical mechanical polishing performances and aging effect of alumina and silica mixed abrasive slurries
Authors: Yong-Jin Seo, Woo-Sun Lee, Pochi Yeh
Venue: Microelectronic Engineering (2004)

In this paper, in order to investigate the effects of agglomeration on the chemical mechanical polishing (CMP) performance of oxide layer using mixed abrasive slurry (MAS), we have studied an aging effect as a function of different slurry composition. Also, the effects of each slurry composition on the oxide CMP characteristics were investigated to obtain the higher removal rate and lower within-wafer non-uniformity (WIWNU). We prepared the various kinds of MAS. In order to save the cost of slurry, the original slurry was diluted by de-ionized water. Alumina (Al"2O"3) abrasives were added before and after annealing in the diluted silica slurry in order to promote the mechanical force of diluted slurry. As an experimental result, the CMP characteristics of 1:10 diluted silica slurry containing 1500 ^oC-annealed alumina abrasives of 0.5 wt% showed excellent removal rate and WIWNU. We think that it is due to the increase of mechanical strength of alumina abrasive particles after annealing. At the same time, we can anticipate the saving of high-cost CMP slurry for ULSI fabrication industry.
A safe and generic model for synchronizing divergent data
Authors: Gérald Oster, Pascal Molli, Hala Skaf-Molli, Abdessamad Imine
Venue: Proceedings of the 1st French-speaking conference on Mobility and ubiquity computing (2004)

La r&eacute;conciliation de donn&eacute;es divergentes est un des probl&egrave;mes clefs de l'informatique mobile, ainsi que des syst&egrave;mes de gestion de configuration. Malgr&eacute; le nombre important de synchroniseurs et d'outils de fusion qui traitent ce probl&egrave;me, aucun crit&egrave;re de correction d'un processus de synchronisation n'existe.Dans cet article, nous proposons d'utiliser le mod&egrave;le des transform&eacute;es op&eacute;rationnelles pour raisonner sur la synchronisation de donn&eacute;es divergentes. Nous pr&eacute;sentons un algorithme et des fonctions de transformation qui r&eacute;alisent la r&eacute;conciliation d'un syst&egrave;me de fichiers. Contrairement aux autres synchroniseurs, notre syst&egrave;me garantit des propri&eacute;t&eacute;s bien d&eacute;finies telles que la convergence et le respect de la causalit&eacute;. Il est &eacute;galement extensible &agrave; d'autres types de donn&eacute;es.
Estimations on the Security Aspect of Brand's Electronic Cash Scheme
Authors: Chang Yu Cheng, Jasmy Yunus, Kamaruzzaman Seman
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

In Cryptoý93, Stefan Brands [1] proposed a very efficient off-line electronic cash. Then, the subsequent researchers such as Ernest Foo [2,3], WK Yip [4] and Yiannis [5] developed their schemes based upon Brands model [1] to improve Brandýs efficiency. In this paper, we demonstrate the feasibility of attacks on Brands schemeýs security aspect. By our attacks presented here, we conclude the security aspect of [1,2,3,4,5] has been defeated by us. Although we address here that Brandýs security aspect need to be further investigated, but the anonymous feature in Brandýs scheme [1] remain significant contributions to electronic cash, especially for privacy reason.
Ten CAD Challenges
Authors: David J. Kasik, William Buxton, David R. Ferguson
Venue: IEEE Computer Graphics and Applications (2005)

The computer-aided design (CAD) industry has reached a significant plateau. A few large companies dominate the marketplace and provide excellent systems for a targeted clientele. A number of smaller companies understand how to provide functional extensions that make the systems better for specific user communities. This article discusses the most significant technical challenges the CAD industry and the research community face today. We take a further step and present an approach to addressing the challenges in a way we believe will improve CAD systems' effectiveness and, more importantly, make results accessible to a larger user community.
Design and implementation of a feedback controller for slowdown differentiation on internet servers
Authors: Jianbin Wei, Cheng-Zhong Xu
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Proportional slowdown differentiation (PSD) aims to maintain slowdown ratios between different classes of clients according to their pre-specified differentiation parameters. In this paper, we design a feedback controller to allocate processing rate on Internet servers for PSD. In this approach, the processing rate of a class is adjusted by an integral feedback controller according to the difference between the target slowdown ratio and the achieved one. The initial rate class is estimated based on predicted workload using queueing theory. We implement the feedback controller in an Apache Web server. The experimental results under various environments demonstrate the controller's effectiveness and robustness.