ppxscal/embedding_network huggingface dataset:
Feature Reduction and Database Maintenance in NETNEWS Classification
Authors: Wen-Lin Hsu, Sheau-Dong Lang
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

We propose a statistical feature-reduction technique to filter out the most ambiguous articles in the training data for categorizing the NETNEWS articles. We also incorporate a batch updating scheme to periodically do maintenance on the term structures of the news database after training. The baseline method combines the terms of all the articles of each newsgroup in the training set to represent the newsgroups as single vectors. After training, the incoming news articles are classified based on their similarity to the existing newsgroup categories. Our implementation uses an inverted file to store the trained term structures of each newsgroup, and uses a list similar to the inverted file to buffer the newly arrival articles, for efficient routing and updating purposes. Our experimental results using real NETNEWS articles and newsgroups demonstrate (1) applying feature reduction to the training set improves the routing accuracy, efficiency, and database storage; (2) updating improves the routing accuracy; and (3) the batch technique improves the efficiency of the updating operation.
Me++: The Cyborg Self and the Networked City
Authors: William J. Mitchell
Venue:  (2003)

:With Me++ the author of City of Bits and e-topia completes an informal trilogy examining the ramifications of information technology in everyday life. William Mitchell describes the transformation of wireless technology in the hundred years since Marconi--the scaling up of networks and the scaling down of the apparatus for transmission and reception. It is, he says, as if "Brobdingnag had been rebooted as Lilliput"; Marconi's massive mechanism of tower and kerosene engine has been replaced by a palm-size cell phone. If the operators of Marconi's invention can be seen as human appendages to an immobile machine, today's hand-held devices can be seen as extensions of the human body. This transformation has, in turn, changed our relationship with our surroundings and with each other. The cell phone calls from the collapsing World Trade Center towers and the hijacked jets on September 11 were testimony to the intensity of this new state of continuous electronic engagement.Thus, Mitchell proposes, the "trial separation" of bits (the elementary unit of information) and atoms (the elementary unit of matter) is over. With increasing frequency, events in physical space reflect events in cyberspace, and vice versa; digital information can, for example, direct the movement of an aircraft or a robot arm. In Me++ Mitchell examines the effects of wireless linkage, global interconnection, miniaturization, and portability on our bodies, our clothing, our architecture, our cities, and our uses of space and time. He argues that a world governed less and less by boundaries and more and more by connections requires us to reimagine and reconstruct our environment and to reconsider the ethical foundations of design, engineering, and planning practice.
Design of real-time admission control algorithms with priority support
Authors: A. Dailianas, A. Bovopoulos
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

A multimedia ATM network is shared by media channels with different performance requirements and traffic characteristics. To make efficient use of network resources, the quality of service provided to the users should be as close as possible to their requirements. A scheme with two levels of cell loss priority within each channel is proposed. Priorities are assigned and enforced by the network locally at each switch along the path of a connection. The assignment, which can be different for the same connection at two different switches, is also dynamic; it is updated every time a connection is set up or one is terminated. Algorithms used by the network to decide the fraction of cells of each stream assigned to each cell loss priority level, along with a simple mechanism to enforce the desired priority assignment and a real-time admission control algorithm, with decision time of very few milliseconds even for thousands of heterogeneous sources are presented.
Mesh Distance Formulae
Authors: Michael J. Pertel
Venue:  (1992)

A table of useful summation formulae are derived, together with a Mathematica package for producing them. The distance distribution in mesh routing networks is derived. The mean and variance of the distance distribution are computed. A program for computing the distance distribution of any mesh is presented. 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
An IT degree combining the strengths of university and TAFE
Authors: Simon
Venue: Proceedings of the fifth Australasian conference on Computing education - Volume 20 (2003)

As a partnership of University and TAFE, the Ourimbah Campus of the University of Newcastle is ideally placed to take advantage of the best that each sector has to offer. The new Applied Information Technology degree is unusual in two respects: first, students' programs are constrained to consist of half IT and half some other discipline; and second, almost two-thirds of the IT is provided directly by TAFE NSW, a provider of Vocational Educational Training. The latter feature has provoked renewed consideration of the different roles of TAFE and University in IT education.
Design of a robust active queue management algorithm based on feedback compensation
Authors: Zhang Heying, Liu Baohong, Dou Wenhua
Venue: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications (2003)

