ppxscal/embedding_network huggingface dataset:
Visualizing real-time language-based feedback on teamwork behavior in computer-mediated groups
Authors: Gilly Leshed, Diego Perez, Jeffrey T. Hancock, Dan Cosley, Jeremy Birnholtz, Soyoung Lee, Poppy L. McLeod, Geri Gay
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

While most collaboration technologies are concerned with supporting particular tasks such as workflows or meetings, many work groups do not have the teamwork skills essential to effective collaboration. One way to improve teamwork is to provide dynamic feedback generated by automated analyses of behavior, such as language use. Such feedback can lead members to reflect on and subsequently improve their collaborative behavior, but might also distract from the task at hand. We have experimented with GroupMeter - a chat-based system that presents visual feedback on team members' language use. Feedback on proportion of agreement words and overall word count was presented using two different designs. When receiving feedback, teams in our study expressed more agreement in their conversations and reported greater focus on language use as compared to when not receiving feedback. This suggests that automated, real-time linguistic feedback can elicit behavioral changes, offering opportunities for future research.
Constraint Specification for Active Process Models
Authors: Kevin Finch, Weigang Wang
Venue: Proceedings of the 2009 International Conference on Information, Process, and Knowledge Management (2009)

The coordination of human-oriented flexible processes remains a priority of Business Process Management (BPM). Flexible, model-driven, process centric approaches have met with initial success when used as a coordinating device. However, maintaining model quality in rapid and frequent change remains problematic. One cause of the problem is identified as the inability of procedural models to make a precise specification of organizational requirements within the process space. A multi-notation modeling approach is proposed which enriches work models with organizational constraints, to help protect the integrity of models in deployment. A schema shows how constraints can be effectively captured and integrated with procedural work models. The best formalism for constraint specification is an open question. We show why Object Constraint Language is a promising candidate. A running example is used to demonstrate the problem and approach.
Finding what is missing from a digital library: A case study in the Computer Science field
Authors: Allan J. C. Silva, Marcos André Gonçalves, Alberto H. F. Laender, Marco A. B. Modesto, Marco Cristo, Nivio Ziviani
Venue: Information Processing and Management: an International Journal (2009)

This article proposes a process to retrieve the URL of a document for which metadata records exist in a digital library catalog but a pointer to the full text of the document is not available. The process uses results from queries submitted to Web search engines for finding the URL of the corresponding full text or any related material. We present a comprehensive study of this process in different situations by investigating different query strategies applied to three general purpose search engines (Google, Yahoo!, MSN) and two specialized ones (Scholar and CiteSeer), considering five user scenarios. Specifically, we have conducted experiments with metadata records taken from the Brazilian Digital Library of Computing (BDBComp) and The DBLP Computer Science Bibliography (DBLP). We found that Scholar was the most effective search engine for this task in all considered scenarios and that simple strategies for combining and re-ranking results from Scholar and Google significantly improve the retrieval quality. Moreover, we study the influence of the number of query results on the effectiveness of finding missing information as well as the coverage of the proposed scenarios.
Multi-modal Speech Processing Methods: An Overview and Future Research Directions Using a MATLAB Based Audio-Visual Toolbox
Authors: Andrew Abel, Amir Hussain
Venue: Multimodal Signals: Cognitive and Algorithmic Issues: COST Action 2102 and euCognition International School Vietri sul Mare, Italy, April 21-26, 2008 Revised Selected and Invited Papers (2009)

This paper presents an overview of the main multi-modal speech enhancement methods reported to date. In particular, a new MATLAB based Toolbox developed by Barbosa et al (2007) for processing audio-visual data is reviewed and its performance potential evaluated. It is shown that the tool does not represent a complete and comprehensive speech processing solution, but rather serves as a standardised, yet versatile base to build upon with further research. To demonstrate this versatility, preliminary examples that make use of these computational procedures with an audiovisual corpus are demonstrated. Finally, some future research directions in the area of multi-modal speech processing are outlined, including future research that the authors aim to carry out with the aid of this newly developed audio-visual MATLAB toolbox, including toolbox customisation, and processing noisy speech in real world environments.
Video Indexing Using MPEG Motion Compensation Vectors
Authors: E. Ardizzone, M. La Cascia, A. Avanzato, A. Bruna
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

