ppxscal/embedding_network huggingface dataset:
Optimum Topology-Aware Scheduling of Many-to-Many Collective Communications
Authors: Vaclav Dvorak, Jiri Jaros, Milos Ohlidal
Venue: Proceedings of the Sixth International Conference on Networking (2007)

The paper addresses general many-to-many collective communications, whose scheduling may be needed when writing application-specific communication routines or communication libraries. Optimum schedules with the number of steps equal or close to theoretical lower bounds are designed with the use of evolutionary algorithms. Optimization is carried out for a given topology of a direct interconnection network; network nodes can be single or multiple processors connected to a router. Wormhole switching, full duplex links and single-port non-combining nodes are assumed. The developed scheduling could be advantageous mainly for networks on chip (NoC) and application-specific communication architectures.
When it is worthwhile to work with the stochastic RCPSP?
Authors: Francisco Ballestín
Venue: Journal of Scheduling (2007)

The Resource-Constrained Project Scheduling Project (RCPSP), together with some of its extensions, has been widely studied. A fundamental assumption in this basic problem is that the duration of activities is known before their execution. Very little effort has been made in developing heuristics for the RCPSP with stochastic durations, that is, when the duration of activities is given by a distribution of probability. In fact, the deterministic approach is often used even in the presence of non-trivial distributions. In this paper we discuss when it is worth the effort, in heuristic algorithms, to work with stochastic durations instead of deterministic ones. We also describe techniques that seem to be useful for a wide variety of heuristic algorithms for the stochastic problem. We develop two algorithms that include these procedures and that are capable of outperforming other existing heuristics in the literature. Computational experiments are provided on instances based on the standard set j120, generated using ProGen, and on the well-known Patterson set.
Compliance defects in public-key cryptography
Authors: Don Davis
Venue: Proceedings of the 6th conference on USENIX Security Symposium, Focusing on Applications of Cryptography - Volume 6 (1996)

Public-key cryptography has low infrastructural overhead because public-key users bear a substantial but hidden administrative burden. A public-key security system trusts its users to validate each others' public keys rigorously and to manage their own private keys securely. Both tasks are hard to do well, but public-key security systems lack a centralized infrastructure for enforcing users' discipline. A compliance defect in a cryptosystem is such a rule of operation that is both difficult to follow and unenforceable. This paper presents five compliance defects that are inherent in public-key cryptography; these defects make public-key cryptography more suitable for server-to-server security than for desktop applications.
B-cubing theory: new possibilities for efficient SAT-solving
Authors: D. Babic, J. Bingham, A. J. Hu
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2005. on Tenth IEEE International (2005)

SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA (electronic design automation) applications, so the efficiency of SAT-solving is of great practical importance, B-cubing is our extension and generalization of Goldberg et al. (2002) supercubing, an approach to pruning in SAT-solving completely different from the standard approach used in leading solvers. We have built a B-cubing-based solver that is competitive with, and often outperforms, leading conventional solvers (e.g., ZChaff II) on a wide range of EDA benchmarks. However, B-cubing is hard to understand, and even the correctness of the algorithm is not obvious. This paper clarifies the theoretical basis for B-cubing proves our approach correct, and maps out other correct possibilities for further improving SAT-solving.
Analysis of the Relation between the Teaching Materials and Motivation in Programming Education
Authors: Yasuhiro Takemura, Hideo Nagumo, Kuo-Li Huang, Kenichi Matsumoto
Venue: Proceedings of the 20th Conference on Software Engineering Education & Training (2007)

The purpose of this paper is to analyze the relation between the teaching materials and motivation to learn programming when the results of programming are works of art, and the students are from the art and digital design faculty. The programming environment used in this study was Processing which can produce fine artwork with relatively simple codes. The programming courses with Processing were offered at two universities, and the SIEM assessment standard was used to evaluate the students' motivation levels to learn programming. It has been verified from the analysis of the SIEM assessment standard that the desire of the students to create aesthetically satisfying artwork is important for the motivation to learn programming. Also, we have outlined the items that affected the change of the motivation index using the statistical analysis method.
Broadband array processing using subband techniques
Authors: F. Lorenzelli
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