Active Queue Management (AQM) is a very active research area in networking. The main objective of an AQM mechanism is to provide low delay and low loss service in best-effort service networks. In this paper we propose a new AQM algorithm based on the feedback compensation technique in control theory. The algorithm is called Proportional Integral based series compensation, and Position feedback compensation (PIP). By choosing the appropriate feedback compensation element and its parameters, the properties of the corrected system become dependent, to a great extent, on the series and feedback compensatory elements. Thus, PIP can eliminate the error incurred by the inaccuracy in the linear system model as well as eliminate the sensitivity to the changes in system parameters like load level, propagation delay, etc. The performance of PIP is compared to PI using ns simulations. From the experiments and analysis we conclude that PIP is more responsive to and robust under time-varying network conditions than PI.
A case-based procurement advisory system for construction
Authors: Duc Thanh Luu, S. Thomas Ng, Swee Eng Chen
Venue: Advances in Engineering Software (2003)

The selection and use of an appropriate procurement system are fundamental to the success of a construction project. However, the procurement selection process involves the analysis of complex and dynamic criteria such as cost certainty, time certainty, speed, flexibility, etc. Procurement selection is, therefore, plagued with uncertainty and vagueness that is difficult to be represented by a generalized set of rules. In reality, decisions in procurement selection are usually derived from intuition and past experience. Case-based reasoning (CBR) appears to be an appropriate approach to meet the requirements of the procurement selection process because of the value of experiential knowledge. This paper reviews the practicality and suitability of a CBR approach for procurement selection through the development of a prototype case-based procurement advisory system. In this prototype system, procurement selection cases are represented by a set of attributes elicited from experienced procurement experts. The system is powered by a fuzzy similarity retrieval mechanism, which gives a greater accuracy than the normal similarity retrieval process. The results indicate that the CBR approach can suitably model the characteristics of construction procurement selection, and provide an indication of potential outcomes to any apparently suitable procurement methods.
iPhoto 1.1 for Mac OS X: Visual QuickStart Guide
Authors: Adam C. Engst
Venue:  (2002)

:Taking digital pictures is easy enough. But organizing the hundreds of oddly named image files that wind up on your hard drive so that you can easily share your photos with friends--well, that can be quite a different story. Unless, of course, you have iPhoto, Apple's free digital photography program, and best-selling author Adam Engst's iPhoto 1.1 for Mac OS X: Visual QuickStart Guide to get you up to speed on how to use it. While most consumer photography programs help you edit your digital photos and turn them into projects, iPhoto focuses on organizing those photos and sharing them with others. Using a step-by-step approach that emphasizes tasks over lengthy explication, iPhoto 1.1 for Mac OS X: Visual QuickStart Guide will have you importing, organizing, editing, and sharing your photo collections in no time. With a single click, you'll be able to order prints online, publish your photos to a Web page, or order a linen-bound book of your photographs. As with all VQS books, there are plenty of screen shots and graphics to illustrate key concepts, as well as tips to explain aspects of the program that aren't obvious form the interface or online help. Best of all, iPhoto 1.1 for Mac OS X: Visual QuickStart Guide includes a trouble-shooting chapter that can save you hours of grief should something happen to an irreplaceable photo.
Planar Graphs and Sparse Graphs from Efficient Motion Planning in the Plane
Authors: L. P Chew
Venue:  (1990)

Given a source, a destination, and a number of obstacles in the plane, the Motion Planning Program is to determine the best path to move an object (a robot) from the source to the destination without colliding with any of the obstacles. For us, motion is restricted to the plane, the robot is represented by a point, and the obstacles are represented by a set of polygons with a total of n vertices among all the polygonal obstacles.
Fault Detection Effectiveness of Spathic Test Data
Authors: Jane Huffman Hayes, Pifu Zhang
Venue: Proceedings of the Eighth International Conference on Engineering of Complex Computer Systems (2002)

This paper presents an approach for generating test datafor unit-level, and possibly integration-level, testing basedon sampling over intervals of the input probabilitydistribution, i.e., one that has been divided or layeredaccording to criteria. Our approach is termed "spathic"as it selects random values felt to be most likely or leastlikely to occur from a segmented input probabilitydistribution. Also, it allows the layers to be furthersegmented if additional test data is required later in the testcycle.The spathic approach finds a middle ground between themore difficult to achieve adequacy criteria and random testdata generation, and requires less effort on the part of thetester. It can be viewed as guided random testing, with thetester specifying some information about expected input.The spathic test data generation approach can be used toaugment "intelligent" manual unit-level testing. An initialcase study suggests that spathic test sets detect more faultsthan random test data sets, and achieve higher levels ofstatement and branch coverage.
Improving dynamic cluster assignment for clustered trace cache processors
Authors: Ravi Bhargava, Lizy K. John
Venue: ACM SIGARCH Computer Architecture News (2003)

