ppxscal/embedding_network huggingface dataset:
The importance of learning styles in group design work
Authors: K. Carrizosa
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

Effective communication between engineering design team members is essential. It depends on the successful transfer (sending, receiving and processing) of information. This information may range from data and facts to creative ideas. Recent work by R. Felder and L. Silverman (1988) has shown that individuals differ from one another in how they prefer to receive and process information. In this paper, we look at the relationship between individuals' preference for receiving information and their methods of sending information. It was initially anticipated that each individual's mode of presenting information would match his or her preferred mode of receiving information, and that this match would result in improved communication. To study the congruency (or incongruency) of how individuals prefer to receive information and how they go about sending information, an experiment was designed and conducted. The experiment consisted of four teams of engineering educators engaged in a design exercise. Their design activities were videotaped. Results based on analysis of the tapes and individual learning styles inventories showed that most participants preferred to receive information visually and engaged in drawing very little during the design exercise. If the definition was expanded to include using drawings, communicative gesturing (i.e. using hand gestures to describe a physical object or action), using hardware and referencing hardware, then visual communication went from comprising an average of 3.8% of the design time to an average of 21.1% of the design time.
Distributed Flow Admission Control for Multimedia Services Over Wireless Ad Hoc Networks
Authors: Yong Pei, Viraj Ambetkar
Venue: Wireless Personal Communications: An International Journal (2007)

In this paper we propose a novel Priority-based Distributed flow Admission Control (PDAC) protocol to provide Quality of Service (QoS) to multimedia applications over the Dynamic Source Routing (DSR) protocol-based wireless ad hoc networks. In contrast to short-term packet forwarding, medium and long-term multimedia and real-time traffic may benefit from `flow'-based transmission due to the reduction in the packet-level control overhead. In this paper, we introduce a new DSR option called the "Admission Control Option" for flow establishment, and present a new scalable transmission rate reservation protocol to support bandwidth-constrained traffic flows in interference-limited wireless ad hoc networks. It allows a node in the wireless ad hoc network to establish or discard a traffic flow state based on the global knowledge of traffic flow priority, and local knowledge in the form of interference and effective transmission rate. The PDAC scheme can also operate in a `cross-layer' protocol architecture that encompasses the network layer and the MAC layer.
Autonomous Community Area Construction Technology to Achieve High Assurance
Authors: Hiroyuki Endo, Yosuke Sugiyama, Kotaro Hama, Yuuki Nakahara, Kinji Mori
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

With the advancement of wireless communication, widespread devices and mobile communication technologies have realized location-aware services. In such an environment, the necessity for an effective service discovery is becoming increasingly important, but because of the static property, conventional technologies such as re-setting various TTL (Time To Live) face the difficulties when considering dynamic situation. In this paper, Autonomous Community Area Construction Technology composed of Autonomous Service Search Technology and Autonomous Service Area Construction Technology is proposed as the service retrieval technology in dynamic and distributed environment. In Autonomous Service Search Technology, the searching area is set dynamically by the response of Service Provider (SP) in a single request. Thus, the timeliness can be improved in the situation where location of SP is unpredictable. Autonomous Service Area Construction Technology achieves the service retrieval by adopting the idea of dynamic data caching technology. The simulation result shows the effectiveness of the technology.
Supporting network coordinates on PlanetLab
Authors: Peter Pietzuch, Jonathan Ledlie, Margo Seltzer
Venue: Proceedings of the 2nd conference on Real, Large Distributed Systems - Volume 2 (2005)

Large-scale distributed applications need latency information to make network-aware routing decisions. Collecting these measurements, however, can impose a high burden. Network coordinates are a scalable and efficient way to supply nodes with up-to-date latency estimates. We present our experience of maintaining network coordinates on PlanetLab. We present two different APIs for accessing coordinates: a per-application library, which takes advantage of application-level traffic, and a stand-alone service, which is shared across applications. Our results show that statistical filtering of latency samples improves accuracy and stability and that a small number of neighbors is sufficient when updating coordinates.
Principal component analysis for facial animation
Authors: K. Goudeaux
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

This paper presents a technique for animating a three-dimensional face model through the application of principal component analysis (PCA). Using PCA has several advantages over traditional approaches to facial animation because it reduces the number of parameters needed to describe a face and confines the facial motion to a valid space to prevent unnatural contortions. First, real data is optically captured in real time from a human subject using infrared cameras and reflective trackers. This data is analyzed to find a mean face and a set of eigenvectors and eigenvalues that are used to perturb the mean face within the range described by the captured data. The result is a set of vectors that can be linearly combined and interpolated to represent different facial expressions and animations. We also show that it is possible to map the eigenvectors of one face onto another face or to change the eigenvectors to describe new motion.
Uncertainty identification, representation and inference in a user adaptive information system
Authors: Anthony F. Norcio
Venue:  (2005)

