ppxscal/embedding_network huggingface dataset:
Development of a technology mentor survey instrument: Understanding student mentors' benefits
Authors: Sonmez Pamuk, Ann D. Thompson
Venue: Computers Education (2009)

Agreement on the effectiveness of the technology mentoring approach in addressing educators' needs for learning different technologies has been growing. Literature on the concept of mentoring in general and technology mentoring specifically has indicated mentoring relationships in different settings provide benefits for the less experienced mentoring partner, while existing literature was limited in providing insights about mentoring from the more experienced partner's point of view. But, studies have suggested that understanding mentors' reactions to the experience is necessary to establish sustainable and mutually beneficial mentoring relationships. For this purpose, this study discusses and proposes an assessment framework and an instrument to examine benefits for technology mentors. Considering the lack of similar studies and the absence of an instrument designed specifically to study this subject, we believe that our study will contribute to the knowledge base by providing educators with an assessment strategy and a tool for investigating the benefits gained by the more experienced person (graduate student in our context) benefits in a technology mentoring relationship. In addition, the resulting survey instrument provided along with this study is a valuable tool for those studying technology mentoring. The theoretical foundations, development process of the development of the instrument, and reliability and validity issues are discussed in detail.
SPIRAL: A novel biologically-inspired algorithm for gas/odor source localization in an indoor environment with no strong airflow
Authors: Gabriele Ferri, Emanuele Caselli, Virgilio Mattoli, Alessio Mondini, Barbara Mazzolai, Paolo Dario
Venue: Robotics and Autonomous Systems (2009)

This work describes the design and experimental results of an algorithm, designed to localize a gas source in an indoor environment with no strong airflow by using an autonomous agent. This condition exacerbates the patchiness and intermittency of odor distribution, typical of turbulent flows in the presence of strong mean flows. Furthermore, no information about the wind can be used to detect the position of the source. In the approach proposed here, the robot moves along spirals. A spiral can be reset and a new one started, based on the information acquired about gas distribution. This enables the robot to get close to the ejecting source, without relying on airflow measurements. Results from experiments are also described and discussed, to assess the efficiency of the proposed method.
A novel hybrid algorithm for scheduling steel-making continuous casting production
Authors: Arezoo Atighehchian, Mehdi Bijari, Hamed Tarkesh
Venue: Computers and Operations Research (2009)

In this paper, steel-making continuous casting (SCC) scheduling problem (SCCSP) is investigated. This problem is a specific case of hybrid flow shop scheduling problem accompanied by technological constraints of steel-making. Since classic optimization methods fail to obtain an optimal solution for this problem over a suitable time, a novel iterative algorithm is developed. The proposed algorithm, named HANO, is based on a combination of ant colony optimization (ACO) and non-linear optimization methods. The solution construction in HANO is broken up into two phases. The first phase determines the discrete variables (corresponding to job-machine assignment and sequencing), while the second phase determines the continuous ones (corresponding to timing of the jobs on their assigned machines) through a non-linear optimization method. The efficiency of HANO is compared with a heuristic algorithm as a real case used at Mobarakeh Steel Company (MSC), the biggest steel factory in the Middle East. In addition, the proposed algorithm is compared with Genetic Algorithm, as a search method for both discrete and continuous variables, through solving several instances. Numerical results reveal the higher efficiency of the proposed approach compared with the heuristic one used at MSC. Furthermore, the efficiency of HANO is compared with GA to show that HANO enjoys a better performance in more than 95% of the cases while in the remaining 5%, its performance efficiency shows no difference.
Discovering Computers: Fundamentals, 4th edition
Authors: Gary B. Shelly, Thomas J. Cashman, Misty E. Vermaat
Venue:  (2007)

This fourth edition, from the Shelly Cashman Series, covers the same breadth, but with less depth as Discovering Computers 2008: Complete. This title is ideal for beginning coverage of computer concepts. With the Shelly Cashman Series' project-oriented, step-by-step pedagogy, and full-color screenshots, this book includes new exercises, and tools on the Online Companion. Updated for currency, the latest trends in technology and computer concepts are covered.
Finding your place in digital production
Venue: ACM SIGGRAPH ASIA 2008 courses (2008)

Research is a large part of finding a digital production job.
Bandwidth of Bipartite Permutation Graphs
Authors: Ryuhei Uehara
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

