ppxscal/embedding_network huggingface dataset:
Overlay networks with class
Authors: G. Chiola, G. Cordasco, L. Gargano, A. Negro, V. Scarano
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

We define a family of Distributed Hash Table systems whose aim is to combine routing efficiency of the randomized networks - i.e. average path length O(log n/log log n) vs. the O(log n) average path length of the deterministic system - with the programmability and startup efficiency of a uniform system - that is a system in which the overlay network is transitive, and greedy routing is optimal. It is known that \Omega(log n) is a lower bound to the average path length for uniform systems with O(log n) degree. The proposed family is parameterized with a positive integer c which measures the amount of randomness that is used. Indeed, edges are partitioned into c equivalence classes. Varying the value c, the system goes from the deterministic case (c = 1) to an "almost uniform" system. Increasing c to relatively low values allows routing with optimal average path length while retaining most of the advantages of a uniform system, such as easy programmability and quick bootstrap of the nodes entering the system. We also provide a matching lower bound for the average path length of the family of routing schemes for any c. Moreover, we show how to extend the result to other overlay networks.
An Illuminance-Reflectance Model for Nonlinear Enhancement of Color Images
Authors: Li Tao, Richard Tompkins, Vijayan K. Asari
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

An image enhancement algorithm based on illuminance-reflectance model is proposed for improving the visual quality of digital images captured under insufficient and/or non-uniform lighting conditions. The paper presents computational methods for estimation of scene illuminance and reflectance, adaptive dynamic range compression of illuminance, and adaptive enhancement for mid-tone frequency components. The images are processed in a similar way as human eyes sensing a scene. The algorithm demonstrates high quality of enhanced images, robust performance and fast processing speed. Compared with Retinex and multi-scale retinex with color restoration (MSRCR), the proposed method shows a better balance between luminance enhancement and contrast enhancement as well as a more consistent and reliable color rendition without introducing incorrect colors. This is an effective technique for image enhancement with simple computational procedures, which makes real-time application successfully realized. The application of this image enhancement technique to the FRGC images yields improved face recognition results.
An interactive system for negotiation in e-commerce with incremental user knowledge
Authors: Mashrur Mia, S. P. Mudur, T. Radhakrishnan
Venue: Proceedings of the 2005 conference of the Centre for Advanced Studies on Collaborative research (2005)

In retail electronic commerce, incomplete user knowledge is a reality that must be addressed by electronic negotiation models and systems. This is particularly true in the case of multi-attribute products where valid product-configurations may require several constraints on attribute-values to be satisfied. Often, in such cases, the individual buyer refines the preferences for individual attributes as more and more information is exchanged during the negotiation process in an incremental fashion. In this paper, we consider how the negotiating parties can benefit from the incremental knowledge as the negotiation progresses. We assume the trust between the customer and merchant is such that the negotiation is for the purpose of seeking a mutually acceptable configuration of the product and its price. We have implemented a prototype system in which negotiation takes place between a human customer and multiple autonomous software agents, each carrying out sales operations on behalf of different merchants. We also describe the architecture of such an interactive multi-issue negotiation system on a distributed platform. The paper describes the various models we have used, and the multi-agent based software architecture that facilitates the interaction and the user interface. Our initial experiences with the prototype gives hope that e-commerce negotiation systems, in future, can benefit by making use of the incremental knowledge during the negotiation process.
The Challenge of Volunteer Computing with Lengthy Climate Model Simulations
Authors: Carl Christensen, Tolu Aina, David Stainforth
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

This paper describes the issues confronted by the climate-prediction. net project in creating a volunteer computing project using a large legacy climate model application. This application typically takes from weeks to months to complete one simulation, and has large memory and disk usage requirements. We describe issues in porting the climate model to a single-processor PC platform, checkpointing, computer resources and workunit size for a simulation, and the volunteer computing infrastructures used (a project-specific system and BOINC). We also describe the methods used to obtain and retain users, and examine the retention/attrition rate of users running the lengthy modelling simulations.
Watermarking and ownership problem: a revisit
Authors: Husrev T. Sencar, Nasir Memon
Venue: Proceedings of the 5th ACM workshop on Digital rights management (2005)

