ppxscal/embedding_network huggingface dataset:
The social formation of youth leadership
Authors: Ben Kirshner
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

In recent years policymakers and educators have called for greater youth voice in school reform and neighborhood revitalization. Few studies, however, have examined adult assistance strategies that enable youth to assume responsibility for complex campaigns or formulate policy proposals. Drawing on two years of ethnographic fieldwork in an urban after-school leadership group, this article examines how adults and youth jointly created a "youth-led" environment, in which youth took responsibility for making decisions and monitoring their work. Data analysis focuses on the cultural tools that youth appropriated in order to assume leadership of the project, including group agreements, group organizing routines, and a youth empowerment ideology. The paper concludes that to support youth voice adults must do more than just fade into the background, but must also seed the learning community with tools. Implications address how adults can help young people lead efforts to improve their schools and neighborhoods.
Continuous monitoring of multi-dimensional queries
Authors: Dimitris Papadias
Venue:  (2006)

This thesis studies the monitoring of continuous multi-dimensional queries. A continuous query runs over long periods of time and requests reporting of its result as the data dynamically change. Initially, we focus on nearest neighbor (NN) monitoring, a problem that typically arises in location-based services. In this context, the query points and the data objects move arbitrarily, and the task of a central server is to report the k closest objects (i.e., the k NNs) to each query point. First, we propose a method that aims at minimizing the communication cost spent in message exchanges between the data objects and the server. Our second contribution is an algorithm that minimizes the processing cost at the server, assuming that the distance between objects and queries is defined according to the Euclidean metric. Next, we present efficient NN monitoring techniques targeted to applications where the objects and the queries move in a road network, and their distance is defined as the length of the shortest path connecting them in the network. Finally, we consider a class of non-spatial queries and show that geometric reasoning can be used for their efficient monitoring. In particular, we study continuous top-k processing over sliding windows. In this setting, a stream of multi-dimensional tuples arrives at a central server. Among these tuples, only the most recent ones are considered valid. Given a function that assigns a score (i.e., a real number) to each tuple, the task of the server is to continuously report the k valid tuples with the highest scores.
Automated Trainable Summarizer For Financial Documents
Authors: R. Sureka, H. P. H. Kong
Venue: Proceedings of the 10th IEEE on International Enterprise Distributed Object Computing Conference Workshops (2006)

The overload of information available on the Internet has made text mining and simplified news and articles browsing an increasingly important user concern and a prioritized research issue. The aim of our project is to build a light-weight and effective text mining and summarization engine for the financial domain. This engine should also be easily trainable and adaptable to other domains. This paper describes a robust trainable user-focused summarizer for the financial domain that is adapted from algorithms by Kupiec, Pedersen and Chen (KPC) [4] and Lee, Goh and Kong [5]. It employs an adapted feature set to improve the robustness of the algorithm and to incorporate domain specificity in the engine. Evaluation tests verified the improved performance of our user-focused, domain-oriented, corpus-based approach over domain-independent approaches.
An Approach to Realization and Security Provision of Intelligent U-Healthcare Service
Authors: Jieun Song, Myungae Chung
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

Most people assume that all of their medical records are dealt with as privileged information by medical doctor or relative operators. In general, patients' medical records are too personal privacy attributes or weak things which would not be revealed to anyone. In some case, privacy information of patient (e.g., preference products, activity pattern, habits, etc.) is able to become the high value-added profit source to business service provider and be damaged to his reputation or honor by leakage of it. Therefore, requirements for privacy and data protection at all against illegal disclosure are very significantly considered for realization of u-healthcare service with provisioning the patient safety. In this work we give an overview on the actual network architecture which enables to support u-healthcare service and we analysis problems encountered in based on security assets and consumer entities. Especially we present originality security considerations which are characterized by u-healthcare service environment. Additionally we show the current state of research and countermeasures useful to protect the user's privacy.
Research and Design of Phishing Alarm System at Client Terminal
Authors: Ming Qi, Chaobo Yang
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

In this paper, it analyses Phishing's characteristics and harms, and finds out the sticking point of Phishing. Then it designs and realizes the alarm system according to Phishing's intrinsic disadvantages in this article. The system is transparent to users with spacious detection scope, short response time, good security and friendly interface, without increasing users' workload.
Spoon: Compile-time Annotation Processing for Middleware
Authors: Renaud Pawlak
Venue: IEEE Distributed Systems Online (2006)

