ppxscal/embedding_network huggingface dataset:
Factors influencing the performance of Dynamic Decision Network for INQPRO
Authors: Choo-Yee Ting, Somnuk Phon-Amnuaisuk
Venue: Computers Education (2009)

There has been an increasing interest in employing decision-theoretic framework for learner modeling and provision of pedagogical support in Intelligent Tutoring Systems (ITSs). Much of the existing learner modeling research work focuses on identifying appropriate learner properties. Little attention, however, has been given to leverage Dynamic Decision Network (DDN) as a dynamic learner model to reason and intervene across time. Employing a DDN-based learner model in a scientific inquiry learning environment, however, remains at infant stage because there are factors contributed to the performance the learner model. Three factors have been identified to influence the matching accuracy of INQPRO's learner model. These factors are thestructureof DDN model, thevariable instantiationapproach, and theweightsassignmentmethodfortwoconsecutiveDecisionNetworks (DNs). In this research work, a two-phase empirical study involving 107 learners and six domain experts was conducted to determine the optimal conditions for the INQPRO's dynamic learner model. The empirical results suggested each time-slice of the INQPRO's DDN should consist of a DN, and that DN should correspond to the Graphical User Interface (GUI) accessed. In light of evidence, observable variables should be instantiated to their observedstates; leaving the remaining observable nodes uninstantiated. The empirical results also indicated that varying weights between two consecutive DNs could optimize the matching accuracy of INQPRO's dynamic learner model.
Understanding, scoping and defining user experience: a survey approach
Authors: Effie Lai-Chong Law, Virpi Roto, Marc Hassenzahl, Arnold P.O.S. Vermeeren, Joke Kort
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Despite the growing interest in user experience (UX), it has been hard to gain a common agreement on the nature and scope of UX. In this paper, we report a survey that gathered the views on UX of 275 researchers and practitioners from academia and industry. Most respondents agree that UX is dynamic, context-dependent, and subjective. With respect to the more controversial issues, the authors propose to delineate UX as something individual (instead of social) that emerges from interacting with a product, system, service or an object. The draft ISO definition on UX seems to be in line with the survey findings, although the issues of experiencing anticipated use and the object of UX will require further explication. The outcome of this survey lays ground for understanding, scoping, and defining the concept of user experience.
Using age registers for a simple load-store queue filtering
Authors: F. Castro, D. Chaver, L. Pinuel, M. Prieto, F. Tirado
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2009)

One of the main challenges of modern processor design is the implementation of a scalable and efficient mechanism to detect memory access order violations as a result of out-of-order execution. Traditional age-ordered associative load and store queues are complex, inefficient, and power-hungry. In this paper, we introduce two new LSQ filtering mechanisms with different design tradeoffs, but both explicitly rely on timing information as a primary instrument to rule out dependence violation and enforce memory dependences. Our timing-centric design operates at a fraction of the energy cost of an associative LQ and SQ with no performance degradation.
Automatic library assistant
Authors: Valentina Emilia Balas, Andrei Valentin Stoica, Aura Letitia Rugea
Venue: Proceedings of the 8th WSEAS international conference on Distance learning and web engineering (2008)

This paper presents a solution to the problem of library management in a small to medium size campus library. Our solution consists of a small robotic-like unit combined with RFID (Radio Frequency Identification) tags on all books to keep track and direct students to the titles of interest. The system proposed is scalable, multiple robotic units being able to work together to cover a larger area of the library, or cope with an increased flow of people at certain times. We present a brief technical overview of the project, covering both hardware and software aspects.
Extraction of Line Feature in Binary Images
Authors: Shih-Chang Liang, Wen-Jan Chen
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

Thinning and line extraction of binary images not only reduces data storage amount, automatically creates the adjacency and relativity between line and points but also provides applications for automatic inspection systems, pattern recognition systems and vectorization. Based on the features of construction drawings, new thinning and line extraction algorithms were proposed in this study. The experimental results showed that the proposed method has a higher reliability and produces better quality than the various existing methods.
An analytical solution to a fuzzy economic order quantity problem
Authors: Kaj-Mikael Björk
Venue: International Journal of Approximate Reasoning (2009)

This paper contributes to the set of models capturing the economic order quantity with backorders. In real life situations, both the demand and the lead times are uncertain. These uncertainties are handled with fuzzy numbers and the analytical solution to the optimization problem, where both the demand and the lead times are formulated as a triangular fuzzy numbers, is obtained. Finally the solution from the new approach is compared to earlier work and through an example, it is shown that the uncertainties result in increased order quantities.
Audit considerations of data bases
Authors: Richard A. Nerad, Robert Manion, Gresham T. Brebach, James Muenz
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

