Miracle-dz/UniFAR-FTUs huggingface dataset:
A modified rapid access heuristic for flowshop scheduling problem

This paper presents a modified rapid access (MRA) heuristic to solve the flowshop scheduling problems. This new heuristic follows the fundamental idea of the original rapid access approach by forming a two-machine subproblem, but the processing times are determined by using an exponential weighting modifier for the original linear weighting scheme without additional computational effort, then the subproblem is solved by using Johnson's two-machine algorithm. The performance of MRA is tested using instances from the literature and compared with the performance of the original rapid access (RA). Results show that the MRA outperforms the original RA in large size problems by using specific value of parameter alpha. Factorial experiment and response surface methodology are applied to determine the best alpha value which is the main factor that impacts the performance of MRA and produce the best performance of the MRA heuristic.
A hardware architecture for a context-adaptive binary arithmetic coder

The H.264 video compression standard uses a context-adaptive binary arithmetic coder (CABAC) as an entropy coding mechanism. While the coder provides excellent compression efficiency, it is computationally demanding. On typical general-purpose processors, it can take up to hundreds of cycles to encode a single bit. In this paper, we propose an architecture for a CABAC encoder that can easily be incorporated into system-on-chip designs for H.264 compression. The CABAC is inherently serial and we divide the problem into several stages to derive a design that can provide a throughput of two cycles per encoded bit. The engine proposed is capable of handling binarization of the syntactical elements and provides the coded bit-stream via a first-in first-out buffer. The design is implemented on an Altera FPGA platform that can run at 50 MHz enabling a 25 Mbps encoding rate.
Computer graphics synthesis for inferring artist studio practice: an application to Diego Velázquez's Las Meninas[

Diego Velázquez's Las meninas (1656) has been called by some art experts "the most important painting of the 17th century," "a theology of painting," and even "the world's greatest painting"; it has been the subject of intensive study. The work depicts a complex scene in the Alcázar palace of King Philip IV of Spain, and includes mirror reflections of the king and queen, apparently standing in place of the viewer, as well as the artist himself standing before an enormous canvas on an easel. Nevertheless, questions remain about the studio and the proper viewing configuration: Is the artist looking toward the perspectivally correct position of the viewer in the museum space (center of projection), outside the picture space? Does the perspectivally correct position correspond to the locations of the king and queen seen reflected in the mirror? Is the bright illumination on the king and queen (as revealed in the mirror) consistent with the lighting in the tableau itself? We addressed these questions in a new way: by building a full computer graphics model of the figures and tableau as well as the viewer's space outside the painting. In our full model, the painting itself is represented as a translucent window onto which the picture space is projected toward the center of projection, that is, the viewer. Our geometric and (new) lighting evidence confirm Janson's and Snyder's contention that the plane mirror on the back wall reflects the other side of the large painting depicted within the tableau, not the king and queen themselves in the studio. We believe our computer graphics synthesis of both the tableau within the painting and the viewer's space in the real world is the first of its kind to address such problems in the history of art.
Evaluative Methods for Rapid Prototypes

There are a variety of techniques that can evaluate rapid prototype design alternatives for human-machine interfaces. These techniques can be used singly, or in combination. Empirical techniques require that the analyst obtain data from respondents who exercise a rapid prototype. Empirical techniques include questionnaires, observation and unobtrusive methods of data collection, and retention tests. Analytic techniques do not require data collection, but require that the analyst have a formal description of the human-machine interface and use methods for evaluating these descriptions. Analytic techniques include structured walkthroughs, behavioral models of human-machine interaction, Operator Sequence Diagrams (OSD), and Link Analysis. Empirical and analytical techniques can lead to systems that are more likely to meet users' needs, especially when the analyst employs several techniques simultaneously.
Multi-frame example-based super-resolution using locally directional self-similarity

This paper presents a multi-frame superresolution approach to reconstruct a high-resolution image from several low-resolution video frames. The proposed algorithm consists of three steps: i) definition of a local search region for the optimal patch using motion vectors, ii) adaptive selection of the optimum patch based on low-resolution image degradation model, and iii) combination of the optimum patch and reconstructed image. As a result, the proposed algorithm can remove interpolation artifacts using directionally adaptive patch selection based on the low-resolution image degradation model. Moreover, superresolved images without distortion between consecutive frames can be generated. The proposed method provides a significantly improved super-resolution performance over existing methods in the sense of both subjective and objective measures including peak-to-peak signal-to-noise ratio (PSNR), structural similarity measure (SSIM), and naturalness image quality evaluator (NIQE). The proposed multi-frame super-resolution algorithm is designed for realtime video processing hardware by reducing the search region for optimal patches, and suitable for consumer imaging devices including ultra-high-definition (UHD) digital televisions, surveillance systems, and medical imaging systems for image restoration and enhancement.
Real-time accelerators for volume rendering (panel)

