ppxscal/embedding_network huggingface dataset:
Teaching applet programming to non-majors - virtually
Authors: S. Dexter
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

We discuss the development and deployment of a "partially virtual" computer science course for non-majors in which the Web mediates a significant fraction of the course. In particular, approximately a quarter of the course is dedicated to teaching Java applet programming through the use of a Web-based programming environment. We address the development of the curriculum, the integration of several Web-based tools, and make some preliminary observations about the pedagogical effectiveness of and student response to this approach.
Tightly Connected Hierarchical Interconnection Networks for Parallel Processors
Authors: Peter Thomas Breznay, Mario Alberto Lopez
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

A method for constructing hierarchical in terconnection networks is presented. The method is based on connecting isomorphic clusters using a complete graph as the higher level network. Applying it to various classes of graphs, including hypercubes and meshes, results in networks with optimal connectivity, high bisection width, low degree, diameter and cost. With hypercube clusters, the degree, diameter and cost are approximately | , | and j of the same parameters in a comparable size hy percube. With mesh clusters, the performance parame ters are polynomially better than those in a similar size mesh.
Geographic Routing on Improved Coordinates
Authors: Ulrik Brandes, Daniel Fleischer
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

We consider routing methods for networks when geographic positions of nodes are available. Instead of using the original geographic coordinates, however, we precompute virtual coordinates using a barycentric layout. Combined with simple geometric routing rules, this greatly reduces the lengths of routes and outperforms algorithms working on the original coordinates. Along with experimental results we proof properties such as guaranteed message delivery and worst-case optimality. Our methods apply to static networks in which short routes are important, but memory for full routing tables is not available and the one-time-precomputation is affordable.
Self-complementary two-graphs and almost self-complementary double covers
Authors: Primo Potočnik, Mateja Šajna
Venue: European Journal of Combinatorics (2007)

A graph X is called almost self-complementary with respect to a perfect matching I if it is isomorphic to the graph obtained from its complement X^c by removing the edges of I. A two-graph on a vertex set @W is a collection T of 3-subsets of @W such that each 4-subset of @W contains an even number of elements of T. In this paper we investigate the relationship between self-complementary two-graphs and double covers over complete graphs that are almost self-complementary with respect to a set of fibres. In particular, we classify all doubly transitive self-complementary two-graphs, and thus all almost self-complementary graphs with an automorphism group acting 2-transitively on the corresponding perfect matching.
Formalizing Informal Stakeholder Decisions--A Hybrid Method Approach
Authors: Hasan Kitapci, Barry W. Boehm
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Decisions are hard to make when available information is incomplete, inconsistent, and ambiguous. Moreover, good -- sufficiently complete, consistent, traceable, and testable -- requirements are a prerequisite for successful projects. Without understanding what the stakeholders really want and need and writing these requirements in a concise, understandable and testable manner, projects will not develop what the stakeholders wanted leading to either major late rework or project termination. During the development of the WinWin negotiation model and the EasyWinWin requirements negotiation method, we have gained considerable experience in capturing decisions made by stakeholders in over 100 projects. However, the transition from informal decisions to requirements specification is still a challenging problem. Based on our analysis of the projects to date, we have developed an integrated set of gap-bridging methods as a hybrid method to support stakeholders making better decisions in order to eliminate requirements related problems and ease the process of formality transition.
VWQGRR: A Novel Packet Scheduler
Authors: Linhua Zhong, Jin Xu, Xianlei Wang
Venue: Proceedings of the Sixth International Conference on Networking (2007)

In this paper, we propose a novel grouping strategy of group round robin and an O(1) complexity scheduling algorithm called virtual weighted queue group round robin. Simulation and implementation experiments show that our algorithm can provide better end-to-end delay than traditional group round robin.
Innovative Design Platforms for Reliable SoCs in Advanced Nanometer Technologies
Authors: Davide Pandini
Venue: Proceedings of the 13th IEEE International On-Line Testing Symposium (2007)

An increasing demand for higher performance, lower power density, and greatly expanded functionalities will deter-mine radical changes in the future computing architectures. These widely acknowledged emerging trends are however insufficient to address all the challenges introduced by advanced silicon nanome-ter technologies. It is well known that manufacturability for high yield, along with design productivity and predictability are major problems in gigascale System-on-Chip (SoC) design. Moreover, as technology advances deeper into the nanometer regime, a tight control on process parameters is increasingly difficult. As a con-sequence, variability will be a dominant factor in the design of complex ICs that must be addressed at the technology, circuit, and architecture level. In this talk, we will discuss the impact of sys-tematic and random variations, and we will present a new archi-tecture-to-silicon design platform based on the concept of regular-ity at different levels of abstraction. Moreover, we will also intro-duce an innovative design methodology to synthesize clockless circuits, which can be exploited to implement logic blocks that operate under process, power supply, and temperature variations.
Bounded wait communication for systems with distributed and autonomous components
Authors: Javed I. Khan
Venue:  (2006)