Now, at the onset of a new era of data processing centered around the data base concept, it is important for the business-oriented systems man to be aware of the impact that this concept has on the company management responsible for the business operations. This panel will present a series of topics related to the corners of key corporate responsibilities: the executive management, the financial management and the auditor.
Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?
Authors: Nadia Creignou, Heribert Vollmer
Venue: Complexity of Constraints: An Overview of Current Research Themes (2008)

The propositional satisfiability problem SAT, i.e., the problemto decide, given a propositional formula &phi; (without loss ofgenerality in conjunctive normal form CNF), if there is anassignment to the variables in &phi; that satisfies &phi;, is thehistorically first and standard NP-complete problem [Coo71].However, there are well-known syntactic restrictions for whichsatisfiability is efficiently decidable, for example if everyclause in the CNF formula has at most two literals (2CNF formulas)or if every clause has at most one positive literal (Horn formulas)or at most one negative literal (dual Horn formulas), see [KL99].To study this phenomenon more generally, we study formulas with&ldquo;clauses&rdquo; of arbitrary shapes, i.e., consisting ofapplying arbitrary relations R&thinsp;&sube;&thinsp;{0,1} k to (notnecessarily distinct) variables x 1,...,x k . A constraint language&Gamma; is a finite set of such relations. In the rest of thischapter, &Gamma; and &Gamma;&prime; will always denote Booleanconstraint languages. A &Gamma;-formula is a conjunction of clausesR(x 1,...,x k ) as above using only relations R from &Gamma;. Thefor us central family of algorithmic problems, parameterized by aconstraint language &Gamma;, now is the problem to determinesatisfiability of a given &Gamma;-formula, denoted byCsp(&Gamma;).
Microcalcification classification assisted by content-based image retrieval for breast cancer diagnosis
Authors: Liyang Wei, Yongyi Yang, Robert M. Nishikawa
Venue: Pattern Recognition (2009)

In this paper, we propose a microcalcification classification scheme, assisted by content-based mammogram retrieval, for breast cancer diagnosis. We recently developed a machine learning approach for mammogram retrieval where the similarity measure between two lesion mammograms was modeled after expert observers. In this work, we investigate how to use retrieved similar cases as references to improve the performance of a numerical classifier. Our rationale is that by adaptively incorporating local proximity information into a classifier, it can help to improve its classification accuracy, thereby leading to an improved ''second opinion'' to radiologists. Our experimental results on a mammogram database demonstrate that the proposed retrieval-driven approach with an adaptive support vector machine (SVM) could improve the classification performance from 0.78 to 0.82 in terms of the area under the ROC curve.
Collision-free path coloring with application to minimum-delay gathering in sensor networks
Authors: Luisa Gargano, Adele A. Rescigno
Venue: Discrete Applied Mathematics (2009)

Efficient data gathering is an important challenge in sensor networks. In this paper we address the problem of gathering sensed data to the sink of a sensor network minimizing the time to complete the process. We present optimal time data gathering algorithms for any sensor network topology, in the half-duplex with directional antennas model, when each sensor has one data packet to be gathered and merging of packets is not allowed at intermediate nodes. Our results improve on existing approximation algorithms. We approach the gathering problem by obtaining optimal solutions to a path coloring problem in graphs.
PReSENt: A Collaboration Framework for Resource Sharing in Wireless Mesh Networks
Authors: Hwangnam Kim, E-yong Kim
Venue: IEEE Transactions on Parallel and Distributed Systems (2009)

Many protocol particulars developed for the wireless mesh networks, such as multi-path routing, channel assignment, topology control, assume that a network-wide collaboration is available to establish connections to the network outside. However, the collaboration can be easily discouraged in the presence of selfish behaviors, referred to as free-riding. In this paper, we propose a framework, PReSENt, to promote and make more secure the practices of collaboration among nodes by securing a compensation to the collaboration. When the PReSENt is enabled in wireless mesh networks, a node accumulates credits, an amount quantifying its resource provision when it provides its resource for other nodes. The nodes consuming the resource publish rewards, an amount quantifying their resource usage. The credits are used to guarantee the resource sharing for the provider from the customers in the future, whose amount is proportional to its relative contribution to the network-wide collaboration. The rewards are used to validate their corresponding credits in order to prevent false accumulations of the credits in selfish nodes. We formally define the underlying security model of the PReSENt and prove that the PReSENt is secure in the random oracle model. We then implement the PReSENt in J-Sim to illustrate its operational behaviors with respect to correct and secure resource sharing.
Analyses of simple hybrid algorithms for the vertex cover problem*
Authors: Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt
Venue: Evolutionary Computation (2009)