This work examines dynamic cluster assignment for a clustered trace cache processor (CTCP). Previously proposed cluster assignment techniques run into unique problems as issue width and cluster count increase. Realistic design conditions, such as variable data forwarding latencies between clusters and a heavily partitioned instruction window, increase the degree of difficulty for effective cluster assignment.In this work, the trace cache and fill unit are used to perform dynamic cluster assignment. The retire-time fill unit analysis is aided by a dynamic profiling mechanism embedded within the trace cache. This mechanism provides information about inter-trace data dependencies, an element absent in previous retire-time CTCP cluster assignment work. The strategy proposed in this work leads to more intra-cluster data forwarding and shorter data forwarding distances. In addition, performing cluster assignment at retire time reduces issue-time complexity and eliminates early pipeline stages. This increases overall performance for integer programs by 11.5% over our base CTCP architecture. This speedup is significantly higher than a previously proposed retire-time CTCP assignment strategy. Dynamic cluster assignment is also evaluated for several alternate cluster designs as well as for media benchmarks.
Location Updates and Probabilistic Tracking Algorithms for Mobile Cellular Networks
Authors: John C. S. Lui, Cedric C. F. Fong, H. W. Chan
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

In this work, we develop a novel mathematical model to analyze different location update protocols for mobile cellular network. Our model can capture many important features of user movements, such as geographically dependent movement, directional movement and non-exponential distribution of cell dwell times. We propose to use the transient method to predict the location of a mobile user. This method is efficient and, more importantly, able to address the temporal change in the current location of a mobile user. Therefore, the accuracy of the prediction of the location of a user can be enhanced.We also propose a new location update protocol which can attain a lower tracking cost and also adapt to different mobility patterns. Transient performance analysis is also carried out and the results are compared with other protocols.
Admission Control Policies for Internet File Transfer Protocols
Authors: Simon Holmes a Court
Venue:  (1997)

Server congestion is a major cause of frustration with the Internet. It is not uncommon for a server with a new release of popular software to be swamped by many times more clients than it can possibly handle. Current Internet file transfer protocols, namely FTP and HTTP, do not have any policy to regulate client admission. In this thesis we are concerned with server admission policies that will improve clients'' experience with servers under heavy load. Using a purpose-built network simulator, we compare the prevalent protocols with two new protocols that include policies taken from processor scheduling. By applying more intelligent client admission policies it is hoped that the quality of service on the Internet can be improved. 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
Ramping New IC Products in the Deep Submicron Age
Authors: John Kibarian
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

It is well known that the majority of the potential profits are early in a products life. This is especially true in product segments such as system on a chip, graphics accelerators, microprocessors, and memory. The spoils in these segments go the company who gets its product to market first. At the same time, the investments required to produce the next generation products is going up at an accelerated pace. As a result, companies are sharing the investment by working with more third party suppliers. Today, a chip will be designed with 3rd party EDA tools and using commercial IP. It is often manufactured in commercial foundries, and tested and assembled a separate company. When the product is not meeting yield and performance, how are the issues resolved? Eventually, these yield issues are resolved, but often not before the profitable part of the product's life-style is complete. In this presentation we describe new methodologies, tools and services, which can help, turn designs into products. We will summarize the key technical issues, which make performance and yield targets difficult to meet given the product's life-style constraints and demonstrate how these new methodologies can greatly change the production ramp. Examples of these methods applied to advanced products such as microprocessors, embedded DRAM, and system on a chip, and DRAM will be provided.
SHAPE OPTIMIZATION GOVERNED BY THE EULER EQUATIONS USING AN ADJOINT METHOD
Authors: Angelo Iollo, Manuel D. Salas, Shlomo Ta''asan
Venue:  (1993)

In this paper we discuss a numerical approach for the treatment of optimal shape problems governed by the Euler equations. In particular, we focus on flows with embedded shocks. We consider a very simple problem: the design of a quasi-one-dimensional Laval nozzle. We introduce a cost function and a set of Lagrange multipliers to achieve the minimum. The nature of the resulting costate equations is discussed. A theoretical difficulty that arises for cases with embedded shocks is pointed out and solved. Finally, some results are given to illustrate the effectiveness of the method.
An Agent Framework for a Dynamically Distributed Application
Authors: A. Inoue, T. Abe
Venue: Proceedings of the 3rd International Conference on Multi Agent Systems (1998)

