ppxscal/embedding_network huggingface dataset:
Evaluation and comparison of hyperspectral imagery for mapping surface symptoms of dryland salinity
Authors: A. Dutkiewicz, M. Lewis, B. Ostendorf
Venue: International Journal of Remote Sensing (2009)

Hyperspectral images from three sensors are compared for their ability to discriminate and map selected symptoms of salinity in a dryland agricultural area in southern Australia. Airborne HyMap and satellite Hyperion imagery were acquired in the late dry season to maximize the discrimination of saline soils and perennial, halophytic vegetation, whereas airborne Compact Airborne Spectrographic Imager (CASI) imagery was acquired in late spring to capture senescence of annual, halophytic grasses. The evaluation of imagery included comparisons of spectral resolution, spectral range, spatial resolution and landscape seasonality. Salinity symptoms were also characterized using field spectra collected with an ASD FieldspecPro spectrometer. Image-derived spectra were used to map salinity symptoms using partial spectral unmixing techniques. Salinity symptom maps were compared with independent mapping of soils and salinity from aerial photography and Landsat imagery. Saltpans were discriminated using the gypsum 1750 nm absorption feature, whereas full-wavelength image spectra were necessary to map the halophytic plants. HyMap imagery produced the most accurate maps of samphire and saltpans, identifying substantial saline areas covered with samphire that had not been delineated in previous aerial photo-interpretation. The study demonstrates that hyperspectral imagery can improve discrimination of vegetation and mineral indicators of surface salinity and has the potential to improve traditional soil and salinity mapping based on multispectral satellite imagery and aerial photo-interpretation.
Learning by seeing: photo viewing in the workplace
Authors: Jennifer Thom-Santelli, David R. Millen
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

In this paper, we focus on the role that photo viewing plays within a large distributed enterprise. We describe the results of an analysis of users' viewing behavior through log activity and semi-structured interviews with respect to a photo sharing application embedded within an internal social networking site. Specifically, we investigate how these forms of expression can assist in the transmission of the norms and values associated with the culture of the organization through impression formation. We conclude by discussing how photos might act as a resource for newcomers to learn about the various aspects of the organizational culture and offer design suggestions for photo viewing systems within organizations.
A Novel Automated Trust Negotiation Framework for Securing Grids
Authors: Shangyuan Guan, Yiduo Mei, Xiaoshe Dong, Zhao Wang, Zhengdong Zhu
Venue: Computer Supported Cooperative Work in Design IV: 11th International Conference, CSCWD 2007, Melbourne, Australia, April 26-28, 2007. Revised Selected Papers (2008)

Automated Trust Negotiation (ATN) is a promising approach to allowing strangers to access sensitive services in open environments. Although many ATN systems are proposed, some issues still remain to be addressed: 1) they are centralized and cannot scale well; and 2) their policy languages are coarse-grained. To address the above problems and secure grids, we present a novel automated trust negotiation framework, FORT, to establish trust relationship between service providers and service requesters. FORT is decentralized, so it scales well. Furthermore, we utilize attribute constraints to refine its language. This paper implements FORT and designs experiments to evaluate its performance. Experimental results show that FORT can effectively protect sensitive services at the cost of little performance of systems and scale well.
Conceptual framework for introducing e-governance in university administration
Authors: Subrata Kumar Dey, M. Abdus Sobhan
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

With emergence of technology and growing demand of the society, e-Governance became a key issue and developed nations started adopting it to better serve their citizens through efficient and effective services, with accountability and transparency. When appropriately applied, e-Governance can effectively ensure the well being of a university, too. The underlying goals for adopting e-Governance practices are to ensure improved quality in disseminating education and administration, conforming to regulations as per the university statutes and acts. In this paper, the authors attempt to propose a conceptual e-Governance framework for universities and benchmark it.
Density results for Gabor systems associated with periodic subsets of the real line
Authors: Jean-Pierre Gabardo, Yun-Zhang Li
Venue: Journal of Approximation Theory (2009)

The well-known density theorem for one-dimensional Gabor systems of the form {e^2^@p^i^m^b^xg(x-na)}"m","n"@?"Z, where g@?L^2(R), states that a necessary and sufficient condition for the existence of such a system whose linear span is dense in L^2(R), or which forms a frame for L^2(R), is that the density condition ab@?1 is satisfied. The main goal of this paper is to study the analogous problem for Gabor systems for which the window function g vanishes outside a periodic set S@?R which is aZ-shift invariant. We obtain measure-theoretic conditions that are necessary and sufficient for the existence of a window g such that the linear span of the corresponding Gabor system is dense in L^2(S). Moreover, we show that if this density condition holds, there exists, in fact, a measurable set E@?R with the property that the Gabor system associated with the same parameters a,b and the window g=@g"E, forms a tight frame for L^2(S).
The New Approach of Marking Activity-Loops Based on the String Reachable Matrix
Authors: Huilin-Yuan, Dingwei-Wang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