Hybrid methods are very popular for solving problems from combinatorial optimization. In contrast, the theoretical understanding of the interplay of different optimization methods is rare. In this paper, we make a first step into the rigorous analysis of such combinations for combinatorial optimization problems. The subject of our analyses is the vertex cover problem for which several approximation algorithms have been proposed. We point out specific instances where solutions can (or cannot) be improved by the search process of a simple evolutionary algorithm in expected polynomial time.
Plenary lecture VI: heterogeneous reconfigurable chip multiprocessors for embedded systems
Authors: Sotirios G. Ziavras
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Chip multiprocessing has recently become a common practice in processor design. With ever increasing concerns for energy consumption, performance-energy trade-offs are often necessary, especially in the design of real-time embedded systems. Multiprocessor heterogeneity is a successful design paradigm for high performance and energy conservation with embedded systems. Performance and energy analyses will be presented for an in-house developed FPGA - based mixed-mode heterogeneous chip multiprocessor, where the SIMD (Single-Instruction, Multiple-Data) and MIMD (Multiple-Instruction, Multiple-Data) parallel computing modes can be realized simultaneously or distinctly. The presented performance-energy trade-off techniques are based on the observation that SIMD and MIMD tasks involve substantially different amounts of computation and communication with different execution time and energy behaviors. Experimental results on Xilinx FPGAs demonstrate the effectiveness of the proposed approach. To conserve space and power as well as to incorporate dynamic adaptability in embedded systems, it is important to utilize hardware components as best as possible. The hardware customization of application kernels reduces the execution time and potentially the power consumption. Reconfiguring the same hardware to facilitate various customized kernels as execution proceeds greatly reduces the space requirements. When the kernel execution is carefully scheduled considering also the reconfiguration overheads, the obtained performance gain can offset such overheads. A policy and experiments will be presented of customizing and reconfiguring multiprocessor hardware for embedded benchmark kernels implemented on FPGAs. The results reveal substantial performance improvement and resource conservation.
A Novel Geographic Set-up and an Access Protocol for Mesh, Ad-Hoc and Cognitive Networks
Authors: Chaturanga Pilane Lokuge, Alan Coulson, Jason Gao
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

This paper introduces a combined geographic and a Media Access Control (MAC) protocol for mesh, ad-hoc and cognitive networks. For mesh and ad-hoc networks, this paper examines the end-to-end (source to destination) link performance characteristics when supporting multimedia traffic. This paper also explains the cognitive network concept prior to analyzing cognitive network related results. The performance analysis was performed by a Monte Carlo simulator, the accuracy of which was verified by a Markov model analysis. An overlaid cell structure was considered for the Monte Carlo simulation where the terminals can be mobile within this environment. The system model includes Rice fading, log-normal shadowing and distance dependent pathloss. The system model also considers preferential channel access based on the capture effect. For mesh and ad-hoc networks, the proposed MAC protocol produced satisfactory performance characteristics in the presence of multimedia traffic. These results also show performance benefits of mesh networks over ad-hoc networks and how network density affects the network performance. Finally, the effect of primary users in cognitive networks is demonstrated.
Power estimation technique for DSP architectures
Authors: Yaseer A. Durrani, Teresa Riesgo
Venue: Digital Signal Processing (2009)

The main goal of power estimation is to optimize the power consumption of a electronic design. Power is a strongly pattern dependent function. Input statistics greatly influence on average power. We solve the pattern dependence problem for intellectual property (IP) designs. In this paper, we present a power macro-modeling technique for digital signal processing (DSP) architectures in terms of the statistical knowledge of their primary inputs. During the power estimation procedure, the sequence of an input stream is generated by a genetic algorithm using input metrics. Then, a Monte Carlo zero delay simulation is performed and a power dissipation macro-model function is built from power dissipation results. From then on, this macro-model function can be used to estimate power dissipation of the system just by using the statistics of the macro-block's primary inputs. In experiments with the DSP system, the average error is 26%.
Using Intradisk Parallelism to Build Energy-Efficient Storage Systems
Authors: Sudhanva Gurumurthi Mircea R. Stan, Sriram Sankar
Venue: IEEE Micro (2009)

Server storage systems use numerous disks to achieve high performance, thereby consuming a significant amount of power. Intradisk parallelism can significantly reduce such systems' power consumption by letting disk drives exploit parallelism in the I/O request stream. By doing so, it's possible to match, and even surpass, a storage array's performance for these workloads using a single, high-capacity disk drive.
7DS - A Modular Platform to Develop Mobile Disruption-Tolerant Applications
Authors: Arezu Moghadam, Suman Srinivasan, Henning Schulzrinne
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

