ppxscal/embedding_network huggingface dataset:
Oer recommender: linking nsdl pathways and opencourseware repositories
Authors: Joel Duffin, Brandon Muramatsu
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

The OER Recommender (www.oerrecommender.org) is a web service that helps people find relevant open educational resources. It links the digital learning resources in the National Science Digital Library (NSDL) disciplinary pathways with courses in OpenCourseWare repositories thereby providing critical contextual information. When a person browses a web page in a participating NSDL Pathway or OpenCourseWare repository, the recommender annotates the page with a "Recommended resources" link. The poster will describe the motivations for the project, provide detail on the recommendation engine, display recommendations for participating collections, and describe how other collections can participate in the project.
A flexible time-varying generalised minimum variance controller
Authors: Zheng Li, Christian Schmid
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

The problem of generalised minimum variance control of linear time-varying systems is studied in this paper. A generalised minimum variance controller is developed in a transfer operator framework for linear time-varying systems using a pseduocommutation technique and a more flexible cost functional that includes time-varying filters for the plant input and output.
High speed pipelined Booth multiplier for DSP applications
Authors: Hwang-Cherng Chow, I-Chyn Wey
Venue: Proceedings of the 9th International Conference on Circuits (2005)

In this paper, a new MBE (modified Booth encoding) recoder, and a new MBE decoder are proposed in CMOS transistor level to improve the performance of traditional multipliers. The proposed pipelined Booth multiplier can reduce the delay time of the critical path by levelizing the complex gate in the MBE decoder. As a result, MBE decoder is no more the speed bottleneck of a pipelined booth multiplier, and the speed of the MBE decoder can be improved up to 66.3 percent. Besides, an 8-bit by 8-bit glitch-free Booth multiplier is pipelined as a traditional pipelined array multiplier without any bottleneck in the MBE encoder and decoder, but with better performance in both power and speed. Finally, a low voltage, high speed pipelined glitch-free Booth multiplier architecture is presented at 1 GHz in TSMC 0.35µm process with a power consumption of only 100.52mw.
Positioning using Acceleration and Moving Direction
Authors: Bongeun Gu, Yunsik Kwak
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

The position of user or object is important context to provide the user with the user-oriented services. To position the user or object, we propose the autonomous positioning technique in this paper. In the autonomous positioning technique, the acceleration and the moving direction are used to position the user or the moving object. The moving length is calculated from the acceleration. And the calculated moving length and the direction is used to calculate new position of user or object. To show that the autonomous positioning technique is effective and useful, we implement the positioning device which uses the autonomous positioning technique. From the prototype implemented, we know that the proposed positioning is useful.
A resource limited artificial immune system algorithm for supervised classification of multi/hyper-spectral remote sensing imagery
Authors: L. Zhang, Y. Zhong, B. Huang, P. Li
Venue: International Journal of Remote Sensing (2007)

The resource limited artificial immune system (RLAIS), a new computational intelligence approach, is being increasingly recognized as one of the most competitive methods for data clustering and analysis. Nevertheless, owing to the inherent complexity of the conventional RLAIS algorithm, its application to multi/hyper-class remote sensing image classification has been considerably limited. This paper explores a novel artificial immune algorithm based on the resource limited principles for supervised multi/hyper-spectral image classification. Three experiments with different types of images were performed to evaluate the performance of the proposed algorithm in comparison with other traditional image classification algorithms: parallelepiped, minimum distance, maximum likelihood, K-nearest neighbour and back-propagation neural network. The results show that the proposed algorithm consistently outperforms the traditional algorithms in all the experiments and hence provides an effective new option for processing multi/hyper spectral remote sensing images.
Manifold splines with a single extraordinary point
Authors: Xianfeng Gu, Ying He, Miao Jin, Feng Luo, Hong Qin, Shing-Tung Yau
Venue: Computer-Aided Design (2008)