Spoon is a Java-based program analysis and transformation tool that programmers can use for compile-time annotation processing in the middleware context. Spoon reifies the Java abstract syntax tree and processes it with user-defined processors. It uses compile-time reflection combined with a pure Java template framework for well-typed and intuitive fine-grained metaprogramming. Several examples show how programmers can use Spoon to implement intrusive compile-time annotation processing for middleware.
SINR estimation and orthogonality factor calculation of DS-CDMA signals in MIMO channels employing linear transceiver filters: Research Articles
Authors: Andrew Logothetis, Afif Osseiran
Venue: Wireless Communications Mobile Computing (2007)

A discrete-time model of DS-CDMA signaling using multiple transmit and receive antennas employing linear transceiver filters is derived. For each link, connecting a base-station to a wireless mobile user, the downlink signal to interference plus noise ratio (SINR) after despreading is derived analytically, and as a by-product an exact closed-form solution of the orthogonality factor is obtained. The orthogonality factor is derived for any linear receiver structure that is implemented by a bank of correlators and for any linear combining techniques (such as MRC and MMSE), and for any number of transmit and&#x002F;or receive antennas that utilize transmit (pre-RAKE) and receive (post-RAKE) filtering. The MIMO DS-CDMA model is derived using a filter representation, and is extended to a vector&#x002F;matrix formulation that permits a systematic and efficient way of computing the SINR in a radio network simulator. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Dynamic Artificial Neural Networks for Centroid Prediction in Astronomy
Authors: S. J. Weddell, R. Y. Webb
Venue: Proceedings of the Sixth International Conference on Hybrid Intelligent Systems (2006)

Motivation for this research is the real-time restoration of faint astronomical images through turbulence over a large field-of-view. A simulation platform was developed to predict the centroid of a science object, convolved through multiple perturbation fields, and projected on to an image plane. Centroid data were selected from various source and target locations and used to train an artificial neural network to estimate centroids over a spatial grid, defined on the image plane. The capability of the network to learn to predict centroids over new target locations was assessed using a priori centroid data corresponding to selected grid locations. Various distortion fields were used in training and simulating the network including data collected from observation runs at a local observatory. Results from this work provide the basis for extensions and application to modal tomography.
Explanation of Performance Degradation in Turn Model
Authors: Slavko Gajin, Zoran Jovanović
Venue: The Journal of Supercomputing (2006)

The Turn model routing algorithms for mesh interconnection network achieve partial adaptivity without any virtual channels. However, the routing performance measured by simulations is worse than with the simple deterministic routing algorithm. Authors have explained these results simply by uneven dynamic load through the network. However, this phenomenon has not been studied further.This paper investigates performance degradation with Turn model and drawbacks of partially adaptive routing in comparison with the deterministic routing, and it introduces some new concepts. Our simulations deal with individual channels and results are presented by 3D graphs, rather than by commonly used averages. An additional parameter--channel occupation, which is consistent with queuing theory commonly used in many proposed analytical models, is introduced. We also propose a new structure, the Channel Directions Dependency Graph (CDDG). It provides a new approach in analysis, helps in understanding of dynamic routing behaviour, and it can be generalized in other routing algorithms.
Control of chaotic behavior in high order dynamical systems
Authors: A. Boukabou, N. Mansouri
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 2 (2003)

In this paper, we present a chaos control algorithm, based on the OGY method, to control chaotic behavior in high order dynamical systems. To begin with, once chaotic behavior identified on the bifurcation diagram, studying the so-called Poincare sections enable determining fixed points and the effect of small changes in the control parameter on trajectory. Introduction of a stabilizer parameter in the control law, keeps the dynamical properties and maintains them on a cyclic trajectory. The effectiveness of the proposed method is tested by numerical examples on Lorenz and Rossler systems.
Lost on Your Cell Phone: Innovations from NAB 2006
Authors: Tammi Titsworth
Venue: IEEE MultiMedia (2006)

The author discusses the latest in IPTV and mobile digital television innovations presented at the National Association of Broadcasters 2006 conference.
Navier-Stokes equation controlled by degenerate forcing: controllability of finite-dimensional approximations
Authors: A. Agrachev, A. Sarychev
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 4 (2003)

The aim of this work is studying controllability of finite-dimensional Galerkin approximations of 2D and 3D Navier-Stokes equations, controlled by degenerate forcing. Methods of geometric/Lie-algebraic nonlinear control theory are used to establish sufficient criteria of global controllability.
The usability of graphical user interfaces of mobile computing devices designed for construction foremen: icons and pre-defined text lists compared
Authors: Jimmie W. Hinze, Mary J. Hasell
Venue:  (2006)