The Authors present a new approach of finding out unreasonable activity loops. The approach was named as SRM (string reachable matrix) which intended to analyze business processes effectively. This matrix stemmed from reachable matrix and could show activity loops and paths directly in elements of the matrix. The definition, operating rules of SRM and others related to SRM were also described in this paper. At the end, the approach was applied to a practical process, the loops and paths were found out quickly. The approach provides a new resolution to the BPR (business process reengineering).
The Need for Reconfigurable Routers in Networks-on-Chip
Authors: Debora Matos, Caroline Concatto, Luigi Carro, Fernanda Kastensmidt, Altamiro Susin
Venue: Proceedings of the 5th International Workshop on Reconfigurable Computing: Architectures, Tools and Applications (2009)

There are many examples in the literature of applications that show different communication needs within a MPSoC. Very often cores interconnected through a Network-on-Chip have routers containing different buffers size, with different clock speed requirements. In this context, we are proposing a dynamic reconfigurable router for a NoC. With the proposed architecture it is possible to reconfigure the depth of each FIFO of the channel inside the routers. It allows more reusability in the NoC since the FIFO depth in the channels can be defined in accordance with the application. Besides, a buffer that is not used by its own channel can be used by others channel, reducing the power consumption.
The projection median of a set of points
Authors: Stephane Durocher, David Kirkpatrick
Venue: Computational Geometry: Theory and Applications (2009)

Given a nonempty and finite multiset of points P in R^d, the Euclidean median of P, denoted M(P), is a point in R^d that minimizes the sum of the Euclidean (@?"2) distances from M(P) to the points of P. In two or more dimensions, the Euclidean median (otherwise known as the Weber point) is unstable; small perturbations at only a few points of P can result in an arbitrarily large relative change in the position of the Euclidean median. This instability motivates us to consider alternate notions for location functions that approximate the minimum sum of distances to the points of P while maintaining a fixed degree of stability. We introduce the projection median of a multiset of points in R^2 and compare it against the rectilinear (@?"1) median and the centre of mass, both in terms of approximation factor and stability. We show that a mobile facility located at the projection median of the positions of a set of mobile clients provides a good approximation of the mobile Euclidean median while ensuring both continuous motion and low relative velocity.
ECTSA: Energy-Efficient Clustering Time Synchronization Algorithm for Sleeping-Based MAC Protocol
Authors: Liyan Liu, Wei Wu
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

Time synchronization and energy saving are important for sleeping-based media access control protocols in wireless sensor networks. Existing time synchronization methods were not designed for energy-efficient and sleeping based MAC protocol in WSN in mind. We proposed the energy-efficient clustering time synchronization algorithm by introduce synchronization schedule adopting and border node controlling to the synchronization algorithm. Our solution features minimal energy cost on synchronization. It also provides latency reduce. Some simulation experiments are done to evaluate the performance of the proposed approach.
An efficient moving mesh spectral method for the phase-field model of two-phase flows
Authors: Jie Shen, Xiaofeng Yang
Venue: Journal of Computational Physics (2009)

We develop in this paper a moving mesh spectral method for the phase-field model of two-phase flows with non-periodic boundary conditions. The method is based on a variational moving mesh PDE for the phase function, coupled with efficient semi-implicit treatments for advancing the mesh function, the phase function and the velocity and pressure in a decoupled manner. Ample numerical results are presented to demonstrate the accuracy and effectiveness of the moving mesh spectral method.
Bridging the gap between education and professional production
Authors: Robin King, Barry Weiss, Prashant Buyyala, Michael Sehgal
Venue: ACM SIGGRAPH ASIA 2008 educators programme (2008)

There are two major challenges facing the global animation and visual effects industries and they are both particularly acute in the Far East, India and Pacific regions.
Intentional learning agent architecture
Authors: Budhitama Subagdja, Liz Sonenberg, Iyad Rahwan
Venue: Autonomous Agents and Multi-Agent Systems (2009)

Dealing with changing situations is a major issue in building agent systems. When the time is limited, knowledge is unreliable, and resources are scarce, the issue becomes more challenging. The BDI (Belief-Desire-Intention) agent architecture provides a model for building agents that addresses that issue. The model can be used to build intentional agents that are able to reason based on explicit mental attitudes, while behaving reactively in changing circumstances. However, despite the reactive and deliberative features, a classical BDI agent is not capable of learning. Plans as recipes that guide the activities of the agent are assumed to be static. In this paper, an architecture for an intentional learning agent is presented. The architecture is an extension of the BDI architecture in which the learning process is explicitly described as plans. Learning plans are meta-level plans which allow the agent to introspectively monitor its mental states and update other plans at run time. In order to acquire the intricate structure of a plan, a process pattern called manipulative abduction is encoded as a learning plan. This work advances the state of the art by combining the strengths of learning and BDI agent frameworks in a rich language for describing deliberation processes and reactive execution. It enables domain experts to specify learning processes and strategies explicitly, while allowing the agent to benefit from procedural domain knowledge expressed in plans.
Description and evaluation of a system for high-speed, three-dimensional computed tomography of the body: the dynamic spatial reconstructor
Authors: Richard A. Robb, Barry K. Gilbert
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