This paper develops a novel computational technique to define and construct manifold splines with only one singular point by employing the rigorous mathematical theory of Ricci flow. The central idea and new computational paradigm of manifold splines are to systematically extend the algorithmic pipeline of spline surface construction from any planar domain to an arbitrary topology. As a result, manifold splines can unify planar spline representations as their special cases. Despite its earlier success, the existing manifold spline framework is plagued by the topology-dependent, large number of singular points (i.e., |2g-2| for any genus-g surface), where the analysis of surface behaviors such as continuity remains extremely difficult. The unique theoretical contribution of this paper is that we devise new mathematical tools so that manifold splines can now be constructed with only one singular point, reaching their theoretic lower bound of singularity for real-world applications. Our new algorithm is founded upon the concept of discrete Ricci flow and associated techniques. First, Ricci flow is employed to compute a special metric of any manifold domain (serving as a parametric domain for manifold splines), such that the metric becomes flat everywhere except at one point. Then, the metric naturally induces an affine atlas covering the entire manifold except this singular point. Finally, manifold splines are defined over this affine atlas. The Ricci flow method is theoretically sound, and practically simple and efficient. We conduct various shape experiments and our new theoretical and algorithmic results alleviate the modeling difficulty of manifold splines, and hence, promote the widespread use of manifold splines in surface and solid modeling, geometric design, and reverse engineering.
Implementation of a constant-time dynamic storage allocator
Authors: M. Masmano, I. Ripoll, J. Real, A. Crespo, A. J. Wellings
Venue: Software&mdash;Practice Experience (2008)

This paper describes the design criteria and implementation details of a dynamic storage allocator for real-time systems. The main requirements that have to be considered when designing a new allocator are concerned with temporal and spatial constraints. The proposed algorithm, called TLSF (two-level segregated fit), has an asymptotic constant cost, O(1), maintaining a fast response time (less than 200 processor instructions on a x86 processor) and a low level of memory usage (low fragmentation). TLSF uses two levels of segregated lists to arrange free memory blocks and an incomplete search policy. This policy is implemented with word-size bitmaps and logical processor instructions. Therefore, TLSF can be categorized as a good-fit allocator. The incomplete search policy is shown also to be a good policy in terms of fragmentation. The fragmentation caused by TLSF is slightly smaller (better) than that caused by best fit (which is one of the best allocators regarding memory fragmentation). In order to evaluate the proposed allocator, three analyses are presented in this paper. The first one is based on worst-case scenarios. The second one provides a detailed consideration of the execution cost of the internal operations of the allocator and its fragmentation. The third analysis is a comparison with other well-known allocators from the temporal (number of cycles and processor instructions) and spatial (fragmentation) points of view. In order to compare them, a task model has been presented. Copyright &copy; 2007 John Wiley & Sons, Ltd.
Beyond 4G: Open Source Telecom Leveraging MIMO and Distributed P2P Connectivity for Wired Independence
Authors: Tirtharaj Bhattacharjee, Brent R. Petersen
Venue: Proceedings of the Communication Networks and Services Research Conference (2008)

With the advent of multi-processing and multi-core systems, parallels in multiplexing radio-frequency (RF) transmission by Multiple-Input-Multiple-Output (MIMO) is advantageous. Convergence architecture for Beyond-Fourth-Generation (B4G) communications is considered utilizing open standards,MIMO and P2P topology. The system is observed as a software host-media-processing (HMP) appliance aggregated with modularized interfacing for distributed network communications. Experiments conducted on the modular interfacing components demonstrate active and passive wireless link properties of 802.11 b, g and n under LOS, NLOS, VLOS scenarios as compared to Ethernet. Codec’s used in the system (G711a, G711u, G723.1, G726-32, and G729a) for communication are tested under QoS bandwidth starvation for behavior of bi-directional throughput within the networked system. UDP protocol saturation tests on IPv6 and IPv4 are conducted. The model of the appliance is proposed for voice, data, and video communications anytime, anywhere.
Borland Pascal tools for bootstrapping dependent data
Authors: A. Mouiha
Venue: Proceedings of the 7th WSEAS International Conference on Applied Mathematics (2005)

One of the drawbacks of the bootstrap method is that it is time consuming when exucuting its applications, especielly with some statistical software (example: S-plus, Minitab, Gauss..). But when using the programming languages (example: Borland Pascal, C/C++,..) this execution becomes faster. In this paper, we describe some Borland Pascal procedures, functions and units to overcome this problem.
Two-level trust-based decision model for information assurance in a virtual organization
Authors: Yanjun Zuo, Brajendra Panda
Venue: Decision Support Systems (2008)

Like other unstructured decision problems, selection of external trustworthy objects are challenging particularly in a virtual organization (VO). Novel methods are desired to filter out invalid information as well as insecure programs. This paper presents a new, conceptual approach to support selection of objects. It is a two-level decision model, which helps a VO participant determine whether an external object can be accepted based on the object's quality and security features. This hierarchical decision-making process complies with both practical evidence and theoretical decision models. Its underlying concepts are logically sound and comprehensible. We illustrate the approaches using software selection.
A Comparative Study of Industrial Static Analysis Tools
Authors: Pär Emanuelsson, Ulf Nilsson
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