Field documentation by construction foremen traditionally has been done through the use of pen and paper. The drawbacks of the traditional method and the need to computerize the field documentation process have long been recognized by researchers of construction management. Mobile computing devices provide an excellent hardware platform for addressing this need. Unfortunately, the past research efforts and technological developments in this area have not provided solutions with good usability. This study examined past research from a usability point of view and focused on the graphical user interface usability aspect of the problem. The inefficiency associated with the data input method though stylus and touch sensitive screen was examined. The focus of the study was on construction foremen, but other participants in the construction industry were also included as a basis of comparison. The study investigated the experience of the research participants with computers, personal digital assistants (PDA's) and other touch sensitive screen devices. The study evaluated the usability properties of icons and pre-determined text lists as potential candidates for automated data entry on mobile computing devices in the construction field. The views of participants on the standardization of the content of the field documentation, importance of quick data entry in the field, and the inefficiency associated with a stylus writing data input method were explored. Thirty-five construction foremen employed by sitework contractors, 37 construction professionals, and 28 university students were selected to complete a specially designed computer visual search game that consisted of an icon visual search interface and a text visual search interface. Each subject completed 14 visual search tasks in each interface. Results showed foremen and construction professionals performed visual search tasks faster with icons than with pre-determined text lists. Study results also showed comparable levels of accuracy of data input and also good satisfaction ratings when using the icon interface when compared with the text interface. The results also suggested a strong positive correlation between the task completion time and task errors (fewer errors when task times were short). A strong negative correlation was noted between the construction experience of the research participant and the task errors; i.e., participants with less experience made more errors.
Service Plans for Context- and QoS-aware Dynamic Middleware
Authors: Sten A. Lundesgaard, Ketil Lund, Frank Eliassen
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

State-of-the-art context- and QoS-aware dynamic middleware platforms use information about the environment, in order to evaluate alternative configurations of an application and select the one that best meets the user's QoS requirements. The specification of the alternatives is prepared at designtime and associated with the software during deployment. From the information and requirements in the specification, the middleware can synthesis, filter, and compare the alternative application configurations. This paper presents a platform independent specification, referred to as service plan, which contains information elements for specifying configurations, dependencies on the environment, and QoS characteristics. The service plan is specified at a conceptual level to ensure that it can be implemented in a wide range of middleware platforms. The paper describes how the concept is used during deployment, instantiation, and reconfiguration. From the implementation and validation the expressiveness and usefulness of the service plan concept is assessed.
Fault-tolerance and load management in a distributed stream processing system
Authors: Hari Balakrishnan
Venue:  (2006)

Advances in monitoring technology (e.g., sensors) and an increased demand for online information processing have given rise to a new class of applications that require continuous, low-latency processing of large-volume data streams. These "stream processing applications" arise in many areas such as sensor-based environment monitoring, financial services, network monitoring, and military applications. Because traditional database management systems are ill-suited for high-volume, low-latency stream processing, new systems, called stream processing engines (SPEs), have been developed. Furthermore, because stream processing applications are inherently distributed, and because distribution can improve performance and scalability, researchers have also proposed and developed distributed SPEs. In this dissertation, we address two challenges faced by a distributed SPE: (1) fault-tolerant operation in the face of node failures, network failures, and network partitions, and (2) federated load management. For fault-tolerance, we present a replication-based scheme, called Delay, Process, and Correct (DPC), that masks most node and network failures. When network partitions occur, DPC addresses the traditional availability-consistency trade-off by maintaining, when possible, a desired availability specified by the application or user, but eventually also delivering the correct results. While maintaining the desired availability bounds, DPC also strives to minimize the number of inaccurate results that must later be corrected. In contrast to previous proposals for fault tolerance; in SPEs, DPC simultaneously supports a variety of applications that differ in their preferred trade-off between availability and consistency. For load management, we present a Bounded-Price Mechanism (BPM) that enables autonomous participants to collaboratively handle their load without individually owning the resources necessary for peak operation. BPM is based on contracts that participants negotiate offline. At runtime, participants move load only to partners with whom they have a contract and pay each other the contracted price. We show that BPM provides incentives that foster participation and leads to good system-wide load distribution. In contrast to earlier proposals based on computational economics, BPM is lightweight, enables participants to develop and exploit preferential relationships, and provides stability and predictability. Although motivated by stream processing, BPM is general and can be applied to any federated system. We have implemented both schemes in the Borealis distributed stream processing engine. They will be available with the next release of the system. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
Delay testing viability of gate oxide short defects
Authors: J. M. Gallière, M. Renovell, F. Azaïs, Y. Bertrand
Venue: Journal of Computer Science and Technology (2005)

Gate Oxide Short (GOS) defects are becoming predominant as technology is scaling down. Boolean and IDDQ testing of this defect has been widely studied but there is no paper dedicated to delay testing of this defect. So, this paper studies the delay behavior of Gate Oxide Short faults due to pinhole in the gate oxide. The objective of this paper is to give a detailed analysis of the behavior of the GOS defect taking into account the random parameter of the defect such as the GOS resistance and the GOS location. Because an accurate analysis is desired, the bi-dimensional array will be used. Because a complete analysis is desired, we derive the dynamic characteristic of the GOS as a function of the GOS resistance and location. It is demonstrated that i) GOS has a significant impact on gate delay, ii) GOS located close to the source of the transistor and with small resistance has very high impact.
A simple solution to the k-core problem
Authors: Svante Janson, Malwina J. Luczak
Venue: Random Structures Algorithms (2007)