Panel Summary This panel will present the different approaches for real-time acceleration for volume rendering. using either special-purpose hardware or commercially available systems. Alternative approaches for real-time rendering of 3D static and JD (spatial-temporal) dynamic datasets will bc discussed, and three different architectures will be compared. Volume rendering is a key technology for the interpretation of the large amounts of 3D scalar data gcnernted by acquisition devices such as biomedical scanners, by supcrcomputer simulations. or by synthesizing volumetric datasets from geometric mod&. Especially important for the exploration and understanding of the data arc sub-second display rates and instantaneous visual feedback during the change of rendering parameters. To create the illusion of smooth dynamics. the image must be updated in true real-tnne. The high computational requirements of traditional computer graphics led to the development of special-purpose graphics engines, primarily for polygon rendering. Similarly, the spectal needs of volume rendering. where an image must be computed rapidly and repeatedly from a volume dataset, lends itself to the development of special-purpose volume rendering architectures. A dedicated accelernror. which separates volume rendering from general-purpose computing, seems to be best suited to provide true real-time volume rendering on standard deskside or desktop computers. Volume rendering hardware may also be used to directly view changes of the 3D data over time for 4D tspatial-temporal) visualization, such as in real-time 3D ultrasonography. micro-tomography. or confocal microscopy. This may lead to the direct integration of volume visualization hardware with real-time acquisition devices. in much the same way as fast signal processing hardware became part of today's scanning devices. The choice of whether one adopts a general-purpose or a special-purpose solution to volume rendering depends upon the circumstances. If maximum flexibility is required, general-purpose appears to be the best way to proceed. However. an important feature of graphics accelerators is that they are integrated into a much larger environment where software can shape the form of input and output data, thereby providing the additional flexibility that is needed. A good example is the relationship between the needs of conventional computer graphics and special-purpose graphics hardware. Nobody would dispute the necessity for polygon graphics acceleration despite its obvious limitations. We are making the exact same argument for volume rendering architectures. Arie E. Kaufman is a Leading Professor of computer science and radiology at the State University of New York at Stony Brook. He has been on the faculty there since …
Trust Building in Virtual Salespersons Versus in Human Salespersons: Similarities and Differences

Customer trust in a salesperson is important in generating sales and managing customer relationships. In online stores, recommendation agents (computer agents) can serve as virtual salespersons who advise customers on what to buy, just as human salespersons do in physical stores. This study compares the similarities and differences between customer trust in virtual salespersons and customer trust in human salespersons. In this exploratory study, 44 participants used the services of both virtual and human salespersons in the same commercial store. Written protocols were collected by asking the participants open-ended questions regarding their comparative trust. This paper finds that similar to trust in human salespersons, trust in virtual salespersons contains trusting beliefs in competence, benevolence, and integrity. However, the processes of trust building in virtual salespersons, trust building in human salespersons, distrust building in virtual salespersons, and distrust building in human salespersons differ. This paper theoretically outlines to what extent research on trust in computer agents can draw from literature on interpersonal trust. It contributes to our practical understanding of how to better design trustworthy recommendation agents as virtual salespersons.
Evaluation of the WCRP‐CMIP3 model simulations in the La Plata basin

In this article, an assessment of the climate simulations for the La Plata Basin (LPB) by the Phase 3 of the World Climate Research Programme—Coupled Model Intercomparison Project is made. The LPB covers a wide area over south‐eastern South America, and is the fifth largest basin in the world in terms of geographical extent.
Time-instant optimization for hybrid model predictive control of the Rhine–Meuse delta

In order to ensure safety against high sea water levels, in many low-lying countries, water levels are maintained at certain safety levels, and dikes have been built, while large control structures have been installed that can also be adjusted dynamically after they have been constructed. Currently, these control structures are often operated purely locally, without coordination of actions being taken at different locations. Automatically coordinating these actions is difficult, as open water systems are complex, hybrid dynamical systems, in the sense that continuous dynamics (e.g. the evolution of the water levels) appear mixed with discrete events (e.g. the opening or closing of barriers). In low lands, this complexity is increased further due to bi-directional water flows resulting from backwater effects and interconnectivity of flows in different parts of river deltas. In this paper, we propose a model predictive control (MPC) approach that is aimed at automatically coordinating the actions of control structures. The hybrid dynamical nature of the water system is explicitly taken into account. In order to relieve the computational complexity involved in solving the MPC problem, we propose TIO-MPC, where TIO stands for time-instant optimization. Using this approach, the original MPC optimization problem that uses both continuous and integer variables is transformed into a problem involving only continuous variables. Simulation studies of current and future situations are used to illustrate the behavior of the proposed scheme.
The implementation of mobile learning in higher schools of Kazakhstan