Uncertainty that arises due to imperfect information about users is a major problem in user modeling and user adaptive systems. In this dissertation, different sources, types and requirements for handling uncertainty in user modeling and user adaptive systems are identified. Subsequently, system architectures for user modeling and user-adaptive information systems under uncertainty are developed. The study develops the theoretical foundation that comprises concepts and methods from fuzzy theory, possibility theory, and machine-learning. Using the theoretical foundation, two methods for representation, inference, and measurement of uncertainty due to vagueness, imprecision, and ambiguity are developed. The Fuzzy Theoretic Item Based Similarity Driven Recommendation method (FTIBSDRM) is proposed and developed for building short-term user models based on item and user features; and Neuro-fuzzy method is proposed and used for learning stereotype user models based on item and user demographic features. For a movie recommender system, relationships between a movie and its genres, and the level of user interest in movies are represented using fuzzy set with possiblistic interpretation. As inference strategy, the maximum-minimum and weighted-sum along with fuzzy theoretic similarity measures are used.The results of simulation experiments for a movie recommender system provide empirical support for the effectiveness and efficiency of FTIBSDRM compared to the best results of conventional recommendation methods. First, an increase of 141%, 5.2% and 33% in precision, recall, and F1-Measure are obtained, respectively. Secondly, a decrease of 60% and 58% for model time and recommendation time are obtained, respectively. Thirdly, model sizes of 5 to 15, and recommendation size of 3 to 10 appear to produce satisfactory recommendation accuracy, compared to the 10 to 20 for model size and 10 for recommendation size. Furthermore, the classification accuracy and mean square of error show the Neuro-fuzzy method to be as effective as conventional machine learning approach. Therefore, modeling uncertainty can contribute to the effectiveness and efficiency of user adaptive information systems. Furthermore, for recommender systems, depending on user tasks and available data, designers of user adaptive systems can choose the Neuro-fuzzy method or a combination of one of the inference strategies and the fuzzy theoretic similarity measures of FTIBSDRM.
Scene cut detection from MPEG video stream coded without B pictures
Authors: A. M. Dawood
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

We propose an algorithm that automatically detects clear scene cut locations from an MPEG-1 video bit stream coded with a GOP structure of M=1, without B pictures. The algorithm detects scene cuts at P type pictures by monitoring the percentage of intramacroblocks per P picture. while scene cuts at I pictures are detected by matching the macroblock type of the two P pictures at the GOP boundaries. A "type matching parameter" (TMP) is developed to estimate the matching degree between the macroblock types of two P pictures. It is shown that the method is able to identify the location of scene cuts in P and I pictures with a high success rate.
A case study in configuration management tool deployment
Authors: Narayan Desai, Rick Bradshaw, Scott Matott, Sandra Bittner, Susan Coghlan, Rémy Evard, Cory Lueninghoener, Ti Leggett, John-Paul Navarro, Gene Rackow, Craig Stacey, Tisha Stacey
Venue: Proceedings of the 19th conference on Large Installation System Administration Conference - Volume 19 (2005)

While configuration management systems are generally regarded as useful, their deployment process is not well understood or documented. In this paper, we present a case study in configuration management tool deployment. We describe the motivating factors and both the technical considerations and the social issues involved in this process. Our discussion includes an analysis of the overall effect on the system management model and the tasks performed by administrators.
Vamping on Ultrafractal
Authors: Gary Singh
Venue: IEEE Computer Graphics and Applications (2007)

Prolific fractal artist Michael Sussna has a varied and interdisciplinary academic background, however, as an artist, he is entirely self-taught. He grew up with a mother who painted and he had an extensive collection of art books long before he had an interest in creating art. "Combining that pursuit with my long-standing love for science fiction and the fantastic, my comfort with mathematics and computing, and my deep appreciation for the abstract, the dive into fractal art creation was a natural step for me," he said. Although he's been incredibly prolific over the years, the end is nowhere in sight.
Dynamic instruction stream editing
Authors: E. Christopher Lewis
Venue:  (2006)

