ppxscal/embedding_network huggingface dataset:
Scalable and Systolic Montgomery Multipliers over GF(2m)
Authors: Chin-Chin Chen, Chiou-Yng Lee, Erl-Huei Lu
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

This work presents a novel scalable and systolic Montgomery's algorithm in GF(2m). The proposed algorithm is based on the Toeplitz matrix-vector representation, which obtains the scalable and systolic Montgomery multiplier in a flexible manner, and can adapt to the required precision. Analytical results indicate that the proposed multiplier over the generic field of GF(2m) has a latency of d + n(2n + 1), where n = ⌈m/d⌉, and d denotes the selected digital size. The latency is reduced to d + n(n + 1) clock cycles when the field is constructed from generalized equally-spaced polynomials. Since the selected digital size is d ≥ 5 bits, the proposed architectures have lower time-space complexity than traditional digit-serial multipliers. Moreover, the proposed architectures have regularity, modularity and local interconnect ability, making them very suitable for VLSI implementation.
Computer Assistance Image Processing Spores Counting
Authors: Pengyun Xu, Jigang Li
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

To monitor plant disease which caused by spores, it is needed to obtain the spores image exterior outline characteristic, prepares for spores type analysis and automatic counting. This paper uses computer assistance digital image processing, realized image pretreatment, determined the threshold value reasonably, and transformed the gray image to binary image. Images was captured by CCD and input into computer for process. A kind of gray images research method has been proposed. In order to remove low frequency components, the input gray image is preprocessed by edge enhancement using the Median filter and canny edge algorithm. In this foundation using the imagery processing technology carries on morphology analyses, feature extraction and track. Its goal is obtains the spore image exterior outline characteristic, completes the spores type analysis, counting and distinguish.
Note: Comparing the Zagreb indices for graphs with small difference between the maximum and minimum degrees
Authors: Lingli Sun, Ting Chen
Venue: Discrete Applied Mathematics (2009)

The first Zagreb index M"1(G) and the second Zagreb index M"2(G) of a (molecular) graph G are defined as M"1(G)=@?"u"@?"V"("G")(d(u))^2 and M"2(G)=@?"u"v"@?"E"("G")d(u)d(v), where d(u) denotes the degree of a vertex u in G. The AutoGraphiX system [M. Aouchiche, J.M. Bonnefoy, A. Fidahoussen, G. Caporossi, P. Hansen, L. Hiesse, J. Lachere, A. Monhait, Variable neighborhood search for extremal graphs. 14. The AutoGraphiX 2 system, in: L. Liberti, N. Maculan (Eds.), Global Optimization: From Theory to Implementation, Springer, 2005; G. Caporossi, P. Hansen, Variable neighborhood search for extremal graphs: 1 The AutoGraphiX system, Discrete Math. 212 (2000) 29-44; G. Caporossi, P. Hansen, Variable neighborhood search for extremal graphs. 5. Three ways to automate finding conjectures, Discrete Math. 276 (2004) 81-94] conjectured that M"1/n@?M"2/m (where n=|V(G)| and m=|E(G)|) for simple connected graphs. Hansen and Vukicevic [P. Hansen, D. Vukicevic, Comparing the Zagreb indices, Croat. Chem. Acta 80 (2007) 165-168] proved that it is true for chemical graphs and it does not hold for all graphs. Vukicevic and Graovac [D. Vukicevic, A. Graovac, Comparing Zagreb M"1 and M"2 indices for acyclic molecules, MATCH Commun. Math. Comput. Chem. 57 (2007) 587-590] proved that it is also true for trees. In this paper, we show that M"1/n@?M"2/m holds for graphs with @D(G)-@d(G)@?2 and characterize the extremal graphs, the proof of which implies the result in [P. Hansen, D. Vukicevic, Comparing the Zagreb indices, Croat. Chem. Acta 80 (2007) 165-168]. We also obtain the result that M"1/n@?M"2/m holds for graphs with @D(G)-@d(G)@?3 and @d(G)
Quantization Noise: Roundoff Error in Digital Computation, Signal Processing, Control, and Communications
Authors: Bernard Widrow, Istvn Kollr
Venue:  (2008)

If you are working in digital signal processing, control or numerical analysis, you will find this authoritative analysis of quantization noise (roundoff error) invaluable. Do you know where the theory of quantization noise comes from, and under what circumstances it is true? Get answers to these and other important practical questions from expert authors, including the founder of the field and formulator of the theory of quantization noise, Bernard Widrow. The authors describe and analyze uniform quantization, floating-point quantization, and their applications in detail. Key features include: Analysis of floating point round off Dither techniques and implementation issues analyzed Offers heuristic explanations along with rigorous proofs, making it easy to understand 'why' before the mathematical proof is given
An infinite hierarchy of language families generated by scattered context grammars with n-limited derivations
Authors: Alexander Meduna, Jií Techet
Venue: Theoretical Computer Science (2009)

