ppxscal/embedding_network huggingface dataset:
PDM: a new strong password-based protocol
Authors: Charlie Kaufman, Radia Perlman
Venue: Proceedings of the 10th conference on USENIX Security Symposium - Volume 10 (2001)

In this paper we present PDM (Password Derived Moduli), a new approach to strong password-based protocols usable either for mutual authentication or for downloading security information such as the user's private key. We describe how the properties desirable for strong password mutual authentication differ from the properties desirable for credentials download. In particular, a protocol used solely for credentials download can be simpler and less expensive than one used for mutual authentication since some properties (such as authentication of the server) are not necessary for credentials download. The features necessary for mutual authentication can be easily added to a credentials download protocol, but many of the protocols designed for mutual authentication are not as desirable for use in credentials download as protocols like PDM and basic EKE and SPEKE because they are unnecessarily expensive when used for that purpose. PDM's performance is vastly more expensive at the client than any of the protocols in the literature, but it is more efficient at the server. We claim that performance at the server, since a server must handle a large and potentially unpredictable number of clients, is more important than performance at the client, assuming that client performance is "good enough". We describe PDM for credentials download, and then show how to enhance it to have the properties desirable for mutual authentication. In particular, the enhancement we advocate for allowing PDM to avoid storing a password-equivalent at the server is less expensive than existing schemes, and our approach can be used as a more efficient (at the server) variant of augmented EKE and SPEKE than the currently published schemes. PDM is important because it is a very different approach to the problem than any in the literature, we believe it to be unencumbered by patents, and because it can be a lot less expensive at the server than existing schemes.
Pattern-oriented instruction and its influence on problem decomposition and solution construction
Authors: Orna Muller, David Ginat, Bruria Haberman
Venue: ACM SIGCSE Bulletin (2007)

Novices often experience difficulties in problem analysis and solution construction. Pattern-oriented instruction (POI) is a pedagogical approach based on incorporating patterns into instruction design. It is well-grounded in cognitive theories concerning knowledge construction and organization as well as the acquisition of expertise in problem solving. We show that the incorporation of algorithmic patterns through POI may enhance the construction of algorithmic problem-solving knowledge. Findings of a comparative research study showed that novices who studied according to the POI approach exhibited better problem-solving competence than those who studied in a traditional manner. Specifically, they were more competent in problem decomposition and solution construction.
Intelligent predictive control of a power plant with evolutionary programming optimizer and neuro-fuzzy identifier
Authors: H. Ghezelayagh, K. Y. Lee
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

An intelligent predictive controller is implemented to control a fossil fuel power unit. This controller is a non-model based system that uses a self-organized neuro-fuzzy identifier to predict the response of the plant in a future time interval. The control inputs are optimized in this prediction horizon by evolutionary programming (EP) to minimize the error of identifier outputs and reference set points. The identifier performs automatic rule generation and membership function tuning by genetic algorithm (GA) and error back-propagation methods, respectively. This intelligent system provides a predictive control of multi-input multi-output nonlinear systems with slow time variation.
On the Intrinsic Fault-Tolerance Nature of Parallel Genetic Programming
Authors: Daniel Lombrana Gonzalez, Francisco Fernandez de Vega
Venue: Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (2007)

In this paper we show how Parallel Genetic Programming can run on a distributed system with volatile resources without any lack of efficiency. By means of a series of experiments, we test whether Parallel GP -and consistently Evolutionary Algorithms- are intrinsically fault-tolerant. The interest of this result is crucial for researchers dealing with real-life problems in which parallel and distributed systems are required for obtaining results on a reasonable time. In that case, parallel GP tools will not require the inclusion of fault-tolerant computing techniques or libraries when running on Meta-systems undergoing volatility, such us Desktop Grids offering Public Resource Computing. We test the performance of the algorithm by studying the quality of solutions when running over distributed resources undergoing processors failures, when compared with a fault-free environment. This new feature, which shows its advantages, improves the dependability of the Parallel Genetic Programming Algorithm.
A split-combination approach to merging knowledge bases in possibilistic logic
Authors: Guilin Qi, Weiru Liu, David H. Glass, David A. Bell
Venue: Annals of Mathematics and Artificial Intelligence (2006)