Tools based on static analysis can be used to find defects in programs. Tools that do shallow analyses based on pattern matching have existed since the 1980's and although they can analyze large programs they have the drawback of producing a massive amount of warnings that have to be manually analyzed to see if they are real defects or not. Recent technology advances has brought forward tools that do deeper analyses that discover more defects and produce a limited amount of false warnings. These tools can still handle large industrial applications with millions lines of code. This article surveys the underlying supporting technology of three state-of-the-art static analysis tools. The survey relies on information in research articles and manuals, and includes the types of defects checked for (such as memory management, arithmetics, security vulnerabilities), soundness, value and aliasing analyses, incrementality and IDE integration. This survey is complemented by practical experiences from evaluations at the Ericsson telecom company.
Attribute-based Signature Scheme
Authors: Guo Shanqing, Zeng Yingpei
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

In real life, one requires signatures from people who satisfy certain criteria like that they should possess some specific attributes. For example, Alice wants a document to be signed by some employee in Bob’s company. This employee must have certain attributes such as being part of the IT staff and at least a junior manager in the cryptography team or a senior manager in the biometrics team. In order to satisfy these kinds of needs, we defined a common Attribute-based signature scheme where the signing member has to have certain attributes or belong to a certain group, and we also proved our scheme to be secure.
Survey Research on Mobile Phone Market for Mobile-Learning in Japan
Authors: Yoshiko Goda, Yuichi Kogure, Yukinari Shimoyama, Midori Kimura, Hiroyuki Obari
Venue: Proceedings of the Fifth IEEE International Conference on Wireless, Mobile, and Ubiquitous Technology in Education (2008)

This study reports the actual situations of mobile phone market for mobile learning at universities in Japan. About 700 undergraduate students in Tokyo area participated into the survey research and the researcher-developed questionnaire was utilized to collect the data. The results of descriptive analyses are reported focusing on distribution rate of mobile phones, daily usage of mobile phones, preferable mobile phone services to investigate possibilities of mobile phone use for learning. Comparisons of the results with that of last year show the tremendous increase of students’ subscription of the flat rate for the unlimited use service of networking packets. This implies that infrastructure for mobile learning environments has been established at universities in Japan.
Preparation of ferroelectric ceramics in a film structure and their photovoltaic properties
Authors: M. Ichiki, Y. Morikawa, Y. Mabune, T. Nakada, K. Nonaka, R. Maeda
Venue: Microsystem Technologies (2005)

This paper reports the formation of a new-layered film structure and the highly improved photovoltaic output of the lead lanthanum zirconate titanate (PLZT) employed. The new structural design is described using an upper top transparent indium tin oxide (ITO) electrode. The PLZT film structure exhibited V and &#x03bc;A output. The photovoltaic current of the PLZT film per unit width was more than 102 times larger than that of bulk PLZT, while the photovoltaic voltage per unit thickness in the layered film structure was almost the same as that in bulk ceramics and single crystals. These differences are due to the characteristics of the film structure and configuration of the electrode. The PLZT film also has the advantage of easily controllable parameters: film thickness, illuminated area, and illumination intensity. A simple model is used for the phenomenological explanation of the improved photovoltaic effect of the PLZT film.
Short-term response of arctic vegetation NDVI to temperature anomalies
Authors: I. Olthof, R. Latifovic
Venue: International Journal of Remote Sensing (2007)

The effects of climate change on northern vegetation productivity need to be fully understood in order to reduce uncertainties in predicting vegetation distributions under different climate warming scenarios. Knowledge of the relationship between northern climate and vegetation productivity will also help provide a better understanding of changes in vegetation distributions as an indicator of climate change and variability. Vegetation productivity and biomass have been monitored using long-term satellite earth observations, mostly using the Normalized Difference Vegetation Index (NDVI), as a cumulative indicator of all effects resulting from processes related to climate change, including changes in temperature, precipitation, and disturbance. In this paper, the investigation is focused on the short-term effect of temperature anomalies on arctic and tree-line transition vegetation productivity in both dry and humid regions of Canada. The analysis shows that several land-cover types composed mainly of trees and shrubs exhibit a significant increase in NDVI with higher-than-normal temperatures in the preceding 10-40-day period, while land-cover types consisting of lichen and moss growing on mostly barren surfaces show a significant NDVI decrease with increased temperature. These trends are consistent with results reported in plot-warming experiments in the north, which have shown that certain vegetation communities increase, while others decrease in cover fraction and biomass in response to warming. When land cover is grouped into increasing and decreasing NDVI with temperature and stratified by dry and humid regions of Canada, much of the dry region of northern Canada does not exhibit significant NDVI response to preceding temperature anomalies. It is expected that in the absence of disturbance or other limiting factors, an increased frequency of elevated temperature anomalies may eventually contribute to changes in vegetation biomass. A map of land-cover types that have the potential to increase in biomass with climate warming and those that are vulnerable to decline is presented.
The complexity of approximating the square root
Authors: Y. Mansour
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

