ppxscal/embedding_network huggingface dataset:
An Architecture of Network Imprinting for Personal but Wide Area Applications
Authors: Teruaki Yokoyama, Katsuyoshi Iida, Suguru Yamaguchi
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

Since the number of networked devices in the future ubiquitous network will grow explosively, one of the major problems for such networks is the scalability problem. In this paper, we consider the network imprinting approach, where imprinting is a process to register other devices owned by the same person. After the imprinting process, all devices of the same owner constitute a group, in which the devices perform rendezvous and handover management in the end-to-end fashion. To implement the device imprinting approach, we propose a network architecture, called Inter-device Imprinting on the Internet (I3). I3 is a promising approach to solve the scalability problem.
Discrete Rayleigh fading channel modeling: Research Articles
Authors: Julio Aráuz, Prashant Krishnamurthy, Miguel A. Labrador
Venue: Wireless Communications Mobile Computing (2004)

In order to understand the behaviour of upper-layer protocols and to design or fine tune their parameters over wireless networks, it is common to assume that the underlying channel is a flat Rayleigh fading channel. Such channels are commonly modeled as finite state Markov chains. Recently, hidden Markov models have also been employed to characterize these channels. In this paper, we study the different models that have been proposed along with the analysis of their validity. We start by presenting some preliminary concepts related to the modeling of the wireless communications channel. We then proceed to introduce finite state Markov channel models (FSMCs) along with the relations between them and the modulation schemes, error control protocols and channel coding. We propose and study the effects of taking into account the fading process in its characterization. We finish with a discussion on hidden Markov models for Rayleigh fading channel modeling. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Adaptive polling MAC schemes for IEEE 802.11 wireless LANs supporting voice-over-IP (VoIP) services: Research Articles
Authors: Young-Jae Kim, Young-Joo Suh
Venue: Wireless Communications Mobile Computing (2004)

The IEEE 802.11 standard specifies the point coordination function (PCF) in the media access control (MAC) sublayer for the transfer of real-time traffic, such as voice. The transfer of real-time traffic over wireless LANs is rapidly gaining acceptance, but little work has been done concerning the efficient use of IEEE 802.11 PCF mode to support voice-over-IP (VoIP) services. In this paper, we propose adaptive polling MAC schemes for IEEE 802.11 MAC. The proposed schemes achieve bandwidth efficiency by reducing the number of polls required for the uplink voice packet transmissions using a talkspurt detection algorithm. We analyze the applicability of the proposed schemes to IEEE 802.11 WLANs and compare them with other related works. Copyright &copy; 2004 John Wiley & Sons, Ltd.
An Embedded Microprocessor for Intelligent Control
Authors: Ioannis Panagopoulos, Christos Pavlatos, George Papakonstantinou
Venue: Journal of Intelligent and Robotic Systems (2005)

The conventional approach for the implementation of the knowledge base of a planning agent, on an intelligent embedded system, is solely of software nature. It requires the existence of a compiler that transforms the initial declarative logic program, specifying the knowledge base, to its equivalent procedural one, to be programmed to the embedded system's microprocessor. This practice increases the complexity of the final implementation (the declarative to sequential transformation adds a great amount of software code for simulating the declarative execution) and reduces the overall system's performance (logic derivations require the use of a stack and a great number of jump instructions for their evaluation). The design of specialized hardware implementations, which are only capable of supporting logic programs, in an effort to resolve the aforementioned problems, introduces limitations in their use in applications where logic programs need to be intertwined with traditional procedural ones in a desired application. In this paper, we exploit HW/SW codesign methods to present a microprocessor, capable of supporting hybrid applications using both programming approaches. We take advantage of the close relationship between attribute grammar (AG) evaluation and knowledge engineering methods to present a programmable hardware parser that performs logic derivations and combine it with an extension of a conventional RISC microprocessor that performs the unification process to report the success or failure of logic derivations. The extended RISC microprocessor is still capable of executing conventional procedural programs, thus hybrid applications can be implemented. The presented implementation increases the performance of logic derivations for the control inference process (experimental analysis yields an approximate 1000% -- 10 times increase in performance) and reduces the complexity of the final implemented code through the introduction of an extended C language called C-AG that simplifies the programming of hybrid procedural-declarative applications.
Understanding the function of web elements for mobile content delivery using random walk models
Authors: Xinyi Yin, Wee Sun Lee
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