In this paper, we consider array processing techniques for broadband signals. The optimisation techniques and associated performance results correspond to steerable but fixed beam microphone arrays, to be used in a variety of applications, both in free-space and in reverberant conditions. The proposed arrays maximize the energy concentration around the desired look directions, minimize reverberant disturbance, cancel individual interferers, and control the amount of signal distortion. Optimization criteria for array subband processing are also given. The uniformly spaced subband and the non-uniformly spaced subband using quadrature mirror filter approaches are treated. Finally, various simulation results for free-space and reverberant conditions are presented to demonstrate the usefulness of this class of microphone array, as well as the feasibility of quadrature mirror filter-based subband processing.
Combining DagMaps and Sugiyama Layout for the Navigation of Hierarchical Data
Authors: Pierre-Yves Koenig, Guy Melancon, Charles Bohan, Berengere Gautier
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

This paper presents a novel technique for exploring and navigating large hierarchies, not restricted to trees but to directed acyclic graphs (DAGs). The technique combines two different visualizations emphasizing different points of view the user can adopt when analyzing the content of the hierarchy. Usual hierarchical (node-link) layout reflect the relative position of nodes in the hierarchy while a variation of a treemap emphasizes node attributes. The classical treemap algorithm has been adapted in order to deal with DAGs. Linking the two views enables the user to visually and interactively explore elements of the hierarchy with respect to selected attributes, while being able to locate the node in the DAG.
Payment method negotiation service: framework and programming specification
Authors: Alireza Bahreman, Rajkumar Narayanaswamy
Venue: Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce - Volume 2 (1996)

We propose a Payment Method Negotiation Service in this paper. This service enables transacting peers to determine and negotiate their common set of payment methods, protocols, systems or mechanisms, system providers, capabilities, accounts, and instruments. The service also enables the peers to select, among the negotiated choices, a particular payment system or mechanism to use to conduct commerce. We use a modular framework and define an object-based solution. The programming interface is modular and extensible and can interoperate with a wide range of payment systems. The service is transport independent and can support a variety of communication models. Therefore, all electronic commerce application developers would be able to accommodate this service in their applications. The Payment Method Negotiation service introduced here is part of the Generic Electronic Payment Services (GEPS) framework being designed and implemented in the E-CO System Project.
Modeling of concurrent web sessions with bounded inconsistency in shared data
Authors: Alexander Totok, Vijay Karamcheti
Venue: Journal of Parallel and Distributed Computing (2007)

Client interactions with web-accessible network services are organized into sessions involving requests that read and write shared application data. When executed concurrently, web sessions may invalidate each other's data. Allowing the session with invalid data to progress might lead to financial penalties for the service provider, while blocking the session's progress will result in user dissatisfaction. A compromise would be to tolerate some bounded data inconsistency, which would allow most of the sessions to progress, while limiting the potential financial loss incurred by the service. This paper develops analytical models of concurrent web sessions with bounded inconsistency in shared data, which enable quantitative reasoning about these tradeoffs. We illustrate our models using the sample buyer scenario from the TPC-W benchmark, and validate them by showing their close correspondence to measured results in both a simulated and a real web server environments. We augment our web server with a profiling and automated decision making infrastructure which is shown to successfully choose the best concurrency control algorithm in real time in response to changing service usage patterns.
A further investigation on AR-vector models for text-independent speaker identification
Authors: I. Magrin-Chagnolleau
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

In this paper, we investigate on the role of dynamic information on the performances of AR-vector models for speaker recognition. To this purpose, we design an experimental protocol that destroys the time structure of speech frame sequences, which we compare to a more conventional one, i.e., keeping the natural time order. These results are also compared with those obtained with a (single) Gaussian model. Several measures are systematically investigated in the three cases, and different ways of symmetrisation are tested. We observe that the destruction of the time order can be a factor of improvement for the AR-vector models, and that results obtained with the Gaussian model are merely always better. In most cases, symmetrisation is beneficial.
A Novel Approach for Frequent Phrase Mining in Web Search Engine Query Streams
Authors: M. Barouni-Ebarhimi, Ali A. Ghorbani
Venue: Proceedings of the Fifth Annual Conference on Communication Networks and Services Research (2007)

In this paper, conceptual frequency rate, a new frequency definition suitable for query stream mining, is introduced. An online single-pass algorithm called OFSD (Online Frequent Sequence Discovery) is given, to mine the set of all conceptual frequent sequences in a data stream whose conceptual frequency rates satisfy a minimum user defined frequency rate. Phrase recommender algorithm is then described based on the set of conceptual frequent phrases extracted by the OFSD algorithm. We have also designed a query recommender algorithm, OQD (Online Query Discovery). OQD is used for comparison purposes along side the proposed phrase recommender algorithm. Simulation results show the efficiency of the proposed Phrase recommender algorithm compared to OQD.
On shopping incognito
Authors: Ralf Hauser, Gene Tsudik
Venue: Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce - Volume 2 (1996)