Akira Inoue and Tetsuji Abe Recently, several distributed applications have been proposed, each of which consists of many separate components. In these applications, because operations are distributed to the components, their performance is improved. However, the performance is not always good. This is because the configuration of the components is fixed, whereas obtaining a suitable configuration requires a flexible response to several factors.So, in this paper, we propose an agent framework for a dynamically distributed application which consists of many mobile agents. The agents change their configuration dynamically using migration to improve the performance of the application depending on variations in the environment such as the network condition and the load of the computer.To support these activities, the framework provides agents with many services, which enable them to communicate with other agents seamlessly even during migration over the network.We also implement the agent framework and a prototype application. Then we show the potency of the dynamically distributed application by evaluating the dynamic transformation of agents' configuration, and show the effectiveness of the framework by evaluating the migration process.
Regulating access to XML documents
Authors: Alban Gabillon, Emmanuel Bruno
Venue: Proceedings of the fifteenth annual working conference on Database and application security (2001)

In this paper, our objective is to define a security model for regulating access to XML documents. Our model offers a security policy with a great expressive power. An XML document is represented by a tree. Nodes of this tree are of different type (element, attribute, text, comment...etc). The smallest protection granularity of our model is the node, that is, authorisation rules granting or denying access to a single node can be defined. The authorisation rules related to a specific XML document are first defined on a separate Authorisation sheet. This Authorisation sheet is then translated into an XSLT sheet. If a user requests access to the XML document then the XSLT processor uses the XSLT sheet to provide the user with a view of the XML document which is compatible with his rights.
Cellulat
Authors: Jaime Lagunez-Otero, Pedro Pablo González Pérez, Maura Cárdenas-García, Octavio Rosas, Armando Franyuti
Venue: Proceedings of the eighth international conference on Artificial life (2002)

In order to model the cell it is essential to understand the communication system that governs its behaviour. Though it is true that determining the kinetic equations of the biochemistry involved in vital functions is very useful, the management of the information in order for the cell to make the correct physiological decisions is even more so. This can be appreciated in the determinacy of the correct function of oncogenes coding for signal transduction components. We emulate a signal transduction network using behaviour-based systems and the blackboard architecture. Our construct, named Cellulat, allows one to observe two essential aspects of the intracellular signalling networks: (1) the apparent behavioural capabilities and (2) a spatial organization. The first user interfaces for creating a model cell are presented, the ontology used, as well as a simple example for the analysis of a kinase pathway.
Updating a Hybrid Rule Base with New Empirical Source Knowledge
Authors: Jim Prentzas, Ioannis Hatzilygeroudis, Athanasios Tsakalidis
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

Neurules are a kind of hybrid rules that combine a symbolic (production rules) and a connectionist (adaline unit) representation. Each neurule is represented as an adaline unit. One way that the neurules can be produced is from training examples (empirical source knowledge). However, in certain application fields not all of the training examples are available a priori. A number of them become available over time. In these cases, updating the corresponding neurules is necessary. In this paper, methods for updating a hybrid rule base, consisting of neurules, to reflect the availability of new training examples are presented. The methods are efficient, since they require the least possible retraining effort and the number of the produced neurules is kept as small as possible.
CharToon 2.0 manual
Authors: Han Noot, Zs Ruttkay
Venue:  (2000)

CharToon is a modular system to design and animate 21/2D faces and other graphical objects. This manual describes the features of each module in version 2.0, with practical tips and sections for sophisticated features marked in the margin. This arrangement allows the novice as well as the advanced user to get introduced to using CharToon. A special extension to CharToon, the EmotionDisc is also described, which allows easy visualization of the entire emotional repertoire of a face made by CharToon. In the Appendices, samples of ascii data files, sample heads and animations and color figures are given.
A Note on the Transaction Backout Problem
Authors: Mark W. Krentel
Venue:  (1986)

The transaction backout problem arises in the area of distributed databases. Suppose failures partition a data-redundant distributed database, and each partition continues to function as if it were the entire database. When the database is reconnected, the transactions executed by different partitions may not be serializable, and hence it may be necessary to back out some of the transactions. The transaction backout problem is to remove the smallest set of transactions that will leave the remaining ones serializable. The general problem is NP-complete, and in this paper we show that the special case of a fixed-size database can be solved in polynomial time by dynamic programming.