This paper introduces scattered context grammars without erasing productions, in which an application of a production always occurs within the first n nonterminals of the current sentential form. It demonstrates that this restriction gives rise to an infinite hierarchy of language families each of which is properly included in the family of context-sensitive languages. In addition, it proves analogous results for unordered scattered context grammars. Some consequences of these results are derived and open problems formulated.
Richardson-extrapolated sequential splitting and its application
Authors: István Faragó, Ágnes Havasi, Zahari Zlatev
Venue: Journal of Computational and Applied Mathematics (2009)

During numerical time integration, the accuracy of the numerical solution obtained with a given step size often proves unsatisfactory. In this case one usually reduces the step size and repeats the computation, while the results obtained for the coarser grid are not used. However, we can also combine the two solutions and obtain a better result. This idea is based on the Richardson extrapolation, a general technique for increasing the order of an approximation method. This technique also allows us to estimate the absolute error of the underlying method. In this paper we apply Richardson extrapolation to the sequential splitting, and investigate the performance of the resulting scheme on several test examples.
Persistence in massively multiplayer online games
Authors: Kaiwen Zhang, Bettina Kemme, Alexandre Denault
Venue: Proceedings of the 7th ACM SIGCOMM Workshop on Network and System Support for Games (2008)

The most important asset of a Massively Multiplayer Online Game is its world state, as it represents the combined efforts and progress of all its participants. Thus, it is extremely important that this state is not lost in case of server failures. Survival of the world state is typically achieved by making it persistent, e.g., by storing it in a relational database. The main challenge of this approach is to track the large volume of modifications applied to the world in real time. This paper compares a variety of strategies to persist changes of the game world. While critical events must be written synchronously to the persistent storage, a set of approximation strategies are discussed and compared that are suitable for events with low consistency requirements, such as player movements. An analysis to better understand the possible limitations and bottlenecks of these strategies is presented using experimental data from an MMOG research framework. Our analysis shows that a distance-based solution offers the scalability and efficiency required for large-scale games as well as offering error bounds and eliminating unnecessary updates associated with localized movement.
Control charts applications for multivariate attribute processes
Authors: Hassen Taleb
Venue: Computers and Industrial Engineering (2009)

Two procedures were proposed for the construction of control charts to monitor multivariate process based on multi-dimenstional linguistic data. The first is based on probability theory and the second on the fuzzy theory. The performance of resulting control charts and their sensitivity to process shift are presented. These procedures are applied to a real data example. This real data application allow us to illustrate the implementation and the use of the proposed charts. Comparison of these charts is based on the ARL following a predefined process shift. A new procedure for interpreting out-of-control signals is also developed.
No more "freeloading": using individual assignments to improve team-based learning outcomes
Authors: Svetlana Kouznetsova
Venue: Journal of Computing Sciences in Colleges (2009)

Although team-based coursework is widely perceived by both students and faculty as a valuable teaching strategy, it can lead to a "free rider" problem: often one or more team member(s) does not fully participate in the assignment workload. This paper describes an approach to teaching the introductory database course that is based on a hybrid of individual and team-based assignments. By forcing every team member to be involved in all phases of the collaborative project, the approach alleviates the free rider problem that often occurs in project teams, thus improving learning outcomes and student perceptions of the team-based assignments.
A Fast Initialization Method for Edge-based Registration Using an Inclination Constraint
Authors: Daisuke Kotake, Kiyohide Satoh, Shinji Uchiyama, Hiroyuki Yamamoto
Venue: Proceedings of the 2007 6th IEEE and ACM International Symposium on Mixed and Augmented Reality (2007)

We propose a hybrid camera pose estimation method using an inclination sensor value and correspondence-free line segments. In this method, possible azimuths of the camera pose are hypothesized by a voting method under an inclination constraint. Then some camera positions for each possible azimuth are calculated based on the detected line segments that affirmatively voted for the azimuth. Finally, the most consistent one is selected as the camera pose out of the multiple sets of the camera positions and azimuths. Unlike many other tracking methods, our method does not use past information but rather estimates the camera pose using only present information. This feature is useful for an initialization measure of registration in augmented reality (AR) systems. This paper describes the details of the method and shows its effectiveness with experiments in which the method is actually used in an AR application.
Using GPU-Based Ray Tracing for Real-Time Composition in the Real Scene
Authors: Sungmin Bae, Kyunghee Hwang, Hyunki Hong
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