The increasing popularity and importance of electronic commerce makes very apparent the issue of privacy and anonymity for electronic consumers. Technologies are already in existence that offer some degree of electronic privacy, e.g., electronic/digital cash However, the mere fact that electronic commerce is conducted over existing network infrastructure (such as the global Internet) runs counter to the privacy of the consumer. This is due mainly to the end-to-end nature of application protocols that are used as vehicles for electronic commerce - World-Wide Web (WWW), Electronic Mail, File Transfer Protocols and others. In this paper we discuss the issue of consumer anonymity and propose some solutions for the activities that typically "surround" electronic payment: pre-purchase browsing and merchandise delivery.
Engineers invent and innovate
Authors: L. E. Carlson
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

First-year students at CU gain a hands-on introduction to engineering through a design and build projects course. In fall 1998, a course with an emphasis on entrepreneurship was piloted to provide advanced and transfer students with similar hands-on opportunities. This paper summarizes course components and lessons learned, and describes some of the products invented. Students design and build an invention of their choice, and explore entrepreneurial topics including profitability, marketing, raising venture capital, angel investors and patenting. Creating mini-business plans forces teams to estimate the manufacturing cost of their product and forecast potential sales revenues. A two-week introductory design project provides an early opportunity for creativity, as well as insight into individual strengths and weaknesses in a team environment. Assessment results are presented as learned from student focus group interviews and pre- and post-course innovation skills assessment surveys. In spring 2000, two student teams received funding from NCIIA to continue development of their products.
A faculty-driven quality initiative at the Colorado School of Mines
Authors: B. M. Olds, R. L. Miller
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

Although a small group of faculty at the Colorado School of Mines has been actively concerned about quality and continuous improvement issues for years, our involvement increased when we recently received a TQM curriculum implementation grant from Procter and Gamble (P&G). We have learned several valuable lessons through our work over the past two years with this grant: faculty buy in and involvement are essential for a successful program; given the opportunity, faculty will be interested in ways to improve teaching and learning; faculty and students are best qualified to judge the effectiveness of their courses and effect changes; assessment is an essential part of the quality process. When we received the P&G grant, we decided to make our quality efforts curriculum centered and grassroots organized. The paper highlights what we have done and what we have learned over the past three years (1992-5) in the hope that our experience may prove valuable to others, especially teaching faculty, who are interested in incorporating TQM concepts into their classrooms but who have little previous experience.
A Privacy Oriented Extension of Attribute Exchange in Shibboleth
Authors: Shoichirou Fujiwara, Takaaki Komura, Yasuo Okabe
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

In frameworks for Web services like SAML, Liberty or Shibboleth, a user can get authentication by asking one's IdP (identity provider) to issue a security assertion by which one can get access to services at an SP (service provider). If the SP additionally requests some attributes of one's, the user is forced to reveal the immediate values of them. There are cases where users must present detailed privacy information which SPs don't actually require to authorize them. We focus on Shibboleth and propose an extension of the attribute exchange protocol between an IdP and an SP in Shibboleth. While in the conventional framework of Shibboleth attributes are exchanged in immediate value, in our extension an SP requests an IdP to test whether user's attributes are satisfied some conditions, then the IdP returns either "true", "false" or "unanswerable" to the SP. We specify a language to describe the conditions as a query at the SP. We also extend an Attribute Authority at the IdP to evaluate the conditions presented from the SP.
Wavelets in the frequency domain for narrowband process detection
Authors: P. Willett
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

Detecting signals that are long, weak, and narrowband is a well known and important problem in acoustic signal processing. In this paper an ad hoc scheme is developed: its stages include the DFT, a multiresolution decomposition in the frequency domain, and a GLRT. The computational load is light, and the performance is remarkably good. This is so not just in the original narrowband situation, but also, due to an inherent adaptivity to the data, in the detection of signals that are relatively broadband in nature. Generalizations are given to CFAR operation in both prewhitened and unwhitened cases, and to the detection of multi-band signals. As regards the last, it is discovered that there is little loss from over-estimating the number of bands.
Creation of two children's speech databases
Authors: J. D. Miller
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