In the last years a lot of work has been done on color, textural, structural and semantic indexing of "content-based" video databases. Motion-based video indexing has been less explored, with approaches generally based on the analysis of optical flows. Compressed videos require the decompression of the sequences and the computation of optical flows, two steps computationally heavy.In this paper we propose some methods to index videos by motion features (mainly related to camera motion) and by motion-based spatial segmentation of frames, in a fully automatic way. Our idea is to use MPEG motion vectors as an alternative to optical flows. Their extraction is very simple and fast; it doesn't require a full decompression of the stream and saves us from computing optical flows. Additional computational economy comes from having one motion vector each 16x16 sub-image; this makes the algorithms faster than working with dense optical flows. Experimental results reported at the end of this paper show that MPEG motion compensation vectors are suitable for this kind of applications.
Analysis and optimization of NDVI definitions and areal fraction models in remote sensing of vegetation
Authors: X. Zhou, H. Guan, H. Xie, J. L. Wilson
Venue: International Journal of Remote Sensing (2009)

Variations in the definition of the Normalized Difference Vegetation Index (NDVI) and inconsistencies in vegetation areal fraction models prejudice the understanding of long-term variability and change in land cover. We analysed the consequences of using NDVI definitions based on the digital number (DN), spectral radiance and spectral reflectance for six active and high spatial resolution multi-and hyperspectral satellite sensors (ALI, ASTER, ETM+, HRVIR, Hyperion and IKONOS) and optimized the NDVI definitions, and then examined the performance of three vegetation areal fraction models: the linear reflectance, linear NDVI and quadratic NDVI models. The examination was performed for three plots chosen from two biomass zones: a short and small leaf area index (LAI) creosote shrub zone, and a tall and large-LAI pinon-juniper zone. The results show that: (1) the difference in NDVI values among the NDVI definitions is sensor dependent and always significant; spectral reflectance should be used in NDVI calculations, and using radiance or DN values in calculating the NDVI should be avoided; (2) in deriving vegetation areal coverage, the linear reflectance model outperforms the other two models in the shrub biomass zone; and (3) the linear NDVI model outperforms the other two models in the pinon-juniper biomass zone. These observations are consistent with the fact that the non-linear effect is less important in shrubland than in pinon-juniper woodland and that the linear NDVI model is more capable of capturing non-linearity in the spectral analysis.
Analysis of Synergy Marketing in Supply Chain Based on Game Theory
Authors: Liu Shuyong, Chen Yan, Zhang Liwei, Hu Jiaxing
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

This paper builds up supply chain synergy marketing game model based on retailer investment level and manufactory investment level, applying the game theory to analyze the game methods of the manufactory and retailer under the different structure markets, It is discussed the related factor which different marketing mode influenced manufactory and retailer profits level, It is studied the synergy marketing game model and found out the superior acceptable pareto-optimal solution to both the manufactory and retailer.
Testing fuzzy hypotheses based on fuzzy test statistic
Authors: S. Mahmoud Taheri, Mohsen Arefi
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2009)

A new approach for testing fuzzy parametric hypotheses based on fuzzy test statistic is introduced. First, we define some models representing the extended versions of the simple, the one-sided and the two-sided crisp hypotheses to the fuzzy ones. Then, we provide a confidence interval for interested parameter, and using &#x03b1;-cuts of the fuzzy null hypothesis, we construct the related fuzzy test statistic. Finally, by introducing a credit level, we can decide to accept or reject the fuzzy hypothesis. The method is applied to test the fuzzy hypotheses for the mean of a normal distribution, the variance of a normal distribution, and the mean of a Poisson distribution.
Formation of attribute spaces using wavelets in automatic classification of explosives
Authors: Nikolai Shopov, Rajcho Ilarionov, Ivan Simeonov, Hristo Kilifarev
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