We propose an adaptive approach to merging possibilistic knowledge bases that deploys multiple operators instead of a single operator in the merging process. The merging approach consists of two steps: the splitting step and the combination step. The splitting step splits each knowledge base into two subbases and then in the second step, different classes of subbases are combined using different operators. Our merging approach is applied to knowledge bases which are self-consistent and results in a knowledge base which is also consistent. Two operators are proposed based on two different splitting methods. Both operators result in a possibilistic knowledge base which contains more information than that obtained by the t-conorm (such as the maximum) based merging methods. In the flat case, one of the operators provides a good alternative to syntax-based merging operators in classical logic.
A new constraint for the regularized enhancement of compressed video
Authors: C. A. Segall
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

A novel fidelity constraint to the image enhancement problem is presented. With this constraint, we exploit the motion vectors of a compressed video bit-stream. These vectors establish a correspondence between image pixels across a series of frames, and we guarantee that processing the decoded sequence does not violate this correspondence. We develop the constraint within the context of MPEG-2 and incorporate the constraint into a regularized enhancement algorithm. Simulations are then performed. Quantitative and qualitative results illustrate an improvement in visual quality.
Modelling of Complex Supply Networks
Authors: Georg Weichhart, Chris Stary, Stefan Oppl
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

The increased complexity of products and production processes as well as market developments require models of networked organisations that enable mutual tuning and continuous improvements at the process level. In addition, divergent goals of network partners might require distributed decision making. Collaboration frameworks help to meet those requirements, however, need to be developed in a structured way. In this paper, we detail essential requirements for such frameworks.
Dynamic guiding of bounded property checking
Authors: P. M. Peranandam, R. J. Weiss, J. Ruf, T. Kropf, W. Rosenstiel
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2004. Ninth IEEE International (2004)

Current statistics attribute up to 75% of the overall design costs of digital hardware and embedded system development to the verification task. In recent years, the trend to augment functional with formal verification tries to alleviate this problem. Efficient property checking algorithms allow automatic verification of middle-sized designs nowadays. However, the steadily increasing design sizes still leave verification the major bottleneck, because formal methodologies do not yet scale to very large designs. In this paper we present the formal verification tool SymC based on forward state space traversal and so-called AR-automata for property checking, both internally represented with BDDs. Furthermore, we introduce a new methodology called dynamic guiding. This methodology best suits multimodule concurrent finite state machine (FSM) designs. The aim of guiding is to reduce the intermediate and final BDD size, which in turn makes this verification technique applicable to larger designs. Our approach exploits abstract information of the design in the form of regular expressions and effectively guides the symbolic traversal depending on the verified property.
Promoting active learning: the role of the faculty as agent provocateur
Authors: J. A. Pearce
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

An experiment in promoting active learning was conducted in a junior level required Electrical Engineering class, Electromagnetic Engineering I. The class was not large, numbering only 35. Students were asked to prepare prior to lecture and queried in a general way (no specific names were called) during the lecture. An effort was made to provoke interaction and response on a wide range of topics (including extracurricular topics) as a motivational tool. Class rules were designed to break passive learning habits. Results were mixed: in-class response did improve during the semester; however, class test scores were usually strongly bimodal. Student reaction was generally strongly positive.
A new spectrum envelope estimation technique based on sample projections
Authors: N. M. Abu-Shikhah, O. Aloquili
Venue: Signal Processing (2007)

Spectral envelope plays a very important role in different areas of speech applications. This envelope contains the intelligible information within a given message. A new spectral envelope estimation method with two different versions has been introduced in this paper. This method is based on sample projections. The proposed technique incorporates the weighted effect of extrapolation of previous samples on the current sample. This is achieved through the implementation of an Auto Regressive (AR) model. Results showed that higher peaks in the envelope are obtained based on the proposed technique. This means that more emphasis is given on the poles of the filter transfer function and hence leading to better conveying of the message effectively. The proposed technique leads to better speech quality when applied to speech coding and speech recognition. It is found that the filter order resulting from the proposed method will increase by one as compared to the traditional linear prediction (LP) method. Moreover, in some cases, the resulting filter must be stabilized by moving the poles to lie within the unit circle.
Inexact graph matching using a genetic algorithm for image recognition
Authors: Surapong Auwatanamongkol
Venue: Pattern Recognition Letters (2007)