This dissertation proposes a novel, cooperative hardware/software mechanism, called DISE (dynamic instruction stream editor), for efficiently transforming programs. DISE transforms programs using programmable instruction macro-expansion. It resides within the processor inspecting every fetched instruction. Based on user-defined rules, it macro-expands some of those instructions into parameterized replacement sequences.DISE can express a broad range of transformations including transformations for profiling program characteristics, implementing interactive debugging primitives, decompressing compressed programs, and detecting stack and pointer smashing attacks. This dissertation describes the functionality, interface, and system architecture of DISE and proposes one implementation of this architecture. Our evaluation demonstrates that DISE transformation is highly efficient. Unlike transformation mechanisms implemented entirely in software, DISE has no impact on instruction cache performance because it transforms instructions within the processor. Furthermore, the performance cost of macro-expanding instructions is neglible, which is not true of software mechanisms (although some mechanisms transform code statically rather than at runtime). The only significant performance cost of DISE transformation is executing the additional instructions, and this overhead is usually less than 25% for most transformations and benchmarks.
Rendezvous and Election of Mobile Agents: Impact of Sense of Direction
Authors: Lali Barriere, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro
Venue: Theory of Computing Systems (2007)

Consider a collection of r identical asynchronous mobile agents dispersed on an arbitrary anonymous network of size n. The agents all execute the same protocol and move from node to neighboring node. At each node there is a whiteboard where the agents can write and read from. The topology of the network is unknown to the agents. We examine the problems of rendezvous (i.e., having the agents gather in the same node) and election (i.e., selecting a leader among those agents). These two problems are computationally equivalent in the context examined here. We study conditions for the existence of deterministic generic solutions, i.e., algorithms that solve the two problems regardless of the network topology and the initial placement of the agents. In particular, we study the impact of edge-labeling on the existence of such solutions. Rendezvous and election are unsolvable (i.e., there are no deterministic generic solutions) if gcd(r,n) > 1, regardless of whether or not the edge-labeling has sense of direction. On the other hand, if gcd(r,n) = 1 then the initial placement of the robots in the network creates topological asymmetries that could be exploited to solve the problems. We prove that these asymmetries can be exploited if the edge-labeling has sense of direction, but cannot if the edge-labeling is arbitrary. The possibility proof is constructive: we present a solution protocol and prove its correctness. The protocol, among other features, uses a dynamic naming mechanism based on sense of direction to overcome the complete anonymity of the system.
A Grid-based algorithm for the solution of non-Markovian stochastic Petri nets: Research Articles
Authors: S. Distefano, A. Puliafito, M. Scarpa
Venue: Concurrency and Computation: Practice Experience (2007)

WebSPN is a modeling tool for the analysis of non-Markovian stochastic Petri nets that we developed some years ago. Its solution algorithm is based on a discretization of time and an approximation of non-exponentially distributed firing time transitions by means of the phase-type distributions. In order to solve the problems related to the management of the state space (which can become very large) we parallelized the solution algorithm through the MPICH libraries. To improve the MPICH parallel implementation with an adequate security management, a more efficient load distribution and fault-tolerance capabilities, in this paper we propose the porting of WebSPN from the MPI to the Grid computational paradigm. In addition to a better flexibility in accessing computational and storage resources, one of the main advantages is the introduction of a fault recovery system to detect and recover from potential machine faults. The resulting new tool is named GridSPN. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Hierarchical real-time garbage collection
Authors: Filip Pizlo, Antony L. Hosking, Jan Vitek
Venue: ACM SIGPLAN Notices (2007)

Memory management is a critical issue for correctness and performance in real-time embedded systems. Recent work on real-time garbage collectors has shown that it is possible to provide guarantees on worst-case pause times and minimum mutator utilization time. This paper presents a new hierarchical real-time garbage collection algorithm for mixed-priority and mixed-criticality environments. With hierarchical garbage collection, real-time programmers can partition the heap into a number of heaplets and for each partition choose to run a separate collector with a schedule that matches the allocation behavior and footprint of the real-time task using it. This approach lowers worst-case response times of real-time applications by 26%, while almost doubling mutator utilization -- all with only minimal changes to the application code.
An investigation into the automated assessment of the design-code interface
Authors: Alan Hayes, Pete Thomas, Neil Smith, Kevin Waugh
Venue: Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education (2007)

In this paper, we present an investigation into the development of a framework for the automatic grading (marking) of student submitted course work. We discuss this framework, its structure and its subsystems. Our framework has been developed in the context of the student submission consisting of two components: a design (using the UML methodology) and source code (using the Java programming language). The focus of our framework is upon the consistency between the student code and design. We discuss its context and development and highlight how we can infer structure from the student submission and use this to inform the assessment process. We describe the approach we are currently undertaking to instantiate this framework and apply it to work submitted for assessment by undergraduate computing students.
Phase detector models and their performances for IF/baseband frequency recovery for complex envelope based DSP implemented PLL
Authors: S. Kandeepan, S. Reisenfeld
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