The current Internet is a massively distributed computing system consisting of autonomous entities having diverse and complex behavioral patterns. The Internet includes the web and various other networks like the P2P, grid, and wireless and sensor ad hoc networks. The network-based distributed algorithms that run on these complex networks encounter various forms of unreliability such as deadbeat nodes, unreliable or busy peers, missing messages, authentication failures, intentional non-cooperation, selective cooperation, etc. A system composed of distributed autonomous elements is called the Moody and Autonomous System (MAS). The unreliability of the MAS is inherently different from the packet loss or transport unreliability and has been addressed neither in conventional communication protocols nor in the construct of conventional distributed network algorithms. Thus the distributed network algorithms, designed with the assumption of a 'perfect' distributed system, routinely face severe performance degradations in the 'real' Internet computing environment. One essential way to efficiently address the moodiness property of the MAS is the principle of bounded wait. An entity in the MAS , while running a distributed algorithm, faces the dilemma of duration it should wait for some other entities. If it waits too long, it delays the overall computation completion time or it may even miss the timer deadline of its parent. Conversely, if it waits too short a period, then it may miss communication from many of its children. Consequently, this deteriorates the overall quality of the computation. The dissertation formalizes the multi-way bounded wait principle and provides an optimal timer management scheme for the MAS. It presents simulation results comparing the performance of the optimal scheme with a set of proposed generalized heuristic based timer management schemes. It also presents a reusable framework for communication and computation so that the multi-way timer guided communication model can be used for various distributed network algorithms independent of their computation. It demonstrates the way the framework can be applied to efficiently solve the most frequent occurrences of distributed network algorithms.
Trimming CFG parse trees for sentence compression using machine learning approaches
Authors: Yuya Unno, Takashi Ninomiya, Yusuke Miyao, Jun'ichi Tsujii
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

Sentence compression is a task of creating a short grammatical sentence by removing extraneous words or phrases from an original sentence while preserving its meaning. Existing methods learn statistics on trimming context-free grammar (CFG) rules. However, these methods sometimes eliminate the original meaning by incorrectly removing important parts of sentences, because trimming probabilities only depend on parents' and daughters' non-terminals in applied CFG rules. We apply a maximum entropy model to the above method. Our method can easily include various features, for example, other parts of a parse tree or words the sentences contain. We evaluated the method using manually compressed sentences and human judgments. We found that our method produced more grammatical and informative compressed sentences than other methods.
"IT as a catalyst for human resource re-engineering for knowledge networked environments"
Authors: K. Subramanian
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

With converging of electronics and communication technologies and the integration of voice, data and images has made possible the penetration of information technology to play a major role in human resource re-engineering in the knowledge networked environments. The whole scenario synergises into the concept of providing education or learning on demand and leveraging information and expertise to improve organizational innovation, responsiveness, productivity and competency. The human resource re-engineering assumes greater significance in the new millennium with knowledge management providing a catalytic tool in involving, acquiring, creating, and packaging, distributing, applying and maintaining knowledge databases. This paper deals with certain components of knowledge management emphasizing knowledge networking concepts by means of working out strategic partnerships/alliances with leading organizations which will enable new paradigms for assessing and measuring country's economic empowerment in the totally network global economy. The salient features described in this paper also cover knowledge management, knowledge categories, knowledge types and strategic business objectives and knowledge management and collaboration/alliances/partnerships playing a leading role in the years to come for making one world economy to be predominantly a network and knowledge dependent. 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
New look-ahead algorithm for pipelined implementation of recursive digital filters
Authors: A. K. Shaw
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

A new look-ahead (LA) scheme, referred to as distributed look-ahead (DLA), is proposed for pipelined implementation of recursive digital filters. It is established that in case of many recursive filters, DLA can provide equivalent and stable implementation with reduced pipeline delay and hardware, when compared with existing look-ahead schemes.
Roughness Feeling Telepresence System with Communication Time-D
Authors: Shogo Okamoto, Masashi Konyo, Takashi Maeno, Satoshi Tadokoro
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