This paper presents a novel rendering system using GPU-based ray tracing for interactive composition of a synthetic object in the real scene. In order to generate correct lighting in the scene, we extract the texture information and the light samples from a panoramic image in real-time. The proposed interactive system provides a powerful way to represent shadows and reflections by surrounding environments. The simulation results demonstrated that the proposed method is useful in real-time applications such as rendering service on the mobile device.
Block-oriented random access MNOS memory
Authors: J. E. Brewer, D. R. Hadden,  Jr.
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

MNOS storage elements have been used to realize a block-oriented all electronic secondary memory module. This nonvolatile storage unit offers 10-microsecond data access and reliable error free operation. BORAM modules provide an immediately available cost effective alternative to electromechanical storage in severe environment applications. The text below describes an 18-million-bit advanced development model of a BORAM module and briefly outlines the growth potential of MNOS BORAM systems.
Game approach problems for dynamic processes with impulse controls
Authors: A. N. Khimich, K. A. Chikrii
Venue: Cybernetics and Systems Analysis (2009)

This paper deals with game problems with impulse and geometric constraints on the players' controls. To analyze conflict-controlled processes with discontinuous trajectories, the method of resolving functions is used. This makes it possible to derive sufficient conditions of the game termination in a finite guaranteed time.
Support vector machines regression and modeling of greenhouse environment
Authors: Dingcheng Wang, Maohua Wang, Xiaojun Qiao
Venue: Computers and Electronics in Agriculture (2009)

The greenhouse environment is an uncertain nonlinear system which classical modeling methods cannot solve. Support vector machines regression (SVMR) is well supported by mathematical theory and has a simple structure, good generalization ability, and nonlinear modeling properties. Therefore, SVMR offers a very competent method for modeling the greenhouse environment. However, to deal with uncertainty, the model must be rectified online, and Online Sparse Least-Squares Support Vector Machines Regression (OS_LSSVMR) was developed to solve this problem. OS_LSSVMR reduced the number of training samples through use of a sample dictionary, and consequently LSSVMR has sparse solutions; the training samples were added sequentially, so that OS_LSSVMR has online learning capability. A simplified greenhouse model, in which only greenhouse internal and external air temperatures were considered, was presented, after analyzing the factors in the greenhouse environment. Then the OS_LSSVMR greenhouse model was constructed using real-world data. The resulting model shows a promising performance in the greenhouse environment, with potential improvements if a more complete data setup is used.
Research on Establishment of Evaluation Model of Accounting for Safety Resources Based on Technology of Data Mining
Authors: Enzhi Li
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

This paper demonstrates the necessity of establishing the evaluation model of accounting for safety resources based on technology of data mining systematically. The author gives the connotations and the features of the proposed new model. The main viewpoint of the paper includes that this evaluation model for safety resources is used in all units with possible accidents in production and for estimating and reflecting the effectiveness of the safety resources provided in preventing accidents, and also for the compensation of the losses caused by the accidents in production within the entire process. In accordance with the connotations of this evaluation model, the main precondition of data mining in safety and the model of Data Envelopment Analysis for safety resources based on technology of data mining are also explained. The purpose of establishing this evaluation model of accounting is to promote effective management of safety resources invested in high dangerous enterprises.
XML data partitioning strategies to improve parallelism in parallel holistic twig joins
Authors: Imam Machdi, Toshiyuki Amagasa, Hiroyuki Kitagawa
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

Parallel XML query processing systems that process numerous queries over large heterogeneous XML documents often experience under-performance due to workload imbalance and low CPU/system utilization, because conventional partitioning strategies cannot serve well for state-of-the-art query processing algorithms, such as holistic twig joins. Consequently, partitioning and distributing heterogeneous XML documents onto a parallel cluster system have lead to such an intricacy issue for maintaining good query performance. In this paper, we propose XML data partitioning strategies that are able to alleviate system performance degradation due to workload imbalance, especially for parallel holistic twig joins processing. The proposed XML data partitioning strategies aim at improving workload balance on both static data distribution and dynamic data distribution. In the first strategy we refine an XML partition having a high cost by series of XML data partition refinements with various levels of granularities from document, query, and subquery, up to node streams. The selection of the granularity level for refining a high cost partition is contextually dependent on the overall workload balance in the system. In the second strategy for dynamic data distribution, we dynamically handle low system utilization when there are many idle nodes in the system. We propose an XML data redistribution approach by partitioning XML data on the fly at the stream nodes-based granularity.
Performance Analysis and Functional Verification of the Stop-and-Wait Protocol in HOL
Authors: Osman Hasan, Sofiène Tahar
Venue: Journal of Automated Reasoning (2009)