Watermarking technologies have been envisioned as a potential means for establishing ownership on digital media objects. However, achievable robustness and false-positive rates of the state-of-the-art watermarking techniques raise doubts about applicability of watermarking to ownership problem. With this perspective, we address the security weaknesses common to most watermarking techniques and assess the role of watermarking in construction of ownership assertion systems. We identify the requirements of a watermarking based ownership assertion system. Also, we provide a basic functional outline of a practical version of such a system and identify its potential vulnerabilities. To mitigate these vulnerabilities, we aim at reducing the false positive rate of the watermark detection scheme. For this purpose, we propose embedding multiple watermarks as opposed to single watermark embedding while constraining the embedding distortion. The crux of the proposed method lies in watermark generation which deploys a family of one-way functions. We incorporate the multiple watermark embedding idea with the additive watermarking technique [1] and present results to illustrate the potential of this approach in reducing the false-positive rate of the watermark detection scheme.
MapTable: a tactical command and control interface
Authors: Fan Yang, Christopher Baber
Venue: Proceedings of the 11th international conference on Intelligent user interfaces (2006)

This paper describes a novel tabletop interface, MapTable, which can be used as a tactical command and control interface. It is designed and implemented to explore more intelligent and intuitive interaction in a distributed environment that can support remote collaboration. MapTable offers a common space for planners to work, which retains the intuitive feel of a "sandbox" around which discussion can take place and plans easily displayed, whilst the automated navigation command system means that both planning and the issuing of directions can effectively be merged into a single activity using a single user interface that embeds the tasks into the interaction. Empirical studies were conducted to test this tactical interface in a remote searching task environment. Compared to the traditional desktop command and control interface, MapTable can lead to significant differences in performance. This fusion of planning, command and control means that planners can be expected have a high level of situational awareness with regard to where those they are directing are, where they will be and what others in the team are doing.
Optimizing Constraint-Based Mining by Automatically Relaxing Constraints
Authors: Arnaud Soulet, Bruno Cremilleux
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

In constraint-based mining, the monotone and anti-monotone properties are exploited to reduce the search space. Even if a constraint has not such suitable properties, existing algorithms can be re-used thanks to an approximation, called relaxation. In this paper, we automatically compute monotone relaxations of primitive-based constraints. First, we show that the latter are a superclass of combinations of both kinds of monotone constraints. Second, we add two operators to detect the properties of monotonicity of such constraints. Finally, we define relaxing operators to obtain monotone relaxations of them.
e-NeXSh: Achieving an Effectively Non-Executable Stack and Heap via System-Call Policing
Authors: Gaurav S. Kc, Angelos D. Keromytis
Venue: Proceedings of the 21st Annual Computer Security Applications Conference (2005)

We present e-NeXSh, a novel security approach that utilises kernel and LIBC support for efficiently defending systems against process-subversion attacks. Such attacks exploit vulnerabilities in software to override its program control-flow and consequently invoke system calls, causing out-of-process damage. Our technique defeats such attacks by monitoring all LIBC function and system-call invocations, and validating them against process-specific information that strictly prescribes the permissible behaviour for the program (unlike general sandboxing techniques that require manually maintained, explicit policies, we use the program code itself as a guideline for an implicit policy). Any deviation from this behaviour is considered malicious, and we halt the attack, limiting its damage to within the subverted process. We implemented e-NeXSh as a set of modifications to the linux-2.4.18-3 kernel and a new user-space shared library (e-NeXSh.so). The technique is transparent, requiring no modifications to existing libraries or applications. e-NeXSh was able to successfully defeat both codeinjection and libc-based attacks in our effectiveness tests. The technique is simple and lightweight, demonstrating no measurable overhead for select UNIX utilities, and a negligible 1.55% performance impact on the Apache web server.
The Quantitative Safety Assessment for Safety-Critical Software
Authors: Yangyang Yu, Barry W. Johnson
Venue: Proceedings of the 29th Annual IEEE/NASA on Software Engineering Workshop (2005)

The software fault failure rate bound is discussed and generalized for different reliability growth models. The fault introduction during testing and the fault removal efficiency are modeled to relax the two common assumptions made in software reliability models. Three approaches are introduced for the fault content estimation, and thus they are applied to software coverage estimation. A three-state nonhomogenous Markov model is constructed for software safety assessment. The two most important metrics for safety assessment, Steady State Safety and MTTUF, are estimated using the three-state Markov model. A case study is conducted to verify the theory proposed in the paper.
Decycling Cartesian Products of Two Cycles
Authors: David A. Pike, Yubo Zou
Venue: SIAM Journal on Discrete Mathematics (2005)

The decycling number $\nabla(G)$ of a graph $G$ is the smallest number of vertices which can be removed from $G$ so that the resultant graph contains no cycles. In this paper, we study the decycling number for the family of graphs consisting of the Cartesian product of two cycles. We completely solve the problem of determining the decycling number of $C_m \square C_n$ for all $m$ and $n$. Moreover, we find a vertex set $T$ that yields a maximum induced tree in $C_m\square C_n$.
A Space to Dream
Authors: Gary Singh
Venue: IEEE Computer Graphics and Applications (2006)

