ppxscal/embedding_network huggingface dataset:
Optimization of decision-timing for early termination of SSDA-based block matching
Authors: A. Hatabu, T. Miyazaki, I. Kuroda
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

This paper describes an analysis-based method for optimizing the timing of decisions regarding early termination of block matching (BM) in the application of a successive similarity detection algorithm (SSDA). Although the SSDA reduces BM computational costs, making decisions to terminate BM or not consumes additional processor cycles. Here, total costs, including cycles for decisions, are formulated through use of a decision interval, processor-dependent cost factors, and a function which gives probabilities of BM termination. The optimal decision interval is derived by minimizing the cost function. Experiments on MPEG-4 video coding show the proposed method facilitates comparative evaluation of the computational costs of SSDA-based BM for various processors.
Using an Improved Particle Swarm Optimization for Back Analysis of Geotechnical Parameters of Concrete Face Rock-fill Dams
Authors: Hao Du, ShiChun Chi
Venue: Proceedings of the Sixth International Conference on Hybrid Intelligent Systems (2006)

In this paper, an improved particle swarm optimizer (PSO) is applied to back analysis of geotechnical parameters of concrete face rock-fill dams (CFRD). This method uses the diverse coefficients in the different evolutionary strategies to prevent premature convergence and refine the convergence performance. The application of the proposed method to a case studies shows that it is applicable to back analysis of CFRD with very promising results.
Which factors explain the Web impact of scientists' personal homepages?
Authors: Franz Barjak, Xuemei Li, Mike Thelwall
Venue: Journal of the American Society for Information Science and Technology (2007)

In recent years, a considerable body of Webometric research has used hyperlinks to generate indicators for the impact of Web documents and the organizations that created them. The relationship between this Web impact and other, offline impact indicators has been explored for entire universities, departments, countries, and scientific journals, but not yet for individual scientists&mdash;an important omission. The present research closes this gap by investigating factors that may influence the Web impact (i.e., inlink counts) of scientists' personal homepages. Data concerning 456 scientists from five scientific disciplines in six European countries were analyzed, showing that both homepage content and personal and institutional characteristics of the homepage owners had significant relationships with inlink counts. A multivariate statistical analysis confirmed that full-text articles are the most linked-to content in homepages. At the individual homepage level, hyperlinks are related to several offline characteristics. Notable differences regarding total inlinks to scientists' homepages exist between the scientific disciplines and the countries in the sample. There also are both gender and age effects: fewer external inlinks (i.e., links from other Web domains) to the homepages of female and of older scientists. There is only a weak relationship between a scientist's recognition and homepage inlinks and, surprisingly, no relationship between research productivity and inlink counts. Contrary to expectations, the size of collaboration networks is negatively related to hyperlink counts. Some of the relationships between hyperlinks to homepages and the properties of their owners can be explained by the content that the homepage owners put on their homepage and their level of Internet use; however, the findings about productivity and collaborations do not seem to have a simple, intuitive explanation. Overall, the results emphasize the complexity of the phenomenon of Web linking, when analyzed at the level of individual pages. &copy; 2007 Wiley Periodicals, Inc.
Lowering the Barrier of Query Language Skills within Mobile and Web User Interface Environments
Authors: Masaki Hasegawa, Subhash Bhalla
Venue: Proceedings of the Japan-China Joint Workshop on Frontier of Computer Science and Technology (2006)

Many research efforts aim to provide access to database systems (through the world wide web). At the human end, few users have database query language skills. Most users of the web are highly skilled at referring to tabular data. A natural inclination exists among the users for object-byobject traction to find information. Similarly, In another context, users of geographic maps tend to locate objects and path by following an item-wise (a step-wise) approach. We propose a similar approach for web information systems users. The proposed interface introduces simplicity and avoids communication ambiguities. It provides an interface between the user and the SQL query language. We compare the proposed approach with alternative approaches. The study presents an example case for a high level interface for web information systems users.
Shortest-path metric approximation for random subgraphs
Authors: Jan Vondrák
Venue: Random Structures Algorithms (2007)