Two sets of speech recordings were made from children talkers ranging in age from 5 to 18 years. One set was recorded via telephone channels (TEL) and the other using high-fidelity recording equipment (MIC). Special considerations and techniques required for the recording of speech from children are discussed. Also presented are (1) a description of the recording environment including ambient noise levels, (2) the vocabularies used for both sets of recordings, and (3) the distribution of talkers by age and sex. A total of 478 and 436 young talkers (age 5-18 years' inclusive) were employed for the TEL and MIC recordings, respectively. Finally, speech was also recorded from 59 deaf talkers (age 6-14 years' inclusive).
The Effect of Large Clock Drifts on Performance of Event and Time Triggered Network Interfaces
Authors: Dawid Trawczynski, Janusz Sosnowski, Janusz Zalewski
Venue: Proceedings of the 2nd International Conference on Dependability of Computer Systems (2007)

This paper discusses some dependability problems (e.g. message delays) related to clock drifts in the processing nodes of real-time networks based on event and time triggered interfaces. We show that having detected the clock drift, it is reasonable to delay the shutdown of the network node whose clock synchronization algorithm is not able to track a high clock drift. We observed that transient clock drifts, which last up to one second and are as high as 2e-2 sec/sec do not increase message delays above safety-critical required levels. We verified this by injecting transient faults into our new clock model and measured the message delay between a pair of network nodes. The performed experiments revealed that time triggered interfaces are more sensitive to transient clock drift disturbances than event triggered interfaces.
Algorithm of Scattered Data Reduction for Surface Reconstruction using Radial Basis Function
Authors: Xinping Ji, Xiaojun Wu, Michael Yu Wang
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

This paper concerns a method to reduce centers progressively for radial basis function surface reconstruction from scattered point set to decrease the computational complexity, which belongs to the category of data filtering. In the procedure of the algorithm, we use kd tree to reduce the computational complexity and make it practical for large number of points, then use the radial basis function to approximate, the good performance of the proposed filtering scheme is finally shown by some experimental examples.
P3P Adoption on E-Commerce Web sites: A Survey and Analysis
Authors: Patricia Beatty, Ian Reay, Scott Dick, James Miller
Venue: IEEE Internet Computing (2007)

To maintain user trust, e-commerce vendors have a strong incentive to protect customers' privacy. The authors examine whether this incentive translates into the adoption of the Platform for Privacy Preferences Project (P3P) in the ecommerce industry. They present the results from a Web crawl to illustrate P3P's current state of adoption among different Web sectors, and how it interacts with other privacy-enhancing technologies (PETs).
Energy optimization for chain-based data gathering in wireless sensor networks: Research Articles
Authors: Li-Hsing Yen, Ming-Zhou Cai, Yang-Min Cheng, Ping-Yuan Yang
Venue: International Journal of Communication Systems (2007)

This paper aims to minimize energy expense for chain-based data gathering schemes, which is essential to prolong the operation lifetime of wireless sensor networks. Energy expense in chain-based data gathering schemes consists of two parts. One corresponds to inter-sensor communications and depends on chain structure. The other corresponds to leader-BS (base station) communications and depends on leader scheduling policy. To optimize inter-sensor communications, the notion of virtual chain is utilized, where an edge may correspond to a multi-hop data propagation path to conserve power. In contrast, an edge in previous work can only be a costly direct communication link. To optimize leader-BS communications, a leader scheduling rule is presented, where the node with the maximum residual power will be selected to be the leader of the chain. In contrast, nodes in previous work act as leaders by turns, resulting in non-uniform energy consumption among sensors. Simulation results show that our strategies are nearly optimal in terms of power conservation. Copyright &copy; 2006 John Wiley & Sons, Ltd.
MOPSO: a proposal for multiple objective particle swarm optimization
Authors: C. A. Coello Coello, M. S. Lechuga
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

This paper introduces a proposal to extend the heuristic called "particle swarm optimization" (PSO) to deal with multiobjective optimization problems. Our approach uses the concept of Pareto dominance to determine the flight direction of a particle and it maintains previously found nondominated vectors in a global repository that is later used by other particles to guide their own flight. The approach is validated using several standard test functions from the specialized literature. Our results indicate that our approach is highly competitive with current evolutionary multiobjective optimization techniques.
Cramer-Rao Lower Bound Calculations for Registration of Linearly-Filtered Images
Authors: David W. Tyler
Venue: Proceedings of the 35th Applied Imagery and Pattern Recognition Workshop (2006)

I have developed covariance matrix expressions for the registration Cramer-Rao Lower Bound for images processed with a linear filter. These results also generalize a previous registration CRLB by accounting for Poisson noise as well as read noise. Expressions shown here have been translated into a Fortran 90 code currently being tested.