Exact graph matching using a genetic algorithm for image recognition has been introduced in previously published work. The algorithm was based on angle matching between two given graphs. It has proven to be quite effective in exact graph matching. However, the algorithm needs some modifications in order to handle cases where the number of nodes, shapes and rotations of the two graphs are different. This paper presents modifications such as the introduction of node exemption, inexact matching between straight lines and curves in the graphs and consideration of rotational degrees of the graphs. Each angle in a graph is also given a weight to indicate the significant degree of identifying the graph. A multi-objective function is used to reflect the similarity between two graphs. The experiments designed to evaluate the algorithm have shown very promising results. It is highly accurate in matching graphs with dissimilarities in shape, number of nodes and degrees of rotation.
Jumbo store: providing efficient incremental upload and versioning for a utility rendering service
Authors: Kave Eshghi, Mark Lillibridge, Lawrence Wilcock, Guillaume Belrose, Rycharde Hawkes
Venue: Proceedings of the 5th USENIX conference on File and Storage Technologies (2007)

We have developed a new storage system called the Jumbo Store (JS) based on encoding directory tree snapshots as graphs called HDAGs whose nodes are small variable-length chunks of data and whose edges are hash pointers. We store or transmit each node only once and encode using landmark-based chunking plus some new tricks. This leads to very efficient incremental upload and storage of successive snapshots: we report compression factors over 16x for real data; a comparison shows that our incremental upload sends only 1/5 as much data as Rsync. To demonstrate the utility of the Jumbo Store, we have integrated it into HP Labs' prototype Utility Rendering Service (URS), which accepts rendering data in the form of directory tree snapshots from small teams of animators, renders one or more requested frames using a processor farm, and then makes the rendered frames available for download. Efficient incremental upload is crucial to the URS's usability and responsiveness because of the teams' slow Internet connections. We report on the JS's performance during a major field test of the URS where the URS was offered to 11 groups of animators for 10 months during an animation showcase to create high-quality short animations.
Implementing multiservice wireless LANs in the enterprise
Authors: R. P. Swale, M. M. Fontenoy
Venue: BT Technology Journal (2007)

Wireless networks based on IEEE802.11 specifications have emerged to be the de facto wireless networking technology for modern enterprise networks. When appropriately designed into a network, this commonly available equipment now makes it possible for a whole suite of services to be delivered from a common high performance infrastructure. This paper reviews the types of service now viable, and considers the practical steps that need to be taken to achieve a successful implementation for an enterprise class network.
WWG: a distributed infrastructure for learning in groups
Authors: J. M. Marques
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

This paper describes the experiences of learning and working in groups on the Computer Science studies at the Virtual Campus of the Open University of Catalunya. Two communities have used a web based shared workspace tool to (a) coordinate the task of tutors of a computer architecture course, and (b) a problem based collaborative learning project with software engineering students. These experiences have lead to the design of WWG: a distributed infrastructure for distance learning in groups on an Internet scale. WWG is based on the distribution of events about the information produced by people. Every participant can be notified and thus be aware of the actions, changes, and progress of the groups he belongs to: synchronous awareness for asynchronous work. There are three classes of components that work together: user agents for collecting and presenting actions to people, meta-information agents for distributing event information, and repository agents for providing distributed storage for group objects.
Delay Components of Job Processing in a Grid: Statistical Analysis and Modeling
Authors: K. Christodoulopoulos, V. Gkamas, E. A. Varvarigos
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

The existence of good probabilistic models for the job arrival process and the delay components introduced at the different stages of job processing in a Grid environment is important for the improved understanding of the computing concept envisioned by the Grid. In this study, we present a thorough analysis of the job arrival process in the EGEE infrastructure and the time durations a job spends at different states in the EGEE environment. We define four delay components of the total job delay and model each component separately. We observe that the job inter-arrival times at the Grid level can be adequately modeled by a rounded exponential distribution, while the total job delay (from the time it is generated until the time it completes execution) is dominated by the Computing Element's queuing and Worker Node's execution times.
Engineering togetherness (an incentive system for interdisciplinary research)
Authors: J. A. Roberts
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

Engineering faculty members today are expected to fulfill missions of classroom instruction, research and scholarship, and service. Particularly on research university campuses, there is an expectation that engineering faculty will conduct externally funded research. Moreover, engineering research should no longer be conducted in isolation as interdisciplinary research has taken on increased emphasis and importance. Traditional academic department organizations can present barriers to interdisciplinary research as inevitably issues of credit and money rear their heads. This paper describes the process that the University of Kansas uses to assign credit and to return overhead funds to academic units, research centers and institutes, and principal investigators in an effort to break down barriers to interdisciplinary research. We also describe the way that research centers are organized and administered at the university, again with the goal of promoting bigger projects and breaking down barriers. We conclude with results of these actions.
Plantio: an interactive pot to augment plants' expressions
Authors: Satoshi Kuribayashi, Yusuke Sakamoto, Maya Morihara, Hiroya Tanaka
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