We study the k-core of a random (multi)graph on n vertices with a given degree sequence. We let n &rarr;&infin;. Then, under some regularity conditions on the degree sequences, we give conditions on the asymptotic shape of the degree sequence that imply that with high probability the k-core is empty and other conditions that imply that with high probability the k-core is non-empty and the sizes of its vertex and edge sets satisfy a law of large numbers; under suitable assumptions these are the only two possibilities. In particular, we recover the result by Pittel, Spencer, and Wormald (J Combinator Theory 67 (1996), 111151) on the existence and size of a k-core in G(n,p) and G(n,m), see also Molloy (Random Struct Algor 27 (2005), 124135) and Cooper (Random Struct Algor 25 (2004), 353375). Our method is based on the properties of empirical distributions of independent random variables and leads to simple proofs. &copy; 2006 Wiley Periodicals, Inc. Random Struct. Alg.,, 2007
A Tale of Two Projects
Authors: Rod Coffin
Venue: Proceedings of the conference on AGILE 2006 (2006)

I had a unique opportunity to experience and analyze the adoption of agile practices on two projects at a major car rental company which, although sharing many similarities including staff, professed commitment to agile process, architecture, and programming environment, experienced two drastically different outcomes. The first became bogged down and eventually went to production late, over-budget, with fewer features then expected, and was only reluctantly embraced by its user community. The second was ready for its first production milestone after only 9 weeks, was enthusiastically embraced by its users, and went on to become an unqualified success and a model for other software development projects at this company. In this report I will illustrate the similarities between these two projects, highlight the differences, and draw conclusions about the factors critical to the success of agile projects in large corporate environments.
2005 Special issue: Hippocampal replay contributes to within session learning in a temporal difference reinforcement learning model
Authors: Adam Johnson, A. David Redish
Venue: Neural Networks (2005)

Temporal difference reinforcement learning (TDRL) algorithms, hypothesized to partially explain basal ganglia functionality, learn more slowly than real animals. Modified TDRL algorithms (e.g. the Dyna-Q family) learn faster than standard TDRL by practicing experienced sequences offline. We suggest that the replay phenomenon, in which ensembles of hippocampal neurons replay previously experienced firing sequences during subsequent rest and sleep, may provide practice sequences to improve the speed of TDRL learning, even within a single session. We test the plausibility of this hypothesis in a computational model of a multiple-T choice-task. Rats show two learning rates on this task: a fast decrease in errors and a slow development of a stereotyped path. Adding developing replay to the model accelerates learning the correct path, but slows down the stereotyping of that path. These models provide testable predictions relating the effects of hippocampal inactivation as well as hippocampal replay on this task.
Decoder-Friendly Subpel MV Selection for H.264/AVC Video Encoding
Authors: Qi Zhang, Yunyang Dai, Siwei Ma, C.-C. Jay Kuo
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

A decoder-friendly subpel motion vector (MV) selection scheme for H.264/AVC video encoding is proposed in this work. First, the rate-distortion (RD) relationship with respect to subpel MVs is examined to shed light on the tradeoff of R-D performance degradation and complexity reduction in different block types. It is observed that the R-D gain of some macroblocks (MB) is greatly enhanced by employing subpel MVs while others are not. An SAD-based approach is adopted to decide whether the subpel MV scheme is needed for a certain MB. To enhance the prediction accuracy, the correlation of MVs in the spatial domain is also exploited. Our scheme further introduces decoder complexity budget to aid the designer in making design tradeoffs. Experimental results indicate that our scheme is flexible enough that the actual achieved complexity is very close to the target complexity budget under different QP settings.