High temporal resolution, full three-dimensional imaging of the heart and circulation is required for accurate basic physiological studies of the structural-to-functional relationships of these organ systems, and for improved diagnostic evaluation and treatment of patients with cardiac and/or circulatory disorders. Current diagnostic imaging techniques and systems, including x-ray computed tomography (CT) (1, 2), do not provide accurate measurements of the true dynamic changes in shape and dimensions of the intact heart over its entire anatomic extent, or for accurate measurement of the regional distribution of blood flow to, from, and within the heart, or any other organ of the body.
Heat transfer correlation for the V-groove solar collector
Authors: A. Fudholi, K. Sopian, M. Y. Othman, M. H. Ruslan, M. A. AlGhoul, A. Zaharim, R. Zulkifly
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

The performance of solar collectors of conventional design can be base on absorber shape factor by supposing fully developed turbulent flow. A mathematical model has been developed from the energy balance equations of the solar collector system to predict the value of heat transfer coefficient. The Charters correlation has been modified by adding a constant, K. This value is determined by comparing the theoretical efficiency with the efficiency from the experimental data. Since the heat transfer coefficients are temperature dependent, an initial values of the mean temperatures of the glass cover, the plate and the backplate have been approximated which allowed the heat transfer coefficients to be evaluated as a first guess. An iterative procedure have been developed that enabled the absorber's mean temperatures of the collector to be calculated. The newly calculated mean temperatures were then compared with the initially guessed temperatures. The iterative procedure was repeated until consecutive mean temperature values differed by less than 0.01°C. This mathematical model can also be apply to other solar collector with different kind of absorber plate in order to get the value of K.
Data base design
Authors: Vincent Lum
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

In the past, data base design has been treated in literature and technology as a "universally" definable endeavor susceptible to some common or singular approach or model. It is now being recognized, especially by data base designers and users, that data base design is not nearly as tractable as it once appeared since its design is much more user- and environment-dependent than previously recognized.
Cyberpandemics: History, Inevitability, Response
Authors: Bret Michael, Jeffrey Voas, Phil Laplante
Venue: IEEE Security and Privacy (2009)

As cyberspace has evolved into a large, dynamic, and tangled web of computing devices, engineers often fail to design in dependability properties—such as stability, robustness, and security—at the system level. Consequently, unintentional and malevolent actions taken in cyberspace have affected critical infrastructures in the physical world. These disturbances and systems' resultant undependable behavior can progress and spread like infectious disease-like cyberpandemics.
Keepon goes Seoul-searching
Authors: Marek P. Michalowski, Jaewook Kim, Bomi Kim, Sonya S. Kwak, Hideki Kozima
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

Keepon is a robot designed for social interaction with children for the purposes of social development research and autism therapy [1]. Keepon's capacity for rhythmic synchrony in the form of dance has resulted in the popularity of several fictional music videos on the internet [2,3]. During a research collaboration visit at the KAIST PES Design Lab in Korea, Keepon's creators added this new chapter to the story of Keepon's travels. Upon watching a video of traditional Korean "Pungmulnori" dancing, which features distinctive spinning hats, Keepon becomes enamored. The robot has many adventures as he travels around Korea in search of a dance group that finally welcomes him into their cultural performance. Additional credits: Music ("Superfantastic" by Peppertones/Cavare Sound); Videography (Uyoung Chang and Minwoo Kang); Pungmulnori Team "Ghil" (Junhyung Park, Seongbok Chae, Sangmi Lee, Mikyeong Kim, and Sohyun Park). This video is available at http://beatbots.org and at http://www.youtube.com/watch?v=XwqfWR2KPd0.
Optimality conditions in global optimization and their applications
Authors: A. M. Rubinov, Z. Y. Wu
Venue: Mathematical Programming: Series A and B (2009)

In this paper we derive necessary and sufficient conditions for some problems of global minimization. Our approach is based on methods of abstract convexity: we use a representation of an upper semicontinuous function as the lower envelope of a family of convex functions. We discuss applications of conditions obtained to the examination of some tractable sufficient conditions for the global minimum and to the theory of inequalities.
RapidMRC: approximating L2 miss rate curves on commodity systems for online optimizations
Authors: David K. Tam, Reza Azimi, Livio B. Soares, Michael Stumm
Venue: Proceeding of the 14th international conference on Architectural support for programming languages and operating systems (2009)