The bandwidth problem is finding a linear layout of vertices in a graph in such a way that minimizes the maximum distance between two vertices joined by an edge. The bandwidth problem is one of the classic ${\mathcal NP}$-complete problems. Especially, the problem is ${\mathcal NP}$-complete even for trees. The bandwidth problem can be solved in polynomial time for a few graph classes. Efficient algorithms for computing the bandwidth for three graph classes are presented. The first one is a linear time algorithm for a threshold graph, and the second one is a linear time algorithm for a chain graph. The last algorithm solves the bandwidth problem for a bipartite permutation graph in O(n 2) time. The former two algorithms improve the previously known upper bounds to optimal, and the last one improves recent result, and they give positive answers to some open problems.
Characterization and modeling of graphene field-effect devices
Authors: K. L. Shepard, I. Meric, P. Kim
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

The novel electronic properties of graphene, including a linear energy dispersion relation and purely two-dimensional structure, have led to intense research into possible applications of this material in nanoscale devices. In this paper, we review the unique electronic properties of graphene that give it the potential for high-frequency electronic applications. We then present the latest results on the current-voltage characteristics of top-gated graphene FETs. These devices show unique characteristics related to the ambipolar nature of the graphene channel. In addition, the devices show very high saturation velocities, suggesting the possibility for superior high frequency performance. Our initial devices have transconductances as high as 150 &mu;S/&mu;m despite low on-off current ratios, making the devices very suitable for analog/RF applications.
Teaching large scale data processing: the five-week course and two years' experiences
Authors: Kang Chen, Yubing Yin, Weimin Zheng
Venue: Proceedings of the 1st ACM Summit on Computing Education in China on First ACM Summit on Computing Education in China (2008)

We have setup a new course on the large scale data processing using clusters. It introduces the concepts and design of distributed systems. Many newly developed ideas such as Google file system and MapReduce programming framework for processing large scale data sets are introduced. Students will gain practical experience with distributed programming technologies via several small labs and one large multi-week final project. Labs and projects will be completed using Hadoop, an open-source implementation of Google's distributed file system and MapReduce programming model. We have taught this class named "Mass Data Processing Technology on Large Scale Clusters" for two years. This paper will describe the design, perform of the course as well as the experiences and lessons learned.
Design for burn-in test: a technique for burn-in thermal stability under die-to-die parameter variations
Authors: Mesut Meterelliyoz, Kaushik Roy
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

Strong temperature dependence of leakage has been a major problem during burn-in test where increased voltages and temperatures are applied to weed out defective parts. Moreover, process variations may result in different temperature profiles in different dies during burn-in. This paper proposes an adaptive design-for-burn-in technique that stabilizes the junction temperature by controlling the leakage power using sleep (supply-gating) transistors for a wide range of ambient temperatures, process variations, thermal resistances and supply voltages.
MA-UML: a conceptual approach for mobile agents' modelling
Authors: Hela Hachicha, Adlen Loukil, Khaled Ghedira
Venue: International Journal of Agent-Oriented Software Engineering (2009)

In recent years, software development based on Mobile Agents (MAs) has received important attention because it introduces a new development paradigm for widely distributed and heterogeneous systems. However, the existing work has mostly focused on the implementation phase of the MA-based applications development process and they do not take into consideration the analysis and design phases. In this paper, we present a conceptual approach to model MAs. This approach is materialised by a Unified Modelling Language (UML) profile, called MA-UML for modelling MAs.
Opportunities for Natural Language Processing Research in Education
Authors: Jill Burstein
Venue: Proceedings of the 10th International Conference on Computational Linguistics and Intelligent Text Processing (2009)

This paper discusses emerging opportunities for natural language processing (NLP) researchers in the development of educational applications for writing, reading and content knowledge acquisition. A brief historical perspective is provided, and existing and emerging technologies are described in the context of research related to content, syntax, and discourse analyses. Two systems, e-rater® and Text Adaptor, are discussed as illustrations of NLP-driven technology. The development of each system is described, as well as how continued development provides significant opportunities for NLP research.
Energy efficient implementation of G.729 for wireless VoIP application
Authors: Aihong Yao, Junjun Gu, Gang Qu, Shuvra Bhattacharyya
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

In this paper, we describe the formatting guidelines for ACM SIG Proceedings. Traditionally silence in VoIP applications is detected by a VAD algorithm after G.729 compression, both have high computational and energy cost. However, such cost on silence frames will be completely wasted because the detected silence frames will not be sent to receiver. We propose to use a silence pre-detection (SPD) module to detect silence frames directly from the voice sample in order to reduce energy. Our adaptive SPD algorithm has little hardware requirement and low computation cost. However, it can detect 59% of the silence, which results in 34% energy saving. The impact to quality of speech is almost unnoticeable.
An on demand data integration model for biological databases
Authors: Mathew Palakal, Pavithra Naidu
Venue: International Journal of Data Mining and Bioinformatics (2009)