The authors prove upper and lower bounds for approximately computing the square root using a given set of operations. The bounds are extended to hold for approximating the kth root, for any fixed k. Several tools from approximation theory are used to prove the lower bound. These include Markoff inequality, Chebyshev polynomials, and a theorem that relates the degree of a rational function to its deviation from the approximated function over a given interval. The lower bound can be generalized to other algebraic functions. The upper bound can be generalized to obtain an O(1)-step straight-line program for evaluating any rational function with integer coefficients at a given integer point.
A Nature-Inspired QoS Routing Algorithm for Next Generation Networks
Authors: Heesang Lee, Gyuwoong Choi, Hyunjoon Kim, Kyuhong Lee
Venue: Proceedings of the Fourth International Conference on Autonomic and Autonomous Systems (2008)

Next generation networks should support voice or data, wired or wireless, telecommunication or broadcasting services by using quality guaranteed technology. In this paper, we suggest a nature-inspired framework and a related routing algorithm that satisfies each requirement for a quality of service of each service. In this algorithm artificial agents establish best routes for each communication service while network-wide resources are efficiently used. Our agents monitor traffic of paths in a given network and decide routes for the paths not using direct communications but an indirect stigmergy. We use agents' pheromone to monitor and record the network status to avoid traffic delay and loss for each class of the service. We analyze the performance of proposed framework and related routing algorithms through simulations. We can conclude that our nature-inspired mechanism and its algorithms show some promising performance for the next generation networks.
Special issue "Conference on Computational Complexity 2004" Guest Editor's foreword
Authors: Eric Allender
Venue: Computational Complexity (2005)

. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Bootstrapping: a technique for scalable flow and context-sensitive pointer alias analysis
Authors: Vineet Kahlon
Venue: Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation (2008)

We propose a framework for improving both the scalability as well as the accuracy of pointer alias analysis, irrespective of its flow or context-sensitivities, by leveraging a three-pronged strategy that effectively combines divide and conquer, parallelization and function summarization. A key step in our approach is to first identify small subsets of pointers such that the problem of computing aliases of any pointer can be reduced to computing them in these small subsets instead of the entire program. In order to identify these subsets, we first apply a series of increasingly accurate but highly scalable (context and flow-insensitive) alias analyses in a cascaded fashion such that each analysis Ai works on the subsets generated by the previous one Ai-1. Restricting the application of Ai to subsets generated by Ai-1, instead of the entire program, improves it scalability, i.e., Ai is bootstrapped by Ai-1. Once these small subsets have been computed, in order to make our overall analysis accurate, we employ our new summarization-based flow and context-sensitive alias analysis. The small size of each subset offsets the higher computational complexity of the context-sensitive analysis. An important feature of our framework is that the analysis for each of the subsets can be carried out independently of others thereby allowing us to leverage parallelization further improving scalability.
2008 Special Issue: Achieving "organic compositionality" through self-organization: Reviews on brain-inspired robotics experiments
Authors: Jun Tani, Ryunosuke Nishimoto, Rainer W. Paine
Venue: Neural Networks (2008)

The current paper examines how compositional structures can self-organize in given neuro-dynamical systems when robot agents are forced to learn multiple goal-directed behaviors simultaneously. Firstly, we propose a basic model accounting for the roles of parietal-premotor interactions for representing skills for goal-directed behaviors. The basic model had been implemented in a set of robotics experiments employing different neural network architectures. The comparative reviews among those experimental results address the issues of local vs distributed representations in representing behavior and the effectiveness of level structures associated with different sensory-motor articulation mechanisms. It is concluded that the compositional structures can be acquired ''organically'' by achieving generalization in learning and by capturing the contextual nature of skilled behaviors under specific conditions. Furthermore, the paper discusses possible feedback for empirical neuroscience studies in the future.