Dolores Kaufmann's work is a cross between photo manipulation and computer-generated imagery. She creates her works using Kai Power Tools' Hyper Tiling plug in.
Customer-managed end-to-end lightpath provisioning
Authors: Jing Wu
Venue: International Journal of Network Management (2005)

Customer-owned and managed optical networks bring new cost-saving benefits. Two types of such networks are becoming widely used: metro dark fiber networks and long-haul leased wavelength networks. Customers may invoke a special QoS mechanism where end-to-end (E2E) lightpaths are dynamically established across multiple independently managed customer domains. The cost of bandwidth is substantially reduced since it largely becomes a capital cost rather than an ongoing service charge. Customers can optimize the overall resource consumption by utilizing resources from different suppliers. Remote peering and transit reduce the Internet connectivity cost. Bandwidth and quality of service are guaranteed because customers directly peer with each other using transport networks. An architecture for a customer-managed E2E lightpath provisioning system is presented. Integration with Grid applications is discussed and a prototype demonstration is described.
Cyclic Descents and P-Partitions
Authors: T. Kyle Petersen
Venue: Journal of Algebraic Combinatorics: An International Journal (2005)

Louis Solomon showed that the group algebra of the symmetric group $$\mathfrak{S}_{n}$$ n has a subalgebra called the descent algebra, generated by sums of permutations with a given descent set. In fact, he showed that every Coxeter group has something that can be called a descent algebra. There is also a commutative, semisimple subalgebra of Solomon's descent algebra generated by sums of permutations with the same number of descents: an "Eulerian" descent algebra. For any Coxeter group that is also a Weyl group, Paola Cellini proved the existence of a different Eulerian subalgebra based on a modified definition of descent. We derive the existence of Cellini's subalgebra for the case of the symmetric group and of the hyperoctahedral group using a variation on Richard Stanley's theory of P-partitions.
Performance Analysis ofWonGoo System
Authors: Tianbo Lu, Binxing Fang, Yuzhong Sun, Xueqi Cheng
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Privacy and anonymity on the Internet are gaining increasing attention from both the scientific and the large Internet user community. WonGoo is a peer-to-peer scalable anonymous communication system that provides strong anonymity and high efficiency with layered encryption and random forwarding. It reduces the message overhead and lengthens the covert path. In this paper, we firstly describe the system briefly and evaluate its payload. Then we present a detailed security analysis of the system. The results reveal that the degree of anonymity provided by the system increases with the increase of forward probability and the path length, and reduces with the increase of corrupted nodes. In addition, it is hard to increase its anonymity signi ficantly only by increasing the size of the system.
Precise Analysis of Memory Consumption using Program Logics
Authors: Gilles Barthe, Mariela Pavlova, Gerardo Schneider
Venue: Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods (2005)

Memory consumption policies provide ameans to control resource usage on constrained devices, and play an important role in ensuring the overall quality of software systems, and in particular resistance against resource exhaustion attacks. Such memory consumption policies have been previously enforced through static analysis, which yield automatic bounds at the cost of precision, or run-time analysis, which incur an overhead that is not acceptable for constrained devices. In this paper, we study the use of logical methods to specify and statically verify precisememory consumption policies for Java bytecode programs. First, we demonstrate how the Bytecode Specification Language (a variant of the Java Modelling Language tailored to bytecode) can be used to specify precise memory consumption policies for (sequential) Java applets, and how verification tools can be used to enforce such memory consumption policies. Second, we consider the issue of inferring some of the annotations required to express the memory consumption policy, and report on an inference algorithm. Our broad conclusion is that logical methods provide a suitable means to specify and verify expressive memory consumption policies, with an acceptable overhead.
ADLARS: An Architecture Description Language for Software Product Lines
Authors: R. Bashroush, T. J. Brown, I. Spence, P. Kilpatrick
Venue: Proceedings of the 29th Annual IEEE/NASA on Software Engineering Workshop (2005)

Software Product Line (SPL) Engineering has emerged to become a mature domain for maximizing reuse within the context of a family of related software products. Within the process of SPL, the variability and commonality among the different products within the scope of a family is captured and modeled into a system's 'feature model'. Currently, there are no Architecture Description Languages (ADLs) that support the relationship between the feature model domain and the system architecture domain, leaving a gap which significantly increases the complexity of analyzing the system's architecture and insuring that it complies with its set feature model and variability requirements. In this paper we present ADLARS, an Architecture Description Language that supports the relationship between the system's feature model and the architectural structures in an attempt to alleviate the aforementioned problem. The link between the two spaces also allows the automatic generation of product architectures from the family reference architecture.
Web Service Composition Using Integer Programming-based Models
Authors: Aiqiang Gao, Dongqing Yang, Shiwei Tang, Ming Zhang
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