We consider graph optimization problems where the cost of a solution depends only on the shortest-path metric in the graph, such as Steiner Tree or Traveling Salesman. We study a scenario where such a problem needs to be solved repeatedly on random subgraphs of a given graph G. With the goal of speeding up the repeated queries and saving space, we describe the construction of a sparse subgraph Q &sbquo; G, which contains approximately an optimal solution for any such problem on a random subgraph of G, with high probability. More precisely, the subgraph Q has the property that after some vertices or edges are removed randomly, Q still contains c-approximate shortest paths between all pairs of vertices with high probability. The number of edges in Q is O(p-cn1+2/c log n) for edge-induced random subgraphs and O(p-2cn1+2/c log 2n) for vertex-induced random subgraphs, where n is the number of vertices in G, p the sampling probability of edges/vertices, and c &micro; Z, c e 3 is the desired approximation factor. &copy; 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2007
Constant beamwidth beamformer for difference frequency in parametric array
Authors: K. S. Tan, W. S. Gan, Jun Yang, M. H. Er
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

The sound reproduction in air by using a parametric acoustic array [P.J. Westervelt, 1963] has been reported for a few decades. Two inaudible ultrasonic frequencies are produced from the parametric array. Due to the nonlinearity of air, it is possible to produce an audible frequency with its frequency equal to the difference in the two ultrasonic frequencies. However, there is not much work done in controlling the beam pattern of the difference frequency generated by the primary waves. In this paper, an algorithm is proposed to control the sidelobe level of the difference frequency directivity. By making use of array signal processing techniques, the algorithm is also capable of producing a constant beamwidth for broadband difference frequency.
Lessons learned from using an asynchronous online discussion board to facilitate scientific thinking in a large cognitive psychology lecture class
Authors: Jordan Lippman, James Pellegrino, Renee Koziol, Emily Whitehair
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

Students' responses to scientific reasoning questions posted on an online discussion board were coded for completeness, coherence, accuracy, use of evidence, reasoning, and comprehensibility. Early performance was low for every dimension. By the end of the term, ratings of coherence and completeness increased but use of evidence decreased, and other dimensions stayed the same. Implications regarding the types of feedback students need to improve their understanding and use of scientific argumentation are discussed.
Exploiting graph cutsets for sampling-based approximations in bayesian networks
Authors: Rina Dechter
Venue:  (2006)

Automated reasoning with graphical models has found many practical applications in domains such as planning, vision, speech recognition, genetic linkage analysis, diagnostics, and many others. Graphical models, combining graph theory and probability theory, facilitate a compact and structured representation for problems with uncertainty and provide a mechanism for answering queries such as computing the probability of an event given observations. Several exact algorithms for reasoning with graphical models exist. However, exact computation is not always possible due to prohibitive time and memory demands. In general, computing exact posterior marginals and even approximating posterior marginals within a desired degree of precision is NP-hard. In practice, we often choose methods that can quickly compute approximate answers to Bayesian queries, trading accuracy for speed. Approximation methods include algorithms for approximate inference, stochastic sampling, network simplifications (simplifying the structure of the underlying graph), and variational approximations. We often obtain a more flexible computation scheme, balancing complexity and accuracy, by combining exact and approximate computation. This dissertation focuses on combining search with existing sampling and bounding methods yielding two new schemes for approximating and bounding posterior marginals in Bayesian networks. Those two new schemes, cutset sampling and any-time bounds, exploit the network structure to bound the complexity of exact computation. Cutset sampling for computing approximate posterior marginals samples only a subset of variables, a cutset of the underlying graph. Since reducing the size of the sampling set results in lower sampling variance, cutset-based sampling converges faster than sampling on a full set of variables. Two variants of cutset sampling algorithm were developed. One, based on Gibbs sampling, is a general approach to collapsed Gibbs sampling in Bayesian networks. The second algorithm implements the likelihood weighting on a cutset. The proposed any-time bounds framework is an any-time scheme for computing bounds on posterior marginals. It enumerates a subset of cutset tuples and performs exact inference over these tuples and then bounds the remaining probability mass. Both methods exploit the problem's underlying network structure to control the time and space complexity of the computations. They focus on finding a cutset of the graph such that the complexity of exact reasoning is bounded when the cutset variables are assigned. The dissertation proposes a new algorithm for finding a minimum cost cutset that yields the specified complexity bound on exact inference.
The two-sided coin of innovative mobile telecommunication market
Authors: Lucia Marchegiani
Venue: Proceedings of the International Conference on Mobile Business (2006)