Real-time systems usually involve a subtle interaction of a number of distributed components and have a high degree of parallelism, which makes their performance analysis quite complex. Thus, traditional techniques, such as simulation, or the state-based formal methods usually fail to produce reasonable results. In this paper, we propose to use higher-order-logic (HOL) theorem proving for the performance analysis of real-time systems. The idea is to formalize the real-time system as a logical conjunction of HOL predicates, whereas each one of these predicates define an autonomous component or process of the given real-time system. The random or unpredictable behavior found in these components is modeled as random variables. This formal specification can then be used in a HOL theorem prover to reason about both functional and performance related properties of the given real-time system. In order to illustrate the practical effectiveness of our approach, we present the analysis of the Stop-and-Wait protocol, which is a classical example of real-time systems. The functional correctness of the protocol is verified by proving that the protocol ensures reliable data transfers. Whereas, the average message delay relation is verified in HOL for the sake of performance analysis. The paper includes the protocol's formalization details along with the HOL proof sketches for the major theorems.
Hierarchical model of a systolic array for solving differential equations implemented as an upgraded Petri net
Authors: Perica Strbac, Milan Tuba, Dana Simian
Venue: WSEAS TRANSACTIONS on SYSTEMS (2009)

The objective of this paper is to develop a hierarchical model of a systolic array which solves differential equations by using Upgraded Petri Net (UPN). The Upgraded Petri Net presents a formal modeling tool, based on mathematical apparatus, used for simulation and analysis of processes, particularly at the register transfer level. Original software for modeling and simulations of Upgraded Petri Nets, PeM (Petri Net Manager), is developed and used for all models described in this paper. This software supports: UPN formal theory, graphical modeling, simulation and analysis of an UPN model. This paper includes a preface on the UPN theory, the UPN models formulation, the UPN models of a processing element of a systolic array which solves differential equation, their simulation and analysis. The first hierarchical level refers to the high level systolic array modeling. This model shows processing elements that calculate or pass their input to the output. Thus, the next processing element uses the results from the previous one. The second level model is more detailed and refers to a single processing element. This model is capable to generate solution of a differential equation through UPN execution based on Taylor's method. This execution is based on parralel firing of a group of transitions. The results are stored into a *.mem file inside the PeM. The suitability of UPN for modelling of the systems at different levels of abstraction is examined and established.
Robot motivator: improving user performance on a physical/mental task
Authors: Juan Fasola, Maja J. Mataric
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

We describe the design and implementation of a socially assistive robot that is able to monitor the performance of a user during a combined mental and physical task, with the purpose of motivating the user to complete the task and to improve performance. A three-condition experimental study was constructed for evaluation of the robot and preliminary results of the robot's interaction with human participants are presented.
A selection-bias free method to estimate the prevalence of hypertension from an administrative primary health care database in the Girona Health Region, Spain
Authors: Marc Saez, Maria Antònia Barceló, Gabriel Coll de Tuero
Venue: Computer Methods and Programs in Biomedicine (2009)

The prevalence of common illnesses could be estimated using general practice databases, providing certain advantages when compared to other alternative sources of information, in particular being relatively more cost-effective. The main limitation is that it is a threat of selection bias. Some individuals have a higher probability of having used primary health care, implying that the potential result, 'contact registration', is overrepresented in the sample observed. The selection bias would provide inconsistent estimators of prevalence. The objective of this study is to propose a bias-free selection method to estimate prevalence using an administrative primary health care database. It proposes re-weighting the estimations of prevalence obtained from the database according to the probability of their being present in the same. These probabilities will be appropriately estimated from a health survey using a treatment effects model with a discrete response, i.e. a hurdle model. As an application, it was estimated the prevalence of hypertension in the population covered by public primary health care providers in the Girona Health Region, Spain, in 2005. Using this bias-free selection method the prevalence of hypertension has been estimated that 15.5% of individuals aged 15 and above (14.1% among men and 16.9% among women) suffer from hypertension. Likewise, the prevalence is estimated at 31.1% (30.3% men and 32.0% women) in individuals aged 45 and over; 48.3% (44.1% men and 51.9% women) among those aged 65 and over; and 13.1% (11.8% men and 13.9% women) in the general population. The proposed method provides estimators of the prevalence of hypertension very close to those obtained directly from the 2006 Catalan Health Survey. It is concluded that the proposed method could be used to estimate the prevalence of hypertension in an approximately unbiased form. Given the use of the administrative primary health care database corresponding to all users of primary health care in the 23 public managed Health Areas of the Girona Health Region during 2005, the proposed method will be more cost-effective and will provide much more population information than health questionnaires.