Miracle-dz/UniFAR-FTUs huggingface dataset:
Directions in Agent Communication

Increasingly, software engineering involves open systems consisting of autonomous and heterogeneous participants or agents who carry out loosely coupled interactions. Accordingly, understanding and specifying communications among agents is a key concern. A focus on ways to formalize meaning distinguishes agent communication from traditional distributed computing: meaning provides a basis for flexible interactions and compliance checking. Over the years, a number of approaches have emerged with some essential and some irrelevant distinctions drawn among them. As agent abstractions gain increasing traction in the software engineering of open systems, it is important to resolve the irrelevant and highlight the essential distinctions, so that future research can be focused in the most productive directions. This paper is an outcome of extensive discussions among agent communication researchers, aimed at taking stock of the field and at developing, criticizing, and refining their positions on specific approaches and future challenges. This paper serves some important purposes, including identifying (1) points of broad consensus; (2) points where substantive differences remain; and (3) interesting directions of future work.
REDUKSI DIMENSI FITUR MENGGUNAKAN ALGORITMA ALOFT UNTUK PENGELOMPOKAN DOKUMEN

Document clustering still have a challenge when the volume of document increases, the dimensionality of term features increases as well. This contributes to the high dimensionality and may cause poor performance of clustering algorithm. A way to overcome this problem is dimension reduction. Dimension reduction methods such as feature selection using filter method has been used for document clustering. But filter method is highly dependent on user input to select number of n top features from the whole document. ALOFT (At Least One feature) Algorithm can generate a number of feature set automatically without user input. In previous research ALOFT algorithm used on classification documents so filter method require labels on classes. Such filter method can not be used on document clustering. This research proposed feature dimension reduction method by using variations of several filter methods in ALOFT algorithm for document clustering. Before dimension reduction process first step that must be done is preprocessing phase then calculate weight of term using tfidf. filter method used in this study are such Document Frequency (DF), Term contributtion (TC), Term Variance Quality (TVQ), Term Variance (TV), Mean Absolute Difference (MAD), Mean Median (MM), and Arithmetic Mean geometric Mean (AMGM). Furthermore, the final feature set selected by ALOFT algorithm. The last phase is document clustering using two different clustering methods, k-means and agglomerative hierarchical clustering (HAC). Experiment results showed that the proposed method using k-means algorithm able to improve results of VR methods.
ROTATION INVARIANT IMAGE REGISTRATION USING ROBUST SHAPE MATCHING

The contour of a known prototype object can be used to detect and identify the similar object in any given images. The two main steps to achieve this objective are: edge detection and segmentation of an image. Edge detection is considered as the fundamental operation in image processing and computer vision. One of the common problems in this approach is distinction between contours of the object and edges originating from the textured region. The stated concept can be implemented for many applications such as biomedical analysis, remote sensing, oceanography etc. This project can also be enhanced to identify the size and texture of a target object. The first step in this endeavor would be segmentation of different objects from its background, present in the given figure. Segmentation of an image allows drawing boundary among the multiple objects or between the background of an image and the object. To perform the segmentation, different threshold values can be set either by generating a histogram or by executing other clustering function available in the Matlab. After the segmentation next step would be the edge detection and drawing a polygon using those edges
Half-Real: Video Games between Real Rules and Fictional Worlds

A video game is half-real: we play by real rules while imagining a fictional world. We win or lose the game in the real world, but we slay a dragon (for example) only in the world of the game. In this thought-provoking study, Jesper Juul examines the constantly evolving tension between rules and fiction in video games. Discussing games from Pong to The Legend of Zelda, from chess to Grand Theft Auto, he shows how video games are both a departure from and a development of traditional non-electronic games. The book combines perspectives from such fields as literary and film theory, computer science, psychology, economic game theory, and game studies, to outline a theory of what video games are, how they work with the player, how they have developed historically, and why they are fun to play. Locating video games in a history of games that goes back to Ancient Egypt, Juul argues that there is a basic affinity between games and computers. Just as the printing press and the cinema have promoted and enabled new kinds of storytelling, computers work as enablers of games, letting us play old games in new ways and allowing for new kinds of games that would not have been possible before computers. Juul presents a classic game model, which describes the traditional construction of games and points to possible future developments. He examines how rules provide challenges, learning, and enjoyment for players, and how a game cues the player into imagining its fictional world. Juul's lively style and eclectic deployment of sources will make Half-Real of interest to media, literature, and game scholars as well as to game professionals and gamers.
Crossing the ‘ Uncanny Valley ’ : Adaptation to Cartoon Faces Can Influence Perception of Human Faces