A framework of tactile telepresence systems will be proposed in the present paper, which enables active touch with time-delay communication between a tactile sensor side system and a display side system. In the framework, a tactile display system can apply tactile stimuli to fingers of an operator in syncronization with touch motions based on physical parameters of objects which are estimated by a tactile sensor. To verify the concepts of the framework, was developed a roughness feeling telepresence system which produces vibratory stimuli computed by estimated surface wavelength of objects and rubbing speed of an operator. To implement the framework, real-time estimation of physical parameters of objects are required as core technology. System implementation and real-time estimation of surface wavelength will be also proposed.
Virtual-Environment-Based Instrument Development Technology
Authors: Tiantai Guo
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

Nowadays developers of instruments are facing more and more pressures from the market, since the development cycle has to be shortened, and the flexibility of the whole development process needs to be increased. To meet such demands, this paper presents the concept of virtual-environment-based instrument development technology, which is implemented by constructing the instrument in a virtual environment (VE) with appropriate hardware and software supports. This supplies a novel and effective method for the development of instruments, since the user can implore the instrument to be designed before it is made in a 3D virtual environment, and networked development can be easily implemented. Based on the author's previous works on virtual reality(VR), virtual instrument(VI), test and simulation technology, this paper systematically discusses the concept and models of virtual-environment- based instrument development technology, including its theoretical model and simulation model, and finally an example is given to show its initial effect. The conclusion is that virtual-environment- based instrument development technology can become practical and useful in instrument development.
Normalized maximum likelihood model of order-1 for the compression of DNA sequences
Authors: Gergely Korodi, Ioan Tabus
Venue: Proceedings of the 2007 Data Compression Conference (2007)

We present the NML model for classes of models with memory described by first order dependencies. The model is used for efficiently locating and encoding the best regressor present in a dictionary. By combining the order-1 NML with the order- 0 NML model the resulting algorithm achieves a consistent improvement over the earlier order-0 NML algorithm, and it is demonstrated to have superior performance on the practical compression of the human genome.
Proof linking: distributed verification of java classfiles in the presence of multiple classloaders
Authors: Philip W. L. Fong, Robert D. Cameron
Venue: Proceedings of the 2001 Symposium on JavaTM Virtual Machine Research and Technology Symposium - Volume 1 (2001)

To offload the computational burden of bytecode verification within Java Virtual Machines (JVM), distributed verification systems may be created using any one of a number of verification protocols, based on such techniques as proof-carrying code and signed verification by trusted authorities. This paper advocates the adoption of a previously-proposed mobile code verification architecture, proof linking, as a standard infrastructure for performing distributed verification in the JVM. Proof linking not only supports both CLDC-style and signature-based distributed verification protocols, but it also provides interoperability between the two. To ground our work in the real-world requirements of Java bytecode verification, we also extend previous work on proof linking to handle mulitple classloaders.
Improving web availability for clients with MONET
Authors: David G. Andersen, Hari Balakrishnan, M. Frans Kaashoek, Rohit N. Rao
Venue: Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2 (2005)

Despite the increasing degree of multi-homing, path and data redundancy, and capacity available in the Internet, today's clients experience outage rates of a few percent when accessing Web sites. MONET ("Multi-homed Overlay NETwork), is a new system that improves client availability to Web sites using a combination of link multi-homing and a cooperative overlay network of peer proxies to obtain a diverse collection of paths between clients and Web sites. This approach creates many potential paths between clients and Web sites, requiring a scalable way to selecting a good path. MONET solves this problem using a waypoint selection algorithm, which picks a good small subset of all available paths to actively probe. MONET runs on FreeBSD, Linux, and Mac OS X, and is deployed at six different sites. These installations have been running MONET for over one year, serving about fifty users on a daily basis. Our analysis of proxy traces shows that the proxy network avoids between 60% and 94% of observed failures, including access link failures, Internet routing problems, persistent path congestion, and DNS failures. The proxy avoids nearly 100% of failures due to client and wide-area network failures, with negligible overhead.
Graph-DTP: Graph-Based Algorithm for Solving Disjunctive Temporal Problems
Authors: Yuechang Liu, Hong Qian, Yunfei Jiang
Venue: Proceedings of the 14th International Symposium on Temporal Representation and Reasoning (2007)