The non-contact automatic on-line classification of explosives is a multi-aspect task. It involves choosing the method of information gathering, planning and conduction of experiments, choosing a classifier, formation of training and control samples, synthesis and reduction of recognition attributes, etc. This paper presents the results of conducted experiments for non-contact ultrasonic information gathering, formation of attribute spaces by means of wavelet transformations and an automatic classification of explosives.
Influence of anisotropic strain on excitonic transitions in a-plane GaN films
Authors: C. Buchheim, M. Röppischer, R. Goldhahn, G. Gobsch, C. Cobet, C. Werner, N. Esser, A. Dadgar, M. Wieneke, J. Bläsing, A. Krost
Venue: Microelectronics Journal (2009)

Hexagonal a-plane GaN films with (112@?0)-orientation were grown by metalorganic vapour phase epitaxy on r-plane sapphire substrates. Spectroscopic ellipsometry in the photon energy range from 1.2 up to 5eV was applied in order to determine the ordinary and extraordinary complex dielectric function of GaN. A distinct optical anisotropy is found over the whole energy range which is emphasized by reflectance anisotropy studies. The polarization dependent shift of the absorption edges is confirmed by photoreflectance measurements and compared to band structure calculations for which the in-plane strain is taken into account.
Note: A connection between circular colorings and periodic schedules
Authors: Hong-Gwa Yeh
Venue: Discrete Applied Mathematics (2009)