In this study we assessed whether there is a single face space common to both human and cartoon faces by testing whether adaptation to cartoon faces can affect perception of human faces. Participants were shown Japanese animation cartoon videos containing faces with abnormally large eyes. The use of animated videos eliminated the possibility of position-dependent retinotopic adaptation (because the faces appear at many different locations) and more closely simulated naturalistic exposure. Adaptation to cartoon faces with large eyes significantly shifted preferences for human faces toward larger eyes, consistent with a common, nonretinotopic representation for both cartoon and human faces. This supports the possibility that there are representations that are specific to faces yet common to all kinds of faces.
Locations of Injection‐Induced Earthquakes in Oklahoma Controlled by Crustal Structures

In recent years, many small‐ to moderate‐size earthquakes occurred in central northern Oklahoma, likely associated with wastewater injection. The most recent one is the M5.8 Pawnee earthquake occurred on 3 September 2016. It is still not clear what controls the locations of these injection‐induced earthquakes. Here we conduct 2‐D Pg wave tomography with anisotropy to image seismogenic structures in this region, using more than 10 years of Pg arrivals recorded by 81 seismic stations. Our high‐resolution Pg wave tomography shows two high‐velocity zones with northwest fast direction alternated by low‐velocity zones with northeast fast direction. The two dominant anisotropy directions are consistent with conjugated microfractures from surface faults and two nodal planes from focal mechanisms of moderate‐size earthquakes. Most moderate‐size (M > 4) earthquakes occurred either close to the boundaries between high‐ and low‐seismic velocity zones or within the high‐velocity zones, suggesting that they are associated with geological boundaries of different basement rock properties or with strong material properties in the upper crust. We suggest that although these moderate‐size earthquakes were induced by fluid injection, their spatial locations were likely controlled by local geologic structures.
The Emergence of Recovery: A Genealogical Exploration of the Forces of Power Shaping New Zealand's Mental Health Services in the 21st Century

Recovery is a conceptual model that underpins New Zealand’s mental health service delivery in the 21st century. This thesis explores how recovery emerged historically as an influential philosophy and how representations of recovery have changed to meet the needs of different groups. An inquiry, based on Foucault’s genealogical method, investigates the historical and contemporary forces of power that have shaped the construction of mental illness, and the development of methods and techniques to support and manage persons labelled as mentally ill. The normalisation of knowledge developed during 19th century psychiatric practice provided a context for later critique and resistance from movements that highlighted the oppressive power of psychiatric discourse. Key to the critique were the antipsychiatry and service user movements, which provided the conditions for the possibility of the emergence of recovery as a dominant discourse. Since its emergence, recovery has moved through a number of representations as it was taken up by different groups. A significant shift in the 21st century has been the dominance of neo-liberal discourse based on consumerism, a rolling back of the state, and an emphasis on individual responsibility. The implications of this shift for users and providers of services and their effects on current representations of recovery conclude the inquiry.
A Generalized Maximum Entropy Approach to Bregman Co-clustering and Matrix Approximation

Co-clustering, or simultaneous clustering of rows and columns of a two-dimensional data matrix, is rapidly becoming a powerful data analysis technique. Co-clustering has enjoyed wide success in varied application domains such as text clustering, gene-microarray analysis, natural language processing and image, speech and video analysis. In this paper, we introduce a partitional co-clustering formulation that is driven by the search for a good matrix approximation — every co-clustering is associated with an approximation of the original data matrix and the quality of co-clustering is determined by the approximation error. We allow the approximation error to be measured using a large class of loss functions called Bregman divergences that include squared Euclidean distance and KL-divergence as special cases. In addition, we permit multiple structurally different co-clustering schemes that preserve various linear statistics of the original data matrix. To accomplish the above tasks, we introduce a new minimum Bregman information (MBI) principle that simultaneously generalizes the maximum entropy and standard least squares principles, and leads to a matrix approximation that is optimal among all generalized additive models in a certain natural parameter space. Analysis based on this principle yields an elegant meta algorithm, special cases of which include most previously known alternate minimization based clustering algorithms such as kmeans and co-clustering algorithms such as information theoretic (Dhillon et al., 2003b)
A Survey on Security Issues in Cloud Computing

Cloud computing is an approach to elaborate the limit and adding the endowment without adding the resourcesinto the modern framework, organizing new process, or authorizing new programming. Cloud computing is the major outcome of the composition of the traditional enrolling development and system development like matrix multiplication, distributed computing, parallel computing and etc. The cloud computing will allows the information allocation that consists of software, policy and infrastructure, which defines the virtualization. Cloud computing is the design which provides the services through internet on paper use access to store the information like storage, servers and applications, without its physical existence. This paper gives outlines that what is meant by the cloud computing means, various cloud computing models such as cloud deployment model, and the cloud service models and the security issues that is faced by the cloud computing model, and the various existing security solutions. This paper is a survey of security issues and security challenges in the world of cloud computing which provides the various aspects of cloud computing.
On the Recent Ambiguity of the North Atlantic Subpolar Gyre Index