This paper presents a user-centric biological query system for information integration and knowledge acquisition from distributed, semantically heterogeneous data sources. The proposed system, BioXBase, extracts user requested query information over the internet from multiple biological sources and organises this information into a homogeneous unified view to the user. This entire process is done in real time on-the-fly. The BioXBase system has improved the results retrieved by 30% compared to a system that has only a local database. The BioXBase system is further enhanced by 20% while combining the results with a local database, making the results more significant in biological domain.
Producing wrong data without doing anything obviously wrong!
Authors: Todd Mytkowicz, Amer Diwan, Matthias Hauswirth, Peter F. Sweeney
Venue: ACM SIGPLAN Notices (2009)

This paper presents a surprising result: changing a seemingly innocuous aspect of an experimental setup can cause a systems researcher to draw wrong conclusions from an experiment. What appears to be an innocuous aspect in the experimental setup may in fact introduce a significant bias in an evaluation. This phenomenon is called measurement bias in the natural and social sciences. Our results demonstrate that measurement bias is significant and commonplace in computer system evaluation. By significant we mean that measurement bias can lead to a performance analysis that either over-states an effect or even yields an incorrect conclusion. By commonplace we mean that measurement bias occurs in all architectures that we tried (Pentium 4, Core 2, and m5 O3CPU), both compilers that we tried (gcc and Intel's C compiler), and most of the SPEC CPU2006 C programs. Thus, we cannot ignore measurement bias. Nevertheless, in a literature survey of 133 recent papers from ASPLOS, PACT, PLDI, and CGO, we determined that none of the papers with experimental results adequately consider measurement bias. Inspired by similar problems and their solutions in other sciences, we describe and demonstrate two methods, one for detecting (causal analysis) and one for avoiding (setup randomization) measurement bias.
Interval estimation of odds ratio in a stratified randomized clinical trial with noncompliance
Authors: Kung-Jong Lui, Kuang-Chao Chang
Venue: Computational Statistics Data Analysis (2009)

It is not uncommon to encounter a randomized clinical trial (RCT), in which we need to account for both the noncompliance of patients to their assigned treatment and confounders to avoid making a misleading inference. In this paper, we focus our attention on estimation of the relative treatment efficacy measured by the odds ratio (OR) in large strata for a stratified RCT with noncompliance. We have developed five asymptotic interval estimators for the OR. We employ Monte Carlo simulation to evaluate the finite-sample performance of these interval estimators in a variety of situations. We note that the interval estimator using the weighted least squares (WLS) method may perform well when the number of strata is small, but tend to be liberal when the number of strata is large. We find that the interval estimator using weights which are not functions of unknown parameters required to be estimated from data can improve the accuracy of the interval estimator based on the WLS method, but lose precision. We note that the estimator using the logarithmic transformation of the WLS point estimator and the interval estimator using the logarithmic transformation of the Mantel-Haenszel (MH) type of point estimator can perform well with respect to both the coverage probability and the average length in all the situations considered here. We further note that the interval estimator derived from a quadratic equation using a randomization-based method can be of use as the number of strata is large. Finally, we use the data taken from a multiple risk factor intervention trial to illustrate the use of interval estimators appropriate for being employed when the number of strata is small or moderate.
The Workload Adaptation in Autonomic DBMSs Based on Layered Queuing Network Model
Authors: Yan Qiang, Yi Li, Junjie Chen
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Modern network computing is in the process of changingfrom manual management to autonomic computing. As thecore of network computing, database management systemwith autonomic computing must be able to participate in theprocess to meet the performance requirements of thenetwork applications. This paper studies on workloadadaptation technology. In the Workload AdaptationFramework, the performance forecasting component is thebase of developing workload control scheme. Layeredqueuing network modeling techniques was used to establishthe performance model of DBMS. A test platform based onthis architecture has been built and been tested. Test resultshows that this framework has played an effective role inworkload control, and improved client satisfaction rate andthe application performance of the network.
Business Data Communications, 6th edition
Authors: William Stallings
Venue:  (2008)

Business Data Communications, 6/e, covers the fundamentals of data communications, networking, distributed applications, and network management and security. Stallings presents these concepts in a way that relates specifically to the business environment and the concerns of business management and staff, structuring his text around requirements, ingredients, and applications. All of the material has been updated for the latest technologies and developments in the field, including: specifications of WiFi/IEEE 802.11 wireless LANs, including 802.11n. IP; performance metrics and service level agreements (SLAs); Gigabit Ethernet and 10-Gbps Ethernet standards; New unified communications concepts; expanded, enhanced security material; New online animations illustrate key functions and algorithms in OS design. Appropriate for professionals interested in business data communications.
How much and where? Private versus public universities' publication patterns in the information systems discipline
Authors: Clyde W. Holsapple, Daniel O'Leary
Venue: Journal of the American Society for Information Science and Technology (2009)

In most disciplines of scholarly endeavor, there are many efforts at ranking research journals. There are two common methods for such efforts. One of these is based on tabulations of opinions offered by persons having some kind of relationship with the discipline. The other is based on analyses of the extent to which a journal's articles have been cited by papers appearing in some selected set of publications. In either case, construction of a journal ranking for a discipline makes no effort to distinguish between private and public universities. That is, data are aggregated from both private and public faculty researchers. It is thus assumed that the resultant ranking is applicable for both kinds of institutions. But, is this assumption reasonable? The answer is very important because these rankings are applied in the evaluation of promotion, tenure, and merit cases of faculty members working in a discipline. Here, we examine this widespread bibliometric assumption through the use of a ranking methodology that is based on the actual publishing behaviors of tenured researchers in a discipline. The method is used to study the behaviors of researchers at leading private universities versus those at leading public universities. Illustrating this approach within the information systems discipline, we find that there are indeed different publication patterns for the private versus public institutions. This finding suggests that journal-ranking exercises should not ignore private&ndash;public distinctions and that care should be taken to avoid evaluation standards that confound private and public rankings of journals. &copy; 2009 Wiley Periodicals, Inc.
What Is between Chordal and Weakly Chordal Graphs?
Authors: Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
Venue: Graph-Theoretic Concepts in Computer Science: 34th International Workshop, WG 2008, Durham, UK, June 30 --- July 2, 2008. Revised Papers (2008)

An (h,s,t)-representation of a graph G consists of a collection of subtrees {S v | v ¿ V(G)} of a tree T, such that (i) the maximum degree of T is at most h, (ii) every subtree has maximum degree at most s, and (iii) there is an edge between two vertices in the graph if and only if the corresponding subtrees in T have at least t vertices in common. For example, chordal graphs correspond to [ ¿ , ¿ ,1] = [3,3,1] = [3,3,2] graphs (notation of ¿ here means that no restriction is imposed).We investigate the complete bipartite graph K 2,n and prove new theorems characterizing those K 2,n graphs that have an (h,s,2)-representation and those that have an (h,s,3)-representation.We characterize [3,2,4] graphs as equivalent to the 4-flower-free [2,4,4] graphs and give a recognition algorithm for [2,3,4] graphs.Based on these characterizations, we present new results that confirm that weakly chordal graphs, as opposed to chordal graphs, can not be characterized within the [h,s,t] framework. Furthermore, we show a hierarchy of families of graphs between chordal and weakly chordal within the [h,s,t] framework.
Mapping world-class universities on the web
Authors: Jose Luis Ortega, Isidro F. Aguillo
Venue: Information Processing and Management: an International Journal (2009)

A visual display of the most important universities in the world is the aim of this paper. It shows the topological characteristics and describes the web relationships among universities of different countries and continents. The first 1000 higher education institutions from the Ranking Web of World Universities were selected and their link relationships were obtained from Yahoo! Search. Network graphs and geographical maps were built from the search engine data. Social network analysis techniques were used to analyse and describe the structural properties of the whole of the network and its nodes. The results show that the world-class university network is constituted from national sub-networks that merge in a central core where the principal universities of each country pull their networks toward international link relationships. The United States dominates the world network, and within Europe the British and the German sub-networks stand out.
Comparing Topological Models for Concurrency
Authors: Emmanuel Haucourt
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Several categories of models for concurrency involving topology have been put forward in each of which a notion of fundamental category is defined. One of them, the category of pospaces, is canonically included in almost all the others. Given a pospace X-> and i(X->), the image of X-> by the inclusion i of PoTop in some of the other category in which the fundamental category is defined, it is then natural to ask how the fundamental categories of X-> and i(X->) are related. The answer to this question is one of the purposes along of this article. We introduce a general framework for categories in which a reasonable notion of fundamental categories can be defined.
Dynamic power optimization by exploiting self-reconfiguration in Xilinx Spartan 3-based systems
Authors: Katarina Paulsson, Michael Hübner, Jürgen Becker
Venue: Microprocessors Microsystems (2009)

Reconfigurable architectures are increasingly often applied in various industrial data processing applications, due to the possibility for performing parallel computations and achieving a simplified Systemon-Chip design flow. Furthermore, the exploitation of dynamic and partial hardware reconfiguration has been investigated in different research projects, often in systems based on Xilinx Virtex 2/4 FPGA families, by time-multiplexing hardware resources for multiple functions. This paper describes the exploitation of partial reconfiguration for dynamic power management in a low-power Spartan 3-based level measurement application. The reconfiguration process is thereby applied to optimize system implementation according to the applications requirements on power consumption and performance.