Miss rate curves (MRCs) are useful in a number of contexts. In our research, online L2 cache MRCs enable us to dynamically identify optimal cache sizes when cache-partitioning a shared-cache multicore processor. Obtaining L2 MRCs has generally been assumed to be expensive when done in software and consequently, their usage for online optimizations has been limited. To address these problems and opportunities, we have developed a low-overhead software technique to obtain L2 MRCs online on current processors, exploiting features available in their performance monitoring units so that no changes to the application source code or binaries are required. Our technique, called RapidMRC, requires a single probing period of roughly 221 million processor cycles (147 ms), and subsequently 124 million cycles (83 ms) to process the data. We demonstrate its accuracy by comparing the obtained MRCs to the actual L2 MRCs of 30 applications taken from SPECcpu2006, SPECcpu2000, and SPECjbb2000. We show that RapidMRC can be applied to sizing cache partitions, helping to achieve performance improvements of up to 27%.
On Independent Sets and Bicliques in Graphs
Authors: Serge Gaspers, Dieter Kratsch, Mathieu Liedloff
Venue: Graph-Theoretic Concepts in Computer Science: 34th International Workshop, WG 2008, Durham, UK, June 30 --- July 2, 2008. Revised Papers (2008)

Bicliques of graphs have been studied extensively, partially motivated by the large number of applications. One of the main algorithmic interests is in designing algorithms to enumerate all maximal bicliques of a (bipartite) graph. Polynomial-time reductions have been used explicitly or implicitly to design polynomial delay algorithms to enumerate all maximal bicliques.Based on polynomial-time Turing reductions, various algorithmic problems on (maximal) bicliques can be studied by considering the related problem for (maximal) independent sets. In this line of research, we improve Prisner's upper bound on the number of maximal bicliques [Combinatorica, 2000] and show that the maximum number of maximal bicliques in a graph on n vertices is exactly 3 n/3 (up to a polynomial factor). The main results of this paper are O(1.3642 n ) time algorithms to compute the number of maximal independent sets and maximal bicliques in a graph.
A comparison of sequential design methods for RF circuit block modeling
Authors: Karel Crombecq, Luciano De Tommasi, Dirk Gorissen, Tom Dhaene
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

When modeling complex systems, the locations of the data points are essential to the success of the algorithm. Sequential design methods are iterative algorithms that use data acquired from previous iterations to guide future sample selection. They are often used to improve an initial design such as a Latin hypercube or a simple grid, in order to focus on highly dynamic parts of the design space. In this paper, a comparison is made between different sequential design methods on a real-world electronics problem. Error-based and density-based methods are compared against a novel hybrid technique which incorporates both an error-based measure, using gradient estimations of the objective function, and a density-based measure, using a Voronoi tessellation approximation. The test results indicate that a considerable improvement of the average model accuracy can be achieved by using this new approach.
Personality-Based Practical Reasoning
Authors: Thomas L. Weide, Frank Dignum, John-Jules Ch. Meyer, Henry Prakken, Gerard A. Vreeswijk
Venue: Argumentation in Multi-Agent Systems: Fifth International Workshop, ArgMAS 2008, Estoril, Portugal, May 12, 2008. Revised Selected and Invited Papers (2009)

In virtual training scenarios, agent technology can be used to build a virtual tutor that assists a student during training. In a dialogue using argumentation schemes, the virtual tutor provides reasons to the students to explain why a particular action is the most sensible. The tutor determines the best action using practical reasoning. The justification of this action is selected based on the personality type of the student. This paper studies how agent technology could be used to make a virtual tutor that assists the student during the training. In particular, we study how the tutor can generate persuasive arguments for what the student should do.
The Many Facets of Progressive Retrieval for CBIR
Authors: Nouha Bouteldja, Valerie Gouet-Brunet, Michel Scholl
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

Recently, progressive retrieval has been advocated as an alternate solution to multidimensional indexes or approximate techniques, in order to accelerate similarity search of points in multidimensional spaces. The principle of progressive search is to offer a first subset of the answers to the user during retrieval. If this subset satisfies the user's needs retrieval stops. Otherwise search resumes, and after a number of steps the exact answer set is returned to the user. Such a process is justified by the fact that in a large number of applications it is more interesting to rapidly bring first approximate answer sets rather than waiting for a long time the exact answer set. The contribution of this paper is a first typology of existing techniques for progressive retrieval. We survey a variety of methods designed for image retrieval although some of them apply to a general database browsing context which goes beyond CBIR. We also include techniques not designed for but that can easily be adapted to progressive retrieval.