We show that there is a curious connection between circular colorings of edge-weighted digraphs and periodic schedules of timed marked graphs. Circular coloring of an edge-weighted digraph was introduced by Mohar [B. Mohar, Circular colorings of edge-weighted graphs, J. Graph Theory 43 (2003) 107-116]. This kind of coloring is a very natural generalization of several well-known graph coloring problems including the usual circular coloring [X. Zhu, Circular chromatic number: A survey, Discrete Math. 229 (2001) 371-410] and the circular coloring of vertex-weighted graphs [W. Deuber, X. Zhu, Circular coloring of weighted graphs, J. Graph Theory 23 (1996) 365-376]. Timed marked graphs G-> [R.M. Karp, R.E. Miller, Properties of a model for parallel computations: Determinancy, termination, queuing, SIAM J. Appl. Math. 14 (1966) 1390-1411] are used, in computer science, to model the data movement in parallel computations, where a vertex represents a task, an arc uv with weight c"u"v represents a data channel with communication cost, and tokens on arc uv represent the input data of task vertex v. Dynamically, if vertex u operates at time t, then u removes one token from each of its in-arc; if uv is an out-arc of u, then at time t+c"u"v vertex u places one token on arc uv. Computer scientists are interested in designing, for each vertex u, a sequence of time instants {f"u(1),f"u(2),f"u(3),...} such that vertex u starts its kth operation at time f"u(k) and each in-arc of u contains at least one token at that time. The set of functions {f"u:u@?V(G->)} is called a schedule of G->. Computer scientists are particularly interested in periodic schedules. Given a timed marked graph G->, they ask if there exist a period p>0 and real numbers x"u such that G-> has a periodic schedule of the form f"u(k)=x"u+p(k-1) for each vertex u and any positive integer k. In this note we demonstrate an unexpected connection between circular colorings and periodic schedules. The aim of this note is to provide a possibility of translating problems and methods from one area of graph coloring to another area of computer science.
Exploiting semantic proximities for content search over p2p networks
Authors: Nikolaos D. Doulamis, Pantelis N. Karamolegkos, Anastasios Doulamis, Ioannis Nikolakopoulos
Venue: Computer Communications (2009)

In this paper, we address the issue of content search over peer-to peer networks. We use the concept of semantic proximity that exploits the commonalities of interests exhibited among peer users so as to decompose the network into semantic clusters. We initially define search entropy, as a metric indicating the average number of packets required to locate the requested content. Then, spectral clustering is used to organize the peer nodes into semantic clusters so that (a) the probability that a node locates content within its own cluster is maximized, while simultaneously; (b) the respective probability of finding this content outside this cluster is minimized. The proposed semantic partitioning algorithm is then extended into a hierarchical two-tier scheme, in which practical issues arising for the deployment of a peer-to-peer (p2p) application can be more easily addressed. After the system has been initialized, a dynamic algorithm places new users that join the p2p network into appropriately selected clusters and also handles peer departures without the need for matrix eigen decomposition process which is necessary for the assessment of the initial static partitioning. Our experimental results validate that (a) our static partitioning outperforms traditional and novel search techniques and (b) our dynamic algorithm is able to efficiently track the system's progression maintaining the search entropy close to the initially assessed levels.
Dynamic mechanism design
Authors: Davide Bilò, Luciano Gualà, Guido Proietti
Venue: Theoretical Computer Science (2009)

In this paper we address the question of designing truthful mechanisms for solving optimization problems on dynamic graphs with selfish edges. More precisely, we are given a graph G of n nodes, and we assume that each edge of G is owned by a selfish agent. The strategy of an agent consists in revealing to the system-at each time instant-the cost at the actual time for using its edge. Additionally, edges can enter into and exit from G. Among the various possible assumptions which can be made to model how this edge-cost modifications take place, we focus on two settings: (i) the dynamic, in which modifications can happen at any time, and for a given optimization problem on G, the mechanism has to maintain efficiently the output specification and the payment scheme for the agents; (ii) the time-sequenced, in which modifications happens at fixed time steps, and the mechanism has to minimize an objective function which takes into consideration both the quality and the set-up cost of a new solution. In both settings, we investigate the existence of exact and approximate truthful (w.r.t. to suitable equilibrium concepts) mechanisms. In particular, for the dynamic setting, we analyze the minimum spanning tree problem, and we show that if edge costs can only decrease and each agent adopts a myopic best response strategy (i.e., its utility is only measured instantaneously), then there exists an efficient dynamic truthful (in myopic best response equilibrium) mechanism for handling a sequence of k declarations of edge-cost reductions having runtime O((h+k)logn), where h is the overall number of payment changes.
Knowledge Discovery in Services
Authors: M. Brian Blake
Venue: IEEE Internet Computing (2009)

Service mashups can be useful in understanding Web-scale workflows. Although creating a service mashup shares similar challenges with data integration, a more exciting aspect of this area is the ability to predict which services are viable candidates for a mashup. Such "service mashup recommendations" can enable knowledge discovery, an approach the author calls knowledge discovery in services (KDS).
Evaluation of porous PZT with 3-3 connectivity for biomedical ultrasonic imaging applications
Authors: K. Boumchedda, A. Ayadi, M. Hamadi, G. Fantozzi
Venue: Proceedings of the 6th conference on Applications of electrical engineering (2007)

PZT porous ceramics with 3-3 connectivity is characterized on the large range of porosity from 25 % to more than 80%, for possible use in ultrasonic systems for medical imaging. Two methods are used to evaluate the electromechanical properties of these transducers, the resonance method and an original method based on the analysis of the time response of transducer excited by a current impulse. Porous PZT developed a same d33 than Structural PZT ceramic which gives a large voltage coefficient g33, thickness coupling coefficients kt are very large, and then planar coupling coefficients are reduced strongly, for 60% of porosity = kt/kp =3,1 the for PZT ceramic kt/kp = 0,67 These results showed that the presence of the three-dimensional porosity in ceramic causes a decoupling of the piezoelectric effects axial radial directions, to privilege the axial mode, and for large porosities the transducer vibrates exclusively according to the axial mode. The acoustic impedance (Za) is decreased by the reduction of the density of PZT. Porous PZT constitute an excellent material for use in ultrasonic systems for medical imaging.
New method of image retrieval using fractal code on the compression domain
Authors: Liangbin Zhang, Yi Wang, Lifeng Xi, Kun Gao, Tianyun Hu
Venue: WSEAS TRANSACTIONS on SYSTEMS (2008)

Image retrieval and indexing techniques are important for efficient management of visual database. Many techniques are generally developed based on the associated compression domain. In the fractal domain, a fractal code is a contractive affine mapping that represents a similarity relation between the range block and the domain block in an image. A new algorithm of IFS fractal code for image retrieval on the compression domain is presented in this paper. First, the inquired image and each image in the database are encoded by Jacquin fractal coding. Second, the image fractal feature vector and the distance of fractal code between two images are defined, and the distance between the inquired image and current image in the database are computed one by one. Finally, the preceding n frame images which are the smallest distance sum of fractal code are taken as the retrieval result. Experimental results show that compared with the direct image pixels similar matching strategy, our scheme shortens the retrieval time of compression domain greatly and guarantees the retrieval accuracy. Our proposed method is effective and feasible.
ZOOM: The Global Race to Fuel the Car of the Future, Reprint edition
Authors: Vijay Vaitheeswaran, Iain Carson
Venue:  (2008)

"Zoom goes zero to sixty in nothing flat. It's an exciting ride into the future of the world's favorite physical object, the automobile."-Gregg Easterbrook, author of THE PROGRESS PARADOX"Zoom offers a new way to think about cars and energy that's key to understanding the forces shaping business today. It's smart, well-informed and insightful--exactly what one would expect from two of The Economist's best journalists."-Chris Anderson, author of THE LONG TAIL"Zoom puts oil in its sights and squeezes off one telling round after another. Car lovers will see a sunny future with other fuels; OPEC a steadily darkening twilight."-R. James Woolsey, VP, Booz Allen Hamilton; former Director of Central Intelligence"An incisive analysis of the end of the petroleum age, including all its repercussions and opportunities."-Vinod Khosla, Khosla Ventures"Oil is the problem. Cars are the solution." Those two simple sentences by the authors of Zoom define the scope of their illuminating and important book, an examination of a transformation in business and culture that is occurring before our eyes. We are living in the midst of a Great Awakening. People are seeking environmentally-sound alternatives to gas guzzlers. Detroit's reign is over. Oil companies, despite their billion-dollar profits, could be on the brink of extinction if they don't adapt. And citizens, all too aware that these industries have lobbied politicians into gridlock over energy policy, are mobilizing to support leaders who advocate new policies. In Zoom, Iain Carson and Vijay V. Vaitheeswaran, award-winning correspondents for The Economist, show why and how geopolitical and economic forces are compelling the linked industries of oil and autos to change as never before.Drawing on years of industry research-including dozens of interviews with motor and energy executives, top policymakers, and latter-day Fords and Edisons-Carson and Vaitheeswaran explain: -How Toyota became the world's largest automaker through innovation and superior performance. -Why American politicians have, for decades failed to address our energy issues and global warming-and how grassroots movements, along with individual entrepreneurs, innovators, and outsiders, are making real reform possible.-How these Green revolutionaries are creating new products powered by hydrogen, electricity, bio-fuels, and digital technology.As political leaders debate our energy, environmental and economic future, Zoom offers a lucid and visionary portrait of what that future could be. Anyone planning to vote will find compelling truth in its assertions and conclusions.
The influence of growth temperature and precursors' doses on electrical parameters of ZnO thin films grown by atomic layer deposition technique
Authors: T. Krajewski, E. Guziewicz, M. Godlewski, L. Wachnicki, I. A. Kowalik, A. Wojcik-Glodowska, M. Lukasiewicz, K. Kopalko, V. Osinniy, M. Guziewicz
Venue: Microelectronics Journal (2009)

In this paper we report on the low-temperature growth (T"s=30-250^oC) of zinc oxide thin films by atomic layer deposition method using two different organic zinc precursors: diethylzinc and (for comparison) dimethylzinc, and deionized water as an oxygen precursor. An evident influence of growth temperature and precursors' doses on electron concentration and Hall mobility of obtained zinc oxide layers is presented. The lowest achieved room-temperature electron concentration was at the level of 10^1^6cm^-^3 with mobility up to 110cm^2/Vs.