We study an expressive quantitative temporal model: Disjunctive Temporal Problem (DTP), which was first proposed only in 1998 [5]. As extension of Temporal Constraint Satisfaction Problem (TCSP) [1], DTP differs from TCSP in that two disjuncts in a same disjunctive constraint do not necessarily refer to same temporal variables. Traditionally, most of the DTP algorithms in the literature solve DTPs by treating them as Constraint Satisfaction Problems (CSPs), and searching for solutions using standard CSP techniques, e.g. backtracking, back-jumping, forward checking, semantic branching, removal of subsumed variables, nogood recording [3, 5, 6], etc.
Prime-way Interleaved Memory
Authors: De-Lei Lee
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

In this paper, we study prime-way inter leaved memory in the context of vector multiproces sor systems. Practical, efficient techniques for imple mentation of prime-way interleaved memory are pre sented. A method for minimizing access contention among multiple vector streams is described.
Displaying LiDAR Data for Interactive Web-Based Modelling of the Environment
Authors: John Counsell, Steve Smith
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

The increasing commercial availability of highly accurate LiDAR scanning offers remote sensed data accurate enough for generalized and distant views of the environment. From this data, bare earth digital terrain models (DTMs) can be processed semi-automatically, then draped with aerial imagery. The paper describes an approach developed in the VEPs project that switches on the LiDAR data for trees and buildings removed from the DTM in the 3D Scene. This data can then be used to visually judge the appropriate height and form of buildings and trees. A set of web-based interactive tools have been developed to enable users to freely adjust the scale and mass of structures and vegetation to match the selected point cloud area, substantially improving the quality of presence and accuracy of the resulting model. Issues are raised in obtaining equally accurate data of what is proposed from Planners and Developers.
A Non-Existence Result For Finite Projective Planes In Lenz-Barlotti Class I.4
Authors: Dina Ghinelli, Dieter Jungnickel
Venue: Combinatorica (2007)

Let &#x03a0; be a projective plane of order n in Lenz&#x2013;Barlotti class I.4, and assume that n is a multiple of 3. Then either n=3 or n is a multiple of 9.
Hiding Virtualization from Attackers and Malware
Authors: Matthew Carpenter, Tom Liston, Ed Skoudis
Venue: IEEE Security and Privacy (2007)

With security researchers relying on virtual machine environments (VMEs) in their analysis work, attackers and their malicious code have a significant stake in detecting the presence of a virtual machine. Virtualization, by its very nature, creates systems that have different characteristics from real machines. From a theoretical perspective, any difference between the virtual and the real could lead to a fingerprinting opportunity for attackers. This article focuses on detection techniques and mitigation options for the most widely deployed VME product today, VMware.
Adaptive eigenvalue decomposition algorithm for real time acoustic source localization system
Authors: Y. Huang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

To locate an acoustic source in a room, the relative delay between microphone pairs must be determined efficiently and accurately. However, most traditional time delay estimation (TDE) algorithms fail in reverberant environments. A new approach is proposed that takes into account the reverberation of the room. A real time PC-based TDE system running under Microsoft/sup TM/ Windows system was developed with three TDE techniques: classical cross-correlation, phase transform, and a new algorithm that is proposed in this paper. The system provides an interactive platform that allows users to compare performance of these algorithms.
Revisiting LISYS: parameters and normal behavior
Authors: J. Balthrop, S. Forrest, M. R. Glickman
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

This paper studies a simplified form of LISYS, an artificial immune system for network intrusion detection. The paper describes results based on a new, more controlled data set than that used for earlier studies. The paper also looks at which parameters appear most important for minimizing false positives, as well as the trade-offs and relationships among parameter settings.
Parallel Numerical Interpolation on Necklace Hypercubes
Authors: S. Meraji, H. Sarbazi-Azad
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

The Necklace Hypecube has been recently proposed as an attractive topology for multicomputers and was shown to have many desirable properties such as well-scalability and suitability for VLSI implementation. This paper introduces a parallel algorithm for computing an N-point Lagrange interpolation on a necklace hypercube multiprocessor. This algorithm consists of 3 phases: initialization, main and final. There is no computation in the initialization phase. The main phase consists of \left\lceil {E/2} \right\rceilsteps (with E being the number of edges of the network), each consisting of 4 multiplications and 4 subtractions, and an additional step including 1 division and 1 multiplication. Communication in the main phase is based on an all-to-all broadcast algorithm using some Eulerian rings embedded in the host necklace hypercube. The final phase is carried out in three sub-phases. There are \left\lceil {k/2} \right\rceilsteps in the first sub-phase where k is the size of necklace. Each of sub-phases two and three contains n steps. Our study reveals that when implementation cost in taken into account, there is no speedup difference between lowdimensional and high-dimensional necklace networks.