Because web services provided by different providers may be different in Quality of Service (QoS), so it needs to select web services for composite service dynamically. This paper gives methods that are built on the base of QoS description and addresses the issue of selecting web services for the purpose of their composition. The effect of service level and workload on QoS is illustrated. Based on web service QoS model, several methods for dynamic service selection are discussed. Experiments are conducted to evaluate the performance of these methods.
PIDISC: Pattern Independent Design Independent Seed Compression Technique
Authors: Kedarnath J. Balakrishnan, Seongmoon Wang, Srimat T. Chakradhar
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

A novel scheme for compressing the seeds of a linear feedback shifter register (LFSR) is presented. Instead of storing the seeds of the LFSR in the tester, the scheme compresses the seeds and stores them in the tester. The compression scheme can be used with any variation of static LFSR reseeding. An important feature of the proposed scheme is that the decompressor is test pattern and design independent and can be implemented with very little area overhead. Experimental results show that seed compression can improve overall compression by a factor of 7x for large industrial circuits.
An efficient replicated data access approach for large-scale distributed systems
Authors: M. M. Deris, J. H. Abawajy, H. M. Suzuri
Venue: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid (2004)

In data-intensive distributed systems, replication is the most widely used approach to offer high data availability, low bandwidth consumption, increased fault-tolerance and improved scalability of the overall system. Replication-based systems implement replica control protocols that enforce a specified semantics of accessing the data. Also, the performance depends on a host of factors chief of which is the protocol used to maintain consistency among object replica. In this paper, we propose a new low-cost and high data availability protocol for maintaining replicated data on networked distributed computing systems. We show that the proposed approach provides high data availability, low bandwidth consumption, increased fault-tolerance and improved scalability of the overall system as compared to standard replica control protocols.
3-D Shape Retrieval Using Cognitive Psychology-based Principles
Authors: Hsueh-Yi Sean Lin, Ja-Chen Lin, Hong-Yuan Mark Liao
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

In this paper, we incorporate a set of principles that originated in cognitive psychology into the design of 3-D shape analysis and retrieval systems. Based on the "visual salience-guided mesh decomposition" scheme we proposed previously, a 3-D shape represented in mesh form is first broken into parts such that human visual perception of the parts can be appropriately mimicked. Next, the decomposed parts are individually analyzed and quantified according to the properties of visual salience. To establish the indices of 3-D meshes for the subsequent retrieval process, spherical parameterization is adopted to map the decomposed parts onto the surface of a unit sphere. In this way, the degree of similarity between a query provided by a user and models in the database can be calculated. The experiment results show that the retrieval performance of the proposed scheme is indeed efficient and powerful.
Exploiting Independent State For Network Intrusion Detection
Authors: Robin Sommer, Vern Paxson
Venue: Proceedings of the 21st Annual Computer Security Applications Conference (2005)

Network intrusion detection systems (NIDSs) critically rely on processing a great deal of state. Often much of this state resides solely in the volatile processor memory accessible to a single user-level process on a single machine. In this work we highlight the power of independent state, i.e., internal fine-grained state that can be propagated from one instance of a NIDS to others running either concurrently or subsequently. Independent state provides us with a wealth of possible applications that hold promise for enhancing the capabilities of NIDSs. We discuss an implementation of independent state for the Bro NIDS and examine how we can then leverage independent state for distributed processing, load parallelization, selective preservation of state across restarts and crashes, dynamic reconfiguration, high-level policy maintenance, and support for profiling and debugging. We have experimented with each of these applications in several large environments and are now working to integrate them into the sites' operational monitoring. A performance evaluation shows that our implementation is suitable for use even in large-scale environments.
A Study of Intrusion Signature Based on Honeypot
Authors: Jun-feng TIAN, Jian-ling WANG, Xiao-hui YANG, Ren-ling LI
Venue: Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (2005)

To meet network security requirement, the model of SISH (Study of Intrusion Signature based on Honeypot) takes advantage of honeypot technology to collect the activities of attackers on the honeypot. According to information replied from the honeypot, and data captured on the network, one can reproduce the attack with attack tree. Having classified the attack information of the attacked objects, one can create the signature of the intrusion data in the same class by LCS(Longest Common Sub-string) algorithm. new signatures are used to enrich the signature database of the IDS to make up for the deficiency of the IDSs and perfect defense system.