Technological convergence, digitalization of contents, alongside with the miniaturization of the devices have rendered the mobile phone a powerful instrument in the hand of the end-costumer. Moreover, an even greater effect has been provoked in the supply side of the market. In fact, operators urge to pay attention to the market for complementary assets. We argue in this paper that, in light of the recent innovations, the mobile telecommunication market has become a two-sided market, and that the mobile network operators should reshape their competitive behavior accordingly.
A Information Monitoring and Job Scheduling System for Multiple Linux PC Clusters
Authors: Chao-Tung Yang, Chun-Sheng Liao, Ping-I Chen, Hao-Yu Tung
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

Managing and monitoring a cluster is both a tedious and challenging task, since each computing node is designed as a stand-alone system rather than a part of a parallel architecture. In this paper, a software system that allows the centralized administration of a generic Beowulf cluster is proposed. This system also provides web services and applications to monitor multiple PC clusters with job submission and scheduling.
Applying specialized simulators for Kanban and flow optimization (KanbanSIM) and PowerTrain Manufacturing (PTMSim)
Authors: Samarn Chantaravarapan, Onur Ulgen
Venue: Proceedings of the 36th conference on Winter simulation (2004)

We present two specialized simulators: KanbanSIM and PTMSim. KanbanSIM is a simulator that optimizes the Card/Call (Electronic) Kanbans in the line while minimizing the material handling flow in the system. It captures the production variability at assembly stations, shows the effects of material handling equipment scheduling, etc. Its application is an Automotive Final Assembly Line with about 300 stations and 3000 Kanban types. The selection and scheduling of the material handling equipment and the station inventory sizes were based on the analysis using KanbanSIM. PTMSim, Power Train Manufacturing Simulator, is a powerful tool for automotive industries. PTMSim provides users predefined and parameterized manufacturing objects that are typical to such manufacturing environments. PTMSim reduce the developing time by 60-70 percent and model verification and validation time by 50 percent. Three-dimensional animation encourages a better vision and the model can be built on top of the AutoCAD layout for precise physical dimensions.
Batch Process Fault Diagnosis Based on Fuzzy Petri Nets
Authors: Liu Zhenjuan, Pan Bo, Li Hongguang
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 2 (2006)

The fuzzy Petri net (FPN) is a new kind of Petri nets that is well developed in recent years. It is difficult to model and simulate the fault diagnosis of batch process because of the alternation between the discrete states and the continuous process. This paper concerned with a new method of complex batch process fault diagnoses based on fuzzy Petri nets. We use Petri nets to model batch processes, and use fuzzy probability to deal with the uncertain information in fault diagnoses and calculate the dependability in fault diagnoses. A simulation of the fault diagnosis system is illustrated with a batch process example, the conclusion of which shows that this method is feasible.
Recursive direction finding in the presence of sensor array uncertainties
Authors: S. Marcos, J. T. -H. Lo
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

An algorithm which recursively computes the maximum likelihood (ML) estimates of the arrival directions of multiple signals in the presence of sensor array uncertainties is presented. It is assumed that a priori estimates of the signal arrival directions and sensor locations and intrinsic phases are available and that they are reliably described by Gaussian random variables with a given means and covariances. The algorithm combines the a priori information together with new data collected by the array and then produces updated estimates and covariances of both the signal arrival directions and the unknown sensor parameters. Therefore, not only does this recursive procedure generate optimal estimates of the signal locations, but it also performs sensor self-localization and calibration.
Agent-based simulation for software project planning
Authors: David Joslin, William Poole
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Estimates of task duration and resource requirements in software engineering are notoriously inaccurate, and as a result effective project management often must be very dynamic. In response to new information or revised estimates, it may be necessary to reassign resources, cancel optional tasks, etc. Project management tools that make projections while treating decisions about tasks and resource assignments as static will not yield realistic results. In this paper we describe some preliminary attempts to adapt a simulation-based planning algorithm developed for planning experimental activities of Mars rovers to the problem of planning for software project management. Simulation techniques offer the potential for modeling the way agents behave in project development, and the way a manager might adapt the project plan based on the project status at future points, resulting in a tool that more accurately reflects the realities of software project management.
Parameters Identifying and Experiment of Automatic Gauge Control System in 300-Rolling Mill
Authors: Dong-sheng Shan, Xiang-dong Kong, Ya-ya An, Ying-jie Gao
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