The so-called gyre index appears to be related to core aspects of the North Atlantic subpolar gyre, meridional overturning circulation, hydrographic properties in the Atlantic inflows toward the Arctic, and in marine ecosystems in the northeast Atlantic Ocean. Recent publications, however, present a more linear version of this index with less of the key interannual-to-decadal variability. This has introduced uncertainty about the meaning and usefulness of the gyre index. We claim that these concerns are primarily caused by the fact that the recently produced “gyre index” is not the same as the original gyre index and discuss possible reasons.
I nternational J ournal of I nnovative R esearch in S cience, E ngineering and T echnology

— As malicious attacks greatly threaten the security and reliability of biometric systems, Authentication of biometric data is very important. In this paper Two-stage authentication based on watermarking is proposed to address this problem. The facial features of an individual embed into a fingerprint image which works as data credibility token and secondary authentication source. At the first stage of authentication, the credibility token of input data is established by checking the validness of extracting patterns. Due to the specific characteristics of face watermarks, the face detection based classification schemes are applied for reliable watermark verification instead of conventional correlation based watermark detection. If token authentication is successful, the face patterns can further serve as supplemental identity information to facilitate sub sequential biometric authentication. In this framework, one critical issue is to guarantee the robustness and capacity of watermark while preserving the discriminating features of host fingerprints. Hence a wavelet quantization based watermarking and LSB watermarking approach is proposed to adaptively distribute watermark energy on significant DWT coefficients of fingerprint images.
Generalized Cross Subspace Alignment Codes for Coded Distributed Batch Matrix Multiplication

The goal of coded distributed batch matrix multiplication is to efficiently multiply L instances of $\lambda\times \kappa$ matrices, $\mathrm{A}= (\mathrm{A}_{1}\,\ \mathrm{A}_{L})$, with L instances of $\kappa\times \mu$ matrices $\mathrm{B}= (\mathrm{B}_{1}\,\ \mathrm{B}_{L})$, by distributing the computation across S servers, such that the response from any R servers $(R$ is called the recovery threshold) is sufficient to compute the L matrix products, AB $= (\mathrm{A}_{1}\mathrm{B}_{1},\ \mathrm{A}_{2}\mathrm{B}_{2},\ \cdots\,\ \mathrm{A}_{L}\mathrm{B}_{L})$. Existing solutions either compute each $\mathrm{A}_{\iota}\mathrm{B}_{\iota}$ one at a time by partitioning individual matrices and coding across these partitions, or rely only on batch processing, i.e., coding across the batch of matrices without any matrix partitioning. The state-of-art for matrix-partitioning and batch processing approaches is represented by Entangled Polynomial Codes (EP codes), and Lagrange Coded Computing (LCC), respectively. In order to combine the benefits of the two approaches, we propose Generalized Cross-Subspace Alignment Codes (GCSA codes) that unify, generalize and improve upon the state of art. GCSA codes bridge the two extremes by efficiently combining both matrix-partitioning and batch processing, and offer flexibility in how much of each approach is used. Both EP codes and LCC codes can be recovered as special cases of GCSA codes. Remarkably, even without matrix partitioning, GCSA codes demonstrate an advantage over LCC codes in download-constrained settings. This is due to cross-subspace alignment, characterized by a Cauchy-Vandermonde code structure that aligns interference along Vandermonde terms, while the desired matrix products remain resolvable along Cauchy terms.
On Base Field of Linear Network Coding

For a (single-source) multicast network, the size of a base field is the most known and studied algebraic identity that is involved in characterizing its linear solvability over the base field. In this paper, we design a new class N of multicast networks and obtain an explicit formula for the linear solvability of these networks, which involves the associated coset numbers of a multiplicative subgroup in a base field. The concise formula turns out to be the first that matches the topological structure of a multicast network and algebraic identities of a field other than size. It further facilitates us to unveil infinitely many new multicast networks linearly solvable over GF(q) but not over GF(q') with q <; q', based on a subgroup order criterion. In particular: 1) for every k ≥ 2, an instance in N can be found linearly solvable over GF(22k) but not over GF(22k+1) and 2) for arbitrary distinct primes p and p', there are infinitely many k and k' such that an instance in N can be found linearly solvable over GF(pk) but not over GF(p'k') with pk <; p'k'.
The actual use of investigative physiopsychological examinations in Germany EUROPEAN POLYGRAPH