Due to the low density of mobile devices or their limits in wireless radio range, a continuous network connectivity cannot be sustained in mobile disruption-tolerant networks. In these networks traditional networking models relying on end-to-end communication cease to work. These type of mobile disconnected networks can only support opportunistic, store-carry-forward communication. Furthermore, due to mobile nodes that dynamically join and leave the network the concept of a single, always-on server is unreasonable. In these scenarios, mobile users have to rely on node and service discovery and applications that cope with network disruptions. 7DS introduces a new platform to develop mobile applications for disruption-tolerant mobile networks. 7DS provides the necessary transport and application layer functionalities for mobile nodes to exchange information in store-carry-forward communication. 7DS has been developed as a modular platform that provides application developers with core underlying functionalities required for mobile disruption-tolerant communication. We discuss the primary requirements of mobile applications and introduce two new applications implemented on top of the 7DS platform. These applications assist mobile users in data and event sharing in a server-less and disconnected networking environment.
Optimization of Parameters of the Chemic Kinetic Model by Improved Genetic Algorithms
Authors: Rui-feng Han, Yu-li Yang, Yong-kui Zhang
Venue: Proceedings of the 2009 Second International Symposium on Intelligent Information Technology and Security Informatics (2009)

Detailed kinetic model is one of the most important basic research items that the chemic synthesis techniques will have been commercialized from laboratory. A great breakthrough has been made in the detailed mechanistic kinetics of the chemic synthesis, but LM (Levenberg-Marquardt) algorithm still plays a leading role in estimating parameters of the kinetic model. As an unlimited algorithm, LM algorithm often makes an erroreous conclusion because of parameters exceeding limit. Its computation deeply depends on the initial point, and easily falls into non-global optima. It is a new attempt to apply GA(Genetic Algorithm) to the solutions of optimization problems of FTS(Fischer-Tropsch Synthesis) parameters. After a number of systemic tests, comparatively satisfying results of parameters-estimating and a lot of precious experience on GA have been obtained. The detailed kinetic model of FTS is provided by Institute of Coal Chemistry, Chinese Academy of Sciences.
The snackbot: documenting the design of a robot for long-term human-robot interaction
Authors: Min Kyung Lee, Jodi Forlizzi, Paul E. Rybski, Frederick Crabbe, Wayne Chung, Josh Finkle, Eric Glaser, Sara Kiesler
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

We present the design of the Snackbot, a robot that will deliver snacks in our university buildings. The robot is intended to provide a useful, continuing service and to serve as a research platform for long-term Human-Robot Interaction. Our design process, which occurred over 24 months, is documented as a contribution for others in HRI who may be developing social robots that offer services. We describe the phases of the design project, and the design decisions and tradeoffs that led to the current version of the robot.
A Pre-Emptive Horizontal Channel Borrowing and Vertical Traffic Overflowing Channel Allocation Scheme for Overlay Networks
Authors: Fang-ming Zhao, Ling-ge Jiang, Chen He
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In this paper, a channel allocation scheme is studied for overlay wireless networks to optimize connection-level QoS. The contributions of our work are threefold. First, a channel allocation strategy using both horizontal channel borrowing and vertical traffic overflowing (HCB-VTO) is presented and analyzed. When all the channels in a given macro-cell are used, high-mobility real-time handoff requests can borrow channels from adjacent homogeneous cells. In case that the borrowing requests fail, handoff requests may also be overflowed to heterogeneous cells, if possible. Second, high-mobility real-time service is prioritized by allowing it to pre-empt channels currently used by other services. And third, to meet the high QoS requirements of some services and increase the utilization of radio resources, certain services can be transformed between real-time services and non-real-time services as necessary. Simulation results demonstrate that the proposed schemes can improve system performance.
Modeling and Analyzing Project Performance with Timing Constraint Petri Net
Authors: Ruiqiang Yu, Zhiqiu Huang, Lin Wang
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

Time Petri net and timed Petri net, in which transactions are constrained with time info, are widely used in task scheduling and performance analysis, whereas they are not effective enough for project performance analysis. Timing constraint Petri net (TcPN for short) is proposed in which places are endued with time delaying domain and time persisting domain simultaneously. Furthermore, all time constraints are based on global clock. Colored resource property is attached to backward flow relation for cost evaluation. The formal definition of TcPN and its firing rule are furnished. An algorithm is offered to calculate the time constraint. State class method is used for the cost space analysis. For proving its feasibility in analyzing project performance, an example is provided and variant performance problems (such as critical path, shortest period, cost control,and state space) are discussed.