This paper introduces an interactive pot called "Plantio" which realizes hybridization between plants and electronic computing systems. The goal for this research is to create an intimate relationship between human and plants. Plantio represents plants' biopotentials changed by surroundings, and it makes various expressions according to daily interactions with human. Plantios' representation begins to have individuality as it interacts with users and environments.
Semantic Web approach to smart link generation for Web navigations
Authors: Shang-Juh Kao, I-Ching Hsu
Venue: Software&mdash;Practice Experience (2007)

The rapid development of the Internet has led to diverse applications of accessing various Web resources, such as Web pages, XML documents, pictures and video and audio files. Intelligently discovering how these Web resources are related in order to enable effective Web surfing is a current challenge in Internet development. The XML Link Language (XLink), which is a W3C recommendation for describing the relationships among Web resources, is a potential solution to this problem. However, XLink is still short of knowledge representation in handling computer-interpretable effects, such as dynamic link generations. This study attempts to integrate knowledge into XLink by defining a multi-layered semantic framework. The proposed framework is across four layers of the semantic Web stack, including the URI layer, XML (XLink) layer, ontology layer and rule layer, to facilitate machine understanding. The ontology, which is based on description logics, provides sound reasoning, while the rule is a logic program built on top of an ontology to support complementary inference capabilities. Based on the multi-layered semantic framework, an intelligent XLink shell, called XLinker, is also developed to facilitate three semantic approaches of linking associations, i.e. XLink-based metadata, ontology-based reasoning and rule-based inference. To demonstrate the feasibility of XLinker, an XLink Transcoding Web Server is also implemented to reveal smart hyperlink generation for Web navigations. Copyright &copy; 2006 John Wiley & Sons, Ltd.
A library-based distributed shared memory system
Authors: Andrew J. Weber
Venue: Proceedings of the 3rd annual conference on Atlanta Linux Showcase - Volume 3 (1999)

Distributed computing systems made up of a collection of computers require effective communication between the participating computers. The two fundamental models of communication are the message passing model and the shared memory model. The shared memory model can be further broken down into hardware-based, page-based, and library-based implementations. The Network Chunk System implements a library-based shared memory model of communication using IP multicast as the underlying transport. NCS provides for several dynamically configurable data replication behaviors. Each named data element, or chunk, may be configured to be replicated in any one of the supported ways at any given time. Beowulf and Network of Workstations clusters currently have several message passing model implementations to choose from such as PVM and MPI/LAM. Beowulf clusters also have page-based shared memory models such as the ZOUNDS based implementation from Sarnoff and a package being implemented by Jason Crawford. NCS provides a library-based shared memory model implementation which provides a different approach to the already available message passing and page-based shared memory options. This paper presents the overall design of NCS and introductory guide to using NCS.
Circular colouring and algebraic no-homomorphism theorems
Authors: Amir Daneshgar, Hossein Hajiabolhassan
Venue: European Journal of Combinatorics (2007)

In this paper, we apply some new algebraic no-homomorphism theorems in conjunction with some new chromatic parameters to estimate the circular chromatic number of graphs. To show the applicability of the general results, as a couple of examples, we generalize a well known inequality for the fractional chromatic number of graphs and we also show that the circular chromatic number of the graph obtained from the Petersen graph by excluding one vertex is equal to 3. Also, we focus on the Johnson-Holroyd-Stahl conjecture about the circular chromatic number of Kneser graphs and we propose an approach to this conjecture. In this regard, we introduce a new related conjecture on Kneser graphs and we also provide some supporting evidence.
Facilitating Group Decisions through Multicriteria Analysis and Agent Based Modeling
Authors: George Rigopoulos, John Psarras, Nikolaos V. Karadimas, Alessandra Orsoni
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

Decisions in today's demanding business environment often require participation of a group of decision makers. Although decision complexity increases by the number of the participating decision makers, in many cases it is necessary to combine experts' knowledge to minimize risk. Banking sector is a domain where decision makers face decision problems and need appropriate methodologies and tools to support them. However, complexity in tools and methodologies directs them to follow less structured methodologies, mostly heuristic based. Considering the above issues, we present our approach towards a Group Decision Support System, which utilizes muliticirteria analysis and multiagent modeling, and is oriented towards sorting decisions in the financial sector.