This paper discusses four phase detector (PD) models that could be used in DSP implemented phase locked loops (PLL) for frequency recovery at intermediate frequency (IF) or at baseband. The PD models, which are nonlinear functions in general, can be easily implemented in DSP. The steady state and the acquisition performances of the PD models are discussed and compared with each other, and the noise statistics are explored by means of computer experiments and numerical analysis.
Solving general shallow wave equations on surfaces
Authors: Huamin Wang, Gavin Miller, Greg Turk
Venue: Proceedings of the 2007 ACM SIGGRAPH/Eurographics symposium on Computer animation (2007)

We propose a new framework for solving General Shallow Wave Equations (GSWE) in order to efficiently simulate water flows on solid surfaces under shallow wave assumptions. Within this framework, we develop implicit schemes for solving the external forces applied to water, including gravity and surface tension. We also present a two-way coupling method to model interactions between fluid and floating rigid objects. Water flows in this system can be simulated not only on planar surfaces by using regular grids, but also on curved surfaces directly without surface parametrization. The experiments show that our system is fast, stable, physically sound, and straightforward to implement on both CPUs and GPUs. It is capable of simulating a variety of water effects including: shallow waves, water drops, rivulets, capillary events and fluid/floating rigid body coupling. Because the system is fast, we can also achieve real-time water drop control and shape design.
A protocol for secure transactions
Authors: Douglas H. Steves, Chris Edmondson-Yurkanan, Mohamed Gouda
Venue: Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce - Volume 2 (1996)

Secure transactions form the computational basis for electronic commerce. Many forms of commerce depend upon there being a defined and verifiable relationship between messages in a transaction. We have identified three such relational properties: causality, atomicity and isolation. Causality is a new property. It allows the receiver of a message to deduce and verify the sequence of messages sent and received by the sender prior to that message. In this paper we present a secure transaction protocol that provides relational properties in addition to the normal properties of secure messages.
Specifying and Enforcing High-Level Semantic Obligation Policies
Authors: Zhen Liu, Anand Ranganathan, Anton Riabov
Venue: Proceedings of the Eighth IEEE International Workshop on Policies for Distributed Systems and Networks (2007)

Obligation Policies specify management actions that must be performed when a particular kind of event occurs and certain conditions are satisfied. Large scale distributed systems often produce event streams containing large volumes of low-level events. In many cases, these streams also contain multimedia data (consisting of text, audio or video). Hence, a key challenge is to allow policy writers to specify obligation policies based on high-level events, that may be derived after performing appropriate processing on raw, low-level events. In this paper, we propose a semantic obligation policy specification language called Eagle, which is based on patterns of high-level events, represented as RDF graph patterns. Our policy enforcement architecture uses a compiler that builds a workflow for producing a stream of events, which match the high-level event pattern specified in a policy. This workflow consists of a number of event sources and event processing components, which are described semantically. We present the policy language and enforcement architecture in this paper.
Network enablers for enhanced mobility management
Authors: R. Giaffreda, F. Carvalho, T. Melia
Venue: BT Technology Journal (2007)

The proliferation of network access technologies and the increased mobility of end users bring new challenges to operators who are willing to support their subscribers with seamless and context-aware services. This paper reviews the requirements that these challenges generate, focusing on the issues that are not entirely addressed by existing mobility protocols, the IMS set of specifications or by the IEEE802.21 standardisation efforts. A set of network enablers for enhanced mobility management addressing these issues is then proposed with an explanation of their positioning within future IMS-based mobility architectures.
Complex and almost-complex structures on six dimensional manifolds
Authors: Jan Segert
Venue:  (2006)

We investigate the properties of hypothetical exotic complex structures on three dimensional complex projective space CP3 . This is motivated by the long standing question in differential geometry of whether or not the six sphere S6 admits an integrable almost-complex structure. An affirmative answer to this question would imply the existence of many exotic complex structures on CP3 . It is known that CP3 admits many topologically different almost-complex structures, but it is unknown whether or not CP3 admits an integrable almost-complex structure other that the standard K&auml;hler structure. In this manuscript we give lower bounds on the Hodge numbers of hypothetical exotic structures on CP3 and a necessary condition for the Fr&ouml;licher spectral sequence to degenerate at the second level. We also give topological constraints on the classes of hypothetical exotic complex structures which are C* -symmetric. We give restrictions on the fixed point sets of such C* actions.