In this paper, we describe a method for understanding the function of web elements. It classifies web elements into five functional categories: Content (C), Related Links (R), Navigation and Support (N), Advertisement (A) and Form (F). We construct five graphs for a web page, and each graph is designed such that most of the probability mass of the stationary distribution is concentrated in nodes belong to its corresponding category. We perform random walks on these graphs until convergence and classify based on its rank value in different graphs. Our experiment shows that the new method performed very well comparing to basic machine learning methods.
GridDeploy: A Toolkit for Deploying Applications as Grid Services
Authors: Zhijie Guan, Vijay Velusamy, Purushotham Bangalore
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

In Grid computing environments it is common practice to use grid middleware as the intermediate layer between end user/application and existing functionalities available on the resources. The purpose of this paper is to introduce GridDeploy, a toolkit for automatically deploying programs as Grid services and providing the necessary infrastructure for users' applications to invoke these services directly and transparently. Two different strategies for deployment of Grid services are proposed: one exploits semantics of programs stored in a repository and converts them into Application-Specific Grid Services; the other one provides support for creation and invocation of General Grid Services for general applications that don't require permanent deployment.
A New Generalized Particle Approach to Allot Resources And Jobs for Grid Computing
Authors: Dianxun Shuai, Xiang Feng, Rui Gong, Xing Wang
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

This paper presents a new generalized particle approach (GPA) to optimally allot the resources and jobs for grid computing. The proposed GPA transforms the allocation problem of grid resources and grid jobs into the kinematics and dynamics of massive particles in a force-field. This paper discusses the construction, dynamics and properties of the GPA and corresponding algorithm. The GPA has many advantages in terms of the parallelism, multi-objective optimization, multi-type coordination, and the ability to deal with a variety of complex issues, such as the autonomy, personality, congestion, failure of distinct grid facilities. The simulations have shown the effectiveness and suitability of the proposed approach for grid computing.
Knowledge transformers: A link between learning and creativity
Authors: Siang Kok Sim, Alex H. B. Duffy
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2004)

The purpose of this paper is to investigate whether knowledge transformers that are featured in the learning process are also present in the creative process. First, this was achieved by reviewing accounts of inventions and discoveries with the view of explaining them in terms of knowledge transformers. Second, this was achieved by reviewing models and theories of creativity and identifying the existence of the knowledge transformers. The investigation shows that there is some evidence to show that the creative process can be explained through knowledge transformers. Hence, it is suggested that one of links between learning and creativity is through the knowledge transformers.
JavaSymphony: a new programming paradigm to control and synchronize locality, parallelism and load balancing for parallel and distributed computing: Research Articles
Authors: Thomas Fahringer, Alexandru Jugravu
Venue: Concurrency and Computation: Practice Experience (2005)

There has been an increasing research interest in extending the use of Java towards performance-oriented programming for distributed and concurrent applications. JavaSymphony is a Java-based programming paradigm that allows the programmer to control parallelism, load balancing, and locality at a high level of abstraction. Objects can be explicitly distributed and migrated based on a high-level API to static&sol;dynamic system parameters and dynamic virtual distributed architectures, which impose a virtual hierarchy on a distributed system of physical computing nodes. In this paper we describe various extensions to the original JavaSymphony API, which includes a generalization of virtual architectures that can be used to specify and to request arbitrary heterogeneous distributed and concurrent architectures inside of a JavaSymphony program. The number of threads that execute an object's methods can be controlled dynamically through single- and multi-threaded objects. Conventional Java objects can be dynamically converted to JavaSymphony objects. A (un)lock mechanism has been introduced in order to avoid inconsistent modifications of objects or virtual architectures. A sophisticated event mechanism for asynchronous communication, coordination, and interaction is provided. Several synchronization constructs including distributed barrier synchronization and synchronization for asynchronous method invocations have been included. Several experiments are presented to demonstrate the effectiveness and efficiency of JavaSymphony. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Domain-Specific Reconfigurable Array Targeting Discrete Wavelet Transform for System-on-Chip Applications
Authors: Sajid Baloch, Imran Ahmed, Tughrul Arslan
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

Domain-specific heterogeneous reconfigurable arrays are for one particular domain of applications, which provide high performance over generic Field Programmable Gate Arrays (FPGAs). This paper introduces an embedded reconfigurable array that targets discrete wavelet transform (DWT). Reconfigurable architectures are highly suitable for complex algorithms which are part of changing standards like JPEG2000 etc. The proposed reconfigurable array is flexible to implement lifting and integer based different DWT algorithms. Two benchmark DWT algorithms are implemented on three different platforms (on proposed array, on conventional FPGAs and on hardwired cores) for performance evaluation. The performance based on power consumption, timing and area, shows considerable improvement of presented arrays over FPGAs.
Strategyproof cost-sharing mechanisms for set cover and facility location games
Authors: Nikhil R. Devanur, Milena Mihail, Vijay V. Vazirani
Venue: Decision Support Systems (2005)