This article considers how the process mobile learning's implementation is realised through phased development of ICT in Kazakhstan higher education. The article examines the main indicators of ICT development in higher education of Kazakhstan. In this article are shown the main problems in e-learning foundation. The author tried to tell about the prospects in development of ICT and e-learning in higher education for next ten years. The main part is devoted to the current situation with the implementation of mobile learning in Kazakhstan. It has highlighted the examples of the successful organisation of mobile learning in universities.
An Efficient Broadcast Encryption System with Delegation of Decryption

In a Broadcast Encryption System, a sender sends an encrypted message to a large set of receivers at once over an insecure channel and it enables only users in a target set to decrypt the message with their private keys. In 2005, Boneh et al. proposed a fully collusion-resistant public key broadcast encryption in which the ciphertext and the privatekey sizes are constant. In general, pairing-based broadcast encryption system is efficient in bandwidth and storing aspects than non-pairing based broadcast encryption system, however, it requires many computational costs that resource-constrained devices is not suit to be applied. In this paper, we propose a Broadcast Encryption scheme(called BEWD) that user can decrypt a ciphertext more efficiently. The scheme is based on Boneh et al.scheme. More precisely, it reduces receiver`s computational costs by delegating pairing computation to a proxy server which computation is required to receiver in Boneh et al.scheme. Furthermore, the scheme enables a user to check if the proxy server compute correctly. We show that our scheme is secure against selective IND-RCCA adversaries under l-BDHE assumption.
The mechanized verification of garbage collector implementations

Languages such as Java, Cs, Standard ML, and Haskell use automated memory management to simplify development and improve reliability by eliminating the need for programmers to manually free unused objects. The cost of this improved programmer experience is that the implementation of the language becomes more complex, requiring a garbage collector. Garbage collectors are becoming increasingly sophisticated to adapt them to high-performance, concurrent and real-time applications, making internal collector invariants and the interface with user programs (mutators in garbage collector parlance) subtle and difficult to implement correctly. My thesis is that treating the garbage collected heap as an abstract data type allows the specification and verification of flexible and expressive garbage collector-mutator interfaces, and that the mechanized verification of garbage collector implementations using Hoare-style logic is both practical and effective. The mutator-garbage collector interface I describe in this paper is expressive enough to be used with verified mutators, while being abstract enough that a single interface can be used with both stop-the-world and incremental collectors. It is also powerful enough to be used with collectors that require read or write barriers. In this dissertation, I describe my framework for the mechanized verification of garbage collector implementations. I discuss the formal setting, and my approach to garbage collector interfaces. I also describe the specification and verification of the Cheney and Baker copying collectors. The Baker collector is an incremental collector that requires a read barrier. Finally, I discuss some practical tools I developed for program verification using separation logic in the Coq proof assistant.
An Implementation of the Control System of the Mobile Robot using ROS

In this paper we implement collision avoidance using an artificial potential field and remote control of a mobile robot through ROS(Robot Operating System) among the robot’s middleware. We also apply dynamic reconfigure to a node of collision avoidance. The main purposes of ROS are sharing and cooperation. In order to make to fit the purpose of ROS, the hardware that frequently is used in the robot such as LRF and joystick, were reused as node that provide in the ROS.
Introduction to the Issue

This special issue of the Journal of Educational Computing Research focuses on “Situated Technology Professional Development Programs. ” Putnam and Borko (2000) relate recent trends in research on professional development to new understandings of the nature of learning and knowing that collectively have been labeled “situative. ” They identify three conceptual themes central to situative perspectives—that cognition is situated in particular physical and social contexts, that it is social in nature, and that knowing is distributed across the individual, others, and tools—that they believe have important implications for professional development. If knowledge and learning are situative, as they argue, then the most effective professional development will be constructive in focus and situated in authentic classroom practice. This is crucial and relevant for the area of technology integration, as the need for continued learning increases for teachers to develop new skills and instructional practices that incorporate technology in meaningful ways. The integration of technology into teaching and learning has long been a challenge to educational systems worldwide, and for almost as long, professional development has been viewed as a necessary and critical part of any technology integration initiative. In this issue, seven articles explore the efficacy of situated professional development programs to support teachers’ learning about technology integration. This issue grew out of a symposium prepared for Division K of the American Educational Research Association’s annual meeting in 2004 (Hughes, 2004). To recognize the efforts of educators and researchers in this area, we proposed this special issue and solicited manuscripts about situated professional development programs that aimed to improve technology integration in K-12 schools. We thought of “situated programs” as including any projects that located at least part of teacher’s learning about technology integration in their practice, such as (but not limited to) in-school programs, mentoring programs, or virtual professional development programs. We encouraged submission of manuscripts that presented research issues from diverse perspectives such as case studies, qualitative/quantitative research, theoretical overviews, literature reviews, and
Shape Recognition Based on Freeman Chain Code

In this paper, a shape recognition method based on Freeman chain code has been proposed. According to the detected corners, feature vector of a contour shape can be obtained. And the descriptor of each corner in the feature vector has three components, which are the normalized distance between the corner and the centroid of all the corners, the local main trend of both sides of the corners. By using the feature vector, the matching judgment has been given, and the results of the experiment are shown.
Active Learning for Multi-Label Image Annotation

Active learning is useful in situations where labeled data is scarce, unlabeled data is available and labeling has some cost associated with it. In such situations active learning helps by identifying a minimal set of items to label that will allow the training of an eective classifier. Thus active learning is appropriate for annotation tasks in multimedia, particularly in image labeling. In this paper we address the challenge of using active learning for multi-labeling of images in personal image collections. Multi-label learning covers situations where objects can have more than one class label and a learner is trained to assign multiple labels simultaneously. In this paper we report results on a learning system for labeling personal image collections that is both active and multi-label. The focus of the research has been to reduce the overall number of images that are presented to the user for labeling.
NoC emulation framework based on Arteris NoC solution for multiprocessor system-on-chip

The growth of complexity and the requirements of on-chip technologies create the need for new architectures which generate solutions representing a compromise between complexity and power consumption, and Quality of Service (QoS) of the communications between the cores of a System-on-Chip (SoC). Network-on-Chip (NoC) arises as a solution to implement efficient interconnections in SoC. This new technology, due to its complexity, creates the need of specialized engineers who can design the intricate circuits that NoC requires. It is possible to reduce those specialization needs by using CAD tools. In this paper, one of this tools, called Arteris NoC Solution, is used for developing the proposed framework for NoC emulation. This software includes three different tools: NoCexplorer, for high-level simulation of an abstract model of the NoC, NoCcompiler, in which the NoC is defined and generated in HDL language, and NoCverifier, which performs simulations of the HDL code. Furthermore, a validation and characterization infrastructure was developed for the created NoC, which can be completely emulated in FPGA. This environment is composed by OCP traffic generators and receptors, which also can perform measurements over the created traffic, and a store and communication module, which is responsible for storing the results obtained from the emulation of the entire system in the FPGA, and send it to a PC. Once the data is stored in the PC, statistical analyses are performed, including a comparison of mean latency from high level simulations, RTL simulations and FPGA emulations. The analysis of the results is obtained from three scenarios with different NoC topologies for the same SoC design.
Cross-Views Process Detection Based on Hardware-Assisted Virtual Machine

The current process hiding and detection technologies are analyzed, and the mechanism of cross-views discrepancy utilized by Strider GhostBuster are studied in detail, and based on Hardware-assisted Virtual Machine (HVM) a new framework for process detection is proposed, namely HCPD, whose effectiveness and integrality are verified through experiments.
The process of asking questions

This paper discusses the area of the question—its generation, its relation to the retrieval system, and its effect on the inquirer. Four levels of question formation may be isolated and analysed: the actual, but unexpressed, need for information; the conscious within‐brain description of the need; the formal statement of the question; and the question as presented to the information system. Input and output characteristics of systems are examined for their effect on the inquirer's decision to ask a question and on the form the query takes. Investigation of six parameters governing question type and ambiguity argues that we may be placing too much emphasis on syntactic matching of inquiry and store of answers. The inquirer's state of readiness is defined as the “state of mind” which allows a selection to be made from a series of messages. A question is seen as an indication of inadequacy on the part of the inquirer who hopes to remedy that inadequacy by calling on the information system. A major objective of information systems is to make commonplace the point of maximum usefulness where three coordinates cross: level of question, state of readiness, and available answer.