Scientifi c papers on polygraph examination seldom point to the issue of examinee distress. Lawyers on the other hand are known to level charges against admissibility of such expert opinions and claim that a polygraph examination is too uncomfortable for the examinee. Widacki (2001: 128–129) criticised beliefs of Polish lawyers concerning the potential infl uence of examinee anxiety on the outcome of a polygraph examination, as such beliefs are not based on results of empirical research. A professional polygrapher should distinguish nervousness from other reactions. Standards of polygraph examination techniques (with procedures for curve interpretation) include safety barriers that let the examiner minimise the risk of making DOI: 10.1515/ep-2017-0001
The actual use of investigative physiopsychological examinations in Germany EUROPEAN POLYGRAPH

I assume that a polygraph examination may be part of mass of evidence in a specifi c case, and I also assume that the result of a polygraph examination belongs to forensic evidence, and within it has its place in expert evidence. Th erefore, as item of evidence, it can be subjected to an analysis covering the assessment of its credibility, reliability, weigh, probative force, etc., and can also be analysed as evidential argument. Such an argument may be evaluated from two points of view: “internal” developed by its creator (in this case: by the expert), and “external” whose author is the analyst, or, more generally speaking, the addressee of the argument. Th e “internal” analysis is presented in (Ibek 2011). Th is article, in turn, aims at presenting the characteristic features of a polygraph examination result as argument in analysis of evidence.
Juvenile Accountability Incentive Block Grants Program from the Administrator Focus on Accountability: Best Practices for Juvenile Court and Probation

If we are to hold juvenile offenders accountable for their delinquent acts, accountability must be integrated into every aspect of the juvenile court and probation processes. Focus on Accountability: Best Practices for Juvenile Court and Probation provides helpful information on how to do just that. The Bulletin sets forth what is entailed in holding offenders accountable, details the roles of the juvenile court and probation department, identifies key elements of programs that promote accountability, and describes effective community-based initiatives. We are excited that the Juvenile Accountability Incentive Block Grants Program affords juvenile courts and probation departments new opportunities to strengthen our Nation's juvenile justice system and renew public confidence in its administration of justice by holding offenders accountable. It is my hope that this Bulletin will assist your efforts to promote accountability. This Bulletin is part of OJJDP's Juvenile Accountability Incentive Block Grants (JAIBG) Best Practices Series. The basic premise underlying the JAIBG program, initially funded in fiscal year 1998, is that young people who violate the law need to be held accountable for their offenses if society is to improve the quality of life in the Nation's communities. Holding a juvenile offender " accountable " in the juvenile justice system means that once the juvenile is determined to have committed law-violating behavior, by admission or adjudication, he or she is held responsible for the act through consequences or sanctions, imposed pursuant to law, that are proportionate to the offense. Consequences or sanctions that are applied swiftly, surely, and consistently, and are graduated to provide appropriate and effective responses to varying levels of offense seriousness and offender chronicity, work best in preventing, controlling, and reducing further law violations. In an effort to help States and units of local government develop programs in the 12 purpose areas established for JAIBG funding, Bulletins in this series are designed to present the most up-to-date knowledge to juvenile justice policymakers, researchers, and practitioners about programs and approaches that hold juvenile offenders accountable for their behavior. An indepth description of the JAIBG program and a list of the 12 program purpose areas appear in the overview Bulletin for this series. Overview Juvenile courts and probation departments play a central role in the administration of juvenile justice in the United States. Thus, the policies and programs advanced by these entities greatly define the Nation's response to juvenile crime. The extensive and critical roles played by the …
Assessment of the Balance of Greenhouse Gases in the Production of Renewable Biomass From Short-Cycle Energy Plantations of Willow

Greenhouse gas control it is the key aspect for climate protection. As climate regulation became inevitable, companies started adopting more proactive strategies. One of the effective methods for greenhouse gas emission calculation is based on life cycle analysis. A carbon footprint is defined as the sum of greenhouse gas emissions caused by an organization, event, or product and is expressed in terms of CO2 equivalents. The investigations were devoted to greenhouse emission assessment during life cycle of willow wood production from short rotation coppice plantations. In accordance with results about 48% of carbon dioxide gas from all life cycle of willow was emitted during wood harvesting and transportation to energy plants.
Real-Time Physics-Based Object Pose Tracking during Non-Prehensile Manipulation

—We propose a method to track the 6D pose of an object over time, while the object is under non-prehensile manipulation by a robot. At any given time during the manipulation of the object, we assume access to the robot joint controls and an image from a camera. We use the robot joint controls to perform a physics-based prediction of how the object might be moving. We then combine this prediction with the observation coming from the camera, to estimate the object pose as accurately as possible. We use a particle ﬁltering approach to combine the control information with the visual information. We compare the proposed method with two baselines: (i) using only an image-based pose estimation system at each time-step, and (ii) a particle ﬁlter which does not perform the computationally expensive physics predictions, but assumes the object moves with constant velocity. Our results show that making physics-based predictions is worth the computational cost, resulting in more accurate tracking, and estimating object pose even when the object is not clearly visible to the camera.