Strategyproof cost-sharing mechanisms, lying in the core, that recover 1/α fraction of the cost, are presented for the set cover and facility location games: α=O(log n) for the former and 1:861 for the latter. Our mechanisms utilize approximation algorithms for these problems based on the method of dual-fitting.
Australian Software Development: What Software Project Management Practices Lead to Success?
Authors: J. M. Verner, N. Cerpa
Venue: Proceedings of the 2005 Australian conference on Software Engineering (2005)

We surveyed a number of Australian software practitioners in order to understand what software development practices were used in their recent software projects. We were particularly interested to discover what project management practices are common in Australian software projects. The relationship between practices and software project outcomes enables us to investigate why some projects succeed and others fail. We found that nearly 20% of projects had no lifecycle methodology and 10% of our respondents did not understand what was meant by a software development lifecycle methodology. Many recognized software practices are not being applied consistently in the projects investigated. Fifty percent of projects began with unclear requirements. Risk assessment is not normally a part of the development process and the organizations are not learning from their mistakes as post mortem reviews are much more likely to be held for successful projects than they are for unsuccessful projects.
Adaptive nonlinear congestion controller for a differentiated-services framework
Authors: Andreas Pitsillides, Petros Ioannou, Marios Lestas, Loukas Rossides
Venue: IEEE/ACM Transactions on Networking (TON) (2005)

The growing demand of computer usage requires efficient ways of managing network traffic in order to avoid or at least limit the level of congestion in cases where increases in bandwidth are not desirable or possible. In this paper we developed and analyzed a generic Integrated Dynamic Congestion Control (IDCC) scheme for controlling traffic using information on the status of each queue in the network. The IDCC scheme is designed using nonlinear control theory based on a nonlinear model of the network that is generated using fluid flow considerations. The methodology used is general and independent of technology, as for example TCP/IP or ATM. We assume a differentiated-services network framework and formulate our control strategy in the same spirit as IP DiffServ for three types of services: Premium Service, Ordinary Service, and Best Effort Service. The three differentiated classes of traffic operate at each output port of a router/switch. An IDCC scheme is designed for each output port, and a simple to implement nonlinear controller, with proven performance, is designed and analyzed. Using analysis performance bounds are derived for provable controlled network behavior, as dictated by reference values of the desired or acceptable length of the associated queues. By tightly controlling each output port, the overall network performance is also expected to be tightly controlled. The IDCC methodology has been applied to an ATM network. We use OPNET simulations to demonstrate that the proposed control methodology achieves the desired behavior of the network, and possesses important attributes, as e.g., stable and robust behavior, high utilization with bounded delay and loss, together with good steady-state and transient behavior.
A local approach for temporal model checking of Java bytecode
Authors: Antonella Santone, Gigliola Vaglini
Venue: Journal of Computer and System Sciences (2005)

Modern computing applications require highly reliable software systems, but current validation techniques, like testing, fail to assure an adequate level of correctness. We present a model checking procedure to verify a subset of the Java virtual machine language (JVML) with respect to properties expressed by a temporal logic. A tableau-based method is developed to prove the satisfaction of a formula: by this local approach a program computation is checked only if involved in the goal of the property verification. A special symbol @? is introduced to represent ''unknown'' values, and computations are performed in a symbolic way exploiting the set of guards present in the formulae to refine possible unknown values. This kind of abstraction cuts the state explosion of the programs and it is applicable to check arbitrary formulae, but the result of the verification has an imprecision degree depending on the number of unknown values manipulated during each symbolic computation.
The economics of open source software for a competitive firm
Authors: Richard E. Hawkins
Venue: Netnomics (2004)

Large quantities of software, ranging from operating systems to web servers to games, are now available as "open source software" or "free software". In many cases, this software is backed by large profit seeking corporations such as IBM. Traditional economic analysis is used to identify the costs and benefits to firms of using open source rather than proprietary solutions, particularly in the case of the firm releasing code to the world when not obliged to do so. Examples of large companies backing open source are examined in light of the profit motive. Additionally, open source is also analyzed as a quasi-public good.
An optimization algorithm for free-form surface partitioning based on weighted Gaussian image
Authors: Kai Tang, Yong-Jin Liu
Venue: Graphical Models (2005)