The article discusses the application of system identification technology to build model of hydraulic automatic gauge control system (AGC) in 300 four-high mill ,because it is hard to acquire the accurate value of some parameters by analyzing the mechanical method. By comparing and analyzing the identzfied results, the identiJication model proves to be feasible and creditable. It might establish a foundation for system design, control characteristic analyzing and optimum control.
Modelling of lossy curved surfaces in the 3-D frequency-domain finite-difference methods: Research Articles
Authors: Riku M. Mäkinen, Herbert De Gersem, Thomas Weiland, Markku A. Kivikoski
Venue: International Journal of Numerical Modelling: Electronic Networks, Devices and Fields (2006)

A conformal first-order or Leontovic surface-impedance boundary condition (SIBC) for the modelling of fully three-dimensional (3-D) lossy curved surfaces in a Cartesian grid is presented for the frequency-domain finite-difference (FD) methods. The impedance boundary condition is applied to auxiliary tangential electric and magnetic field components defined at the curved surface. The auxiliary components are subsequently eliminated from the formulation resulting in a modification of the local permeability value at boundary cells, allowing the curved 3-D surface to be described in terms of Cartesian grid components. The proposed formulation can be applied to model skin-effect loss in time-harmonic driven problems. In addition, the impedance matrix can be used as a post-processor for the eigenmode solver to calculate the wall loss.The validity of the proposed model is evaluated by investigating the quality factors of cylindrical and spherical cavity resonators. The results are compared with analytic solutions and numerical reference data calculated with the commercial software package CST Microwave Studio&trade; (MWS). The convergence rate of the results is shown to be of second-order for smooth curved metal surfaces. The overall accuracy of the approach is comparable to that of CST MWS&trade;. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Analysis of two-level data mapping in an HPF compiler for distributed-memory machines
Authors: Makoto Satoh, Kiyoshi Negishi, Atsushi Kobayashi
Venue: Parallel Computing (2006)

Application programs in scientific and technological fields have grown increasingly large and complex. Thus, it is becoming more difficult to parallelize these programs by hand using message-passing libraries. To reduce this difficulty, we are researching the compilation technology for an industry-standard data-parallel language: High Performance Fortran (HPF). This paper proposes new data-mapping analysis applicable to HPF data-remapping directives more general than those previous research has coped with. This analysis allows programmers to develop highly productive HPF programs. We implemented the analysis in our HPF compiler and evaluated using some benchmark programs. As a result, both programs with general HPF directives and with restricted ones were transformed to similar codes and these codes ran in similar processing speed on a Hitachi SR2201 supercomputer.
Character, computers, and classroom community: a technology-based approach for building classroom community in title i elementary schools
Authors: Ted Ray
Venue:  (2006)

The purpose of this study was to determine the relative effectiveness of character education delivery modes in creating learning communities in selected Title I elementary schools. School accountability reports provided data to match two Title I schools in Volusia County, Florida. Invited parents, guardians, teachers, and intact groups of students from Grade 4 and Grade 5 completed informed consent forms prior to participation. Three hypotheses were tested: (a) There was no significant difference in the number of inappropriate classroom behaviors of fourth- and fifth-grade students who were instructed in character education using the technology-based delivery mode and of students who received paper-based instruction, (b) there was no significant difference in students' perceptions of classroom community resulting from technology- and paper-based character education instruction, and (c) there was no significant difference in teachers' perceptions of classroom community resulting from technology- and paper-based character education instruction. Technology-based and paper-based delivery modes of the MindOH! character education program were presented to participants, employing the quasi-experimental, counterbalanced design. Teacher and student paper-based surveys, administered three times during the study, measured their perceptions of the relative effectiveness of delivery modes in creating classroom community. Nonparametric chi-square analysis was used to determine the relative effectiveness of character education delivery modes in reducing the number of inappropriate behaviors. Data analysis resulted in the failure to reject the first null hypothesis (Ho1). Analysis of variance was employed to determine the relative effectiveness of the technology- and paper-based delivery modes for student and teacher perceptions of classroom community development. The researcher rejected the second null hypothesis (Ho2), as student perceptions of the relative effectiveness of the paper-based treatment were statistically significant. Analysis of the study data failed to support rejection of the third null hypothesis (Ho3). The data did not support the relative effectiveness of the technology-based treatment. Research studies documenting the use of technology as a means to implement character education are limited. A multiple classroom study of character education implementation using common and equivalent program training with varied modes of delivery, technology- and paper-based, contributes to the body of knowledge regarding the instructional effectiveness and the development of classroom community.