Partitioning free-form surfaces into sub-patches and finding optimal representative normal for each patch to maximize a global objective function is an important two-level operation in diverse industrial applications. In this paper, by solving a maximum hemispherical partitioning problem raised from a weighted Gaussian image, an optimization algorithm is proposed to partition a free-form surface into two sub-patches and simultaneously report the optimal representative normals. By discretizing the free-form surface with W sample points and clustering normals on the surface with m distinct sample normals, the proposed algorithm is designed, in general, with O(m2W2) time complexity and O(W2) space complexity, and in particular, if the surface is convex, in O(m2 logm) time complexity. Case studies with four representative examples are presented and a real world application is exploited to demonstrate the effectiveness and usefulness of the proposed algorithm.
FS: An In-Kernel Integrity Checker and Intrusion Detection File System
Authors: Swapnil Patil, Anand Kashyap, Gopalan Sivathanu, Erez Zadok
Venue: Proceedings of the 18th USENIX conference on System administration (2004)

Today, improving the security of computer systems has become an important and difficult problem. Attackers can seriously damage the integrity of systems. Attack detection is complex and time-consuming for system administrators, and it is becoming more so. Current integrity checkers and IDSs operate as user-mode utilities and they primarily perform scheduled checks. Such systems are less effective in detecting attacks that happen between scheduled checks. These user tools can be easily compromised if an attacker breaks into the system with administrator privileges. Moreover, these tools result in significant performance degradation during the checks.Our system, called I3FS, is an on-access integrity checking file system that compares the checksums of files in real-time. It uses cryptographic checksums to detect unauthorized modifications to files and performs necessary actions as configured. I3FS is a stackable file system which can be mounted over any underlying file system (like Ext3 or NFS). I3FS's design improves over the open-source Tripwire system by enhancing the functionality, performance, scalability, and ease of use for administrators. We built a prototype of I3FS in Linux. Our performance evaluation shows an overhead of just 4% for normal user workloads.
Landscape smoothing of numerical permutation spaces in genetic algorithms
Authors: Richard Simpson, Ranette Halverson
Venue: Journal of Computing Sciences in Colleges (2004)

The recent popularity of genetic algorithms (GA's) and their application to a wide range of problems is a result of their ease of implementation and flexibility. Evolutionary techniques are often applied to optimization and related search problems where the fitness of a possible result is easily established. Although many landscapes are searched quickly, there are those, such as permutation landscapes, that are particularly challenging to the GA approach. This paper suggests an alternative approach, called landscape smoothing, to searching numerical permutation landscapes. This paper demonstrates that this approach is more effective than the usual schemes since it smoothes the original landscape in a way that allows GA exploitation to occur naturally using standard mutation and crossover operators.
Geometric texture synthesis and transfer via geometry images
Authors: Y.-K. Lai, S.-M. Hu, D. X. Gu, R. R. Martin
Venue: Proceedings of the 2005 ACM symposium on Solid and physical modeling (2005)

In this paper, we present an automatic method which can transfer geometric textures from one object to another, and can apply a manually designed geometric texture to a model. Our method is based on geometry images as introduced by Gu et al. The key ideas in this method involve geometric texture extraction, boundary consistent texture synthesis, discretized orientation and scaling, and reconstruction of synthesized geometry. Compared to other methods, our approach is efficient and easy-to-implement, and produces results of high quality.
Local Minima and Convergence in Low-Rank Semidefinite Programming
Authors: Samuel Burer, Renato D. C. Monteiro
Venue: Mathematical Programming: Series A and B (2005)

The low-rank semidefinite programming problem LRSDPr is a restriction of the semidefinite programming problem SDP in which a bound r is imposed on the rank of X, and it is well known that LRSDPr is equivalent to SDP if r is not too small. In this paper, we classify the local minima of LRSDPr and prove the optimal convergence of a slight variant of the successful, yet experimental, algorithm of Burer and Monteiro [5], which handles LRSDPr via the nonconvex change of variables X=RRT. In addition, for particular problem classes, we describe a practical technique for obtaining lower bounds on the optimal solution value during the execution of the algorithm. Computational results are presented on a set of combinatorial optimization relaxations, including some of the largest quadratic assignment SDPs solved to date.
B-Rep Based Parallel Machining Simulation
Authors: Robert V. Fleisig, Allan D. Spence
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

Boundary-representation (B-rep) solid modeller based machining simulations are employed in industry to avoid potential manufacturing failures and improve machiningefficiency before machining begins. The B-rep solid modeller maintains the state of the in-process stock exactly. However, the application of B-rep solid modellers to machining simulations is hindered by the complexity growth that occurs for a large number of tool-paths. In this paper, it is shown that by dividing the tool-paths into neighbour groups and working under practical 2 ½D machining assumptions, the number of neighbours to any tool-path is constant. Consequently, parallel processing effectively reduces wall clock running time for a large number of tool-paths.